
There are five pirates, called Pirate 1 through Pirate 5 in order of seniority. The rules for splitting 100 gold coins are as follows.
Everyone is smart and wants to maximize their own share. If the share is the same, they prefer to eliminate the proposer.
What is the most coins Pirate 1 can secure for himself?
If you get stuck, open the hints one at a time, in order.
Start by thinking about the last two pirates.
Each pirate compares "how many coins would I get under the next proposal?"
To buy a vote, give one coin more than the next proposal would.
What is the most coins Pirate 1 can secure for himself?
Choose the answer closest to the truth.
98 coins
The answer is "98 coins."
Work backward. With two pirates (4 and 5), Pirate 4 votes for his own proposal and it passes, so Pirate 4 gets 100 and Pirate 5 gets 0. With three pirates (3 to 5), Pirate 3 pays Pirate 5 one coin and Pirate 5 votes yes (99, 0, 1). With four (2 to 5), Pirate 2 pays Pirate 4 one coin and it passes (99, 0, 1, 0).
With five, Pirate 1 needs 3 votes. He pays one coin each to Pirates 3 and 5, who would get 0 under the next proposal, and keeps 98. (98, 0, 1, 0, 1)
With 100 coins he gets no votes except his own and is rejected. 51 or 20 coins are far less than what he can secure.
Because you think "split it fairly" or "give to the majority."
The cases on this site are fictional puzzles created for entertainment. Any resemblance to real people, organizations or events is coincidental.
© Unsolved Files