Your analysis is nice, but the result I think it should be 97, 0, 1,
2, 0, this proposal prevents the oldest being thrown overboard and get
most gold coins.
5 is the oldest, 1 is the youngest pirate.
Pirate 1 2 3 4 5
5. 0 2 1 0 97
4. 0 1 0 99 -
3. 1 0 99 - -
2. 0 100 - - -
1.100
On Thu, Apr 21, 2011 at 7:43 PM, vaibhav shukla <vaibhav200...@gmail.com> wrote:
> lets consider if there were only 1 pirate. obviously he would take it all
> for himself and no one would complain.
>
> if there were 2 pirates, pirate 2 being the most senior, he would just vote
> for himself and that would be 50% of the vote, so he’s obviously going to
> keep all the money for himself.
>
> if there were 3 pirates, pirate 3 has to convince at least one other person
> to join in his plan. s pirate 3 realizes that if his plan is not adopted he
> will be executed and they will be left with 2 pirates. he already knows what
> happens when there are 2 pirates as we just figured out. pirate 2 takes all
> the money himself and gives nothing to pirate 1. so pirate 3 proposes that
> he will take 99 gold coins and give 1 coin to pirate 1. pirate 1 says, well,
> 1 is better than none, and since i know if i don’t vote for pirate 3, i get
> nothing, i should vote for this plan.
>
> now we know what happens when there are 3 pirates. so what happens with 4?
> well pirate 4 has to convince 1 other person to join in his plan. he knows
> if he walks the plank then pirate 3 will get 99 coins and pirate 1 will get
> 1 coin. pirate 4 could propose giving pirate 1 two coins, and surely pirate
> 1 would vote for him, since 2 is better than 1. but as he is greedy ,pirate
> 4 would rather not part with 2 whole coins. he realizes that if he gets
> executed, then pirate 3’s scenario happens and pirate 2 gets the shaft in
> that scenario (he gets zero coins). so pirate 4 proposes that he will give 1
> coin to pirate 2, and pirate 2 seeing that 1 is better than 0 will obviously
> vote for this plan.
>
> a common objection is that pirate 2 is not guaranteed to vote for this plan
> since he might hope for the case when there are only 2 pirates and then he
> gets all the booty. but that is why it is said that the pirates are
> extremely intelligent. pirate 2 realizes that pirate 3 is smart enough to
> make the optimal proposal, so he realizes that there will never be 2 pirates
> left, because 3 doesn’t want to die and we just showed that 3 has a winning
> proposal.
>
> so lets sum up at this point
>
> Pirate 1 2 3 4 5
> 5. ? ? ? ? ?
> 4. 0 1 0 99 -
> 3. 1 0 99 - -
> 2. 0 100 - - -
> 1.100
>
> On Thu, Apr 21, 2011 at 6:13 AM, Shuaib <aries.shu...@gmail.com> wrote:
>>
>> Not necessarily. Whatever the senior pirate proposes will have to be
>> accepted by pirate 4th and 2nd (assuming 5th is senior most) otherwise
>> pirate 1st gets everything. So it is oldest pirate's call. He can I guess
>> take it all.
>>
>> Shuaib
>> http://twitter.com/ShuaibKhan
>> http://www.bytehood.com/
>> On 21-Apr-2011, at 2:51 PM, durgaprasad k <durga...@gmail.com> wrote:
>>
>> @vaibhav : if they dont agree for 1 gold icon they will be thrown out. so
>> they will accept the 1 gold coin to stay on .
>>
>>
>> On Thu, Apr 21, 2011 at 3:10 PM, vaibhav agrawal <agrvaib...@gmail.com>
>> wrote:
>>>
>>> Why the two pirates would agree when they are getting only one coins
>>> each?
>>>
>>> On Thu, Apr 21, 2011 at 3:05 PM, harshit agrawal
>>> <hagrawal.250...@gmail.com> wrote:
>>>>
>>>> thwy will be shared according to
>>>> senior most pirate(5th)=98
>>>> 4th =0
>>>> 3rd =1
>>>> 2nd=0
>>>> 1st =1
>>>>
>>>> On Thu, Apr 21, 2011 at 2:54 PM, Anders Ma <xuejiao...@gmail.com> wrote:
>>>>>
>>>>> the coins will be shared the way the oldest pirate proposes.
>>>>>
>>>>> On Thu, Apr 21, 2011 at 3:51 PM, Lavesh Rawat <lavesh.ra...@gmail.com>
>>>>> wrote:
>>>>> > Pirate Puzzle
>>>>> >
>>>>> > 5 pirates of different ages have a treasure of 100 gold coins.
>>>>> > On their ship, they decide to split the coins using this scheme:
>>>>> > The oldest pirate proposes how to share the coins, and all pirates
>>>>> > remaining
>>>>> > will vote for or against it.
>>>>> > If 50% or more of the pirates vote for it, then the coins will be
>>>>> > shared
>>>>> > that way. Otherwise, the pirate proposing the scheme will be thrown
>>>>> > overboard, and the process is repeated with the pirates that remain.
>>>>> >
>>>>> > Assuming that all 5 pirates are intelligent, rational, greedy, and do
>>>>> > not
>>>>> > wish to die, (and are rather good at math for pirates) what will
>>>>> > happen?
>>>>> >
>>>>> > Update Your Answers at : Click Here
>>>>> > Solution:
>>>>> > Will be updated after 1 day
>>>>> >
>>>>> > --
>>>>> >
>>>>> > "Never explain yourself. Your friends don’t need
>>>>> > it and
>>>>> > your enemies won’t believe it" .
>>>>> >
>>>>> > --
>>>>> > You received this message because you are subscribed to the Google
>>>>> > Groups
>>>>> > "Algorithm Geeks" group.
>>>>> > To post to this group, send email to algogeeks@googlegroups.com.
>>>>> > To unsubscribe from this group, send email to
>>>>> > algogeeks+unsubscr...@googlegroups.com.
>>>>> > For more options, visit this group at
>>>>> > http://groups.google.com/group/algogeeks?hl=en.
>>>>> >
>>>>>
>>>>>
>>>>>
>>>>> --
>>>>> Regards
>>>>> Anders
>>>>>
>>>>> --
>>>>> You received this message because you are subscribed to the Google
>>>>> Groups "Algorithm Geeks" group.
>>>>> To post to this group, send email to algogeeks@googlegroups.com.
>>>>> To unsubscribe from this group, send email to
>>>>> algogeeks+unsubscr...@googlegroups.com.
>>>>> For more options, visit this group at
>>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>>>
>>>>
>>>>
>>>>
>>>> --
>>>>
>>>>
>>>>
>>>>
>>>>
>>>>
>>>>
>>>>
>>>>
>>>> Harshit Agrawal
>>>> MNNIT Allahabad
>>>>
>>>> --
>>>> You received this message because you are subscribed to the Google
>>>> Groups "Algorithm Geeks" group.
>>>> To post to this group, send email to algogeeks@googlegroups.com.
>>>> To unsubscribe from this group, send email to
>>>> algogeeks+unsubscr...@googlegroups.com.
>>>> For more options, visit this group at
>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>
>
>
> --
> best wishes!!
> Vaibhav Shukla
> DU-MCA
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Anders
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
