0pt - Read Chapters 1 and 2. See the ‘What to Know’ slides at the end of each slide set. In general, you are responsible of anything (discussion, example,…) covered in class and the more we talk about something in class, the more you are responsible to know that topic.
10pts (5 pts each)
In which decade was the term ‘artificial intelligence’ coined and AI begin as an active research area?
a) 1940s b)1950s c)1960s d) 1980s
Circle True or False - After initial excitement, the AI research encountered the a setback and caused disappointment, when solutions offered on toy problems did not generalize to other or bigger problems.
40pts - Consider the vacuum cleaner world discussed in class: current location and local dirt sensors; left,right,suck,noop actions; 2-room world (A-on the left and B-on the right); sucking action cleans the room and rooms stay clean once cleaned. But for this question, each movement and sucking actions costs one point (energy).
10pts – Can a simple reflex agent be perfectly rational for this environment? Explain in 1 line.
10pts - Describe a rational agent function for the case in which each movement and sucking actions costs one point, in 1-2 lines. Does the corresponding agent program require internal state? (variable/memory needed?)
Reminder: The agent function describes the action for each possible percept sequence, not just the current percept. The agent function basically states the desired behavior and not the implementation.
20pts – Complete the following pseudocode (the agent program) that will implement the desired rational agent function.
Format/language does not matter. You can use {} or just use indentation to mean {}s.
For simplicity of grading (uniform code), check both sensors at once, as in the given code part below.
Don’t forget that return exits the code!
25pts - For each of the following assertions, say whether it is true or false and support your answer with examples or counter examples where appropriate. 1 line explanation at most!
Hint: You can answer many of these questions by thinking task environments and sample agents we have seen in class.
T / F - An agent that senses only partial information about the state cannot be perfectly rational.
T / F - There exist task environments in which no pure reflex agent can behave rationally.
T / F - The input to an agent program is the same as the input to the agent function.
T / F - Every agent is rational in an unobservable environment.
T / F - A perfectly rational poker-playing agent never loses.
