© 2000 Todd Neller.
A.I.M.A. t
ext
figures
© 1995 Prentice Hall.
Used by
permission.
Best-First Search (cont.)
•
Let
g
(
n
) = pathCost(
n
).
What search do you
have if
f
(
n
) =
g
(
n
)?
