Read

• Chapters 7, 8.1 – 8.3, 9, 10.1 – 10.4, 11.1 – 11.3 in Russell and Norvig
• Even more robot articles from http://www.aaai.org/AITopics//html/robots.html

You might want to reread Chapter 6.

Follow the instructions given on homework assignment #1 about the structure of your CVS repository for your homework assignments and prjects, the requirements to use a separate file for each exercise (or part thereof), and to make each file self-contained (question + answer).

By the end of this assignment you will be able to speak First Order Logic.

Print out the files comprising your answers to the following problems (2up to save trees) and turn them in at the beginning of class on April 6.

1. Add a sensory input device to your robot, such as a bump sensor, location sensor, microphone, or camera. Program the robot to execute some code in response to the input. For example,
   • if using a camera, it can stop when it sees that it is rolling over a striped surface.
   • if using a location sensor, it can turn around when it notices that it is within 5 centimeters of another object.
   • if using a bump sensor, it can emit an annoyingly loud, high pitched wail, when bumped.
   • if using a microphone, it can launch a projectile if it senses something sounding like "fire!!".
2. For the game Kalah with these variations:
   • six pits per side between side pits (14 total)
   • four seeds per pit to start
   • if last seed lands in your side pit you go again
   • when one player has no seeds, then the other player takes all remaining seeds and the game ends
   define:
   1. A description of the board
   2. The endgame test
   3. A state evaluation function
   4. The move generation function
3. Using your evaluation function from the previous problem, write out the entire tree from this position:

       +------------------------------+
       | +--+                    +--+ |
       | |  |  0  0  0  0  0  1  |  | |
       | |23|                    |21| |
       | |  |  0  0  2  0  1  0  |  | |
       | +--+                    +--+ |
       +------------------------------+
   

   assuming player MAX is sitting at the bottom and moving to the right. Show the values of alpha and beta at each node and show where the pruning occurs. You may want to get an 11x17 sheet of paper for this.

4. Problems 7.5, 7.6, 7.8 and 7.9 in Russell and Norvig
5. Problem 8.6, 8.7, 8.9, 8.15, 8.16 in Russell and Norvig
6. Problem 9.4 and 9.19 in Russell and Norvig
7. Problem 10.1 and 10.5 in Russell and Norvig