| Best-First Search |
|
|
|
|
|
|
|
|
| • | Describe
General Search |
||||||
| • | Evaluation
Function f(n) - desirability of |
||||||
| node n
for expansion |
|||||||
| • | Best-First
Search: General Search with |
||||||
| queueing
ordered by f (A heap
rather than a |
|||||||
| queue,
really.) |
|||||||
