The Tower of Hanoi is a mathematical puzzle. It consists of three poles and a number of disks of different sizes. The puzzle starts with the disk in a neat stack in ascending order of size in one pole, thus making a conical shape. The objective of the puzzle is to move all the disks from one pole (source pole) to another pole (destination pole) with the help of the third pole (auxiliary pole). Rules The mission is to move all the disks to some another pole without violating the sequence of arrangement. A few rules to be followed for Tower of Hanoi are : Only top disk can be moved among the poles at any given time. No large disk can place over a small disk.