is an insanely addictive game. The objective is simple, bring the same powers of two together to add them together, and keep increasing the powers of until you reach and beyond.
The game starts with and tiles, popping up in different places of the grid.
To get to the tile requires finesse, and a slight bit of luck. In the best scenario, what is the least number of moves required to get the tile?
This problem is part of the Science of Apps! series
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Informal idea: Only 4's arrive, so 2048/4=512 and since you start with a block out, its actually 512−1=511 have to arrive and the last one needs to be combined lo g 2 5 1 2 2 0 4 8 i.e. 9 times to make the final 2048 block so a minimum of 520 moves are required, if a perfect game comes up and its perfectly set up when that last 4 comes out, so yes, 520 is the validated absolute minimum.