The Hanoi's Tower (also known as The Towers of Hanoi ) is a mathematical game or puzzle. It consists of three rods or tower, and a number of disks of different sizes which can moves onto any rod. The puzzle starts with the disks neatly stacked in order of size on one rod, the smallest at the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack to another rod, obeying the following rules:
Only one disk may be moved at a time.
Each move consists of taking the upper disk from one of the rods and sliding it onto another rod,
on top of the other disks that may already be present on that rod.
No disk may be placed on top of a smaller disk.
In Application there are 6 levels. As levels of game increases, the number of disks increases by one. There is time limit at each level. At first level there are t3 disks on Tower-1.
To move disk from one tower to another tower, first select that disk then select that tower which you want to move that disk. If that move is not valid constrain of puzzle then application will decline that move. If that move is valid constrain then and only then user can move the disk. User have to finish the level of game in time, otherwise he will lose the game. After correcting current level, user will automatically move to next level. After completing each levels of game, user will win the game.