Introduction to the A* Algorithm (2014)
Created 26 May 2014, updated Aug 2014, Feb 2016, Jun 2016, Jun 2020, Jul 2023 Graph search algorithms let us find the shortest path on a map represented as a graph. Move the blob (start point) and cross (end point) to see the shortest path found by the A* Algorithm: A* is one of a family of related graph search algorithms: Breadth First Search[1] explores equally in all directions. Dijkstra’s Algorithm[2] takes into account movement costs. A*[3] explores more towards a single destination. In ad