![]() ![]() The solutions have profoundly advanced the chess community's understanding of endgame theory. By August 2012, tablebases had solved chess for every position with up to seven pieces (the positions with a lone king versus a king and five pieces were omitted because they were considered uninteresting). By 2005, all chess positions with up to six pieces (including the two kings) had been solved. Tablebases are generated by retrograde analysis, working backwards from a checkmated position. ![]() Typically the database records each possible position with certain pieces remaining on the board, and the best moves with White to move and with Black to move. Thus, the tablebase acts as an oracle, always providing the optimal moves. The tablebase contains the game-theoretical value (win, loss, or draw) of each possible move in each possible position, and how many moves it would take to achieve that result with perfect play. It is typically used by a computer chess engine during play, or by a human or computer that is retrospectively analysing a game that has already been played. ![]() A typical interface for querying a tablebaseĪn endgame tablebase is a computerized database that contains precalculated exhaustive analysis of chess endgame positions.
0 Comments
Leave a Reply. |