Tower of Hanoi problem? What is the solution to the Tower of Hanoi problem

As a summary, if I can move the first n-2 plates to the C-pillar, I must first move the N-2 plates to the B-pillar, then move the N-1 large plate to the C-pillar, and then move the N-2 plates of the B-pillar to the C-pillar, so that the N-1 plate can be moved to the C-pillar, which is the same as moving the last plate, and there is actually no difference between the B-pillar and the C-pillar.

Instead of moving N-1 plates from A to C at once, it is necessary to use B and C to reverse back and forth, and finally move N-1 plates to C. It's about moving ideas, not one-time steps.

Tower of Hanoi problem? The solution is achieved with the help of a recursive method.

1. That is, no matter how many plates there are in front of us, we need to move all the n-1 plates on A except for the largest plate to B with the help of C.

2. Then move the largest plate on column A to column C (A->C), at this time, there is no need to think about the movement of the most important plate, that is, the remaining N-1 plates, how to move them from B to C.

3. The pillar we need to use becomes A, because there are no plates on A, and the problem becomes that Pillar B moves N-1 plates to Pillar C with the help of Pillar A.

The planning ability determines the order in which the disks are moved.

One of the main points of view regarding the solution of the Tower of Hanoi problem is that the task of completing the Tower of Hanoi requires pre-planning and retrospective planning activities on the order of movement of the disks.

When the problem is presented, most participants will pre-plan the order of the disc movements according to the set target state before starting the first step of moving. to determine the order in which the disks move, but the role of this planning ability may be affected by the difficulty of the problem.

The Tower of Hanoi (also known as the Tower of Hanoi) is an old legend in India. Brama, the god of the opening of the world, left three diamond rods in a temple.

The first one was covered with 64 round pieces of gold, the largest one at the bottom, and the other ones were smaller than the other, and they were stacked one after another, and the monks of the temple tirelessly moved them from one rod to the other one by one, stipulating that one rod in the middle could be used as help, but only one at a time, and the large one could not be placed on top of the small one.

Faced with the huge number (number of times the disc was moved) 18446744073709551615 (2 64-1), it seems that it is impossible for the monks to complete the movement of the gold disc even after exhausting their entire lives.

Related information. The French mathematician Edward Lucas once wrote an ancient Indian legend that in the temple of Benares (in northern India), the center of the world, three jeweled pins were stuck in a brass plate.

When Brahma, the presiding god of Hinduism, created the world, he threaded 64 pieces of gold from the bottom to the bottom on one of the needles, which is called the Tower of Hanoi. Day and night, there is always a monk who moves the gold pieces according to the following rule: move one piece at a time, no matter which needle is on, and the small piece must be on top of the large piece.

The monks prophesied that when all the gold pieces were moved from the needle worn by Brahma to the other, the world would be wiped out with a thunderclap, and the pagodas, temples, and living beings would all die together.

Rules of the game:1. Only one person can move the plate at a time, and only one plate is allowed to move the position of the plate at a time;

2. All members of each team must move the plates in turn;

3. In any movement, the smaller plate cannot be placed under the larger plate;

4. After the official start, except for the player who moves the plate, the other team members must stand outside the distance specified by the trainer;

5. After the official start, all members of the team are not allowed to speak, nor are they allowed to make any suggestive words. Someone speaks, it will return to its original state, and then it will begin.

The goal of the game. 1. Let the leader lead the team out of the predicament faster and better;

2. Promote more effective communication between the team;

3. Promote the reasonable division of labor and cooperation of the team, and the best coordination and cooperation;

4. Awareness of how to effectively improve the performance of the team;

5. Cultivate the skills of team members' work handover.