Tower of Hanoi

The objective of the puzzle is to move the entire stack to one of the other rods, obeying the following rules:

  1. Only one disk may be moved at a time.
  2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
  3. No disk may be placed on top of a disk that is smaller than it.

The minimal number of moves required to solve a Tower of Hanoi puzzle is 2^n - 1, where n is the number of disks.

(from wikipedia)

The minimal number of move:

Your move: 0

Holding:

Feeling yourself being too stupid? Watch Ads to get a extra rod!

Other games: