#Linear equation 2048 online game series

In this post, we’ll answer that question by modeling the game of 2048 as a Markov chain and analyzing it to show that, no matter how well the player plays, the number of moves required to win the game is at least 938.8 on average. Next: Counting States with Combinatorics.Īs part of a recent revamp, 2048’s “You win!” screen started reporting the number of moves it took to win, which made me wonder: how many moves should it take to win?

#Linear equation 2048 online game series

After discussing the second insight tomorrow, we’ll be ready to discuss the algebra of 2048.Įnter your email address to follow this blog and receive notifications of new posts by email.There was some lively discussion about this series on Hacker News. This way of thinking about the game… how many points were added for making each tile on the final board… is one of two insights necessary to use algebra to solve for the prior history of the game. So the total score is 4 points from making 4-tile on the final board and 16+16+8 = 40 points from making the 16-tile on the final board, for a total of 44 points. The other two four tiles were introduced by the computer (on steps 0 and 3) and were moved around the board prior to combining with another 4-tile. Two of the four tiles were formed by adding two 2-tiles (on steps 3 and 6). Net contribution:, or another 16 points. Net contribution: 16 points.Įach of these 8-tiles were formed by adding two 4-tiles (one on Step 4, the other on Step 7). To begin, this 16-tile was formed from adding two 8-tiles on Move 8. Handling the one 16-tile on the final board is a little more interesting.

In this case, we see that this particular 4-tile was indeed formed by adding two 2-tiles on Move 8. The one 4-tile on the final board (marked with a green circle) hypothetically could have either been a new tile that was introduced by the computer or else formed by combining two 2-tiles. (The second insight will be discussed in tomorrow’s post.) To study this question, let’s begin with the final board (with a score of 44 points) and look at how the tiles on the final board were formed.Ĭlearly, the three 2-tiles do not contribute anything to the final score. In this post, I introduce the first of two insights that will allow us to answer these questions using algebra. I’ve included black circles to highlight the new 2-tiles and 4-tiles that are placed with each successive move, and I’ve added dark red ovals to indicate when two tiles are about to be combined in the next move.Ĭlearly, for these 9 moves, the computer introduced nine 2-tiles and two 4-tiles (including the two tiles that began the game in the initial position.) So here’s the question: is there a way, from looking only at the final board (with three 2-tiles, one 4-tile, and one 16-tile) and without looking at any of the prior history of the game, to calculate the number of 2-tiles and 4-tiles that were introduced? To study this question, here’s a graphic showing the first nine moves in a typical game of 2048. In this series of posts, I consider how algebra can be used to answer a question about the 2048 game: From looking at a screenshot of the final board, can I figure out how many moves were needed to reach the final board? Can I calculate how many new 2-tiles and 4-tiles were introduced to the board throughout the course of this game?