585
edits
Changes
→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 game can finish in this way but it is not in a perfect way: it takes much time to make move, use more moves than necessary. Sometimes the winning side may lose the change since the rule 50 moves. 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 directly or indirectly immediately for a given position:* If it is a draw or a win/loss* how How far/how many move from matting/being mated* what What is the best move
The main advantages of using EGTBs:
* It does not Engines don’t have search but retrieves data thus it they can move instantly
* The move is the perfect one, leading the shortest line to win
* Engines don’t need to have the code about those endgames or just some simple implementations
The main disadvantages of using EGTBs:
* Data Their data typically are too large for downloading and storing* If use when searching, it They may slow down the search* Require a complicated code codes for probing
=Data=
