A programmable robotic mouse is placed at an intersection on a square grid, the borders of which are extendable as needed.
Note:It will be necessary to test a range of constraining values.
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?
(In reply to re(3): Revision
.... Ok. I concede an error in expression. The latter part of that sentence really does not address those diagonal spirals which could go on ad infinitum. While the thought is covered in "return to the starting point wherever possible" that which follows is only relevant to the other types which are generated.
Yes, I agree that L could have a value higher than 4, but that would be pointless in computer runtime, unless one wanted "x" lobes of the diagonal type.
Edited on January 27, 2008, 7:19 pm
Posted by brianjn
on 2008-01-27 18:36:46