contactgaq.blogg.se - Missionaries games missionaries and cannibals answer

#Missionaries games missionaries and cannibals answer how to#
#Missionaries games missionaries and cannibals answer update#

The program can take about a minute to run on Strauss (or, if you This includes such operations as append, filter, map, etc. You are welcome and encouraged to use Scheme's library functions as you see fit. This measure saves time and how much time it saves. You implement this third edition, you might wish to determine whether Is, if you complete it, you will learn something but you won't getĬredit for it) eliminate all those states that represent solutionĪttempts in which the same state would be reached (at least) twice. For the third, final, and completely optional stage (that Of course, for the initial state this is just the empty

#Missionaries games missionaries and cannibals answer update#

Type with one more slot/element, and then update that as isĪppropriate. You can do this by simply altering your abstract data Representations that include the list of crossings that got the group Then, for the second edition, you must create state Should represent states in a manner that allows the program to find out You might wish to write the program in three stages. QUESTION: Why are there cycles and why is this a problem for a computer program? You do not have to worry about cycles in solution attempts. It generates all those states reachable with eight crossings. Hint: If the final program utilizes the first half-dozen functions, it will generate all states reachable with, say, seven crossings before The input would be a list of just the start state. Group has to make in order to get everyone from one side of the river Its result is the list of boat trips that the

Design a generalized version final-states that consumes a list of states and returns the sub-list of final states.ĭesign a function that generates moves in the ``game'' until it hasįound a final state.Design a function final? that consumes a state and determines if it is the final state.Design a generalized function legal-states that consumes a list of states and returns the sub-list of legal states.nobody gets eaten, not nonsensical) state. Design a function legal? that accepts a state, and determines whether it is a legal (i.e.Define a generalized version all-successors that consumes a list of states, and returns a list of states reachable with one additional crossing.

List may include states in which the cannibals get to enjoy a meal, orĮven nonsensical states where there are -1 missionaries on the Successor state objects, i.e., states reachable with one crossing. Which consumes a state object and returns a list of all possible Define a constant *start-state* using your constructor that represents the starting state.

Determine the initial and final state of the game in your representation.

SomeĮlements of your state abstract data type might be the number ofĬannibals on the right bank, the location of the boat, and so on. In steps, and make sure you have one step working before doing the next.Īn abstract data representation for each STATE of the river crossing.ĭefine the appropriate CONSTRUCTOR and SELECTORS for the state. Missionaries won't abandon any potential converts).Ī Scheme program that finds a solution to the problem. However, the cannibals can be trusted toĬooperate otherwise (they won't abandon any potential food, just as the Were never any missionaries in the minority at either side of the Thus, our 280 graduate had to devise a plan that guaranteed that there Problem? The kind of cannibals in the story kill and eat missionariesĪs soon as there are more cannibals than missionaries at some place. It on her laptop, ran it and used the computed solution to get them all She devised a Scheme program to search a solution, implemented

#Missionaries games missionaries and cannibals answer how to#

Missionaries had taken CISC-280 at UD and knew how to solve their Plan to get all six of them safely across the river. The missionaries could not trust the cannibals they had to figure out a There was no way to bring the boat back other than to row it back. It couldīarely carry two people at a time. Unfortunately, the boat was too small to carry all of them. There was no way to cross the river without a boat.įortunately, they found a row boat with two oars after a short search. Time, they arrived at the left bank of a wide river, filled with deadly Jungle by three cannibals to the nearest mission station. ``Once upon a time, three missionaries were being guided through a (60 Points) State-Space Search: Missionaries and Cannibals (10 Points) Exercise 3.3 on page 225 in the text.ģ. (10 Points) Exercise 2.77 on page 192 in the text.Ģ. CISC-280 Program Development Techniques Homework 8: Abstractions on data and Data Abstraction to Solve the Missionaries andĬannibals Problem Due: Tuesday, December 2, 2008ġ.