1. Full Chess
The normal starting position of chess is fully solved.
No, full chess is not solved. Engines are incredibly strong, and tablebases give perfect answers in small endgames, but nobody has proved the perfect result from the normal starting position.
Full chess: not solved from the starting position.
Endgames: many small-piece positions are solved by tablebases, especially up to seven pieces.
Main warning: a strong engine move is not the same thing as a proof of perfect play.
Judge each statement as correct or incorrect. The Completed bar fills green for correct answers and red for incorrect answers.
1. Full Chess
The normal starting position of chess is fully solved.
2. Tablebases
Some small endgames are solved by tablebases.
3. Engines
A very strong engine evaluation proves chess is solved.
4. Proof
To solve chess, we would need a proof of the perfect-play result.
5. Perfect Draw
Everyone knows by proof that perfect chess is a draw.
6. AI
AlphaZero or modern AI solved the whole game of chess.
7. Deterministic
A game can have fixed rules and still be unsolved.
8. One Position
A forced mate can solve one position without solving all of chess.
No. Full chess is not solved because we do not have a proof of the perfect result from the starting position.
Solved means the game result under perfect play is known, usually with a proof and perfect moves for the relevant positions.
No. We do not know by proof whether the starting position is a forced win for White, a draw or something else under perfect play.
Many players suspect perfect chess may be a draw, but suspicion and engine experience are not the same as a proof.
Yes. Endgame tablebases solve many positions with a small number of pieces by direct calculation.
Tablebases are databases that store the exact win, draw or loss result for endgame positions within their piece limit.
Common modern tablebases cover positions with up to seven pieces, counting both kings.
No. The opening position has all 32 pieces, far beyond current tablebase coverage.
Yes. Positions within seven-piece tablebase coverage have exact win, draw or loss answers.
No. A tablebase looks up a known result rather than searching like a normal engine.
No. Engines are extremely strong, but a strong evaluation is not a mathematical proof of the whole game.
Stockfish can analyse positions very deeply, but it has not solved full chess from the starting position.
No. AlphaZero showed powerful self-learning play, but it did not prove the result of perfect chess.
No. AI can improve analysis and play, but solving chess requires proof across the game tree.
Chess has an enormous number of possible positions and move sequences, so proving every relevant line is far beyond ordinary analysis.
No. Perfect information means both players can see the whole position; solved means the perfect-play result is known.
No. Chess has deterministic rules, but deterministic games are not automatically solved.
Yes. A game can have fixed rules and still be too complex to solve completely.
Checkers is famously solved, but that does not mean chess is solved too.
Yes. Tic-tac-toe is small enough that perfect play is known, unlike full chess.
Not necessarily. Even solved games can still be enjoyable for humans, but full chess is not solved anyway.
In tablebase positions a human can look up perfect answers, but full games are far too complex for perfect human play.
No. Opening books collect strong practical lines, but they do not prove the perfect result of chess.
A forced mate solves that specific position, not the entire game of chess.
Usually yes in a narrow sense: a puzzle has a known best tactic or solution, but that is not the same as solving chess.
It may be theoretically possible, but the full game is so large that a complete solution is not expected soon.
It would tell us the perfect-play result from the starting position and the correct play needed to reach that result.
No. An engine evaluation is a strong practical judgement, while a solution requires proof.
The best answer is no: full chess is not solved, although some endgames are solved by tablebases.
Read the deterministic chess page for fixed rules or the perfect-information page for what both players can see.
A useful analysis habit is to separate strong engine suggestions from proved answers.
or create a ChessWorld username
Already have an account? Log in