Tower of Hanoi Puzzle
Free Towers of Hanoi Online Puzzle Game

The Tower of Hanoi is a famous puzzle. It features disks of different sizes and 3 pegs.

The goal is to move the disks from the first to the third peg while preserving the following two rules:
- You cannot move more than a disk at any given time
- Moved disks can only be placed on an empty peg or on a bigger disk. (i.e. 3 can be placed over 5 but not the other way around).

Now, keep in mind that the minimum number of moves removes in order to solve a game of K disks is:  2^k - 1.

So if you opt for 5 disks, you cannot solve this puzzle in less than 2⁵-1 = 32-1= 31 moves.

Enjoy this brain teaser and make sure you visit the other sections of HanoiTower.info for more background and information.