Welcome, %1$s. Please login or register.

December 14, 2017, 06:15:11 AM
: 1
: Five Pirates  ( 3666 )
« : August 28, 2007, 11:17:47 PM From Rajesh»



Five Pirates


five pirates have 100 gold coins. they have to divide up the loot. in order of seniority (suppose pirate 5 is most senior, pirate 1 is least senior), the most senior pirate proposes a distribution of the loot. they vote and if at least 50% accept the proposal, the loot is divided as proposed. otherwise the most senior pirate is executed, and they start over again with the next senior pirate. what solution does the most senior pirate propose? assume they are very intelligent and extremely greedy (and that they would prefer not to die).

 
Liked It? Share it!

              


« #1 : August 28, 2007, 11:40:54 PM From spazinvader»

I think it is already discussed. Let me derive the answer for you.
Let the pirates are ranked as a,b,c,d,e.
If there are 2 pirates, that is a & b, then
a will take all the gold as he votes for himself and get 50% votes.

If there are 3 pirates, that is a,b,c then a will bribe c with 1 gold.c will probably accept it and vote him.Because if a is dead and b divides the share then c won't get any.So in this case, a will have 99 gold coins.

If there are 4 pirates,that is a,b,c,d then a will bribe c with the same 1 gold because of the above reason.So in this case too,a will have 99 coins.

If there are 5 pirates, then a will bribe c and e as they wont get any shares if a is dead.In this case both will get 1 gold from a.So a will have 98 gold coins.
« #2 : August 29, 2007, 09:49:48 AM From Poonam»

Hey its already discussed here
http://softwareengineersofindia.com/forum/index.php?topic=14.0
: 1
« previous next »

 

Best RatedList All>>



Latest
Random



SMF 2.0.10 | SMF © 2015, Simple Machines | Contact Webmaster | OnlineFunDb.com © 2009/10 | Legal Disclaimer