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(4): No Subject - Constraint by nikki)
Nikki?
Your pseudocode is has a C/C++ orientation? Assumedly your background.
Do you have access to the MS - DOS 5/6 QBasic? [Version used for my program was QBasic 1.1 (c) 87-92!!]
If you wish to explore and discuss this further I can provide a "kit" for this. My email is open.
|
|
Posted by brianjn
on 2008-01-23 08:39:35 |
re(5): No Subject - Constraint
