Shulou(Shulou.com)05/31 Report--

This article mainly introduces "how to solve the Hanoi Tower problem". In daily operation, I believe many people have doubts about how to solve the Hanoi Tower problem. The editor has consulted all kinds of materials and sorted out simple and easy operation methods. I hope it will help you answer the doubts about "how to solve the Hanoi Tower problem"! Next, please follow the small series to learn together!

Hanoi Tower Problem--Recursive Method

Suppose there are three cylindrical towers named x, y and z respectively, and n radii of different sizes are inserted into the tower x, numbered 1, 2,···, n from the top to the bottom, as shown in the figure. Now it is required to move the n disks on the X axis onto the tower Z and stack them in the original order. The disks must follow the following rules when moving:

1. You can only move one disk at a time.

2. The disk can be inserted into any of the X, Y, Z towers.

3. Never press a larger disk onto a smaller disk at any time.

How do you move the disk? This is where our powerful recursion idea comes in. Let a variable n be used to call any disk. When n=1, just move the No. 1 disk from X to Z. When n>1, you need to use Y as the middle tower. If you can try to move the n-1 disks pressed on the No. n disk from X to Y, then move the No. n disk to Z, and finally move the n-1 disks on Y to Z! And the two global operations on the n-1 disks in the whole process can be regarded as a complete Hanoi problem.

The C function thus solved is as follows:

void move(char a,int n,char c)

{

//The operation of this function is: Move the disk numbered n from tower a to tower c.

//Omit a few words here...

}

void Hanoi(int n,char a,char b,char c)

//Move the n disks on tower a to c, b as the middle tower

{

if(n==1)move(x,1,z);

else

{

Hanoi(n-1,x,z,y);

move(x,n,z);

Hanoi(n-1,y,x,z);

}

}

It can be seen that the whole program does not need to use the storage space actually used to store Hanoi Tower (because the algorithm has nothing to do with objectively existing data), so the move function can be written as: printf("Move tray %i from tower %c to tower %c",n,a,c);

At this point, the study of "how to solve the Hanoi Tower problem" is over, hoping to solve everyone's doubts. Theory and practice can better match to help everyone learn, go and try it! If you want to continue learning more relevant knowledge, please continue to pay attention to the website, Xiaobian will continue to strive to bring more practical articles for everyone!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.