The Colour Towers of Hanoi – An Iterative Solution
M. C. Er · Journal of Information and Optimization Sciences · 1984
In the colour Towers of Hanoi problem, three pegs are arranged as a circle and n black and white discs are stacked on a peg in increasing sizes with the largest disc at the bottom. The objective is to move these n discs to a specified peg subject to the restrictions of the standard problem; in addition, white and black discs may move clockwise and counterclockwise respectively only. A simple iterative solution to this complex problem is presented. The necessary and sufficient conditions which uniquely define the sequences of disc moves are also discussed.