Tower of Hanoi

0 Review(s) 
2019-19_HANOI

The Tower of Hanoi (also known as the Tower of Brahma or the Tower of Luke) is a mathematical game or puzzle. It consists of a base with 3 rods and 9 oak discs of different sizes that can slide on any rod.

The puzzle begins with the disks in a neat stack on a rod, in ascending order of size, the smallest at the top, thus forming a conical shape.

The objective of the puzzle is to move the entire pile to another rod, obeying its simple rules.

 

€28.00
Tax included Delivery time between 3 and 4 working days.
In stock

Rules

The objective of the puzzle is to move the stack of 9 discs to another rod, obeying the following simple rules:

1. Only one disc can be moved at a time.

2. Each movement consists of taking the upper disk from one of the stacks and placing it on top of another stack, that is, a disk can only be moved if it is the uppermost disk in a stack.

3. No disc can be placed on top of a smaller disc (smaller discs should always be on top).

_Each piece or block comes from different cuts of wood, so it will present differences in terms of the shape and tone of its grain.

_Free of varnishes or toxic. All the pieces have been treated with a combination of natural oils.

2019-19_HANOI
8 Items
2020-06-01

Data sheet

Recommended age
From 3 years
Wood used
Beech, oak
Dimensions
Base 30x12 cm
Dimensions
Box 34x16x7cm

Specific References

Reviews

No customer reviews for the moment.

Write your review

Tower of Hanoi

The Tower of Hanoi (also known as the Tower of Brahma or the Tower of Luke) is a mathematical game or puzzle. It consists of a base with 3 rods and 9 oak discs of different sizes that can slide on any rod.

The puzzle begins with the disks in a neat stack on a rod, in ascending order of size, the smallest at the top, thus forming a conical shape.

The objective of the puzzle is to move the entire pile to another rod, obeying its simple rules.

 

Write your review

6 other products in the same category:

Customers who bought this product also bought: