Python Tower of Hanoi

The Tower of Hanoi is a puzzle that 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.
• No disk may be placed on top of a smaller disk.

With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2ⁿ-1, where n is the number of disks.

Write code that will perform the moves necessary to move one stack to another stack obeying the rules above. Provide for a random number of rings. The number should be >= 3 and <= 9.

Display each move to each pole. You can represent the ring sizes by a number that is either stored in a two dimensional array or in a dictionary.

Figure: see image.