Thieves have the following personality characteristics:
In this ideal state, if you are the first pirate, how do you propose a plan to get the most gold coins?
According to the general idea, we definitely think that the first person is the worst, because it seems that as long as the more people die, the more gold coins everyone can get, so the first person may die easily, but in fact, under the above conditions, the first pirate is the most profitable, and he can get 97 gold coins! ! !
Let's take a look at what happens when two pirates are involved, and then we will find that it is actually very understandable.
Obviously, with only two pirates, 1 will definitely die, because first of all, as long as the first pirate dies, the remaining one can get all the gold coins. According to = = insatiable greed = =, No.2 will not vote for it, even if 1
==(0, 100) (that is, 1 won 0 gold coins, and No.2 won 100) ==, but according to the principle of = = ruthless = =, No.2 still won't vote in favor, so there won't be more than half of the votes in favor at this time anyway. At this time 1 said: how can I be so miserable!
When there are three pirates, one becomes two, and when there are two pirates. At this time, No.2 knew. If 1 is killed, there is no doubt that he has no way out. According to the principle of = = fear of death = =, he will save himself anyway. In other words, at this time, he will agree with the meaning of 1 anyway, so the smart 1 will be happy when they know their ideas, because
When there are four pirates, 1 understands that No.2 can't please at this time. Because he died, No.2 will definitely get all the 100 gold coins, so he won't invite him at all, so he gave him 0 gold coins. At this time, besides his own ticket, he still lacks two tickets, so please pick them up on the 3 rd and 4 th. No.3 and No.4 are quite easy to please, because 1 is dead. They can only get air (the result of three pirates is (100,0,0)), so just give him a gold coin. 1 No.3 and No.4 gold coins can't be given, of course, because the pirates are = = heartless = = = [If you die or not, I will die] = =.
Similarly, the current first place needs two votes to ensure survival. First of all, No.2 doesn't consider giving gold coins. No matter how much you give, you are against it. No matter how much, No.3 just gave a gold coin, and then there was one vote left. Just give = = 4 or 5 = = one of them two gold coins, not the other. However, it should be noted here that there are differences at this time, which will be used in the later generalization reasoning.
Here, the problem that we five pirates share gold coins has been solved perfectly. One Pirate, which seems to be the worst, has gained the most profits, which makes people shine. Unfortunately, not all people are completely rational, sometimes even stupid, but this is perhaps the most fascinating and frightening place in society.
The story of five pirates is over, and now there are six pirates.
You can continue to analyze the current situation according to the previous ideas. 1 asks for three tickets, but can't get one ticket on the 2nd, and gives one ticket on the 3rd, and on the 4th, 5th and 6th. This is a little unknown. Let me explain the final result first:
Why? From the above reasoning, we can find that we have never used the "5" principle. = = Suspicious = = ",but now we have used it, because there are two ways to divide when five pirates are involved. There may be two gold coins on the 4 th and 5 th, and there may be zero points. They can't guarantee that they will give themselves two or zero when the next person comes up with a plan after this person dies. Now just 1 will give them a gold coin.
= = (don't trust each other, try to ensure that your own interests don't give hope, others give you greater benefits) = =.
So this division is the most profitable for 1, otherwise he will have to spend two gold coins to buy No.4, and one gold coin to buy one of No.5 and No.6 = = ((96,0, 1, 2,0, 1) or (96,0,/kloc-0).
If we extend the same idea, we will find such a rule:
The answer to all the above situations is m-n/2.
This is a common scheme for pirates to divide gold coins.