An Algorithmic Solution to the Multi-tower Hanoi Problem
M. C. Er · Journal of Information and Optimization Sciences · 1987
The Multí-tower Hanoi problem is a generalization of the standard Towers of Hanoi problem, such that the number of pegs is changed from 3 to t, where t ≥ 2. An algorithmíc solution to the Multi-tower Hanoi problem is presented. Furthermore, a method is provided for splitting a tower of n discs into two towers having n1 and n2 dìscs, respectively. Such a method forms the basis for the algorithm to generate the minimum number of moves for transferring a n-disc tower to another peg usíng t pegs.