Metraipolis › archive › dc_c06fc2033bd4
Solving chess — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Solving_chess
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-31T09:10:55.814Z
- SHA-256 of the archived text
b817cb461a835246251538504270b67cb26a0cd4503739ccd4404ceb300dfdef- Stable URL of this page
https://metraipolis.com/documento/dc_c06fc2033bd4
How to cite
Solving chess — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Solving_chess (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_c06fc2033bd4 (Metraipolis archive dc_c06fc2033bd4, sha256 b817cb461a835246251538504270b67cb26a0cd4503739ccd4404ceb300dfdef)
BibTeX
@misc{dcc06fc2033bd4,
title = {Solving chess — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Solving_chess},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_c06fc2033bd4; sha256 b817cb461a835246251538504270b67cb26a0cd4503739ccd4404ceb300dfdef},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Solving_chess. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Solving chess consists of finding an optimal strategy for the game of chess; that is, one by which one of the players (White or Black) can always force either a victory or a draw (see solved game). It is also related to more generally solving chess-like games (i.e. combinatorial games of perfect information) such as Capablanca chess and infinite chess. In a weaker sense, solving chess may refer to proving which one of the three possible outcomes (White wins; Black wins; draw) is the result of two perfect players, without necessarily revealing the optimal strategy itself (see indirect proof). No complete solution for chess in either of the two senses is known, nor is it expected that chess will be solved in the near future (if ever). Progress to date is extremely limited; there are tablebases of perfect endgame play with a small number of pieces (up to seven), and some chess variants have been solved at least weakly. Calculated estimates of game-tree complexity and state-space complexity of chess exist which provide a bird's eye view of the computational effort that might be required to solve the game. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «game theory»). Fonte: Wikipedia in inglese, voce «Solving chess» — https://en.wikipedia.org/wiki/Solving_chess Wikidata Q7559040: «finding an optimal strategy for playing chess» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7559040 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Solving_chess?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1381496275, consultata il 2026-10-31T08:59:01.410Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 8009c1062071c3e9220c32503587f4f36bbd56dd6fa5b272239e864a0269e051