A* search algorithm
December 4, 2007 · Posted in General
“In computer science, A* (pronounced “A star”) is a best-first, tree search algorithm that finds the least-cost path from a given initial node to one goal node (out of one or more possible goals).” more…
A nice Flash implementation of this can be found over at http://www.actionscriptarchitect.com/2007/07/02/a-3d/
Comments
Leave a Reply