Download this project!
Download the 14 sprites and 32 scripts of "Tower of Hanoi" and open it in Scratch 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…
356 views -
whack a mole
469 views -
Spirograph (!)
556 views -
Reversi v0.1
199 views -
slope-detecti…
533 views
Comments
You need to be logged in to post comments
Add a Comment
its so easy
it is possible.
No it's not. The absolute minimum that SHOULD be possible is 256 moves. Maybe you glitched it.
(view all replies)5 moves!
Not possible
5 moves!
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.
Hard, I finally understand now.
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 :)
and six.
it is impossible in 8 moves.
lol!
8 moves THIS IS AN AWESOME GAME
6 moves
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!
u have to move the TOP ones 1st. That's a rule of the game.
wow this is actually a realy good game... confusing at first but cool once you get the hang of it
The bottom disks should not be moved first. That is a bug that I am working on.
7 moves beat dat!
No wait I still can beat that! 0 moves!
8 moves, seriously! I moved the bottom ones first!
Blah Blah Blah spacial relasionshps whith an bunchs of z maipings and othr words i can noht shpell. (ha ha, just kidding LOL)
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?
I like it its cool
(link to project)">(link to project)
toontownmiser, thereseller copied this project.
pLz check out my project: http://www.scratch.mit.edu/projects/Mistz10/21051">http://www.scratch.mit.edu/projects/Mistz10/21051
I swear to god it only took 37 moves!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
i did the auto solve & it got to 181 moves before i screamed & jumped out the window. it just keeps making itself & unmaking itself! :\
cool project!
I did it 134 moves by using the formula for n by the subzero equations it is really rather easy
By cheating I did it in 8 moves ;)
I like it though. =)
cool game except you can drag the blocks from under blocks to another pole, which is kinda of like a glitch.
wat are we supose 2 do ??
I used 315
sorry, 255.
you should add the time up that will be better!
This one is not that hard
I am good at it.
155 moves for beating this game!
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
i like i like alot
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)
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.
That's "Hanoi-ing!" (Please pardon my extremely lame joke.)
255 is a lot of moves! Is that the smallest number of moves possible to solve it?
its a bit glitchy