Subject:
|
Re: New Lego challenge !
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Mon, 13 Sep 1999 06:15:51 GMT
|
Original-From:
|
John Williams <J.A.R.WILLIAMS@antispamASTON.AC.UK>
|
Viewed:
|
590 times
|
| |
| |
> > > > > "Mike" == Mike Poindexter <lego@poindexter.cc> writes:
Mike> Got it figured out. Using the principles of right handed
Mike> recursion, you can have the robot follow the right wall and
Mike> it will eventually get to the light and also get out of the
Mike> maze again.
Mike> Incidentally, right handed recursion will get you out of any
Mike> labyrinth provided that you are not starting inside it
Mike> already. If you are already in it, it will likely work
Mike> there as well. This would then allow the robot to work in
Mike> almost any maze you create.
This only works if the is only one path between each point in the
labrynth. If not then loops may exist and this algorithm could
lead to the robot going round in circles. More generally therefore a
more sophisticated algorithm is required,
--
John A.R. Williams
|
|
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
|
|
|
Active threads in Robotics
|
|
|
|