Tower of Hanoi — Parametric Educational Stacking Puzzle
We calculate the final price from your selected file. You review and accept it before payment.
Saved on this device.
Classic recursion puzzle: move a graduated stack of discs across three pegs, one at a time
- Rating
- 0 / 5
- Likes
- 0
- Downloads
- 6
- Makes
- 0
- Views
- 24
- Reviews
- 0
Updated at source:
Model information
- Source
- Printables
- Category
- Puzzles & Brain-teasers
- License
- Creative Commons — Attribution
A classic problem-solving toy. Move the whole graduated stack of discs from one peg to another, one disc at a time, and never place a larger disc on a smaller one. With n discs the minimum number of moves is 2^n minus 1 (5 discs = 31 moves, 7 = 127) — a tidy lesson in recursion and patience.
Six parts, print-and-play (no assembly):
base.stl — board with three domed pegs. Print this in a WOOD-FILL PLA for the wood-grain relief shown in the photo (the grain is a surface heightfield carved into the board).
disc_1.stl to disc_5.stl — the five graduated discs, smallest to largest. Print each a different colour for a rainbow set, or assign per-object filaments on one AMS plate.
Parametric. The whole model scales from n_discs (default 5, classic range 3 to 9): base width, peg spacing, peg height and the full disc set all follow. Bore clearance is a loose 0.4 mm per side so small hands stack easily. The attached .scad rebuilds at any disc count.
Print. No supports. Base prints flat (pegs up, domed tips self-support); discs print flat on the bed. Default 5-disc build is 248 x 92 mm and fits a 256 mm Bambu bed.
Safety. Smallest disc diameter stays above the small-parts choke gauge (about 32 mm) and every edge is filleted — no sharp corners or points. Ages 3+.