This site requires JavaScript, please enable it in your browser!
Greenfoot back

Report as inappropriate.

Duta presents ...



The famous "Towers of Hanoi" puzzle, with a solver if you can't work out how to complete it!

Here's the rules (copied from Wikipedia):
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.

5031 views / 871 in the last 7 days

6 votes | 0 in the last 7 days

Tags: mouse game simulation physics demo uaslp korea lalala

Your browser does not support the canvas tag.


PERFECT GAME pretty cool i noticed that it counts as a move if you pick up a piece but then drop it back in the same spot


Yeah. I did it twice and got a 257 with 8 disks.


I didn't even know this existed!


I love the towers of Hanoi puzzle! Except for the bug mentioned above, this is a great implementation of it, too.


Why is it that I only realize there's an existing project that basically does everything mine does and more AFTER I create and publish it? *sigh* Nice project, Duta. Just curious, but for your automatic solver, did you use the iterative algorithim or the recursive algorithim? I used and invented the recursive solution I used.


Great, you made me waste like ten minutes of my life. But I got the almighty 255. ;)

Want to leave a comment? You must first log in.

Who likes this?

Kartoffelbrot MatheMagician PoleBro764 SPower Kimtaeyeonz