A challenging and beautiful puzzle devised in 1883 originally called the Tower of Brahma and later the Tower of Hanoi.

Can you move the tower to one of the other two pegs without ever placing a larger ring over a smaller ring? To solve through any layer requires a minimum of two moves to the N power minus 1 where N is the number of rings. We have both 7-ring and 9-ring versions. To solve a 7-ring version requires a minimum of 127 moves; 9 rings requires 511 moves! It’s not an “all or nothing” puzzle though; whatever layer you solve though is a measure of your proficiency. Requires focus and concentration and the ability to recognize and remember patterns.

Comes with wood box that encases all the pieces.