© 2000 Todd Neller.
A.I.M.A. t
ext
figures
© 1995 Prentice Hall.
Used by
permission.
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.)
