27 Jan 2005
CS 3243 - Heuristics
7
Greedy best-first search
nEvaluation function f(n) = h(n) (heuristic)
n= estimate of cost from n to goal
ne.g., hSLD(n) = straight-line distance from n to Bucharest
nGreedy best-first search expands the node that appears to be closest to goal