Hanoi Tower

Tower of Hanoi is a mathematical puzzle where we have three rods and 8 disks. The objective of the puzzle is to shift all the disks from the leftmost tower to the rightmost tower, obeying the following simple rules:
1) Only one disk can be moved at a time.
2) 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.
3) No disk may be placed on top of a smaller disk.