Скачать или смотреть The Tower of Hanoi using Python

The Tower of Hanoi is a mathematical 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 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.

In this example the function "TowerOfHanoi" is called recursively, where in each call it moves the top n-1 discs from source rod to aux rod, then it moves the nth disc from source rod to destination rod, then it moves the n-1 discs from aux rod to destination rod. The base case is when n=0, means no disk is there to move.

This problem can be solved in 2^n-1 steps, it means as the number of disk increase the number of steps will increase exponentially.