Cannibals & Missionaries C++ solution

Cannibals & Missionaries **Problem Description** A particular river crossing is shared by both cannibals and missionaries. A boat is used to cross the river, but it only seats three people, and must always carry a full load. In order to guarantee the safety of the missionaries, you cannot put one missionary and two cannibals in the same boat (because the cannibals would gang up and eat the missionary), but all other combinations are legal. You are to write two procedures: **MissionaryArrives** and **CannibalArrives**, called by a missionary or cannibal when it arrives at the river bank. The procedures arrange the arriving missionaries and cannibals into safe boatloads; once the boat is full, one thread calls *RowBoat* and after the call to *RowBoat*, the three procedures then return. There should also be no undue waiting: missionaries and cannibals should not wait if there are enough of them for a safe boatload. **Please also write a one page design documentation** **The assignment has to be done in Java and Due by 8:59PM, 5/21/2014** ## Deliverables Cannibals & Missionaries **Problem Description** A particular river crossing is shared by both cannibals and missionaries. A boat is used to cross the river, but it only seats three people, and must always carry a full load. In order to guarantee the safety of the missionaries, you cannot put one missionary and two cannibals in the same boat (because the cannibals would gang up and eat the missionary), but all other combinations are legal. You are to write two procedures: **MissionaryArrives** and **CannibalArrives**, called by a missionary or cannibal when it arrives at the river bank. The procedures arrange the arriving missionaries and cannibals into safe boatloads; once the boat is full, one thread calls *RowBoat* and after the call to *RowBoat*, the three procedures then return. There should also be no undue waiting: missionaries and cannibals should not wait if there are enough of them for a safe boatload. **Please also write a one page design documentation** **The assignment has to be done in Java and Due by 11:59AM, Aug-11-03** Common Questions 1. How do we use threads to solve this problem? It's up to you. Remember, a big part of this class is learning how to design code. A lot of these problems have more than one correct solution. Whatever you do, MAKE SURE to tell the grader what you did in your writeup! If the grader doesn't understand what you did, he won't give you any points. L That said, here are some suggestions. One is you can have one thread exist for each Missionary or Cannibal that is there -- in other words, if you have 10 missionaries and 5 cannibals waiting for a boat, there would be 15 threads. Another way you can do it is have a Missionary thread and Cannibal thread; and each one keeps track of how many of its kind of people are waiting -- in this case, there would be 2 threads no matter how many missionaries and cannibals there are. These are just two suggestions. You can do something else if you have a better idea, as long as it involves multiple threads that are communicating via locks and condition variables. (Well, I should say you can do ALMOST anything else... silly solutions will not get points.) Input file and: There is an input file supplied. It will be named **[login to view URL]**. Each line in the file will contain a single request. A request for a Missionary will look like: “Missionary 1??, and a cannibal will look like: “Cannibal 1.?? Essentially it will be the type of passenger, followed by an id number. Output file: The format for the output file should be something like following. "Boat leaving with Missionary 4, Missionary 9, and Cannibal 1!" There should be as many lines printed as the (total number of requests)/3. You should also generate an output file **[login to view URL]** to store your output. ## Platform This assignment must done in C++!!!