**Pirate Puzzle**5 pirates of different ages have a treasure of 100 gold coins.

On their ship, they decide to split the coins using this scheme:

The oldest pirate proposes how to share the coins, and all pirates remaining will vote for or against it.

If 50% or more of the pirates vote for it, then the coins will be shared that way. Otherwise, the pirate proposing the scheme will be thrown overboard, and the process is repeated with the pirates that remain.

Assuming that all 5 pirates are intelligent, rational, greedy, and do not wish to die, (and are rather good at math for pirates) what will happen?

On their ship, they decide to split the coins using this scheme:

The oldest pirate proposes how to share the coins, and all pirates remaining will vote for or against it.

If 50% or more of the pirates vote for it, then the coins will be shared that way. Otherwise, the pirate proposing the scheme will be thrown overboard, and the process is repeated with the pirates that remain.

Assuming that all 5 pirates are intelligent, rational, greedy, and do not wish to die, (and are rather good at math for pirates) what will happen?

**For Solution:**Click Here

The last two will share it equally.

ReplyDeleteThe youngest shall get all the 100 coins....

ReplyDeleteimp to see that voting shall be done by the remaining pirates and not by the scheme proposer.....

PS: they must of different ages, else don't know how those greedy guys would decide the scheme proposer in each iteration....

***metalboy***

If the proposer does not vote then the younest get all 100 ... otherwise ...

ReplyDeleteOldest pirate offers 3 coins to the youngest and 1 to the second youngest (and none to the other two) and the offer will get accepted.Carried 3-2.

Reasoning.

If the offer is rejected then the second oldest can offer 2 to the youngest and that is not as good for him (but better than anything that follows). Vote carried 2-2.

With 3 pirates the oldest offers the youngest 1 (worse still but better that the final option). Carried 2-1

With 2 pirates the older just keeps the lot (his vote is enough). Carried 1-1.

Allan

The oldest(5th) pirate ll give 1 gold to the 3rd and 1st pirate.

ReplyDeleteReasoning:

If there are only 2 pirates the 2nd ll take all 100 and the last(1st) pirate ll not get any.

Now if 3 pirates r there,1st ll not want 2nd pirate to decide, rather he ll vote if 3 decides to give him 1 and 3 ll take 99gold also 3rd could never win 2nd's vote since he ll want 3rd to die.

Now if 4 pirates r there, he would give 1 gold to 2nd since if 3rd decides 2nd ll not get any gold and 3rd and 1st ll not get any gold.

So the 5th pirate ll jus give 1 gold to 3rd n 1st to win their vote, bcas they kno if 4th decides they ll not get any..