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.
Not without cheating, even if only by taking advatage of a bug in the programming. The minimum number of moves can be calculated mathematically, and it is higher than 30.
Comments
You need to be logged in to post comments
Add a Comment
1 | 2 | 3
coolio i did it in 30 moves
(view all replies)Comment Reply
AWSOME!
(view all replies)Comment Reply
This is really hard!!!
(view all replies)Comment Reply
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?
(view all replies)Comment Reply
I mean it just said I was finished, I didn't say anything, lol.
(view all replies)Comment Reply
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?
(view all replies)Comment Reply
I just tried again and got exactly the same score!
(view all replies)Comment Reply
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!
(view all replies)Comment Reply
I did it in 29 moves, for some reason most of the time it won't let me put orange on red.
(view all replies)Comment Reply
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 :)
(view all replies)Comment Reply
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.
(view all replies)Comment Reply
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)Comment Reply
Yea!
(view all replies)Comment Reply
And Mayhem's right, the lowest possible score is 32. (I'm happy you know and shared the math, Mayhem)
(view all replies)Comment Reply
Moves: 32 Time: 84.2
(view all replies)Comment Reply
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!
(view all replies)Comment Reply
lol cause it got featured, thats why there are so many
(view all replies)Comment Reply
i dont now what to do
(view all replies)Comment Reply
no please belive me im not lieing please
(view all replies)Comment Reply
i dont care if you dont beliv me but i swear im not lying
(view all replies)Comment Reply
LOL, zorgrox, 29 moves? either your lieing or the program screwed up because the minimum possible number of moves is 31!
(view all replies)Comment Reply
WOW! that was so great!!
(view all replies)Comment Reply
time 50 move 29
(view all replies)Comment Reply
time:110, moves:33. Nice job
(view all replies)Comment Reply
Must be hard to look at all these comments huh.Nice project too. Check out some of mine at Mike123456789 at the search bar.
(view all replies)Comment Reply
59 moves
(view all replies)Comment Reply
44, 33
(view all replies)Comment Reply
i sucked for my first time but then i got better
(view all replies)Comment Reply
13 moves 11 sec i did not cheat i went fast
(view all replies)Comment Reply
Doesn't matter how fast you go, its not possible to do it in that few moves. Physcially not possible.
(view all replies)Comment Reply
Time:117 Moves:59 Sadly, its impossible to do it quickly because you have to wait for it to fall down :(.
(view all replies)Comment Reply
that was challenging. i made it!
(view all replies)Comment Reply
Fastest Time:68.7 seconds Lowest Number of Moves:23
(view all replies)Comment Reply
Yeh yeh very clever but how do you play?
(view all replies)Comment Reply
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)Comment Reply
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!
(view all replies)Comment Reply
also i swear i didn't cheat
(view all replies)Comment Reply
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)Comment Reply
FIRST TIME YAYAH!
(view all replies)Comment Reply
13 moves and 17 seconds BEAT DAT!
(view all replies)Comment Reply
ow to update you have to click the loveit button
(view all replies)Comment Reply
can you play my battle lloyd 1 game so i can do the update please
(view all replies)Comment Reply
If it's 2^n-1 then you can make a minimum of 31 moves.
(view all replies)Comment Reply
Correct - except that the counter starts at 1, so the lowest score you can get without cheating is 32.
(view all replies)Comment Reply
226 sec, 54 moves. There's some sort of error that seems to make them bounce back for no apparent reason.
(view all replies)Comment Reply
155 sec 73 moves. Hehe, one move less than madness :), first time
(view all replies)Comment Reply
153 sec. 74 moves. Preety bad but it was the first time I've ever played this xD
(view all replies)Comment Reply
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.
(view all replies)Comment Reply
24 moves in 98 secs
(view all replies)Comment Reply
118 secs and 41 moves!!!! That was so hard, but cool!!!
(view all replies)Comment Reply
that was fun and hard at the same time
(view all replies)Comment Reply
127 42 moves
(view all replies)Comment Reply
68 secs 27 moves ( I think I cheated but maybe glitch)
(view all replies)Comment Reply
45 secs. 30 moves!!!!!!!!!!!!!!!1
(view all replies)Comment Reply
I don't think that is actually possible.
(view all replies)Comment Reply
Not without cheating, even if only by taking advatage of a bug in the programming. The minimum number of moves can be calculated mathematically, and it is higher than 30.
(view all replies)Comment Reply
100 sec 46 movs
(view all replies)Comment Reply
90 secs, 43 moves. well done.
(view all replies)Comment Reply
cool
(view all replies)Comment Reply
J
(view all replies)Comment Reply
oiewutriweu4
(view all replies)Comment Reply
ive dine this before at a scout camp youve done really well
(view all replies)