Capture-Quiet Decomposition is a theorem showing that a chess endgame WDL labeling is correct exactly when terminals are right, captures match smaller verified subgames, and quiet positions are retrograde-consistent.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Capture-Quiet Decomposition: A Verification Theorem for Chess Endgame Tablebases
Capture-Quiet Decomposition is a theorem showing that a chess endgame WDL labeling is correct exactly when terminals are right, captures match smaller verified subgames, and quiet positions are retrograde-consistent.