21 Jan 2004
CS 3243 - Heuristics
13
A* search
nIdea: avoid expanding
paths that are already expensive
nEvaluation
function f(n) = g(n) + h(n)
ng(n) =
cost so far to reach n
nh(n) =
estimated cost from n to goal
nf(n) =
estimated total cost of path through n to goal