Question: Question 1. (based on Russell & Norvig, p. 90, question 3.9) (15 points) The missionaries and cannibals problem is a famous toy problem from Al.

Question 1. (based on Russell & Norvig, p. 90, question 3.9) (15 points) The "missionaries and cannibals" problem is a famous toy problem from Al. It's formulation is as follows: There are three missionaries and three cannibals on one side of a river. They have a single boat that can only hold two people. They need to get to the other side of the river. The boat requires at least one person to operate. So far, so good. The problem is that if at any time there are more cannibals than missionaries on one side of the river, the cannibals will eat the missionaries. This is a "bad thing." The goal is to find a way to get all six people from one side to the other without anyone being eaten. a. Describe the minimal state space necessary for this problem (state representation, start state, goal state and operators)). b. Draw the complete directed graph of the search space. You may omit edges that lead to "invalid states. Mark the start state and all end states. You may omit labelling the edges with the corresponding moves. Question 1. (based on Russell & Norvig, p. 90, question 3.9) (15 points) The "missionaries and cannibals" problem is a famous toy problem from Al. It's formulation is as follows: There are three missionaries and three cannibals on one side of a river. They have a single boat that can only hold two people. They need to get to the other side of the river. The boat requires at least one person to operate. So far, so good. The problem is that if at any time there are more cannibals than missionaries on one side of the river, the cannibals will eat the missionaries. This is a "bad thing." The goal is to find a way to get all six people from one side to the other without anyone being eaten. a. Describe the minimal state space necessary for this problem (state representation, start state, goal state and operators)). b. Draw the complete directed graph of the search space. You may omit edges that lead to "invalid states. Mark the start state and all end states. You may omit labelling the edges with the corresponding moves
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
