Post

 Resources 

Console


Re: A* and Pathfinding ian (0 replies, 0 views) (2001-Feb-22)
-
Take a peek at http://www.dacek.net/pathtest.htm It is a somewhat messy screenshot of a modified A* formula I have been intermittantly working on. It is done entirely in VB, without the use of linked-lists, pointers, or trees. The path is of oversized-circles, to make it more visible. Large blue, and green, circles are two slightly different methods i am experimenting with; the purple ones that appear to be pooled in spots are the excess nodes checked, but discarded. The trick is to use a recursive function (a function that calls itself), and to limit the depth of recursion allowed so as to avoid stack-overflows. If and when a path to the destination is found, as the function exits itself, it can (or not) write each good or bad coordinate to an array, or whatever data structure is desired. At present time, only about 2.7% of the map is searched (when a possible path is present). If you require additional info, or chat, or source code, post here or email me. Regards, -ian


-
Up One Level | Back to Forum


Copyright © 2002 - 2004 Eric Coleman, Peter Kuchnio , et. al.
There have been 78 visitors within the last 20 minutes
RSS News Feed