The Divide-and-Conquer Approach to the Generalizedp-Peg Tower of Hanoi Problem
A. A. K. Majumdar · Optimization · 1995
This paper extends the divide-and-conquer approach of Liefvoort [7,8] to the generalized p-peg Tower of Hanoi problem withp5. Given an (n,p)-system, the problem is to divide the tower on the source peg into slices so that each slice (viewed as a single entity) can move usingp–1 pegs only. The number and sizes of slices have been given, and an expression for M(n,p) has been derived in terms of these slices, where M(n,p) denotes the presumed minimum number of moves required to transfer the tower of n discs from the source peg to the destination peg