   
Five Brilliant Pirates
Five Brilliant Pirates
This is a fairly common puzzle and many of you might know the solution and explanation. This problem had also featured in The Times of India recently for promotion of ET.People taking up to solve it might refrain from seeing the solution and comments before trying to reach a solution.
Click on the above link to view the resource 

Quantasauras
Five Brilliant Pirates
I dunno! I m drawing blanks here.
Can you please post the solution! 

Available on PM
Originally Posted by bell_the_cat I dunno! I m drawing blanks here.
Can you please post the solution! have solved it earlier HINT: try to move from youngest to oldest pirate, it will help


know a little about a lot
Five Brilliant Pirates
i think he will take 96 coins
96 0 0 2 2

The Following User Says Thank You to sreekanth_1212 For This Useful Post:

All game theory puzzles
should be taken from smaller to bigger, unless it doesn't work.
The pirates puzzle, as we know all pirates are very smart, then think when there are only 2 pirates, then 3 and so on.
The children puzzle, where they pick a certain number of stones, first not able to pick loses and so on and so forth..
ALl of them you have to work from smaller to bigger


Five Brilliant Pirates
anyone plz give me the solution..


Available on PM
Originally Posted by phalgun anyone plz give me the solution.. let people try otherwise will post the solution by tomorrow


know a little about a lot
Five Brilliant Pirates
Originally Posted by sreekanth_1212 i think he will take 96 coins
96 0 0 2 2 sorry this is wrong
97 0 1 0 2


Available on PM
Originally Posted by sreekanth_1212 sorry this is wrong
97 0 1 0 2 just a bit more close..think a bit more


Intern
Hi all
i think ans z
98 0 1 0 1
iz'nt it?
BLUNDERER 

know a little about a lot
Five Brilliant Pirates
Originally Posted by sumit2goody Originally Posted by sreekanth_1212 sorry this is wrong
97 0 1 0 2 just a bit more close..think a bit more I THINK THIS IS RIGHT BCOZ LAST PERSON WONT ACCEPT THE DEAL IF HE HAS GIVEN ONE COIN


Intern
i hv tried 2 solve the problem ds way...................
lets assume the oldest pirate is named E than next oldest D n nxt C n so on.
so nw the oldest pirate is E n youngest pirtate is A
in case there are only 2 (A,B) pirates
so what ever proposal B will make will b accepted.(even if A says no than TIE GOES IN FAVOUR OF OLDEST).
so his proposal shd b
B100 A0
when B knows he can get all 100 y wud he agree on ny proposal made by C.
so C wud try 2 gt another vote from A
C99 B0 A1
n A wud agree on it bcz he knows in case B makes a proposal he wud nt gt nythng.
nw C can gt 99 so he wud nvr caste his in favour of D . here D wud make a proposal
D99 C0 B1 A0
here B wud agree n there will b a tie bt this goes in favour of D.
nw its my turn 2 make a proposal......................i.e.
E98 D0 C1 B0 A1
here C n A wud agree on it .
i think this is the solution.
PLZ correct me if i m wrong
BLUNDERER 

Quantasauras
Five Brilliant Pirates
Originally Posted by blunderer i hv tried 2 solve the problem ds way...................
lets assume the oldest pirate is named E than next oldest D n nxt C n so on.
so nw the oldest pirate is E n youngest pirtate is A
in case there are only 2 (A,B) pirates
so what ever proposal B will make will b accepted.(even if A says no than TIE GOES IN FAVOUR OF OLDEST).
so his proposal shd b
B100 A0
when B knows he can get all 100 y wud he agree on ny proposal made by C.
so C wud try 2 gt another vote from A
C99 B0 A1
n A wud agree on it bcz he knows in case B makes a proposal he wud nt gt nythng.
nw C can gt 99 so he wud nvr caste his in favour of D . here D wud make a proposal
D99 C0 B1 A0
here B wud agree n there will b a tie bt this goes in favour of D.
nw its my turn 2 make a proposal......................i.e.
E98 D0 C1 B0 A1
here C n A wud agree on it .
i think this is the solution.
PLZ correct me if i m wrong 

Available on PM
Originally Posted by blunderer i hv tried 2 solve the problem ds way...................
lets assume the oldest pirate is named E than next oldest D n nxt C n so on.
so nw the oldest pirate is E n youngest pirtate is A
in case there are only 2 (A,B) pirates
so what ever proposal B will make will b accepted.(even if A says no than TIE GOES IN FAVOUR OF OLDEST).
so his proposal shd b
B100 A0
when B knows he can get all 100 y wud he agree on ny proposal made by C.
so C wud try 2 gt another vote from A
C99 B0 A1
n A wud agree on it bcz he knows in case B makes a proposal he wud nt gt nythng.
nw C can gt 99 so he wud nvr caste his in favour of D . here D wud make a proposal
D99 C0 B1 A0
here B wud agree n there will b a tie bt this goes in favour of D.
nw its my turn 2 make a proposal......................i.e.
E98 D0 C1 B0 A1
here C n A wud agree on it .
i think this is the solution.
PLZ correct me if i m wrong correct solution i believe


Available on PM
Originally Posted by sreekanth_1212 I THINK THIS IS RIGHT BCOZ LAST PERSON WONT ACCEPT THE DEAL IF HE HAS GIVEN ONE COIN post detailed solution..i believe sol given by blunderer is correct


know a little about a lot
Five Brilliant Pirates
Originally Posted by sumit2goody Originally Posted by sreekanth_1212 I THINK THIS IS RIGHT BCOZ LAST PERSON WONT ACCEPT THE DEAL IF HE HAS GIVEN ONE COIN post detailed solution..i believe sol given by blunderer is correct i done the problem by considering the oldest pirate has no chance to vote 

Five Brilliant Pirates
OK Time for solution.
The solution goes like this:
The oldest pirate should suggest the following number of coins to be received by the pirates (from oldest to youngest):
98, 0, 1, 0, 1.
The pirates receiving just 1 coin each will still vote for the oldest, preventing the second oldest from suggesting:
X (killed), 99, 0, 1, 0
This case would be accepted, as the second yongest pirate should vote for, preventing the third oldest from suggesting:
X, X, 99, 0, 1
This case would also be accepted as the youngest should vote for, otherwise it all it all goes down to:
X, X, X, 100, 0.


Five Brilliant Pirates
@ Blunderer: Good job, your ans. is right.


Five Brilliant Pirates
@sreekanth_1212: The oldest pirate has the chance (and he would always vote for himself.)


Five Brilliant Pirates
Probable solution
The oldest will provide a strategy for dividing the 100 coins in the ratio of
100:0:0 where 100 coins can be given to any one of the younger pirates.
the pirate who will be recieving 100 coins will agree . . .while the one recieving 0 coins will not agree.
it will be a tie and the amount will go to the oldest pirate .. . considering that

Similar Threads 
By mehtaayush in forum User Resources
Replies: 3
Last Post: 18Sep09, 12:25 AM Posting Permissions  You may not post new threads
 You may not post replies
 You may not post attachments
 You may not edit your posts
Forum Rules     
 
Bookmarks