==> induction/hanoi.p <==
Is there an algorithm for solving the Hanoi tower puzzle for any number
of towers?  Is there an equation for determining the minimum number of
moves required to solve it, given a variable number of disks and towers?