Here is a fun puzzle to solve.




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.



    The puzzle was invented by the French mathematician Édouard Lucas in 1883. There is a legend about a Vietnamese or Indian temple which contains a large room with three time-worn posts in it surrounded by 64 golden disks. The priests of Brahma, acting out the command of an ancient prophecy, have been moving these disks, in accordance with the rules of the puzzle, since that time. The puzzle is therefore also known as the Tower of Brahma puzzle. According to the legend, when the last move of the puzzle is completed, the world will end. It is not clear whether Lucas invented this legend or was inspired by it. The Tower of Hanoi is a problem often used to teach intermediate programming, in particular, as an example of a simple recursive algorithm. This algorithm can in turn be applied to provide the user with a solution to the puzzle because the tower "solves itself."

More about it @Wiki