Mathematicians usually distinguish between two related ideas in this question: how many possible positions can occur, and how many possible games (move sequences) there are. Both numbers are mind‑bogglingly huge, and only estimates are known.

Quick Scoop

  • There are an estimated 104310^{43}1043 to 104710^{47}1047 legal chess positions, depending on details of how promotions, castling rights, and impossible histories are counted.
  • The number of possible distinct chess games is not known exactly, but a famous lower‑bound estimate by Claude Shannon puts the “game tree complexity” around 1012010^{120}10120, often called the Shannon number.
  • Some authors and popular articles quote even larger rough estimates, such as 10105010^{10^{50}}101050 or around 10100,00010^{100{,}000}10100,000, to illustrate that the true count of all legal move sequences is far beyond what could ever be enumerated.

Positions vs. Games

  • Positions : A position is a single arrangement of pieces on the board with side to move and auxiliary info like castling and en‑passant rights. Estimates using combinatorics and rule constraints (e.g., pawn structure, legal king placements) lead to around 1043–104710^{43}–10^{47}1043–1047 possible legal positions.
  • Games (move sequences) : A game is a sequence of legal moves from the starting position until it ends. Because each move can branch into many replies, the number of possible games explodes enormously with length, giving the classic Shannon estimate of about 1012010^{120}10120 for “typical” games and far bigger counts if extremely long, contrived games are allowed.

Early‑Move “Combinations” (Intuition)

To build some intuition, people sometimes look at just the first few moves from the starting position.

  • After White’s first move and Black’s reply, there are 400 distinct possible positions: 20 legal first moves for White times 20 replies for Black.
  • After only a couple more moves each, the number of distinct games and positions already jumps into the hundreds of thousands, then millions, showing how quickly the tree of possibilities explodes.

Why We Only Have Estimates

  • The rules of chess (especially promotions, repetitions, and the 50‑move rule) make exact counting extremely complex, so researchers usually work with bounds and approximations rather than a precise final figure.
  • Experts in game‑tree complexity generally agree on two main points:
    • The number of legal positions is enormous but finite.
    • The number of possible games is so astronomically large that computing it exactly is effectively impossible with any realistic resources.

TL;DR : There are roughly 1043–104710^{43}–10^{47}1043–1047 legal chess positions, while the number of possible games is at least around 1012010^{120}10120 and likely vastly larger; no exact total is known.

Information gathered from public forums or data available on the internet and portrayed here.