What exactly is the Tower of Hanoi, here is the explanation from Tower of Hanoi:
The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. 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 stack to another rod, obeying the following simple rules:
- Only one disk can be moved at a time.
- Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.
- No disk may be placed on top of a smaller disk.
An animated solution shows it:
[caption id=”” align=”alignnone” width=”300”] Tower of Hanoi animated solution[/caption]
We can solve the puzzle by programming. In fact, the puzzle of the Tower of Hanoi is usually used to illustrate recursion in programming. Below is a solution from yusufshakeel:
/* tower of hanoi