FORUM  
 
 
 
 
     Recent Posts  |   Recent Topics  |   FAQ  |   Search  |   Forum Actions  |   Quick Links Prizes
 
Notices
 
Page 1 of 2 1 2 LastLast
Results 1 to 20 of 26
  1. #1
    Intern
    Join Date
    Aug 2009
    Posts
    30
    Thanks
    0
    Thanked 1 Time in 1 Post

    Post 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

  2. #2
    Quant-a-sauras bell_the_cat's Avatar
    Join Date
    Apr 2009
    Locn
    Mumbai India
    Posts
    1,775
    Thanks
    1
    Thanked 13 Times
    in 13 Posts

    Post Five Brilliant Pirates

    I dunno! I m drawing blanks here.
    Can you please post the solution!
    Merry Christmas and a Happy New Year!

  3. #3
    Available on PM sumit2goody's Avatar
    Join Date
    Aug 2008
    Posts
    8,033
    Thanks
    856
    Thanked 917 Times
    in 558 Posts

    Default

    Quote Originally Posted by bell_the_cat View Post
    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
    B-School Joiners,Please Click
    Moi Blog: (Taken a break) Dissociation
    Quant Thread RC ThreadVerbal Thread Leisure
    PGP Batch IIM Indore 2012

  4. #4
    know a little about a lot sreekanth_1212's Avatar
    Join Date
    May 2009
    Posts
    733
    Thanks
    13
    Thanked 5 Times
    in 4 Posts

    Post Five Brilliant Pirates

    i think he will take 96 coins
    96 0 0 2 2
    Owner and CEO Of Create Online Life - Live On Blogs

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

    murthy123 (13-Oct-09)

  6. #5
    Virtuoso
    Join Date
    Jul 2008
    Posts
    2,703
    Thanks
    162
    Thanked 305 Times
    in 203 Posts

    Default

    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

  7. #6
    Enthusiast
    Join Date
    Sep 2009
    Locn
    Bengaluru / Bangalore India
    Posts
    10
    Thanks
    0
    Thanked 0 Times
    in 0 Posts

    Post Five Brilliant Pirates

    anyone plz give me the solution..

  8. #7
    Available on PM sumit2goody's Avatar
    Join Date
    Aug 2008
    Posts
    8,033
    Thanks
    856
    Thanked 917 Times
    in 558 Posts

    Default

    Quote Originally Posted by phalgun View Post
    anyone plz give me the solution..
    let people try otherwise will post the solution by tomorrow
    B-School Joiners,Please Click
    Moi Blog: (Taken a break) Dissociation
    Quant Thread RC ThreadVerbal Thread Leisure
    PGP Batch IIM Indore 2012

  9. #8
    know a little about a lot sreekanth_1212's Avatar
    Join Date
    May 2009
    Posts
    733
    Thanks
    13
    Thanked 5 Times
    in 4 Posts

    Post Five Brilliant Pirates

    Quote Originally Posted by sreekanth_1212 View Post
    i think he will take 96 coins
    96 0 0 2 2
    sorry this is wrong
    97 0 1 0 2
    Owner and CEO Of Create Online Life - Live On Blogs

  10. #9
    Available on PM sumit2goody's Avatar
    Join Date
    Aug 2008
    Posts
    8,033
    Thanks
    856
    Thanked 917 Times
    in 558 Posts

    Default

    Quote Originally Posted by sreekanth_1212 View Post
    sorry this is wrong
    97 0 1 0 2
    just a bit more close..think a bit more
    B-School Joiners,Please Click
    Moi Blog: (Taken a break) Dissociation
    Quant Thread RC ThreadVerbal Thread Leisure
    PGP Batch IIM Indore 2012

  11. #10
    Intern blunderer's Avatar
    Join Date
    Aug 2009
    Posts
    36
    Thanks
    3
    Thanked 7 Times
    in 2 Posts

    Default

    Hi all
    i think ans z
    98 0 1 0 1

    iz'nt it?
    BLUNDERER

  12. #11
    know a little about a lot sreekanth_1212's Avatar
    Join Date
    May 2009
    Posts
    733
    Thanks
    13
    Thanked 5 Times
    in 4 Posts

    Post Five Brilliant Pirates

    Quote Originally Posted by sumit2goody View Post
    Quote Originally Posted by sreekanth_1212 View Post
    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
    Owner and CEO Of Create Online Life - Live On Blogs

  13. #12
    Intern blunderer's Avatar
    Join Date
    Aug 2009
    Posts
    36
    Thanks
    3
    Thanked 7 Times
    in 2 Posts

    Default

    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

  14. #13
    Quant-a-sauras bell_the_cat's Avatar
    Join Date
    Apr 2009
    Locn
    Mumbai India
    Posts
    1,775
    Thanks
    1
    Thanked 13 Times
    in 13 Posts

    Post Five Brilliant Pirates

    Quote Originally Posted by blunderer View Post
    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
    Merry Christmas and a Happy New Year!

  15. #14
    Available on PM sumit2goody's Avatar
    Join Date
    Aug 2008
    Posts
    8,033
    Thanks
    856
    Thanked 917 Times
    in 558 Posts

    Default

    Quote Originally Posted by blunderer View Post
    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
    B-School Joiners,Please Click
    Moi Blog: (Taken a break) Dissociation
    Quant Thread RC ThreadVerbal Thread Leisure
    PGP Batch IIM Indore 2012

  16. #15
    Available on PM sumit2goody's Avatar
    Join Date
    Aug 2008
    Posts
    8,033
    Thanks
    856
    Thanked 917 Times
    in 558 Posts

    Default

    Quote Originally Posted by sreekanth_1212 View Post
    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
    B-School Joiners,Please Click
    Moi Blog: (Taken a break) Dissociation
    Quant Thread RC ThreadVerbal Thread Leisure
    PGP Batch IIM Indore 2012

  17. #16
    know a little about a lot sreekanth_1212's Avatar
    Join Date
    May 2009
    Posts
    733
    Thanks
    13
    Thanked 5 Times
    in 4 Posts

    Post Five Brilliant Pirates

    Quote Originally Posted by sumit2goody View Post
    Quote Originally Posted by sreekanth_1212 View Post
    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
    Owner and CEO Of Create Online Life - Live On Blogs

  18. #17
    Intern
    Join Date
    Aug 2009
    Posts
    30
    Thanks
    0
    Thanked 1 Time in 1 Post

    Post 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.

  19. #18
    Intern
    Join Date
    Aug 2009
    Posts
    30
    Thanks
    0
    Thanked 1 Time in 1 Post

    Post Five Brilliant Pirates

    @ Blunderer: Good job, your ans. is right.

  20. #19
    Intern
    Join Date
    Aug 2009
    Posts
    30
    Thanks
    0
    Thanked 1 Time in 1 Post

    Post Five Brilliant Pirates

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

  21. #20
    Neophyte
    Join Date
    Aug 2009
    Locn
    Shimla India
    Posts
    3
    Thanks
    0
    Thanked 0 Times
    in 0 Posts

    Post 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

  1. MBA does not stand for "MOST BRILLIANT ANIMAL"
    By mehtaayush in forum User Resources
    Replies: 3
    Last Post: 18-Sep-09, 12:25 AM

Bookmarks

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
 
 
 
 
 

 
 

 
©2008-2017   Enabilon Learning Private Limited. All rights reserved