Tower of Hanoi
Last updated
Last updated
Tower of Hanoi, is a mathematical puzzle which consists of three towers and more than one rings is as depicted ā
These rings are of different sizes and stacked upon in an ascending order, i.e. the smaller one sits over the larger one.
The mission is to move all the disks to some another tower without violating the sequence of arrangement. A few rules to be followed for Tower of Hanoi are ā
Only one disk can be moved among the towers at any given time.
Only the "top" disk can be removed.
No large disk can sit over a small disk.
Tower of Hanoi puzzle with n disks can be solved in minimum 2nā1 steps. This presentation shows that a puzzle with 3 disks has taken 23 - 1 = 7 steps.
To write an algorithm for Tower of Hanoi, first we need to learn how to solve this problem with lesser amount of disks, say 1 or 2. We mark three towers with name, source, destination and aux (only to help moving the disks). If we have only one disk, then it can easily be moved from source to destination peg.
If we have 2 disks ā
First, we move the smaller (top) disk to aux peg.
Then, we move the larger (bottom) disk to destination peg.
And finally, we move the smaller disk from aux to destination peg.
So now, we are in a position to design an algorithm for Tower of Hanoi with more than two disks. We divide the stack of disks in two parts. The largest disk (nth disk) is in one part and all other (n-1) disks are in the second part.
Our ultimate aim is to move disk n from source to destination and then put all other (n-1) disks onto it. We can imagine to apply the same in a recursive way for all given set of disks.
The steps to follow are ā
A recursive algorithm for Tower of Hanoi can be driven as follows ā