CSB551 – Elements of Artificial Intelligence – Fall 2009
Homework #1
(Search Problems)
Due: 9/17/09 (5:15 pm)
How to complete this HW:
Either 1) type your answers in the empty spaces below each
problem and print out this document, or 2) print this document and write your answers in the
empty spaces on the printout.
Return the homework in class, during office hours, or slip it under
the door of Lindley 301F before 5:15 on Thursday, 9/17/09.
Your name:
………………………………………………………………………………………
Your email address:
……………………………………………………………………………
Note on Honor Code:
You must NOT look at previously published solutions of any of these
problems in preparing your answers. You may discuss these problems with other students in the
class (in fact, you are encouraged to do so) and/or look into other documents (books, web sites),
with the exception of published solutions, without taking any written or electronic notes. If you
have discussed any of the problems with other students, indicate their name(s) here:
…………………………………………………………………………………………………
Any intentional transgression of these rules will be considered an honor code violation.
General information:
Justify your answers, but keep explanations short and to the point.
Excessive verbosity will be penalized. If you have any doubt on how to interpret a question, tell us
in advance, so that we can help you understand the question, or tell us how you understand it in
your returned solution.
Grading:
Problem#
Max. grade
Your grade
I
20
II
20
III
30
IV
30
Total
100
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentName ………………………………………………………………….
.
I. Codebreaker Game
Consider the “codebreaker” game illustrated below, where the objective is to guess a 4
color secret code (which is unknown to the player) within N guesses.
There are C possible
colors.
After each submitted guess, the opponent replies with A) the number of colors
correct and in the correct spot (illustrated by a black dot), and B) the number of colors
correct but
not
in the correct spot (illustrated by a white dot).
1. Formulate the player in an agentbased framework.
What are:
a)
The type of task environment (observable/nonobservable, stochastic/deterministic,
episodic/nonepisodic, static/dynamic, single/multi agent).
b) The set of percepts, and the number of possible percepts.
c)
The set of actions, and the number of possible actions
d) The number of unique agent functions (recall that an agent function maps a
sequence
of percepts
to an action, and two agent functions are identical only if they match on
all
possible inputs).
e)
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '10
 asda
 Alberto, birth certificate, Intelligent agent, initial state, Sergio Lopez

Click to edit the document details