Global Information Lookup Global Information

Endgame tablebase information


A typical interface for querying a tablebase

In chess, the endgame tablebase, or simply tablebase, is a computerised database containing precalculated evaluations of endgame positions. Tablebases are used to analyse finished games, as well as by chess engines to evaluate positions during play. Tablebases are typically exhaustive, covering every legal arrangement of a specific selection of pieces on the board, with both White and Black to move. For each position, the tablebase records the ultimate result of the game (i.e. a win for White, a win for Black, or a draw) and the number of moves required to achieve that result, both assuming perfect play. Because every legal move in a covered position results in another covered position, the tablebase acts as an oracle that always provides the optimal move.

Tablebases are generated by retrograde analysis, working backward from checkmated positions. By 2005, tablebases for all positions having up to six pieces, including the two kings, had been created.[1] By August 2012, tablebases had solved chess for almost every position with up to seven pieces, with certain subclasses omitted due to their assumed triviality;[2][3] these omitted positions were included by August 2018.[4] As of 2024, work is still underway to solve all eight-piece positions.

Tablebases have profoundly advanced the chess community's understanding of endgame theory. Some positions which humans had analysed as draws were proven to be winnable; in some cases, tablebase analysis found a mate in more than five hundred moves, far beyond the ability of humans, and beyond the capability of a computer during play. This caused the fifty-move rule to be called into question, since many positions were discovered that were winning for one side but drawn during play because of this rule. Initially, some exceptions to the fifty-move rule were introduced, but when more extreme cases were later discovered, these exceptions were removed. Tablebases also facilitate the composition of endgame studies.

While endgame tablebases exist for other board games, such as checkers,[5] nine men's morris,[6] and some chess variants,[7] the term endgame tablebase is usually assumed to refer to chess tablebases.

  1. ^ Hayworth, G. McC. (September 2005). "6-Man Chess Solved". ICGA Journal. 28 (3): 153.
  2. ^ "Endgame Tablebases". Chess Programming Wiki.
  3. ^ "Lomonosov Endgame Tablebases". ChessOK.
  4. ^ Cite error: The named reference lichess.org was invoked but never defined (see the help page).
  5. ^ Gilbert, Ed. "Kingsrow". edgilbert.org. Retrieved 19 March 2023. Website of KingsRow about the creation of a tablebases for 8x8 and 10x10 checkers
  6. ^ Ralpf Gasser (1996). "Solving nine men's morris" (PDF). Archived from the original (PDF) on 24 July 2015. Retrieved 13 April 2011.
  7. ^ "Gothic Chess Javascript Endgames". gothicchess.com. 27 September 2011. Archived from the original on 27 September 2011. examples of long endings for Capablanca chess

and 27 Related for: Endgame tablebase information

Request time (Page generated in 0.7813 seconds.)

Endgame tablebase

Last Update:

chess, the endgame tablebase, or simply tablebase, is a computerised database containing precalculated evaluations of endgame positions. Tablebases are used...

Word Count : 6383

Chess endgame

Last Update:

reach an endgame; some of them end earlier. All chess positions with up to seven pieces on the board have been solved by endgame tablebases, so the outcome...

Word Count : 7772

Solving chess

Last Update:

possibilities. 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...

Word Count : 1574

Computer chess

Last Update:

years, other endgame database formats have been released including the Edward Tablebase, the De Koning Database and the Nalimov Tablebase which is used...

Word Count : 13447

Ken Thompson

Last Update:

encoding, and his work on computer chess that included the creation of endgame tablebases and the chess machine Belle. He won the Turing Award in 1983 with...

Word Count : 2505

Pawnless chess endgame

Last Update:

construction of endgame tablebases. Grandmaster John Nunn wrote a book (Secrets of Pawnless Endings) summarizing the research of endgame tablebases for several...

Word Count : 7112

Evaluation function

Last Update:

engines frequently use endgame tablebases in their evaluation function, as it allows the engine to play perfectly in the endgame. Historically, evaluation...

Word Count : 2438

Solved game

Last Update:

benefit from solutions of the game from certain endgame positions (in the form of endgame tablebases), which will allow it to play perfectly after some...

Word Count : 2665

Alexey Troitsky

Last Update:

involves analyzing the endgame with two knights versus a pawn, see Troitsky line. John Nunn analyzed this endgame with an endgame tablebase and stated that "the...

Word Count : 362

Searching for Bobby Fischer

Last Update:

Nd7 and 3...Bxf6 hold the draw. (ii) the modern Lomonosov 7-piece endgame tablebase shows White has a win after 4...Bxf6 with 5.Re2+, sacrificing White's...

Word Count : 2239

Chess engine

Last Update:

engines use endgame tablebases to increase their playing strength during the endgame. An endgame tablebase includes all possible endgame positions with...

Word Count : 3661

Queen and pawn versus queen endgame

Last Update:

three books based on the most important endgames in the five-piece endgame tablebases but omitted this endgame because "... it proved too hard to understand"...

Word Count : 2509

Glossary of chess

Last Update:

system. endgame The third and last phase of the game, when there are few pieces left on the board. The endgame follows the middlegame. endgame tablebase A computerized...

Word Count : 24673

Chess endgame literature

Last Update:

constructing endgame tablebases. Some endgame books are general works about many different kinds of endgames whereas others are limited to specific endgames such...

Word Count : 4290

Two knights endgame

Last Update:

Troitsky line] and above". John Nunn analyzed the endgame of two knights versus a pawn with an endgame tablebase and stated that "the analysis of Troitsky and...

Word Count : 3326

Chess

Last Update:

published a tablebase for select six-piece endgames, and by 2005, following the publication of Nalimov tablebases, all six-piece endgame positions were...

Word Count : 17523

Chess theory

Last Update:

Pawnless chess endgame § Minor pieces only and Chess endgame § Effect of tablebases on endgame theory). Several important works on the endgame have been published...

Word Count : 5371

Combinatorial explosion

Last Update:

October 2013. http://chessok.com/Lomonosov Endgame Tablebases Lomonosov Endgame Tablebases "7-piece-endgame-tablebase (chess)". Stack Exchange. Aviezri Fraenkel;...

Word Count : 1234

Kasparov versus the World

Last Update:

became simple enough to use an endgame tablebase. As of October 1999, however, there were no seven-piece endgame tablebases, and seven pieces remained in...

Word Count : 7235

Combinatorial game theory

Last Update:

where players attempt to establish connections Endgame tablebase, a database saying how to play endgames Expectiminimax tree, an adaptation of a minimax...

Word Count : 3198

ChessBase

Last Update:

contain data from prior games and provide engine analyses of games. Endgame tablebases are also provided by the company. ChessBase's Indian YouTube channel...

Word Count : 1665

Syzygy

Last Update:

Syzygy, in biology, the pairing of chromosomes during meiosis Syzygy endgame tablebases, used by chess engines Syzygy, a concept in the philosophy of Vladimir...

Word Count : 471

Outline of chess

Last Update:

passed pawns – both its own pawns and the opponent's. Endgame tablebase – computer database of endgame positions giving optimal moves for both sides and the...

Word Count : 9987

Rook and bishop versus rook endgame

Last Update:

hardest endgames to draw." Being a five-piece endgame, the rook and bishop versus rook endgame has been fully analysed using computers. Endgame tablebases show...

Word Count : 2851

Universal Chess Interface

Last Update:

responsibility for handling endgame tablebases, this is arguably better handled in the engine itself, as having tablebase information can be useful for...

Word Count : 465

MuZero

Last Update:

trained via self-play, with no access to rules, opening books, or endgame tablebases. The trained algorithm used the same convolutional and residual architecture...

Word Count : 1211

List of chess software

Last Update:

Comparison of chess video games Computer chess Computer Olympiad Endgame tablebase List of Internet chess servers Software for handling chess problems...

Word Count : 406

PDF Search Engine © AllGlobal.net