CS 470    ARTIFICIAL INTELLIGENCE               Winter 2009,  Instructor: Jeffrey Horn  

QUIZ 1:  Hungarian Rings Puzzle.  (Barry's web site)   Due:  Monday, March 17, to me by email.

Pick one of the versions of the Hungarian puzzle (in case several are given), and show how to solve with state-space search using A*:

(1)   Describe the state space (e.g., outline the data structure for the state descriptor, and the operators that would change a state to another state).   (This part should be easy for this puzzle.)

(2)  Design and describe an admissible  heuristic that can be used in an A* search of the state space.  Explain why it is admissable (i.e., always underestimates the actual cost).   Is it "locally admissable" too?  (extra credit if it is!)