 | | 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)
|
| |
 | | RE: New Lego challenge !
|
|
(...) This may be a good idea, and in fact it may be a good jump start to many people out there that never tried pbFORTH because the inertia of learning a new language (like me!!). If you can provide a nice implementation of this and explain it to (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | Space shuttle (#8480) kits available
|
|
I've located some kits (I've seen four at least) in a big store (Málaga, Spain). If somebody is interested to get one please contact me at: goyo@ayto-malaga.es The price showed in the box is $195 aprox. a bit high !!! I suppose this is because it's (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | Re: New Lego challenge !
|
|
(...) A call stack is not an absolute requirement to do recursive processing, it just makes it easier. I have written recursive processes with only an array. -Wes (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | RE: Space shuttle (#8480) kits available
|
|
Greetings, I just received a new catalog from Lego on the 10th of September. You can buy it directly from them for $158. They must have a few in stock if they took the time and expense to reprint the picture in the catalog. <<...>> -----Original (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | Re: Kego Constructopedia
|
|
(...) (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | Re: New Lego challenge !
|
|
(...) 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, (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | Re: Kego Constructopedia
|
|
Brian, Thanks for putting that up. I can't get the "trial of Filemaker" link to work. Can you check it again? Thanks, -Phil (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | NQC chapter online
|
|
Hello again, The Not Quite C chapter from my book is online: (URL) the "Sample Chapter" link. It covers NQC 2.0. Enjoy! Jonathan (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | Disconnect Handy Board posts from lugnet.robotics?
|
|
Hi all, Can we get the Handyboard posts isolated on the Handyboard group only? I can't find any Lego posts in all of the Handyboard posts that have flooded the lugnet.robotics group. please? DLC (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | Re: Disconnect Handy Board posts from lugnet.robotics?
|
|
(...) eh? Am I missing something - I can't recall seeing more than a handful of posts mentioning the Handyboard. They're certainly not "flooding" through the gateway to lego-robotics@crynwr.com! (Unless they're being filtered out?) Stuart (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | Disconnect RCX
|
|
Can we get the RCX posts isolated on the lugnet.robotics.rcx group only? I can't find any Cybermaster posts in all of the RCX posts that have flooded the lugnet.robotics group. -Brian Alano ;-`) [who has never even seen a Cybermaster] (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | Re: [meta] Disconnect Handy Board posts from lugnet.robotics?
|
|
(...) I think Dennis is reading via the web. There are N ways to view groups via the web, the default of which is to coalesce the entire .robotics.* hierarchy into a single virtual group at this URL: (URL) when the 6745-message Handy Board archive (...) (27 years ago, 13-Sep-99, to lugnet.robotics, lugnet.admin.general)
|
| |
 | | Re: New Lego challenge !
|
|
Hi, This sounds like a great challenge! One quick question, is the square containing the light beacon marked in any way? Perhaps a different color floor for that square. It would make goal determination much easier. Or is part of the challenge (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | Re: NQC chapter online
|
|
Great Chapter! Noticed a typo though: "Spruce Up That Résumé Writing programs for the RCX is an example of cross-compiling for an embedded system, a phrase that is bound to sound good on your résumé. Cross-compiling means that you are writing (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
|
| |
 | | RE: NQC chapter online
|
|
Great Chapter! Noticed a typo though: "Spruce Up That Résumé Writing programs for the RCX is an example of cross-compiling for an embedded system, a phrase that is bound to sound good on your résumé. Cross-compiling means that you are writing (...) (27 years ago, 13-Sep-99, to lugnet.robotics)
|