Due Sept 7 at 12:00 noon.

This is an individual assignment. List the people with whom you discussed this assignment.

Three cannibals and three missionaries are standing on the west bank of a river. A boat is available that will hold either one or two people. If the missionaries are ever outnumbered -- on either bank or in the boat -- the cannibals will eat them. Your job is to design a program (come up with a representation and implement a search algorithm) that will get everyone across the river to the east bank. My step by step approach would be to:

• Come up with a good representation
  • What are states
  • How do I move from one safe state to the next safe state
• Identify the safe/legal points in the state space
  • Ensure, number of missionaries >= Number of cannibals
• Find a path via safe points from the initial state to the desired state. Your path will take you through all the safe points. Avoid loops.

• Graduate Students generalize your program to solve the N missionaries -- M cannibals problem, with P boat capacity. I'd suggest you do the undergrad portion first, then generalize.

Please turn in hardcopy source and a listing of you running the program for the 3 missionaries and 3 cannibals problem. Your output should list each state change so that each time someone crosses I know how many are on the east bank, on the boat, and on the west bank. You may turn it in to the CS office or slip it under my office door before noon on the 7th.

Also turn in an estimate (for your representation) of the size of your search space

Use any programming language you like. I can help you with C, C++, and Java. Somewhat less with Scheme, Lisp, and Perl.