2048 belongs to the family of sliding tile puzzles, a class of combinatorial puzzles with deep roots in mathematics and game theory. Created by Gabriele Cirulli in 2014, the game is played on a 4x4 grid where tiles bearing powers of two are combined by sliding in one of four cardinal directions. When two tiles of the same value collide, they merge into a single tile with double the value. The scoring system is elegantly mathematical: each merge awards points equal to the value of the newly created tile. This means creating a 2048 tile from scratch requires a cumulative score contribution from every merge along the way, and the theoretical maximum score on a 4x4 board is 3,932,156.

From a game theory perspective, 2048 is a single-player stochastic game because after each move a new tile (either a 2 with 90% probability or a 4 with 10% probability) appears in a random empty cell. This randomness means no deterministic strategy guarantees a win, but probabilistic and heuristic strategies can dramatically improve outcomes. The most well-known heuristic is the corner strategy: keep your highest-value tile locked in one corner and build a monotonically decreasing sequence of tiles along the edges. This approach minimizes the chance of stranding high-value tiles in inaccessible positions.

Mathematically, the state space of 2048 is enormous. Each cell can hold one of roughly 17 different values (empty, 2, 4, 8, ... up to 131072), giving an upper bound of approximately 18^16 possible board states, though most are unreachable. Researchers have applied expectimax search algorithms, which evaluate moves by computing expected values over all possible random tile placements, to play 2048 at near-optimal levels. AI implementations using expectimax with depth-limited search and carefully tuned heuristic evaluation functions (rewarding monotonicity, smoothness, and empty cells) achieve the 2048 tile over 95% of the time and regularly reach 4096 or higher.

The puzzle also connects to the broader mathematical study of sliding block puzzles, which dates back to the 15-puzzle invented by Noyes Chapman in 1874. While the 15-puzzle involves permutations and parity, 2048 introduces merging mechanics that create a fundamentally different combinatorial structure, making it a unique and compelling subject for algorithmic analysis and recreational mathematics alike.