Bicolor Tower of Hanoi

The following variation of the famous Tower of Hanoi puzzle was offered to grade 3-6 students at 2ème Championnat de France des Jeux Mathématiques et Logiques held in July 1988. (For more puzzles check the pages of Vincent Lefèvre, France. My thanks go to José Antônio Fabiano Mendes from Brasil for pointing out that site.)

The rules of the puzzle are essentially the same: 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.


This applet requires Sun's Java VM 2 which your browser may perceive as a popup. Which it is not. If you want to see the applet work, visit Sun's website at https://www.java.com/en/download/index.jsp, download and install Java VM and enjoy the applet.


What if applet does not run?

At the competition, the students were asked to solve the puzzle with 3-disk towers in the minimum number of moves. I would welcome solutions to more general formulations.

Follow-ups

  1. Solution by Nathan Bowler
  1. Tower of Hanoi
  2. Tower of Hanoi, the Hard Way
  3. Bicolor Towers of Hanoi
  4. 3-Colors Tower of Hanoi
  5. 3-Colors Tower of Hanoi (Algorithm)
  6. Hanoing
  7. Sierpinski Gasket and Tower of Hanoi

|Contact| |Front page| |Contents| |Games|

Copyright © 1996-2017 Alexander Bogomolny

 62685315

Search by google: