From the standard starting position, White has 20 legal moves: each of eight pawns can advance one or two squares, and each knight has two destinations. After any of those moves, Black also has 20 legal replies, giving 400 two-ply move sequences.
Ask which quantity is being counted
A legal-move count concerns one position. A game-tree count concerns sequences of moves. A position count concerns board states, including information such as the side to move and castling or en passant rights where relevant.
Different sequences can reach the same position, so sequences and positions are not interchangeable. As the game develops, captures, checks, blocked pieces, and promotions change the number of available moves dramatically.
Why people use estimates
Popular enormous numbers about chess usually estimate a game tree or a set of possible positions. Their meaning depends on assumptions about game length, legality, and branching. A striking power of ten without those assumptions is not an exact count of “all chess moves.”
For practical play, you do not search the whole tree. You identify threats and useful candidate moves, then calculate forcing replies. That is one reason explanations and pattern recognition matter.
Make the count useful
In a puzzle, list the legal checks first, then captures and direct threats. This is a search aid, not a guarantee that the best move is forcing. Quiet defensive or preparatory moves may still be essential.
Count the first few levels carefully
| Length from the starting position | Legal move sequences |
|---|---|
| One ply: White’s first turn | 20 |
| Two plies: White and Black each move once | 400 |
| Three plies: White moves again | 8,902 |
The third count is not 20 × 20 × 20. White’s first move may have opened a bishop’s diagonal or the queen’s route, so the available choices depend on the path taken. These counts can be checked by generating every legal continuation to the stated depth; they are not estimates of complete games.
Two paths can reach the same board
Compare 1.Nf3 Nf6 2.Nc3 with 1.Nc3 Nf6 2.Nf3. The white knights arrive on the same squares in a different order. The pieces, side to move, and castling rights now match. There are two move sequences but one resulting arrangement with those legal possibilities.
This is called a transposition. It matters when counting positions and when learning openings: a different move order can lead to a familiar position. You should recognize the resulting board rather than assuming every different sequence is a different strategic problem.
What the famous enormous estimate means
Claude Shannon’s 1950 paper estimated a game-tree scale around 10¹²⁰ using rough assumptions about choices and game length. It illustrates the scale of exhaustive search; it is not an exact census of distinct legal positions or a count of the moves available in one position.
For a human player, the practical response is selective attention. Identify the opponent’s threat, choose useful candidates, and calculate the forcing replies. A principle helps you decide where to look, while concrete analysis decides whether a candidate works.
Your turn
Pause. Think. Explain.
Why does 20 multiplied by 20 describe the first two plies, but not every later pair of moves?
Reveal the explanation
Both sides have exactly 20 legal options at the start of the game, but later positions have different move counts. Development opens lines, checks restrict choices, and captures remove pieces, so the branching factor changes.
Sources & further reading
Original explanation and exercise by ChessTrainer Academy. Linked sources support the historical, rules, or product details.
Take it to the board
One idea. A whole game to find it in.
Choose a complete game, hide the next move, and explain your candidate before you reveal it.
Explore the game library