21 Jan 2004
CS 3243 - Heuristics
25
Properties of A*
nComplete? Yes (unless there are infinitely many nodes with f ≤ f(G) )
nTime? Exponential
nSpace? Keeps all nodes in memory
nOptimal? Yes