HOME | DD

Published: 2010-01-04 14:46:55 +0000 UTC; Views: 1855; Favourites: 5; Downloads: 8
Redirect to original
Description
Switch position of the two piles!Move the red pile to the left and the blue to the right!
A bigger object can't be placed on top of a smaller, so you need to move them in a specific order.
Related content
Comments: 17
FeelingVeryLucky [2010-02-09 23:28:29 +0000 UTC]
This was fun. It made me think. Took me 187 seconds to finish, with two steps and 3 pile size.
(Yeah, slow when compared to the other guy...)
👍: 0 ⏩: 1
Doodlz7 In reply to FeelingVeryLucky [2010-02-19 00:19:26 +0000 UTC]
holy crap it took me the exact same time to finish! *twilight zone theme plays*
👍: 0 ⏩: 1
ArtyomDesign [2010-01-20 06:21:34 +0000 UTC]
Woo! 88 seconds!
(with 2 steps and 3 pile size)
Awesome game!
👍: 0 ⏩: 1
wonderwhy-ER [2010-01-04 16:27:22 +0000 UTC]
Hmm. Somehow possibility to stack one size peaces on top of each other makes it too easy.
👍: 0 ⏩: 1
veclock In reply to wonderwhy-ER [2010-01-04 16:30:42 +0000 UTC]
Well they also need to switch places so therefore they must be able to be on top of one another.
👍: 0 ⏩: 1
wonderwhy-ER In reply to veclock [2010-01-04 16:41:35 +0000 UTC]
Yeah right... Hmm not shore how much harder it is then usual version. But it is at least a little. Just more moves. Also moving same size peaces in pairs seems to make it little bit easier.
👍: 0 ⏩: 1
veclock In reply to wonderwhy-ER [2010-01-04 16:48:34 +0000 UTC]
yes, I hope it's a bit harder. Do you know what the usual version is called btw?
👍: 0 ⏩: 1
wonderwhy-ER In reply to veclock [2010-01-04 18:32:56 +0000 UTC]
Towers of Hanoi This is classical task for recursion learning for programmers. How can I not remember that
👍: 0 ⏩: 1
veclock In reply to wonderwhy-ER [2010-01-04 18:44:19 +0000 UTC]
Seems like you can move them one or two steps in ToH, which would make my version even harder
👍: 0 ⏩: 0