An algorithm which tries to expand the node that is closest to the goal, on the grounds likely to lead to a solution quickly. It evaluates nodes by using the heuristic function; that is,
f(n) = h(n), where h(n) is heuristic = estimate of cost from n to the goal.
An example: Order in which the nodes are expanded (Solution: Start-A-D-E-Goal)