I had posted a puzzle earlier (Puzzle #3) – https://alokgoyal1971.com/2013/02/10/puzzle-3-five-pirates-and-looted-gold-coins/. This puzzle is an extension of the same puzzle, and also attributed to the same family – this time to Alok Mittal from his Mathematical Circles group.
Original puzzles goes as follows:
Five pirates have looted 100 gold coins. Now they have to divide their loot.These pirates are very greedy and cruel,so they want to maximize their profit and they don’t shy to kill their pirates. For distribution they decide that senior most pirate will proposes a distribution of the loot. All the pirates will vote, and if at least half accept the proposal, the loot is divided as proposed. If not, the most senior pirate will be killed, and they start over again with the next senior pirate. What solution does the most senior pirate propose? So that he can get the maximum profit, and of course live to have it!
Variation of this puzzle:
Assume there are 6 pirates now – A, B, C, D, E and F. A is the senior most, F being the most junior in that order. They have only 1 gold coin. Like before, for a proposal to be accepted, at least half need to vote in favor. What should be A’s strategy?
To avoid any doubt about the pirates’ behavior, following defines the order of prioritization for them:
– Desire to live
– Greed (have as many gold coins as possible)
– Cruelty – all else being equal, they would rather see someone else being killed?
What is A’s strategy?
As always, please send your answers directly to me at firstname.lastname@example.org. If you like the puzzle, please share it with others. If you have interesting puzzles to share, please send them to me at my e-mail given above.