 | | Re: New Lego challenge ! —Mario Ferrari
|
| | | (...) Actually you don't need a recursive algorithm to apply the right hand rule. Simply follow either the right (or left) wall and you'll arrive at the exit. For a maze with no exit but a "special point" to reach inside (like Philippe's one), the (...) (25 years ago, 13-Sep-99, to lugnet.robotics)
|
| | | |
| | | | | Re: New Lego challenge ! —Paul Speed
|
| | | | (...) To be more specific, the "right hand rule" is not a recursive algorithm at all in the classic sense. We like to think of it that way because the "traveler" will traverse parts of the maze repeatedly, in the worst case the whole maze. However, (...) (25 years ago, 13-Sep-99, to lugnet.robotics)
|
| | | | |
| | | | | | Re: New Lego challenge ! —Philippe Jadin
|
| | | | (...) The right (or left (-: ) -hand rule seems to be simple but not the most efficient. That's why I included the light beacon. Providing you have the right beacon detector (let's build one!), and you don't know which direction is the best, you can (...) (25 years ago, 13-Sep-99, to lugnet.robotics)
|
| | | | |
