Minimizing the total estimated solution cost. The most widely known form of best first search is called $A^*$ search. It evaluates nodes by combining g(n), the cost to reach the node, and h(n), the cost to get from the node to the goal:

F(n) = g(n) + h(n)

Since g(n) …