Subject:
|
Re: New Lego challenge !
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Mon, 13 Sep 1999 08:22:51 GMT
|
Viewed:
|
595 times
|
| |
|
|
In lugnet.robotics, Mike Poindexter writes:
> Got it figured out. Using the principles of right handed recursion, you can
> have the robot follow the right wall and it will eventually get to the light
> and also get out of the maze again.
>
> Incidentally, right handed recursion will get you out of any labyrinth
> provided that you are not starting inside it already. If you are already in
> it, it will likely work there as well. This would then allow the robot to
> work in almost any maze you create.
True. From what I know the right hand (and left hand) rucursion always works
in flat labyrinths (no bridges, stairs, tunnels etc).
However, I like Philippe's challenge and think it would be nice to look at a
small robot finding its way inside a maze.
Mario
http://www.geocities.com/~marioferrari
|
|
Message is in Reply To:
 | | Re: New Lego challenge !
|
| Got it figured out. Using the principles of right handed recursion, you can have the robot follow the right wall and it will eventually get to the light and also get out of the maze again. Incidentally, right handed recursion will get you out of any (...) (25 years ago, 13-Sep-99, to lugnet.robotics)
|
22 Messages in This Thread:
  
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
