•Inventing heuristics: 8-puzzle example
•Relaxed problem – problem with constraints removed
•Relax: A tile can move from A to B if A adjacent to B and B is empty.
–A tile can move from A to B if A adjacent to B.
–A tile can move from A to B if A is empty.
–A tile can move from A to B.
•The cost of an exact solution to a relaxed problem can provide a good heuristic h.
