Given a stack of n disks arranged largest on the bottom to smallest on top placed on a rod, together with two empty rods, the towers of Hanoi puzzle asks for the minimum number of moves required to move the stack one rod to another, where moves are allowed only if they place smaller disks on top of larger disks-Given a stack of n disks arranged　largest on the bottom to smallest on top placed on a rod, together with two empty rods, the towers of Hanoi puzzle asks for the minimum number of moves required to move the stack　one rod to another, where moves are allowed only if they place smaller disks on top of larger disks