Procedure hanoi moves n disks from peg A to peg B by first moving n-1 disks from A to C. Moves remaining disk from A to B. Then moves the n-1 disks from C back to B. Solution Complete.
