tablebase
A precomputed database that contains the perfect outcome and best moves for all chess positions with a given small number of pieces, built by retrograde (backward) analysis.
As defined in Garry Kasparov
Where it comes up · 1
- Garry Kasparov2 claims
Most important claims · 2 of 2Search all claims for “tablebase” →
- Tablebase analysis reveals seven-piece positions with forced wins requiring up to 500 moves, and even a decent grandmaster cannot perceive any pattern in the first 400 moves of such play—raising the unanswered philosophical question of how shallow the average 50-move human game really is, suggesting humans are nearly clueless about the true depth of chess.Garry Kasparov
- Chess is a mathematically near-infinite game—the number of legal positions exceeds the atoms in the solar system—so machines cannot solve it forward from move one, but they can solve it backward from the end, having already mathematically solved all positions with four, five, six, and now (in progress) seven pieces, with eight pieces requiring an insane amount of data and 32-piece full solution remaining impossible even with twenty years of expected computing power.Garry Kasparov