Example: The 8-puzzle
	n states? locations of tiles n actions? move blank left, right, up, down n goal test? = goal state (given) n path cost? 1 per move [Note: optimal solution of n-Puzzle family is NP-hard]