Five Pirates and a Hundred Coins
The puzzle
Five pirates, ranked 1 to 5, must divide 100 gold coins. The highest-ranked proposes a split; everybody including the proposer votes. If at least half approve, it stands. Otherwise the proposer is thrown overboard and the next in rank proposes.
Every pirate wants to live first, maximise gold second, and throw others overboard third - and all of them reason perfectly. What does the top pirate propose?
Stuck?
One at a time, smallest first. Open only as many as you need — the whole point of the puzzle is the part you work out yourself.
Hint 1
Work out what happens with two pirates left, then three, then four.
Hint 2
A pirate votes yes if the proposal beats what they would get in the next round.
Show the answer Hide the answer
98 for himself, 0 to the second, 1 to the third, 0 to the fourth and 1 to the fifth - and it passes.
How to get there
With two left, the senior takes everything: his own vote is half of two, so nothing can be rejected. The junior therefore gets zero and dreads reaching that round.
With three, the proposer needs one more vote. The most junior gets nothing in the two-pirate round, so one coin buys him: 99, 0, 1.
With four, the proposer buys the pirate who gets nothing in the three round: 99, 0, 1, 0. With five, he buys the two who get nothing in the four round - the third and the fifth - with one coin each: 98, 0, 1, 0, 1.
The technique worth keeping
Backward induction. Solve the smallest game completely, then use its answer as the "what happens if this fails" for the next size up. Every sequential game with perfect information yields to it.