Changes

Jump to: navigation, search

Endgame Tablebases

11 bytes added, 10:36, 12 June 2021
Purposes
=Purposes=
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.
An EGTB can help to solve this period. It is a kind of a dictionary of all endgame positions which can answer immediately for a given position:
The main advantages of using EGTBs:
* 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
The main disadvantages of using EGTBs:

Navigation menu