Bicolor Tower of Hanoi

The rules of the puzzle are the same as for the regular Tower of Hanoi: disks are transfered between pegs one at a time. At no time may a bigger disk be placed on top of a smaller one. The difference is that now for every size there are two disks: one green and one red. Also, there are now two towers of disks of alternating colors. The goal of the puzzle is to make the towers monochrome. The biggest disks at the bottom of the towers are assumed to swap positions.

As of 2018, Java plugins are not supported by any browsers (find out more). This Wolfram Demonstration, Bicolor Towers of Hanoi, shows an item of the same or similar topic, but is different from the original Java applet, named 'BiColorHanoi'. The originally given instructions may no longer correspond precisely.


A few words

67294176

|Contact| |Front page| |Contents|

Copyright © 1996-2018 Alexander Bogomolny