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

Can you move the tower to one of the other 2 pegs without ever placing a larger ring over a smaller ring? To solve through any layer requires a minimum # of moves of 2 to the N power minus 1; where N is the number of rings. The 9-ring version requires 511 moves to solve! Its 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.