Also known as: A star Search Β· A-star Search
A* Search is a graph search and pathfinding algorithm that uses both the cost already incurred and a heuristic estimate of remaining cost to choose the next path to explore. When its heuristic is properly constrained, it can find an optimal path efficiently and is widely used in planning, navigation, and search problems.
(Pronounced "A-star".) A graph traversal and pathfinding algorithm which is used in many fields of computer science due to its completeness, optimality, and optimal efficiency.