This game is known in mathematical analysis as the “Towers of Hanoi problem”: you have to transfer the tower formed by discs from the first pile to the third pile by following two simple rules:

1) you can move one disk at a time.

2) you cannot superimpose a larger disk on a smaller disk.

The variant we propose is with 7 discs and 127 moves, but the Brahman monks will need 18 trillion and 446 billion moves to complete the transfer of the 64 heavy golden discs…..

Materials: beech wood.

Dimensions: 9x22x10 cm

Rules

Rules