Download this project!Project Notes
This is my version of the tower of hanoi puzzle. I was inspired by this project by daeheryn: (link to project) This has horrible graphics in comparision, but I made it so that it can solve itself. just press the "Auto-Solve" button. The rules are this: Try to move the tower to one of the other pegs in as few moves as possible You can only move the top disk in a stack You can not put a disk on a smaller disk
More Projects by toontownmiser
-
Peg Soiltaire…
113 views -
whack a mole
259 views -
Spirograph (!)
428 views -
Reversi v0.1
155 views -
slope-detecti…
332 views
Comments
You need to be logged in to post comments
Add a Comment
5 moves!
(view all replies)Comment Reply
5 moves!
(view all replies)Comment Reply
Hmmmm... I have played this game in real life. There are a lot of bugs, maybe you should make the top and bottom of each circle a different color. That way you can do the moving script only when its touching the top color of an object.
(view all replies)Comment Reply
Hard, I finally understand now.
(view all replies)Comment Reply
Lol there is a VERY simple algorithm for solving one of these, with infinite blocks. I would have to guess that you know what it is :)
(view all replies)Comment Reply
and six.
(view all replies)Comment Reply
it is impossible in 8 moves.
(view all replies)Comment Reply
lol!
(view all replies)Comment Reply
8 moves THIS IS AN AWESOME GAME
(view all replies)Comment Reply
6 moves
(view all replies)Comment Reply
i mooved the bottom ones first, so i got in 8 moves. I have a wood version of this game, its so HARD! Great game!
(view all replies)Comment Reply
wow this is actually a realy good game... confusing at first but cool once you get the hang of it
(view all replies)Comment Reply
The bottom disks should not be moved first. That is a bug that I am working on.
(view all replies)Comment Reply
7 moves beat dat!
(view all replies)Comment Reply
No wait I still can beat that! 0 moves!
(view all replies)Comment Reply
8 moves, seriously! I moved the bottom ones first!
(view all replies)Comment Reply
Blah Blah Blah spacial relasionshps whith an bunchs of z maipings and othr words i can noht shpell. (ha ha, just kidding LOL)
(view all replies)Comment Reply
I don't know if a glitch let me do this but I got the tower from the middle peg to the left peg and then to the right peg in 45 moves exacly. It never said you win or something so did I beat it?
(view all replies)Comment Reply
I like it its cool
(view all replies)Comment Reply
(link to project)
(view all replies)Comment Reply
toontownmiser, thereseller copied this project.
(view all replies)Comment Reply
pLz check out my project: http://www.(link to project)
(view all replies)Comment Reply
I swear to god it only took 37 moves!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
(view all replies)Comment Reply
i did the auto solve & it got to 181 moves before i screamed & jumped out the window. it just keeps making itself & unmaking itself! :\
(view all replies)Comment Reply
cool project!
(view all replies)Comment Reply
I did it 134 moves by using the formula for n by the subzero equations it is really rather easy
(view all replies)Comment Reply
By cheating I did it in 8 moves ;)
(view all replies)Comment Reply
I like it though. =)
(view all replies)Comment Reply
cool game except you can drag the blocks from under blocks to another pole, which is kinda of like a glitch.
(view all replies)Comment Reply
wat are we supose 2 do ??
(view all replies)Comment Reply
I used 315
(view all replies)Comment Reply
sorry, 255.
(view all replies)Comment Reply
you should add the time up that will be better!
(view all replies)Comment Reply
This one is not that hard
(view all replies)Comment Reply
I am good at it.
(view all replies)Comment Reply
155 moves for beating this game!
(view all replies)Comment Reply
but it is a glitchy becaouse if ya put one of the coloured disks over one of the disks the game goes abit crazy, but the game is stilll good dont worry
(view all replies)Comment Reply
i like i like alot
(view all replies)Comment Reply
Of course I don't mind! Please, make as many different Tower of Hanoi puzzles as you can (then I won't have to, but will still be able to play them ^_^) I just made that little project because it is my favorite puzzle, and I was hoping that it would inspire others to create similar projects. (Spread the word! :D)
(view all replies)Comment Reply
I'm pretty confident that it is the lowest number of moves. A formula for finding the mininum # of moves is (letting n be the number of disks in the tower) moves = (2^n+1)-1 | n=1 moves = 1 | n=2 moves=3 | n=3 moves = 7 etc.
(view all replies)Comment Reply
That's "Hanoi-ing!" (Please pardon my extremely lame joke.)
(view all replies)Comment Reply
255 is a lot of moves! Is that the smallest number of moves possible to solve it?
(view all replies)Comment Reply
its a bit glitchy
(view all replies)Comment Reply