CIS603 S03: Homework 1

1. Exercises 1.11, 1.12, and 1.13, pg. 31 Russell and Norvig, 2nd Edition (RN)

2. Problem 3.7, pg. 90, RN

3. Problem 3.17, pg. 93, RN

4. Answer the following questions:

1. Give an example of a problem where hill climbing and best first search behave differently.
2. 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.
3. 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.
4. Describe a search space where depth-first iterative deepening performs much worse than depth-first search. How many nodes does each algorithm expand?

Switch to:

• CIS603 S03 Home Page
• Homework 1 Solution