Summary: G52PAS Planning and search 2010-11 in-class mock exam
This is not meant to look like a real exam, more like a problem class. You can use the textbook
and lecture notes.
The first four questions use the following example domain. It consists of two rooms and a vacuum
cleaner agent which can be either In(room1) or In(room2). Each room can be clean or dirty. Room 1
being clean is represented as Clean(room1), room 2 being clean Clean(room2). The vacuum cleaner
agent has three actions: Left and Right for moving between the rooms and Suck for cleaning up dirt.
Question 1 (forward planner) Assume that the initial state is In(room1), the goal state is Clean(room1),
Clean(room2). Trace forward planner (using forward search) solving this problem.
Question 2 (goal stack planner) Assume that the initial state is In(room1), the goal state is Clean(room1),
Clean(room2). Trace goal stack planner solving this problem.