Subject:
|
RE: New Lego challenge !
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Mon, 13 Sep 1999 13:01:18 GMT
|
Original-From:
|
Laurentino Martins <LMARTINS@MARKTEST.spamcakePT>
|
Viewed:
|
443 times
|
| |
|
|
At 13:52 13-09-1999 Monday , Ralph Hempel wrote:
> > Yes, unfortunately the current firmware implementation from LEGO doesn't • have a call stack, so you can not build
> > recursive routines. :-(
>
> 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 while back arguing about the "elegegance"
> of recurion and that it can almost always be represented by
> other non-recursive algorithms. The argument was about the difference
> between the memory use on the return stack during recursion
> versus the memory used to represent the problem non-recursively....
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 all of us that don't understand a word of it that Forth is a nice language with advantages compared with C, you may be able to gain a lot of new followers!
Just a thought... :-)
Laurentino Martins
[ mailto:lau@mail.telepac.pt ]
[ http://www.terravista.pt/Enseada/2808/ ]
|
|
Message is in Reply To:
 | | 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. (...) (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
|
|
|
|
