 | | Re: Just a few highlights and points... —Brian Davis
| | | | (...) I didn't read it. But if I had... (...) Agreed. although if we start running mazes with loops (like Alegomazer did) I think mapping, physically, the maze will likely be needed - if for no other reason than to know when you've closed a loop. (...) (19 years ago, 28-Sep-05, to lugnet.org.us.laflrc, lugnet.robotics)
| | | | | | | | | | Re: Just a few highlights and points... —Steve Hassenplug
| | | | | (...) I must have done something wrong. I'm only keeping 2 bits per node, instead of 8. Steve (19 years ago, 28-Sep-05, to lugnet.org.us.laflrc, lugnet.robotics)
| | | | | | | | | | | | Re: Just a few highlights and points... —Brian Davis
| | | | | (...) Yes, I'm sure that's it - you just *imagined* you maze-solver worked ;-). (...) 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 (...) (19 years ago, 28-Sep-05, to lugnet.org.us.laflrc, lugnet.robotics)
| | | | | | | | | | | | Re: Just a few highlights and points... —Steve Hassenplug
| | | | | (...) Nodes I haven't seen have a value of zero. Every time I [re]enter a node, I add 1 to the value that's currently there. If there's no right turn (I follow the right "wall"), I add 2. When the total is 4, you're done searching that node. So, (...) (19 years ago, 28-Sep-05, to lugnet.org.us.laflrc, lugnet.robotics)
| | | | | | |
