• Register

Solve one of the most entertaining mathematical problems ever. Your goal is to move a stack of size-sorted discs from one bar to another. Two rules: Only one disc at once - and bigger discs may never be on smaller ones. The game can theoratically be played with an infinite amount of discs, we offer you ten; if you play on high speed, it takes something like 20 minutes and a lot of pain in the hand to solve it. That's why you get an achievement for that!

  • View media
  • View media
Report RSS Hanoi3D - Level 10 (view original)
Hanoi3D - Level 10
embed
share
view previous
Share Image
Share on Facebook Post Email a friend
Embed Image
Post a comment

Your comment will be anonymous unless you join the community. Or sign in with your social account:

Description

Looks like a whole bunch of work ahead.
Prepare for at least 20 minutes of extreme thinking, and 30 minutes of pain in the hand.
But the game seems to be addicting enough for some people to even solve this - me included.

Info: The number of steps to take is always 2^(number of discs)-1.
Thats 2^10-1 = 1023 steps to take for 10 discs.
I usually end up doing ~1200 due to concentrassion loss and pain.