This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CSci 5511 Spring 2009 1st Midterm Exam Wednesday February 25 75 minutes == 75 points Open book and notes 1. 15 points You are given the missionaries and cannibals problem, which states that there are 3 missionaries and 3 cannibals on one side of a river, along with a boat that can hold one or two people. The problem is to find a way to get everyone to the other side of the river without ever leaving a group of missionaries in one place outnumbered by the number of cannibals in the same place. 1. Describe how you would represent the state space, including the states, successor function, and goal test. 2. Is the search space a tree or a graph? What is the branching factor? 3. What search algorithm would you use to solve the problem? 2. 10 points Answer the following questions briefly but precisely: 1. Can an agent that keeps no history of its percept sequence be rational? Please explain. 2. Why it is important to know if an agent’s environment is fully observ- able or if it is partially observable?able or if it is partially observable?...
View Full Document
- Spring '08
- Search algorithm, search space, heuristic function, Admissible heuristic, Consistent heuristic