Tower of Hanoi using recursion in Python #Recursion#Python#TowerOfHanoi.

There are 3 rods/towers. The objective of the puzzle is to move all the disks from the first to the last rod, obeying the following rules:
1. Only one disk may 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 or on an empty rod.
3. No disk may be placed on top of a disk that is smaller than it.