Question 14
A programmable bee has four commands: move forward one square, turn left 90° without moving, turn right 90° without moving, and move backward one square.
GO executes the stored program. The example presses left, forward, right, forward, left, GO and shows its resulting movement.
The program is remembered, so pressing GO again repeats it from the current state. If the program brings the bee back to its starting square, what is the largest number of GO presses needed to return to that square with exactly its original direction?
GO executes the stored program. The example presses left, forward, right, forward, left, GO and shows its resulting movement.
The program is remembered, so pressing GO again repeats it from the current state. If the program brings the bee back to its starting square, what is the largest number of GO presses needed to return to that square with exactly its original direction?