Assignment  #2
CSE P573 Autumn 2004 - Introduction to AI
Due: October 18

Readings for Week 2 (Games): R&N Chapter 6

Exercises:

Turn in hardcopy in class.  Written exercises should be typed or neatly handwritten.  R&N = Russell & Norvig, Artificial Intelligence, A Modern Approach, 2nd Ed.

1. Email your static evaluation function file(s) to Danny (only one copy per group; include everyone's names).

2. R&N 6.2. Give a rigorous inductive proof on the height of the game tree for the first question.

3. R&N 6.16. Instead of "seek time", use "access time" (the sum of the seek time and latency), which is a better measure of disk performance. An typical PC hard disk (Western Digital 80GB, 7200 RPM) has a seek time of 8.9 millisconds and a latency of 4.17 milliseconds. 

Preparation for Week 3

Download and install the free SWI-Prolog interpreter (http://www.swi-prolog.org/) on your machine.  A copy on the Linux compute servers will also be available.

Readings for Week 3 (Logic & Prolog):

If you have time & interest, you can read Chapters 7 to 9 straight through. But following are the sections we will actually be using, so at least skim them:

• Sec 7.3
• Sec 7.4, up to page 207
• Part of Sec 7.5, from page 213 to top of 217
• Sec 8.2 
• Sec 9.1
• Sec 9.2 up to page 277
• Sec 9.4
• Sec 9.5 up to page 300

In the lecture we will actually be covering the material in Sec 9.5 (resolution) before we cover the material in 9.4 (backward chaining), because the latter is a special case of the former.