Tower of Hanoi

The tower of Hanoi is a puzzle but a puzzle that can be solved easily through mathematical induction. The puzzle is that you have 3 slots with a tower of blocks on the first. The tower on the first as a large base and each block above it is -1 the size of the previous block. So if the base block was 4, the next would be 3 then 2 and the top would be 1. To solve it, you must figure out the pattern it takes to transport each to the 3 spot, while only moving one at a time and placing smaller pieces on bigger pieces only.