Chess Game Endings: A Complete Analysis

1. Game Ending Categories (By Rules)

Chess games can end in 13 distinct ways according to FIDE rules:

Wins (6 ways)

1. Checkmate - King is in check with no legal moves
2. Resignation - Player concedes defeat
3. Timeout (with sufficient mating material) - Time expires and opponent has mating material
4. Forfeit - Player doesn't appear or violates rules
5. Win on time (flagfall) - In increment games when opponent has no mating material but you do
6. Opponent's illegal move - In some rule sets (2 illegal moves = loss)

Draws (7 ways)

1. Stalemate - No legal moves but not in check
2. Agreement - Both players agree to draw
3. Threefold repetition - Same position occurs 3 times (can be claimed)
4. Fivefold repetition - Automatic draw after 5 repetitions
5. Fifty-move rule - 50 moves without capture or pawn move (can be claimed)
6. Seventy-five-move rule - Automatic draw after 75 such moves
7. Insufficient material - Neither side can checkmate (e.g., K vs K, K+B vs K)
8. Timeout with insufficient material - Time expires but opponent cannot mate
9. Dead position - No sequence of legal moves leads to checkmate

(Note: Some of these overlap conceptually but are distinct under different rule contexts)

2. Total Possible Final Positions

This is a fascinating mathematical question with no exact answer, but here's what we know:

The Complexity

Total legal chess positions (not just final ones):

• Lower bound: ~10^40 positions
• Upper bound: ~10^50 positions
• Shannon Number: Claude Shannon estimated ~10^43 reachable positions

Why It's Hard to Calculate

1. Promotion ambiguity: You can have 9 queens of the same color, making piece distributions complex
2. En passant status: Must track if en passant is legal
3. Castling rights: Four independent castling possibilities
4. Turn to move: Affects legality
5. Reachability: Not all arrangements are reachable through legal play

Final Positions Specifically

For checkmate positions alone:

• Estimated 10^37 to 10^40 distinct checkmate positions
• No one has enumerated them all

For all final positions (including stalemates, draws by insufficient material):

• Likely in the range of 10^38 to 10^42
• This includes:
  • All checkmate patterns
  • All stalemate patterns
  • All insufficient material configurations
  • All "dead position" arrangements

What Makes This Tractable (in Theory)

Endgame tablebases have solved all positions with ≤7 pieces:

• 3-6 piece tablebases: Completely solved (billions of positions)
• 7-piece tablebase: ~500 TB of data, solved by Lomonosov
• These contain all final and pre-final positions for their piece counts

Key Studies

1. Tromp & Flikweert (2015): Estimated upper bounds on chess positions
2. Lomonosov Tablebases: Solved all 7-piece endgames
3. Various computer science papers: Analyzed position complexity

Why We Can't Give an Exact Number

• Combinatorial explosion beyond 7-8 pieces
• Storage requirements (7-piece = 140 TB compressed)
• Computational limits (8-piece would require exabytes)
• Distinguishing "final" from "pre-final" positions requires game-tree analysis

Summary

• Rule categories: ~9-13 distinct ending types depending on how you categorize
• Final positions: Unknown exactly, but estimated 10^38-10^42, with checkmates alone being ~10^37-10^40
• Solved exactly: Only for ≤7 pieces through tablebases

The question remains one of the beautiful unsolved counting problems in chess mathematics!