The generalized four-peg tower of hanoi problem
A. A. K. Majumdar · Optimization · 1994
The generalized ρ-peg Tower of Hanoi problem with ρ 4 is considered in this paper. Denoting by M(n, p) the minimum number of (legal) moves required to transfer the tower of n( 1) discs from the pegP 1, to the pegP ρ, the dynamic programming formulation has heen employed to find the optimality equations and some local-value relationships satisfied hy M(n, p). These results are then exploited to solve the 4-peg Tower of Hanoi problem completely