Towers of Hanoi

If you've gone through the tutorial on recursion, then you're ready to see another problem where recursing multiple times really helps. It's called the Towers of Hanoi. You are given a set of three pegs and $n$ disks, with each disk a different size. Let's name the pegs A, B, and C, and let's number the disks from $1$, the smallest disk, to $n$, the largest disk. At the outset, all $n$ disks are on peg A, in order of decreasing size from bottom to top, so that disk $n$ is on the bottom and disk $1$ ...