The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision |
Your text |
Line 31: |
Line 31: |
| JUMP b | | JUMP b |
|
| |
|
| The above solution will work in either case. However, in the case shown in the game, one more optimization of the solution can be made so that the average number of steps is even lower. The character map in memory is invariant, and thus it is known that the longest string will be 5 (characters from 11 to 15). Knowing this, one can skip the loops and decompose the cases for all solutions up to 5 characters, which looks as follows:
| |
|
| |
|
| |
| a:
| |
| b:
| |
| c:
| |
| d:
| |
| e:
| |
| f:
| |
| INBOX
| |
| COPYTO 24
| |
| COPYFROM [24]
| |
| JUMPZ a
| |
| OUTBOX
| |
| BUMPUP 24
| |
| COPYFROM [24]
| |
| JUMPZ b
| |
| OUTBOX
| |
| BUMPUP 24
| |
| COPYFROM [24]
| |
| JUMPZ c
| |
| OUTBOX
| |
| BUMPUP 24
| |
| COPYFROM [24]
| |
| JUMPZ d
| |
| OUTBOX
| |
| BUMPUP 24
| |
| COPYFROM [24]
| |
| JUMPZ e
| |
| OUTBOX
| |
| BUMPUP 24
| |
| COPYFROM [24]
| |
| JUMPZ f
| |
| OUTBOX
| |
|
| |
|
| {{Footer Nav|game=Human Resource Machine|prevpage=Year 29|nextpage=Year 31}} | | {{Footer Nav|game=Human Resource Machine|prevpage=Year 29|nextpage=Year 31}} |