The Tower of Hanoi is a mathematical puzzle.
It consists of three rods and a number of disks of different sizes.
The puzzle starts with the disks in a neat stack in ascending 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 disk to another rod,
obeying the following simple rules:
Only one disk must 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.
Leave your suggestions or comments at firstname.lastname@example.org
if you find any issues, write us an email. We will resolve the problem as soon as possible.
Contact us at: