A* search

The most common informed search algorithm is A* search (pronounced “A-star search”), a best-first search that uses the evaluation function: $$f(n) = g(n) + h(n)$$

Where $g(n)$ is the path cost from the initial state to the node $n$, and $h(n)$ is the estimated cost of the shortest path from $n$ to the goal state, so we have:

$f(n) = $ estimated cost of the best path that continues from $n$ to a goal.

Evaluation

A* search is complete.