AI Programming: Pathfinding with A*

Welcome to "A* Pathfinding" the second set in our AI Programming series. This entry in the series continues from the topics discussed in "Behavior Systems" by exploring the world of pathfinding focusing primarily on the A* pathfinding algorithm. Pathfinding is the process of plotting out the shortest or most efficient path between two given points. A* (pronounced ay-star) is a particular pathfinding search algorithm used in many software applications for calculating this path. In determining the path, the A* algorithm takes a "distance-to-goal + path-cost" score into consideration.

Show Bundles / Threads

Recent Forum Threads

  • No threads found...

A* Pathfinding