Each turn, one 2 tile is added, and other tiles may be combined. So you can derive the move count by adding together the numbers on all the visible tiles and dividing by 2.
This would be cool. I think winning in the fewest moves would be the most impressive. i.e. how few tiles you 'waste'. Though winning with the lowest score may approximate this.
There's actually a semi-optimal strategy that nearly guarantees winning if you're diligent about it. Just build a stairstep pattern with the highest numbers in the bottom corner of the stairs. Then basically combine sideways and downward and "always" resist the temptation to push up. Its kind of how some tri-diagonal matrix algorithms work. The only problem is you have to be fastidious about never using the one direction you've reserved as your excluded case (Up in my example) as that can screw your staircase by putting a [2] right underneath your wonderful [1024]. Just move blocks back and forth, waiting for the right blocks to create combo patterns, while generally storing lower cost blocks on the outside of the stairs, and then snake them through the stairs when you get a chain set up.
I found one not-completely-horrible strategy was just blindly running round the curser keys.. eg. up - right - down - left, repeatedly. Got near 4000 points with that..
Great game though - wasted waaay too much time last night playing.
It's a good start but you will get stuck at higher level. in your case focus on increasing the value on the bottom left. When possible, shift the last line to the right. Never go up.
I was surprised at how well that worked. I was basically blindly cycling between left,down,right (with one accidental up) and got to 1024 on my first try.
With enough tries anything is possible. There is probably even a person who ascended nethack on his first try (using the wiki of course, we're still talking things with p > 0) and didn't play it again because it's too easy and boring.
If that's real, congrats! I had started doubting that anybody would ever win the game :P
It took me a few tries, but it's definitely winnable.
Do you have new numbers? I got a bunch of people addicted and I assume I'm not the only one.
Can you add in how many moves!!?
Each turn, one 2 tile is added, and other tiles may be combined. So you can derive the move count by adding together the numbers on all the visible tiles and dividing by 2.
4 replies →
This would be cool. I think winning in the fewest moves would be the most impressive. i.e. how few tiles you 'waste'. Though winning with the lowest score may approximate this.
Beat it! http://screencast.com/t/2b3zNbYy6HDi
http://www.screencast.com/t/NYuiFDueop8
:P I guess it was almost perfect attempt, and the quickest of mine so far (just a single 16 apart of 2048)
okay, and i win... and my record is 32768 score so what? it was fun) my screen: http://upload.freehacks.ru/MKPEP2 my implementation and guide you can found there: http://vk.cc/2nGPL3
Looks legit
I'm gonna call fake on this one.
There's actually a semi-optimal strategy that nearly guarantees winning if you're diligent about it. Just build a stairstep pattern with the highest numbers in the bottom corner of the stairs. Then basically combine sideways and downward and "always" resist the temptation to push up. Its kind of how some tri-diagonal matrix algorithms work. The only problem is you have to be fastidious about never using the one direction you've reserved as your excluded case (Up in my example) as that can screw your staircase by putting a [2] right underneath your wonderful [1024]. Just move blocks back and forth, waiting for the right blocks to create combo patterns, while generally storing lower cost blocks on the outside of the stairs, and then snake them through the stairs when you get a chain set up.
Ex:
x x x 2
x x 2 4
x 2 4 8
2 4 8 16
Did that, got stuck like that, pretty unfortunate.
http://puu.sh/7rKEF.png
After half an hour playing blindly I realized this, but even using this it´s hard to go beyond 500
I found one not-completely-horrible strategy was just blindly running round the curser keys.. eg. up - right - down - left, repeatedly. Got near 4000 points with that..
Great game though - wasted waaay too much time last night playing.
It's a good start but you will get stuck at higher level. in your case focus on increasing the value on the bottom left. When possible, shift the last line to the right. Never go up.
I was surprised at how well that worked. I was basically blindly cycling between left,down,right (with one accidental up) and got to 1024 on my first try.
2 replies →
Yes, I also discovered this after 20ish minutes of playing. If you're not diligent about it, it's very hard to recover.
1 reply →
With enough tries anything is possible. There is probably even a person who ascended nethack on his first try (using the wiki of course, we're still talking things with p > 0) and didn't play it again because it's too easy and boring.
I've seen that. Wiki, #nethack, valkyrie, and some decent but not extraordinary luck.