2. Therefore, when only pirates 3, 4 and 5 are left, no matter what distribution scheme No.3 proposes, No.4 will agree, then No.3 and No.4 will vote in favor, No.5 will be invalid and No.3 will pass. So number three will come up with a plan to take all the jewels by himself. Scheme 3 is 100, and schemes 4 and 5 are 0 respectively.
3. When Pirates No.2, No.3, No.4 and No.5 are left, No.2 will infer No.3' s intention, knowing that No.3 will definitely vote against it in order to realize his plan, so No.2 will win the support of No.4 and No.5, so No.2' s plan is: No.98, No.3, No.4 and No.5 respectively 1. Because No.4 and No.5 have benefited more from this scheme than No.3, they will vote in favor and Plan No.2 will be passed.
4. Not now. 1 The proposal has been put forward. Second, of course, I hope not. 1 Go to hell and put forward your own plan, so No.2 must vote. 1. For No.3, if 1 dies and No.2 scheme can't get a gem of its own, then if 1 scheme gives him 1, he agrees. For No.4, if 1 dies, Scheme No.2 can only get 1. Then if 1 gives him two, he will vote for it. For No.5, he is the same as No.4 in this link. 1 died, and 2 got 1. Then he is the same as No.4. Give him two and he will vote. Then the scheme of 1 is: self 97,2,0,3 1, 4,2,5,0 (or self 97,2,0,3,0,4,5,2).
Simply express the above ideas as follows:
Option 4: No matter what, it will not pass. No.5 will vote against it, and No.4 will die. (Even if No.4 proposes that No.5 can only get 100 gems! Because according to the principle of pirates "3, kill as many as possible", No.4 will also die! )
Scheme No.3: No.3 100, No.4 0, No.5 0; No.3 and No.4 agreed, No.5 objected, and 2: 1 passed.
Scheme No.2: No.2 98, No.3 0, No.4 1, No.51; No.2, No.4 and No.5 agreed, No.3 objected, and 3: 1 passed.
Scheme 1:
Scheme a: No.97 1, No.0 2, 1 No.3, No.2 4, No.0 5; No.65438 +0, No.3, No.4 agreed, No.2, No.5 opposed and passed at 3:2.
Scheme b: No.97 1, No.0 2, 1 No.3, No.0 4, No.2 5; No.65438 +0, No.3, No.5 agreed, No.2, No.4 opposed and passed at 3:2.