Thanks to Eugene Nalimov, Andrew Kadatch, Robert Hyatt, Kyrill Kryukov, Nelson Hernandez for generating, compressing, and publishing the databases and offering them for free. Thanks to community support, the whole collection is now freely available online on eD2K/KAD network. In August 2006 the last 6-men tablebases were computed, completing the 3-to-6-men tablebase collection of about 1.2 Terabytes. At the same time Nalimov was continuing to release new 6-men tablebases that were now shared via this project. Many people joined contributing files they managed to save. In November 2005 several enthusiasts started a project to find and share all surviving tablebases. The only way to get them was by personal communication with other chess fans. 6-men tablebases were removed from FTP and disappeared from online space. Gradually Nalimov was releasing more and more gigabytes of 6-men tablebases and at some point Bob's FTP could not handle the load. Historically Nalimov Tablebases were computed by Eugene Nalimov and distributed by Robert Hyatt via FTP.
They provide a powerful analytical tool.Įndgame tablebases for other board games like checkers, chess variants or Nine Men's Morris exist, but without a specific mention of the game, one is talking about chess. Tablebases have enhanced competitive play and facilitated the composition of endgame studies. Some positions which humans had analyzed as draws were proved to be winnable the tablebase analysis could find a mate in more than a hundred moves, far beyond the horizon of humans, and beyond the capability of a computer during play. The solutions have profoundly advanced the chess community's understanding of endgame theory. Tablebases have solved chess for every position with six or fewer pieces (including the two kings). 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. An endgame tablebase is a computerized database that contains precalculated exhaustive analysis of a chess endgame position.
0 kommentar(er)
