Monday, Feb. 10, 2003
Monday, Feb. 17, 2003, in the beginning of class
1. Exercises 1.11, 1.12, and 1.13, pg. 31 Russell and Norvig, 2nd Edition (RN) (20 points)
Provide brief arguments.
2. Problem 3.7, pg. 90, RN (20 points)
3. Problem 3.17, pg. 93, RN (20 points)
4. Answer the following questions: (40 points)
- Give an example of a problem where hill climbing and best first
search behave differently.
- Construct a finite search tree
for which it is possible that depth-first search uses more memory than
breadth-first search. Please highlight the goal nodes in your tree.
- Construct a problem and a formulation for it so that hill
climbing is at least as good as breadth-first search, depth-first
search, and best-first search.
- Describe a search space where depth-first iterative deepening
performs much worse than depth-first search. How many nodes does each