 | | Re: Kego Constructopedia
|
|
(...) ... (...) ... (...) I guess if they don't want our participation yet, we'll just wait for them. Mike sent me a copy of his Filemake Pro database. If anyone is interested, I'll forward it to you (7+ MB). I plan to just let it lie for now. (27 years ago, 12-Sep-99, to lugnet.robotics)
|
| |
 | | Running Assembly Programs
|
|
I am taking a course on HC11 assembly. I wanted to know how I can use the Handyboard (and the Miniboard, I have both) in this class. The course uses the Mot EV board and they use the PCBUG11 for everything. Please tell me the procedures and the (...) (28 years ago, 29-Sep-98, to lugnet.robotics.handyboard, lugnet.robotics)
|
| |
 | | Re: Running Assembly Programs
|
|
(...) On the 6.270 board I run an application that is mostly timer interrupt handlers and motor drivers all written in assembler. I took the assembler off of the MIT site on Cher and I wrote a small C main program that calls into the assembler and (...) (28 years ago, 30-Sep-98, to lugnet.robotics.handyboard, lugnet.robotics)
|
| |
 | | 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 (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | Re: New Lego challenge !
|
|
(...) Yes, unfortunately the current firmware implementation from LEGO doesn't have a call stack, so you can not build recursive routines. :-( On the other hand I can imagine labyrinths where that bot would never be able to do anything out of them. (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | 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)
|