2d array simulated with nested lists - list[y][x], non-zero values are obstacles, handler would accept start and end coordinate parameters and figure out a way to get there, returning the resulting path as another list.
-----Original Message----- From: Perry [mailto:[EMAIL PROTECTED]] Sent: 05 March 2002 18:52 To: [EMAIL PROTECTED] Subject: Re: <lingo-l> Pathing > Imagine a maze, and a piece of cheese, and a mouse. Pathing routines allow the mouse to move around the maze to find the piece of cheese, they are related to AI. A Star is the most famous one. Oh that A * ! I've done quite a bit of this sort of stuff over the past few years. It's a frightfully complex subject, though, so what particular issue do you have in mind? Pez [To remove yourself from this list, or to change to digest mode, go to http://www.penworks.com/lingo-l.cgi To post messages to the list, email [EMAIL PROTECTED] (Problems, email [EMAIL PROTECTED]). Lingo-L is for learning and helping with programming Lingo. Thanks!] [To remove yourself from this list, or to change to digest mode, go to http://www.penworks.com/lingo-l.cgi To post messages to the list, email [EMAIL PROTECTED] (Problems, email [EMAIL PROTECTED]). Lingo-L is for learning and helping with programming Lingo. Thanks!]
