The story goes that Captain Jones and his exhausted special forces were blocked everywhere after entering the jungle because one of the eight of them had a spy. They will let God judge who is innocent and who is a spy.

The method is: clockwise, Jones, Fisher, Gary, Ian, Carl, Lee, Matthew, and then back to Jones to form a circle. Roll two dice, look at the total, count from Jones, whoever counts will leave, and then count down … until the last person is left, that person must be innocent. In the dice, an innocent person is identified in turn, and the last one is a spy.

My second monk was puzzled and decided to solve it by experiment.

I'll number these eight special forces first. Jones is 1 and Fisher is 2. ...

Then prepare 1~8 playing cards, line up in a circle and start to set up points.

If the number of points is 2, then 2, 4, 6, 8, 3, 7, 5 are left. Jones is innocent.

If the number of points is 3, leave 3,6, 1, 5,2,8,4, and leave Li.

If the number of points is 4, leave 4, 8, 5, 2, 1, 3, 7 and leave Carl.

If the number of points is 5, leave 5, 2, 8, 7, 1, 4, 6, and leave Gary.

If the number of points is 6, leave 6, 4, 3, 5, 8, 7, 2, and leave Jones.

If the number of points is 7, leave 7, 6, 8, 2, 5, 1, 3 and leave Harvey.

If the number of points is 8, leave 8, 1, 3, 6, 5, 2, 7, and leave Harvey.

If the number of points is 9, leave 1, 3, 6, 4, 5, 2, 7, and leave Matthew.

If the number of points is 10, leave 2,5, 1, 8,4,6,3, and leave Li.

If the number of points is 1 1, leave 3, 7, 5, 6, 2, 8 and 1, leave Harvey.

If the number of points is 12, leave 4, 1, 8, 3, 2, 7, 6, and leave Ian.

It can be seen that in any case, it is impossible to keep Fisher. It can be seen that Jones knew Fisher was a spy for a long time, but in order to convince everyone, he played this "death game".

I remember there was a problem in primary school. Xiaohong has 10 storybooks and Xiaoming has 8 storybooks. How many story books should Xiaohong give Xiaoming? How many story books should they have? I wrote without thinking: 2 copies. But when I checked, I found that there was a mistake. I will solve it through experiments. I put 10 coins on the left to represent Xiaohong, and 8 coins on the right to represent Xiaoming. I found that only by distributing their differences evenly and then giving them, can they be equal. My conclusion: the difference ÷ 2 = the number that has been given to the other party.

Facing more complicated practical problems, experiment is a good method.