There are 5 pirates, all of them being equally greedy. They have varied number of years of experience. Say for convenience sake 5, 4, 3, 2 and 1. They find a booty of 1000 gold coins which they want to split amongst themselves. Everyone being greedy, wants the most for themselves. So they device a scheme!
They agree that each one would propose a split starting with the most senior person to the least senior person. If there is no majority, the guy who proposed will be killed and then the next guy gets the chance. So it'll be 5 first then 4 etc. How does the guy with 5 years experience propose to split the coins so that he gets the max and does not get killed?
Link to the Solution
7 comments:
I rmr this was one of the first puzzles we solved in library ? or it must be ayan and pandey with me .. neways ..
given its majority and hence a vote like 1-1 or 2-2 is not a majority, the ans shud be 997 for Pirate 1, 1 for Pirate 3 and 2 to Pirate 4 or 5 ..
thread's explanation:
this is a trick question. 998-1-1 is NOT the answer because these are 5 dumb fucks who hijack ships; they are the 'perfectly intelligent ppl' reqd to arrive at the above solution.
Likely outcome: They end up killing each other. So, last pirate left standing gets the gold.
read as - *not* ....
996 - 0 - 0 - 2 - 2
Clarification:
-> The pirates are think logically and are all very intelligent!
-> While proposing a split, the vote of the pirate who proposes the split would also count!
I dont care who gets the gold...but hey Mani nd thread..u coming in my wedding rite..
The Answer:
One of the pirates is a crack Ninja, who will flip out when the time comes, and will kill the all the pirates combined.
To know
more about Ninja's visit:
http://www.realultimatepower.net/index4.htm- vishal
Post a Comment