Towers of Hanoi
Obliczymy ostateczną cenę na podstawie wybranego pliku. Sprawdzisz ją i zaakceptujesz przed płatnością.
Zapisane na tym urządzeniu.
A compact version of the "Towers of Hanoi" puzzle, with up to 7 disks.
- Ocena
- 0 / 5
- Polubienia
- 7
- Pobrania
- 127
- Wydruki
- 1
- Wyświetlenia
- 1018
- Oceny
- 0
Aktualizacja u źródła:
Informacje o modelu
- Źródło
- Printables
- Kategoria
- Math
- Licencja
- GNU General Public License v3.0
The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods and a number of disks of different diameters, which can slide onto any rod. The puzzle starts with the disks stacked on one rod in order of decreasing size, the smallest at the top, thus approximating a conical shape.
The objective of the puzzle is to move the entire stack to the last rod, obeying the following simple rules:
Only one disk may be moved at a time.
Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or an empty rod.
No disk may be placed on top of a disk that is smaller than it.¹
With 7 disks, the puzzle can be solved in 127 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2^n − 1, where n is the number of disks.
The towers each have a hole, through wich a piece of bent filament can be inserted when the discs are in place to keep them together with the base for stowage or transport.
Depending on the precision of your printer, you may have to enlarge the holes on the discs by .25-.5mm.
¹Wikipedia contributors. (2021, May 7). Tower of Hanoi. Wikipedia. https://en.wikipedia.org/wiki/Tower_of_Hanoi