Difference between revisions of "TADM2E 2.52"
From Algorithm Wiki
(Recovering wiki) |
(Recovering wiki) |
||
| Line 5: | Line 5: | ||
3+ pirates - The least senior pirate gets it. | 3+ pirates - The least senior pirate gets it. | ||
| − | In general, every 2 + 2^K (k | + | In general, every 2 + 2^K (k >= 1) pirate will survive, while the others will die |
Revision as of 18:23, 11 September 2014
This problem is a famous game-theoretical scenario called the pirate game (http://en.wikipedia.org/wiki/Pirate_game). Assume the senior pirate gets to vote.
Where there is only 1 indivisible dollar: 2 pirates - The senior pirate gets it. 3+ pirates - The least senior pirate gets it.
In general, every 2 + 2^K (k >= 1) pirate will survive, while the others will die
