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

Sit down at a chessboard and you are staring into a number so large the universe can’t keep up. In 1950, mathematician Claude Shannon worked out a rough lower bound for how many distinct games of chess are possible. His logic was simple: a typical position offers about 30 legal moves, so one move by White followed by one by Black yields roughly 1,000 possibilities, and a typical game runs about 40 such move-pairs.

Multiply that out — 1,000 raised to the 40th power — and you land on his famous estimate.

“There will be 10^120 variations to be calculated from the initial position.”

That figure, now called the Shannon number, is 10^120: a 1 followed by 120 zeros. Shannon wasn’t trying to dazzle anyone; he was making a sober point that no computer could ever solve chess by brute force. By his own reckoning, a machine examining one line every microsecond would still need more than 10^90 years to choose its first move — vastly longer than the universe has existed. It was, in effect, a proof that good chess would have to come from clever judgment, not exhaustive calculation, a conclusion that shaped the whole field of computer chess that followed.

Now set that against the cosmos. Cosmologists estimate the observable universe holds only about 10^80 atoms — the mass-energy within our horizon works out to roughly 10^79 protons. So the number of possible chess games doesn’t merely exceed the atom count; it overwhelms it by a factor of around 10^40, a gap so vast that if every atom in the universe were itself a whole universe of atoms, you still wouldn’t have enough to match the games.

All of that combinatorial immensity, hiding inside a quiet wooden box of 32 pieces.