A* search

A* search

(pronounced “A star”) a type of best-first search in which “best” for any state is measured by the distance that state is from the start state plus the heuristic estimate of the quality of that state. The heuristic estimate must be less than or equal to the actual cost of going from that state to a goal state.