CS430/530: Homework Assignment 2 Due October 13, 1999

• All students:
  Work the following problems from the textbook: 3.2, 3.5, 3.9, 4.1, 4.4
  For 3.9, it is not interesting to simply posit a goal at a convenient place for depth-first search in an ordinary-looking search tree. Come up with a tree shape that causes problems for iterative deepening no matter what the ordering of successors.

• CS530 students:
  Work the following problems from the textbook: 3.4 (just draw the state space diagram; you don't need to implement it), 3.12, 3.13.