The Tower of Hanoi Program

Well, if you've never heard of the Tower of Hanoi, then you can look it up online. This program demonstrates the power of recursive programming. When you run the program you will notice a delay in the display of the output of the program until the program has completed. I guess that's a feature, not a bug. Posted 22JAN2008.

Arguments to the program hanoi are:

hanoi(number_of_disks, from_peg, to_peg, aux_peg)

It takes 2^N-1 moves to move a tower of N disks.