| |
In lugnet.org.us.laflrc, Steve Hassenplug wrote:
> I must have done something wrong.
Yes, I'm sure that's it - you just *imagined* you maze-solver worked ;-).
> I'm only keeping 2 bits per node
Hmm. OK, that's got me confused. I *know* I'm storing more information than
needed, but each node in the path only takes 2 bits? If those two bits encode
the direction to the next node (three possible states for L-R-Straight, or four
possible states for N-E-S-W). But if the path the robot is going down is a
dead-end, then the robot has to back up, and it needs to know... oh, OK, it
*does* know which branch it went down at the last node, OK...
Huh. Remember kids, always demonstrate your ignorance in a public forum where
lots of other people can see it. It's much more fun ;-).
I'm not sure why I came up with this much more complicated scheme - I think
it has something to do with thinking about it in terms of N-E-S-W. Some mental
block of mine. OK, back to the coding.
--
Brian Davis
|
|
Message has 1 Reply:
Message is in Reply To:
13 Messages in This Thread:
  
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
This Message and its Replies on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
