A* Algorithm Path Finding example |
A* uses a best first search and finds a least-cost path from a given initial node (start point) to a goal node (a waypoint or the player) out of one or more possible goals. As A* traverses the graph, it
follows a path of the lowest expected total cost or distance, keeping a
sorted priority queue of alternate path segments along the way.
No comments:
Post a Comment