Greedy best-first search Evaluation function f(n)=h(n)(heuristic) estimate of cost from n to goal ● .e.g.,hsLo(n)=straight-line distance from n to Bucharest ● Greedy best-first search expands the node that appears to be closest to goal Greedy best-first search • Evaluation function f(n) = h(n) (heuristic) • = estimate of cost from n to goal • • e.g., hSLD(n) = straight-line distance from n to Bucharest • • Greedy best-first search expands the node that appears to be closest to goal •