a) write a rule set for the knights tour problem. The knight tour is
 able to generate a path from any one square on an 8x8 chess board to any
 other square...

 b) write a rule set for the water jug  problem (described on pg 423, prob 10,
 course notes)...

 c) run the knights tour in depth-first and breadth-first modes.

 d) run the water jug problem in breadth-first and depth-first modes.

Do the best-first search for a possible A.
Make sure you include test cases!

Make sure that your rule sets are separate components from the search engine.
You should use the same search engine (depth-first, for example) on either
(any) set of rules to solve the problem that the set of rules describes.