There are more possible chess games than atoms in the observable universe.

A Number So Big It Breaks Your Brain

Chess looks simple enough on the surface — 64 squares, 32 pieces, a rulebook you can learn in an afternoon. But hiding inside that modest little board is a level of complexity that genuinely dwarfs the physical universe. Not metaphorically. Mathematically.

The key figure here is something called the Shannon number, named after Claude Shannon, the American mathematician and electrical engineer who essentially invented information theory. In 1950, Shannon published a landmark paper on programming a computer to play chess, and as part of that work, he estimated the number of possible chess games at around 10¹²⁰. That's a 1 followed by 120 zeros.

How Does That Compare to the Universe?

Physicists estimate there are roughly 10⁸⁰ atoms in the observable universe. That's every atom in every star, planet, gas cloud, and grain of cosmic dust we can detect — an incomprehensibly large number. And yet, 10¹²⁰ is 10⁴⁰ times larger than that. You could assign a unique chess game to every atom in the universe and still have unimaginably more games left over.

To put it another way: if every atom in the observable universe were itself an entire observable universe, you'd still fall short of the number of possible chess games.

Why Are There So Many Possible Games?

It comes down to branching choices. On the very first move, White has 20 options. Black responds with 20 of their own. That's already 400 possible positions after just one move each. By move three, you're looking at over 9 million possible game states. The branching never really slows down.

Shannon's estimate accounts for an average game lasting about 40 moves per side, with roughly 30 possible moves available at each turn. Run those numbers through the exponent and you arrive at that staggering 10¹²⁰ figure. It's considered a conservative lower bound — some estimates go even higher.

The Game Tree vs. Unique Positions

It's worth noting a distinction: the Shannon number counts games (sequences of moves), not unique board positions. The number of distinct positions is smaller — around 10⁴⁴, according to later research. That's still astronomically large, but it's the game sequences — the paths taken to reach those positions — that truly explode in number.

Why Does This Matter?

This is exactly why chess computers can't simply "solve" chess the way they can solve tic-tac-toe. Even the most powerful AI, like DeepMind's AlphaZero or Stockfish, can't evaluate every possible game. Instead, they use clever search algorithms, pruning branches that are obviously bad and focusing computational power where it counts most.

Chess has been played for roughly 1,500 years. Millions of games have been recorded. And humanity has still barely scratched the surface of what's possible on that 64-square board.