1. No disk can ever be covered by a larger one.

2. You can move one disk at a time.

3. You can move a disk from the top of one stack to the top of another stack.

The object is to move all the disks to another stack.

The bicolor towers of Hanoi is a more complicated version: there are four rods and the original stack contains up to three pairs of disks of equal size but two different colors (here, blue and green). The object is to move all the disks to two separate stacks, each of one color. In this Demonstration, the solution requiring the smallest number of steps possible is shown.

Currently, there is no algorithm that gives the minimum number of steps needed to solve the problem. This Demonstration simulates the process for up to three pairs.