This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: The missionaries and cannibals problem is usually stated as follows: Three missionaries and three cannibals are on one side of a river, along with a boat that can hold one or two people. Find a way to get everyone to the other side, without ever leaving a group of missionaries in one place outnumbered by the cannibals in that place. 3A) [16 points] Formulate the problem precisely, making only those distinctions necessary to ensure a valid solution. Draw a diagram of the complete state space. 3B) [4 points] What is the solution, given your initial state (all one one side, needing to get to the other)? Highlight the path in your state space diagram. CSCI561 Spring 2010 Macskassy Homework 1 Due February 10, 2010 Student name: _____________________________ Student ID: _________________ Question 4 [Informed Search, Chapter 4] (6 points): 4A) [6 points] Can A* work on a search space where some actions might decrease the distance to the goal? Explain....
View
Full
Document
This note was uploaded on 08/26/2010 for the course CSCI 561 taught by Professor Staff during the Spring '08 term at USC.
 Spring '08
 staff

Click to edit the document details