Loading

Tower Of Hanoi

by Mrrocketman, published

Tower Of Hanoi by Mrrocketman Apr 7, 2013

Description

Everyone's natural favorite, the Tower Of Hanoi!
.
Designed in OpenSCAD for easy editing.
.
Note: the files in the download section have a largestRingHeight of 6.0, whereas the customizer version defaults to 8.0
.
Time to solve if you understand the pattern:

  • 3 Piece Puzzle: 10 seconds
  • 4 Piece Puzzle: 20 seconds
  • 5 Piece Puzzle: 40 seconds
  • 6 Piece Puzzle: 1 minutes 15 seconds
  • 7 Piece Puzzle: 2 minutes 30 seconds
  • 8 Piece Puzzle: 5 minutes
  • 9 Piece Puzzle: 10 minutes
  • 10 Piece Puzzle: 20 minutes
  • 11 Piece Puzzle: 40 minutes
  • 12 Piece Puzzle: 1 hour 20 minutes
  • 13 Piece Puzzle: 2 hour 40 minutes
  • 14 Piece Puzzle: 5 hour 20 minutes
  • 15 Piece Puzzle: 10 hour 40 minutes
  • 16 Piece Puzzle: 21 hour 20 minutes

Recent Comments

view all
I love this game! The 10 piece version is about a 20 minute puzzle. And I figure if you edit the script and make a 15 piece puzzle it would take 24 straight hours to solve!!
this looks like a really hard game to beat. I am probably going to print this soon.
this looks like a really hard game to beat. I am probably going to print this soon.

More from Puzzles

view more

Liked By

view all

License

Give a Shout Out

If you print this Thing and display it in public proudly give attribution by printing and displaying this tag. Print Thing Tag

Instructions

Print and Play!
.
From the Wikipedia article:
.
The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower, and sometimes pluralised) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.
.
The objective of the puzzle is to move the entire stack to another rod, obeying the following rules:

  • Only one disk may be moved at a time.
  • Each move consists of taking the upper disk from one of the rods and sliding it onto another rod, on top of the other disks that may already be present on that rod.
  • No disk may be placed on top of a smaller disk.

With three disks, the puzzle can be solved in seven moves.

this looks like a really hard game to beat. I am probably going to print this soon.
I love this game! The 10 piece version is about a 20 minute puzzle. And I figure if you edit the script and make a 15 piece puzzle it would take 24 straight hours to solve!!
this looks like a really hard game to beat. I am probably going to print this soon.
Top