# Bicolor Towers of Hanoi

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

The towers of Hanoi puzzle involves three vertical rods and a number of disks of unequal size with holes in their centers. The disks can slide down a rod to make a stack. The initial set up has all the disks on one rod, subject to the general rule 1:

[more]
Contributed by: Brian Lin and Sarah Brand (June 2016)

Special thanks to the University of Illinois NetMath Program and the mathematics department at William Fremd High School, and especially to Mr. Grattoni.

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

References

[1] P. V. Chaugule, “Math and Fun with Algorithms: A Recursive Solution to Bicolor Towers of Hanoi Problem,” *Recreational Mathematics Magazine*, 4, 2015 pp. 37–48.

[2] D. W. Palmer, “Exploring Recursion with Variations on the Towers of Hanoi,” *Journal of Computing Sciences in Colleges*, 12(2), 1996 pp. 59–66.

## Permanent Citation

"Bicolor Towers of Hanoi"

http://demonstrations.wolfram.com/BicolorTowersOfHanoi/

Wolfram Demonstrations Project

Published: June 15 2016