ANALYSIS OF ALGORITHMS

Part 1

On the left bank of a river are a ferryman, a goat, a boat big enough for four, and an equal number of Bluebeards and Zombies. The latter remain at peace except when one group outnumbers the other. When the ferryman is absent, Bluebeards and Zombies eat goats. Only the ferryman can operate the boat.

Part 1.1

Describe an algorithm, in terms of accumulating outcomes, for getting everyone to the right bank without conflict. Dont include a description of how to implement these outcomes (thats Part 1.2). Use n as the total number of Bluebeards (and Zombies). Remember that (1) outcomes may introduce variable(s) and (2) we assume that the code implementing each outcome will also restore all prior outcomes. Be precise and concise.

You can assume that the boat is always in the same location as the ferryman, so there is no need to mention it. The formulation anticipated below divides the preconditions and postconditions in two, and uses three outcomes, but you are free to organize them differently if you wish.

Precondition 1: Please replace this

Precondition 2: Please replace this

Postcondition 1: Please replace this

Postcondition 2: Please replace this

Outcome 1: Please replace this

Outcome 2: Please replace this

Outcome 3: Please replace this