What is Digg?Sponsored by Double Your Dating
Get Her To Pick YOU Up view!
doubleyourdating.com - An easy way to get a woman to start a conversation with you - no fancy lines required...
76 Comments
- SirPoonga, on 10/12/2007, -0/+2It's the towers of hanoi but with 5 "disks" It pretty much is the same pattern as the towers too.
- FearTec, on 10/12/2007, -0/+2Solution
http://216.239.39.104/translate_c?hl=en&u=http://tz-tech.ath.cx/jhanoi/index.html&prev=/search%3Fq%3Dsolve%2B%2522Junk%2527s%2BHanoi%2Bby%2BJunk%2BKato%2522%26hl%3Den%26lr%3D - procras, on 10/12/2007, -0/+1it is towers of hanoi. if you visualize each pyramid structure (there are three of them) as the spires it works exactly the same way. more interesting for the way you have to wrap your mind around the way the space is laid out than for the actual challenge.
- koreth, on 10/12/2007, -0/+0Interesting variant on Hanoi, but not too hard if you can wrap your brain around the concept of recursion -- got it in the minimum number of moves my first time through. I am glad it didn't have more disks, though; it was right on the edge of tedious by the end.
- rattboi, on 10/12/2007, -0/+0hmm, 201 first time, but got it in the 161 the next. Only took like 5 minutes though. Jeez, people, grow an attention span :)
- xeeton, on 10/12/2007, -0/+02'50 for me
- Milamber, on 10/12/2007, -0/+0161 on my first go... i mean come on people. This isn't really new/news and as has been stated before this is nothing more than Towers of Hanoi with the sizes if the blocks/holes enforcing the rules. Boring, repetetive and not reaslly worth a digg. Is every flash game on the planet going to get a mention on digg now?
OMFG CHECK OUT THIS SWEEET 3D VERSION OF PONG!!!!!
I GOT OVER 31000 (this is true, btw)
YOU CAN EVEN PUT SPIN ON TEH BALL!
http://www.albinoblacksheep.com/flash/curveball.php - inactive, on 10/12/2007, -0/+0i have no idea how to beat it.... i feel like a 'tard
+digg. if it stumps me, its good - nonex, on 10/12/2007, -0/+0I want my 20 minutes of life back.
- kaisho99, on 10/12/2007, -0/+0What kinda of masochist made this! ;)
- GTAcrimelord, on 10/12/2007, -0/+0Hmmm, 163 on first try. I guess I should have used that back button a couple of times. :)
- Th3_anOmoLy, on 10/12/2007, -0/+0for everyone that said "easy pattern"... I hate you....
for everyone that posted hints or solutions... I like you....
I'm flat out stupid with this stuff :P - kheno, on 10/12/2007, -0/+010 minutes... 161 moves, very difficult game
- joshsz, on 10/12/2007, -0/+0really a waste of time, it's just a pattern :P
- inactive, on 10/12/2007, -0/+0i got 161 on my second try >_> total of 5 minutes of my life wasted. nooo
- lemurballs, on 10/12/2007, -0/+0boring = cool...
- Backlash, on 10/12/2007, -0/+0My brain hurts 8|
- Anamith, on 10/12/2007, -0/+0This is a lot like Towers of Hanoi.
- kuchdawg, on 10/12/2007, -0/+0it doesn't crash firefox 1.5..atleast not for me :)
- int128, on 10/12/2007, -0/+0Anamith beat me to the comments, its solved much like the towers of hanoi.
- deveos, on 10/12/2007, -0/+0anywhere i can get a hint to get started?
- joelp, on 10/12/2007, -0/+0good game.
- mfearby, on 10/12/2007, -1/+1No digg. This is stupid because I can't solve it :-(
- HiddenLYNX, on 10/12/2007, -0/+0i right off knew it was like tower of hanoi, keyword Hanoi in the game. i got it in the minimum number of turns after a couple restarts
- blijack, on 10/12/2007, -0/+0simple pattern?
- szym, on 10/12/2007, -0/+0hanoi repetitive scheme. done in 3 minutes
- Crossmenjeff, on 10/12/2007, -0/+0this is pretty easy. you just gotta undo everything you do while taking baby steps to get it in 161
- brucebeh, on 10/12/2007, -0/+0wow this is stupid and hard
- Philbert, on 10/12/2007, -0/+0This gave me a headache, so I looked up this Towers of Hanoi everyone's talking about. I figured that out in a few seconds, what gives?
- inactive, on 10/12/2007, -0/+0Can you say Towers of Hanoi? Took minimum number of moves first time, like 2-3min. Same simple pattern over and over, waste of time, no digg
- Sippi, on 10/12/2007, -0/+0First time I did it in 162, second time 161....in 10 mins
- TheGeek27, on 10/12/2007, -0/+0Cake.
161 first time.
4, maybe 5 minutes. - xavi, on 10/12/2007, -0/+0getting 161/161 was extremely tedious and not very stimulating...
I thought there were going to be more levels with better puzzles, so disappointing...
~no digg - newbietheatre, on 10/12/2007, -0/+0337 moves and I still haven't finished. Wow. I didn't think I would suck so much at this game. Hah.
- raven_gm, on 10/12/2007, -0/+0Ouch. The concept is cool, but it takes to long to do. I finished it in 168 moves.
- Zeusandhera, on 10/12/2007, -0/+0I win... 161 moves... now what...
- umdigger, on 10/12/2007, -0/+0Eh, I got 163, first try with a few mishaps in the begining.
- noahking, on 10/12/2007, -0/+0Solution: There is only one move to be made as your first move. Make it.
From there on, there should also only be one move that doesn't take you to a previously used configuration. Take that move.
Really, it's fairly obvious. - shoota, on 10/12/2007, -0/+0161 first time, its kinda like an insertion sort in a way.
- cheftony, on 10/12/2007, -0/+0cool... but maybe it's just too late to stress on this one... cheflife on itunes
- eklitzke, on 10/12/2007, -0/+0Even though it's trivial once you get the pattern, it's kind of fun. Good waste of time. I wish they had one with more blocks :-)
- dylanA, on 10/12/2007, -0/+0done after 161 moves
- JibberJabber, on 10/12/2007, -0/+0A lot more sliding block puzzles from the same site.
http://www.johnrausch.com/SlidingBlockPuzzles - danmanx, on 10/12/2007, -0/+0Wow. I'm kinda bored after 2 moves. LOL
- ephemeral, on 10/12/2007, -0/+0It's painful. Even when you can see how to work it, the work to do it is awful. The trick is you have to keep moving the same objects over and over and over over and over and over over and over and over over and over and over over and over and over over and over and over over and over and over... well you get the point. =)
- citrusfizz, on 10/12/2007, -0/+0ummm... that was cool did i just have sex?
- Abx0r, on 10/12/2007, -0/+0Beat it with 161 steps :)
- jrclements, on 10/12/2007, -0/+0i didn't have any problems with firefox 1.5 either. and this isn't exactly towers of hanoi because there is a space constraint issue. this takes a minimum of 161 moves to complete, where a 5-disk hanoi problem would only take 31 moves.
- Leadhyena, on 10/12/2007, -0/+0>>161 first time, its kinda like an insertion sort in a way.
Well, not really. In computer science terms the insertion sort is O(n^2) time. In other words, the time it takes to do an insertion sort depends quadratically on the number of things you sort. This puzzle, OTOH, requires O(3^n) steps. In other words, every time you add another plate it takes roughly three times the number of steps (think like this: to solve n+1 plates, you first move n plates to the bottom right, then move the last plate to the upper right, then move the n plates to the upper left, then move the last plate to the lower right, then move the n plates to the lower right. FYI... Steps(n+1)=3*Steps(n)+2, which solves as Steps(n)=2*3^n-1 and Steps(n) is O(3^n).)
In layman's terms, it's quite a bit slower, even slower than the original Towers of Hanoi. - nadeau, on 10/12/2007, -0/+0After succeeding with only 161. I was hopping for a "level 2" with one more tiles.
-
Show 51 - 76 of 76 discussions
© Digg Inc. 2009
— Content created and posted by Digg users is