3 pirates have to decide how to divide their loot of 100 gold coins. The rules are as follow:

* The most senior pirate gets to propose a way to divide the loot.

* Each pirate, including the most senior pirate himself gets to vote.

* If the majority agrees with the proposal, the loot will be divided as suggested.

* In the case of a tie, the proposal will be accepted.

* If the majority disagrees, the most senior pirate will be killed. The next most senior pirate gets to suggest. The process continues.

Now, you’re the most senior pirate out of the three. How are you going to divide the coins so that you get the biggest share possible?

• Im the senior pirate(3)..
  so I need one more pirate to vote fr me
  this has to be solved from back ward.. 1) if only 1 pirate.. he will take all
  2)if there are 2 pirates pirate 2 takes 100 and he gives 0 to other.
  3)if there are 3 pirate 3 gives 1 fr pirate1 and takes 99..cuz 1 is better than 0 fr pirate1 so he ll accept it.
  hence the answer s 99 0 1
  
  
  
  
  
• 10 years agoHelpfull: Yes(17) No(3)
• As per rules if majority disagrees the most senior pirate will be killed.
  
  So, the two junior pirate will vote against the senior pirate and kill him as per rules
  
  and then the remaining 100 gold coins will be shared as 50 and 50 ....
  
  so the answer is 50 50 0
• 10 years agoHelpfull: Yes(4) No(3)
• Pirates at seniority level in descending order(p1>p2>p1)
  I am p1.
  p1 needs either p2 or p3 to vote so that his proposal to be agreed.
  Case1: If p1 proposal is disgreed.
  p2 will make a proposal so that he wants 100 and he votes himself and he wins (tie of votes)
  p3 will get 0 coins
  
  Case 2:
  p1 thinks ahead and he takes 99 and gives 1 for p3.
  So p1=99,p2=0,p3=1.
  Biggest share possible is 99.
  
• 10 years agoHelpfull: Yes(4) No(0)
• 40 30 30 if senior person takes 40 and he share the remaining as 30 and 30 both will accept it and they can share.
• 10 years agoHelpfull: Yes(3) No(5)
• Ans : 99
  Let pirates be p1,p2 and p3 of descending age order
  If p1 decides to take 100 share then p2 and p3 would go against them.So p1 would be killed due to 1: 2 vote ratio . Then p2 would go on to become the seniormost and take 100 gold to himself because of the rule that allows tie resulting in proposal acceptal.That would result in p2 getting 0 gold.
  So that means if p2 and p3 become alone p2 would get all the gold.
  So if i(p1) give 1 gold to p3 he would be satisfied and would go on to vote for me because 1 gold is better than no gold.
  So the share would be in 99 : 0 : 1 order!
• 9 years agoHelpfull: Yes(2) No(0)
• I will divide it by 50,49,1
• 10 years agoHelpfull: Yes(1) No(3)
• The first step is to decide what is our objective. Since we are one of the pirates and have a vote, our goal is to convince two other pirates that our sharing is valid.
  
  Accordingly, it seems obvious that as long as we give money to two of the pirates to get their votes will be enough to save our head. However, we need to decide how much to give them.
  
  We can divide them in two groups:
  P1 --> two pirates to whom you offer money first
  P2 --> two pirates to whom you offer money if P1 rejects
  
  If P1 accepts --> P1 receives money, P2 receives nothing
  If P1 rejects & P2 accepts --> P1 receives nothing, P2 receives money
  If P1 & P2 rejects --> you're death
  
  In other words, if the two first pirates don't accept the offer you give them, they risk to lose everything if the other two pirates get it. For this reason, since they are greedy you can offer one coin to each of the pirates from group P1. If they reject, their most likely option is to get 0 because P2 accepted. Since they are greedy, they prefer to get 1 coin than 0.
  
  In conclusion:
  You get 98 coins, and two pirates get one coin each.
  
• 10 years agoHelpfull: Yes(0) No(2)
• As given the voting is done by the senior pirate also so to get the majority of three we should convince only one pirate, So we should convince any one pirate by giving him more gold coins than other.
• 10 years agoHelpfull: Yes(0) No(1)