A* Search Algorithm

A* (pronounced "A-star") is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency. One major practical drawback is its O(b^d) space complexity, as it stores all generated nodes in memory. Thus, in practical travel-routing systems, it is generally outperformed by algorithms which can pre-process the graph to attain better performance, as well as memory-bounded approaches; however, A* is still the best solution in many cases. 

from A* Search Algorithm - Wikipedia

This topic includes the following resources and journeys:



Pathfinding with A*

Amit Patel
60 min
Article / Blog

An interactive visual explanation of the A* pathfinding algorithm.  This resource uses motivating examples from computer games. 


See More