Changes

When a [[Chess Game|chess game]] goes to the [[Endgame|endgame]] phase, it may complete soon with the result as a draw or a win/loss. Both human/chess engines can finish the endgame by continuing searching, applying some endgame rules. The Even the game can finish in this way but it is not in a perfect way: it takes much time to make movecompute moves, may use more moves than necessary. Sometimes the winning side may lose the change since the rule 50 movesand/or making blunders. Both human and chess engines may miss badly the chances if they don’t know or not good enough about the endgame they are playing.

* Engines don’t have to search but retrieves data thus they can move instantly* The move is Moves are the perfect oneones, leading the shortest line to win* Engines don’t need to have the knowledge and code about those endgames or just some simple implementations

An EGTB is a set of endgames. Each endgame is a set of records about positions’ information. All involving positions in an endgame must have the same material. Each Typically each position 's record associates with an integer number which informs how far that position is from mating/being mated or converting (depends on the type of its metrics).

Based on values of those integer numbers it can answer directly two questions of the EGTB: 1) for a given position it is a draw or a win/loss position and 2) how far it is from mating/being mated or converting. From those numbersTo answer the 3rd question, the best move of a position can be indirectly calculated as below part mentions: generate all legal moves, make them, probe all new positions, compare probing scores for the highest one and the associated move is the best one.

Theoretically, we can add more information to each position’s record. However, due to large numbers of involving positions, any additional information may make the whole EGTB becomes significantly larger. Thus so far none of popular EGTBs store any extra information for each item and each record their records actually contains that integer contain those integers only.

Those arrays of an endgame can be stored in files. Typically each array is stored in one file. However, sometimes they can be combined into one larger file or splitted into more files to easier copy or manage. Those files may be in the form of none compressed or compresseduncompressed forms. If they are compressed, they are typically divided and compressed by small blocks thus they don't need to load and decompress all data to extract just a position.

* [[Christoph Wirth]], [[Jürg Nievergelt]] ('''1999'''). ''Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.'' [[ICGA Journal#22_2|ICCA Journal, Vol. 22, No. 2]]<ref>[http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=2923 Chris Wirth's endgame tablebases] by [[Denis Mendoza|Denis P. Mendoza]], [[Computer Chess Forums|CCRL Endgame Tablebases]], December 13, 2007 » [[Chessterfield]]</ref>

* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=76089 Asynchronous tablebase lookups] by [[Steinar H. Gunderson|Sesse]], [[CCC]], December 17, 2020 <ref>[https://kernel.dk/io_uring.pdf?source=techstories.org io_uring.pdf]</ref>'''2021'''* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=76089 Asynchronous tablebase lookups76659 Stalemate Tablebases] by Dries De Clercq, [[Steinar HCCC]], February 21, 2021 » [[Stalemate]]* [http://www.talkchess.com/forum3/viewtopic. Gunderson|Sessephp?f=7&t=77249 knbk DTM] by [[Martin Sedlak]], [[CCC]], December 17May 05, 2020 <ref>2021 » [[KBNK Endgame]], [[#DTM|DTM]]: [httpshttp://kernelwww.talkchess.dkcom/forum3/io_uringviewtopic.pdfphp?sourcef=7&t=77249&start=techstories4 Re: knbk DTM] by [[Harm Geert Muller]], [[CCC]], May 05, 2021 » [[Marcel van Kervinck|Marcel van Kervinck's]] pretty fast kbnk generator* [http://www.talkchess.org io_uringcom/forum3/viewtopic.pdfphp?f=7&t=77899 tablebase neural nets] by [[Robert Pope]], [[CCC]], August 07, 2021 » [[Neural Networks]]</ref>