Aaaaaaah, I think I see. People have been taking the bottom rings out while the smaller rings are still sliding down, is that what you mean, Danielblarg?
HOLLY MAN! MASSIVE BUG. I just said I was finished for no reason and I had only done 17 moves! 17 moves in 33.6 seconds. Oh, then then I kept going after it said I finished and done it in 28 moves! Are you meant to be able to grab a disk when there is one above it?
To clarify, you know you're done when a little song plays. Maybe some people thought they were done, but actually weren't, explaining the impossibly low scores.
Hey, did you know that there is a simple algorithm for self solving from any position? I figured it out myself when I was playing with a wooden set a few years ago. It can work with infinite rings, but it would take a bit longer to code.
O_O
Note to self: Do not get busy for 6 mo and forget about your Scratch account.
There will be comments.
Many comments.
^_^ Thanks for all the interest, people!
Of course you did. There is a known minimum number of movs, you know. I know that minimum, and it is more than 17. If you used a bug in the programming to cheat, that is still cheating.
Without cheating, the number of moves it takes to move a tower in a tower-of-hanoi puzzle is equal to 2^n - 1, where n= the number of disks. In this instance, the counter starts at 1, so your minimum number of moves recorded will be 2^n. Some people are posting scores that are below this number, and must therefore be cheating.
Download the 8 sprites and 21 scripts of "Tower of Hanoi" and open it in Scratch
Project Notes
-Click and hold the mouse when touching a disc to pick it up, then move it over to a pole and lift up on the mouse to slide it down.
-Try to move the tower over to another pole in as short a time as possible and in as few moves as possible.
-Most people probably know what the rules are, but if not it will soon become apparent.
-I decided to make a short puzzle for now to see if it was possible/worth it before I started working on a larger version.
-Thanks to toontownmiser for giving me the idea for the updated dragging version.
Comments
You need to be logged in to post comments
Add a Comment
62 seconds and 34 seconds.
It's Great
It says 100 time, 51 moves. i thought it was 140 time, but I'll go with the computer, which says I scored well. =P
Very excellent!
yay! 56 moves/218 time! I'm horrible at this! :D
Time : 102.XX Moves: 53.XX
79 moves
95.7 secs
I love hanoi, but this project has a few glitches and the circles go down really slowly
42 moves, 59.4 time
31/22
21 moves and 81 seconds
50 moves & 119 seconds 8)
70 moves and 244 seconds :[
56 moves and 132 seconds!
79 moves!!!!! how com the lowest is 100
There are some bugs but otherwise it's good
17 moves!
I did it in 21
BOOO
coolio i did it in 30 moves
AWSOME!
This is really hard!!!
Aaaaaaah, I think I see. People have been taking the bottom rings out while the smaller rings are still sliding down, is that what you mean, Danielblarg?
I mean it just said I was finished, I didn't say anything, lol.
HOLLY MAN! MASSIVE BUG. I just said I was finished for no reason and I had only done 17 moves! 17 moves in 33.6 seconds. Oh, then then I kept going after it said I finished and done it in 28 moves! Are you meant to be able to grab a disk when there is one above it?
I just tried again and got exactly the same score!
Me and Zorgrox did it in 29 moves and when I did it it was my first go after I found out what you are meant to do!
I did it in 29 moves, for some reason most of the time it won't let me put orange on red.
Mayhem IS right, and a few years back my whole math class had to figure out that formula for minimum number of moves by ourselves :)
To clarify, you know you're done when a little song plays. Maybe some people thought they were done, but actually weren't, explaining the impossibly low scores.
Yea!
Hey, did you know that there is a simple algorithm for self solving from any position? I figured it out myself when I was playing with a wooden set a few years ago. It can work with infinite rings, but it would take a bit longer to code.
(view all replies)And Mayhem's right, the lowest possible score is 32. (I'm happy you know and shared the math, Mayhem)
Moves: 32 Time: 84.2
O_O Note to self: Do not get busy for 6 mo and forget about your Scratch account. There will be comments. Many comments. ^_^ Thanks for all the interest, people!
lol cause it got featured, thats why there are so many
i dont now what to do
no please belive me im not lieing please
i dont care if you dont beliv me but i swear im not lying
LOL, zorgrox, 29 moves? either your lieing or the program screwed up because the minimum possible number of moves is 31!
WOW! that was so great!!
time 50 move 29
time:110, moves:33. Nice job
Must be hard to look at all these comments huh.Nice project too. Check out some of mine at Mike123456789 at the search bar.
59 moves
44, 33
i sucked for my first time but then i got better
13 moves 11 sec i did not cheat i went fast
Doesn't matter how fast you go, its not possible to do it in that few moves. Physcially not possible.
(view all replies)Time:117 Moves:59 Sadly, its impossible to do it quickly because you have to wait for it to fall down :(.
that was challenging. i made it!
Fastest Time:68.7 seconds Lowest Number of Moves:23
Yeh yeh very clever but how do you play?
You have to move the tower from one pole to another BUT you can never put a disc on top of a smaller disc.
(view all replies)61 moves, game thought I won partway through so no time. Not my first time, but first time on the computer. Fix the bug! It thought I won early!
also i swear i didn't cheat
Of course you did. There is a known minimum number of movs, you know. I know that minimum, and it is more than 17. If you used a bug in the programming to cheat, that is still cheating.
(view all replies)FIRST TIME YAYAH!
13 moves and 17 seconds BEAT DAT!
ow to update you have to click the loveit button
can you play my battle lloyd 1 game so i can do the update please
If it's 2^n-1 then you can make a minimum of 31 moves.
Correct - except that the counter starts at 1, so the lowest score you can get without cheating is 32.
226 sec, 54 moves. There's some sort of error that seems to make them bounce back for no apparent reason.
155 sec 73 moves. Hehe, one move less than madness :), first time
153 sec. 74 moves. Preety bad but it was the first time I've ever played this xD
Without cheating, the number of moves it takes to move a tower in a tower-of-hanoi puzzle is equal to 2^n - 1, where n= the number of disks. In this instance, the counter starts at 1, so your minimum number of moves recorded will be 2^n. Some people are posting scores that are below this number, and must therefore be cheating.
24 moves in 98 secs
CHEAT
118 secs and 41 moves!!!! That was so hard, but cool!!!