Python Solution to Tower of Hanoi
Python Solution to Tower of Hanoi - this video shows a recursive solution to the Tower of Hanoi math puzzle.
The puzzle involves 3 towers: A, B, C and a set of disks. You start with a set of disks on A with different diameters and have the goal of moving all disks to C. The puzzle rules say
1) only move one disk at a time
2) only move the disk on top
3) never put a larger disk on top of a smaller one
If you have 1 disk, you can solve this in 1 step.
If you have 2 disks, you can solve this in 3 steps.
If you have 3 disks, you can solve this in 7 steps.
If you have 4 disks, you can solve this in 15 steps.
ex. 2^n - 1 steps where n is the number of disks
