The Generalized Towers of Hanoi Problem
M. C. Er · Journal of Information and Optimization Sciences · 1984
A generalization to the Towers of Hanoi problem is suggested. In this generalization, n discs of different sizes are arranged initially in one or more towers on three pegs, and the task is to move them to a specified peg under the usual restrictions. A simple recursive algorithm for this generalized Towers of Hanoi problem is presented.