Editing Tower of Hanoi (section)

=== Bicolor Towers of Hanoi ===
This 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.<ref>{{Cite journal|url=http://rmm.ludus-opuscula.org/PDF_Files/Chaugule_BicolorHanoi_37_48(4_2015)_low.pdf|journal=Recreational Mathematics Magazine|issue= 4|pages=37–48|title=A Recursive Solution to Bicolor Towers of Hanoi Problem|date=2015|issn=2182-1976
|author=Prasad Vithal Chaugule}}</ref>

[[File:BTOHFC.jpg|thumb|Final configuration of bicolor Towers of Hanoi (n=4)]]
The rules of the puzzle are essentially the same: disks are transferred 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 black and one white. Also, there are now two towers of disks of alternating colors. The goal of the puzzle is to make the towers monochrome (same color). The biggest disks at the bottom of the towers are assumed to swap positions.