 | | Re: New Lego challenge !
|
| (...) 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 (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
| | |  | | Re: New Lego challenge !
|
| (...) 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 (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
| | |  | | Re: New Lego challenge !
|
| (...) 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 (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
| | |  | | one question about MacNQC
|
| I have, rather brutally, bashed around the works and am able to usually get routines and the like to compile error free. However, even though the RCX accepts the download, I don't seem to be able to access 'my' routine. Seems to me that there should (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
| | |  | | RE: New Lego challenge !
|
| (...) Hmm, maybe it is finally time to try a real application with pbFORTH. With it's large memory space, you can map out the maze and represent it as a bitmap, or tree of paths. You CAN do recursion in pbFORTH, but it's ugly. I rememeber a thread a (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
| |