The Tower of Hanoi is a classic mathematical puzzle involving three pegs and a number of disks. The disks are stacked in order of decreasing size on the left peg, and the objective is to move all disks to the right peg. The three rules to move the disks are: 1. You may only pick up the top disk of a peg 2. Only one disk may be picked up at a time 3. You may not place a larger disk on top of a smaller one The optimal number of moves for any number of disks, n, is 2n-1 moves. For example