Subject:
|
RE: New Lego challenge !
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Mon, 13 Sep 1999 12:52:10 GMT
|
Viewed:
|
635 times
|
| |
|
|
> 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....
Cheers,
Ralph Hempel - P.Eng
--------------------------------------------------------
Check out pbFORTH for LEGO Mindstorms at:
<http://www.hempeldesigngroup.com/lego/pbFORTH>
--------------------------------------------------------
Reply to: rhempel at bmts dot com
--------------------------------------------------------
|
|
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
|
|
|
|
Active threads in Robotics
|
|
|
|
|
|
