PUZZLES 2: A Variation on the Hanoi-Puzzle

摘要

Suppose the disks of the Hanoi puzzle are colored with different colors, one perdisk, such that no two disks that are adjacent in the start position have the same color. Now the Hanoi puzzle has to be solved with the additional restriction that it is prohibited to place a disk on a disk of the same color. It is shown that a solution is possible for each such coloring.