NAME: SID#: Section: 1
CS 188 Introduction to AI
Spring 2004 Stuart Russell Midterm
You have 50 minutes. The exam is open-book, open-notes. 100 points total. Panic not.
ALL QUESTIONS IN THIS EXAM ARE TRUE/FALSE, MULTIPLE-CHOICE, OR SHORT-ANSWER.
Mark your answers ON THE EXAM ITSELF. Write your name, SID, and section number at the top of each page.
For true/false questions, CIRCLE True OR False.
For multiple-choice questions, CIRCLE ALL CORRECT CHOICES (in some cases, there may be more than one).
If you are not sure of your answer you may wish to provide a brief explanation.
For official use only
Q. 1 Q. 2 Q. 3 Q. 4 Q. 5 Q. 6 Total
/12 /15 /25 /12 /18 /18 /100
1. (12 pts.) Agents and Environments
(a) (3) True/False: There exist task environments (PEAS) in which some pure reflex agents behave rationally.
(b) (3) True/False: There exist task environments (PEAS) in which all pure reflex agents behave irrationally.
(c) (3) True/False: The input to an agent program is the same as the input to the corresponding agent
function.
(d) (3) True/False: Every agent function is implementable by some program/machine combination
2. (15 pts.) Search
Consider the problem of moving kknights from kstarting squares s1,...,skto kgoal squares g1,...,gk, on
an unbounded chessboard, subject to the rule that no two knights can land on the same square at the same
time. Each action consists of moving up to kknights simultaneously. We would like to complete the maneuver
in the smallest number of actions.
(a) (5) What is the maximum branching factor bin this state space?
(i) 8k(ii) 9k(iii) 8k(iv) 9k
(b) (6) Suppose hiis an admissible heuristic for the problem of moving knight ito goal giby itself. Which of
the following heuristics are admissible for the k-knight problem?
(i) min{h1,...,hk}(ii) max{h1,...,hk}(iii) Pk
i= 1 hi
(c) (4) Which of these is the best heuristic?
(i) min{h1,...,hk}(ii) max{h1,...,hk}(iii) Pk
i= 1 hi
