Solving problems by searching

14 Jan 2004

CS 3243 - Blind Search

16

Example: The 8-puzzle

n

n

n

n

n

nstates? locations of tiles

nactions? move blank left, right, up, down

ngoal test? = goal state (given)

npath cost? 1 per move

n

[Note: optimal solution of n-Puzzle family is NP-hard]

n