Prices are shown in Polish złoty (PLN).
Choose your currency:
Prices in zloty - you can change the currency at any time at the top of the page.

MoYu Hanoi Tower 6 Layers
Fill all fields to send a question about this product. Thanks :
* Requires fields
Cancel or
A classic Tower of Hanoi from MoYu with six discs on three rods. You need to move the whole tower to another rod, and the shortest solution takes 63 moves. It's the easiest of the 6, 8 and 10 Layers versions, which makes it a great place to start.
This brain teaser has three rods, six discs and one rule: a larger disc can never sit on a smaller one. MoYu Hanoi Tower 6 Layers is a six-disc version of the classic Tower of Hanoi. There are no turns and no algorithms like on cubes. What matters is planning a few moves ahead. At the start, all the discs sit on one rod, from the largest at the bottom to the smallest at the top. Your goal is to move the whole tower to another rod.
With six discs, the shortest solution takes 63 moves. The general formula is 2n − 1, where n is the number of discs, so each extra disc almost doubles the number of moves. Once you realise that moving six discs means moving five, then the largest one, and then five again, solving becomes much calmer. A simple observation also helps: the smallest disc moves every other move, always in the same direction. Doing it in 63 moves without a single unnecessary move is a challenge of its own.
The MoYu Tower of Hanoi is also available in 8-disc and 10-disc versions. The 6 Layers version is the shortest, and solving it takes a few minutes. That makes it the best choice to start with, and it won't put you off. With 8 discs the minimum is 255 moves, and with 10 discs it's already 1023 moves. The larger versions are more a test of patience and focus than a new puzzle, because the solving principle stays the same.
It's a great puzzle for a child who is learning logical thinking and planning. It's also a good pick for parents looking for something other than yet another cube. Cubers can treat it as a break from 3x3, and maths and computer science teachers can use it as a teaching aid, because the Tower of Hanoi is a classic example of recursion. If you want a longer challenge, go straight for the 8 or 10 Layers version.
| Rozmiar | 65,5 |
Free step-by-step solving courses with animations and a simulator. All courses
Pickup at a shop pointLublin, ul. Lotnicza 5 0,00 zł 0,00 zł 0,00 zł
InPost International4-5 dni France, Belgium, Italy, Luxembourg, Portugal, Spain, Netherlands 29,99 złThis product has no reviews yet.
Be the first to write your review!