Sunday, October 27, 2013

Enemy AI pathfinding A* Algorithm

We've been having AI difficulties so I started to research it and after awhile I came across The A* Algorithm which will help a lot in our AI path finding abilities.


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.

A* Tutorials

No comments:

Post a Comment