21 Jan 2004
CS 3243 - Heuristics
5
Best-first search
nIdea: use an evaluation function f(n) for each node
nestimate of "desirability"
àExpand most desirable unexpanded node
à
nImplementation:
n Order the nodes in fringe in decreasing order of desirability
n
nSpecial cases:
ngreedy best-first search
nA* search