Towers of Hanoi Puzzle
Towers of Hanoi (aka Tower of Hanoi) is a mathematical puzzle invented by a French Mathematician Edouard Lucas in 1983. Initially the game has few discs arranged in the increasing order of size in one of the tower like shown above. The number of discs can vary, but there are only three towers. The goal is to transfer the discs from one tower another tower. However you can move only one disk at a time and you can never place a bigger disc over a smaller disk. It is also understood that you can only take the top most disc from any given tower.
Solution
Before trying to understand the general algorithm used to solve Tower of Hanoi, it is always better to learn to solve Tower of Honoi with three or four discs. Once you master solving the puzzle with three or four discs, you can solve the same puzzle with more discs with the following algorithm.
1)Move the top N-1 disks from Source to Auxiliary tower,
2)Move the Nth disk from Source to Destination tower,
3)Move the N-1 disks from Auxiliary tower to Destination tower.
Transfering the top N-1 disks from Source to Auxiliary tower can again be thought as a fresh problem and can be solve in the same manner. So once you master solving Tower of Hanoi with three disks, you can solve it with any number of disks with the above algorithm.