The Colour Towers of Hanoi: A Generalization
M. C. Er · The Computer Journal · 1984
The colour Towers of Hanoi problem is proposed. In this variant, discs are coloured white and black. The white and black discs are required to move in the clockwise and the counterclockwise directions, respectively, subject to the usual constraints of the standard problem. Initially, the discs are stacked on the pegs randomly without violating the constraints. The objective is to move them to a specified peg in increasing order with the largest disc at the bottom. A recursive solution to the problem and the unerlying strategies are presented.