A programmable robotic mouse is placed at an intersection on a square grid, the borders of which are extendable as needed.
From its initial location the mouse moves one cell forward.
It turns right with its next move incrementing by 1.
This incremental process continues up to a certain constraint whereby the mouse resumes the process with a move of one space until that constraint is met again; continue this process until you either return to your starting position or you evidently will never return.
What generalisations can be made about how variations of the value of the constraint affect the path forced upon the mouse? |
|
Note:It will be necessary to test a range of constraining values.
(In reply to
re(2): findings - like DNA by Charlie)
Ah! What I was not readily seeing was the two aspects of the second solution, 4k+2 and 4k-2.
I now also understand why "maxima" was used in your categorisations.
|
|
Posted by brianjn
on 2008-01-20 17:40:46 |
re(3): findings - like DNA
