Due Date: Thursday Sept. 27, 2007 at the beginning of class
- Read Chapters 5, and 6 of the textbook.
- Problems: You need to turn in written solutions ONLY
TO THE PROBLEMS MARKED WITH ONE ASTERISK "*" BELOW
at the beginning of class. Solve the
other problems before the class also so that you can ask questions
about them in preparation for Exam 1.
- Chapter 5:
5.1*, 5.3*, 5.4, 5.5, 5.6*, 5.7, 5.8*, 5.11*, 5.13 (good test case for your project).
- Chapter 6:
6.1*, 6.3*, 6.4, 6.5, 6.9, 6.13, 6.15*
- * Consider the adversarial search tree in the handout distributed in
class (linked here for your convenience).
- Use the minimax procedure alone to select
your next move.
Show your work on the adversarial search tree and explain your answer.
- Use the minimax procedure TOGETHER WITH ALPHA-BETA PRUNING to select
your next move. Mark with the word "PRUNE" the nodes/branches that
don't need to be evaluated (and don't expand those unnecessary branches).
Show your work on the adversarial search tree and explain your answer.