27 Jan 2005
CS 3243 - Heuristics
29
Relaxed
problems
nA problem with fewer restrictions on
the actions is called
a relaxed problem
nThe cost of an optimal solution to a
relaxed problem
is an admissible heuristic for the original problem
nIf the rules of the 8-puzzle are
relaxed so that a tile can move anywhere, then h1(n) gives the shortest solution
nIf the rules are relaxed so that a
tile can move to any adjacent square,
then h2(n) gives the shortest solution