Towers of Hanoi

Introduction to Hanoi Tower ============ In this course I was asked to investigate the Hanoi Tower. The Hanoi Tower has 3, 4, 5, or other number of disks (1, 2, 3 etc.) from one of the three poles to the other (A, B, C). Only one disk can be moved at a time. Also, large disks can not be placed on small disks. Also, you need to complete this task with as few movements as possible.

Except for Edward Lucas' explanation on the Hanoi Tower issue, which is an excerpt from the original paper. In particular, recent research, not to mention, can benefit from several literature on computational history, such as Knuth and Pardo (1977) and Wexelblatt (1981) on programming languages, or Mahoney (1997) on computational theory. . In the French version 2nd edition, many mistakes that reviewers pointed out during the English translation were fixed. However, since this book still contains many inaccurate content, careful editing can prevent these inaccuracies. These are mainly due to the use of second-hand resources not double-checked. For example, Liber Abaci was first published with 1202 instead of 1228 (page 290), ENIAC is not a simulation (!).

Now I will explain the Hanoi Tower's algorithm for those who have never heard of it. At Hanoi Tower, there are various specifications of tower and disc. Each tower has a different size disc. You need to move all disks from one tower to another, from largest to smallest. Small disks can only be placed on large disks. Below is a simple animation to explain the process. After repeating several times, I decided to cut off the task from the bottom. If the task does not change the task's position to change the specific order, all developers are familiar with it and agree to the estimate. With this process, a number of tasks began to disappear from the task set. The meeting started early. Soon, we removed the work we agreed and left the work we did not agree with.

In mathematics, Hanoi Tower is a place to use Mason prime. This is a mathematical problem consisting of three rods and disks of various sizes, you can slide to any rod. The puzzle begins in ascending order of disk size of the first pole, and there are the largest and smallest puzzles. The chart below shows Hanoi Tower. Looking at all aspects of Mersenne Primes, functionality, and some applications, I think there are still many unresolved theories on Mersenne's prime numbers. These prime numbers can also be used to further study the digital system and to understand more digital sets such as Fermat prime number, Wieferich prime number, Wagstaff prime number, Solinas prime number.