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