585
edits
Changes
→Data
An EGTB is a set of endgames. Each endgame is a set of positions (they must have the same material). Each position 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). All numbers of an endgame are simply organized as two arrays of integers (one array for one side/color). In other words, each item in those arrays is an integer and its index on an array is mapped to a unique position.
Based on values those integer numbers can answer directly two purposes of the EGTB: for a given position it is a draw or a win/loss position and how far it is from mating/being mated or converting. From those valuesnumbers, the best move for the of a position can be indirectly calculated as below part mentions. Theoretically, we can add more information to each item. However, due to large involving positions, any additional information may make whole EGTB becomes significantly larger.
Those arrays of an endgame can be stored in files. Popularly each array is stored in one file. But sometimes they can be combined into one file. Those files may be in the form of none or compressed. If they are compressed, they are divided and compressed by small blocks thus they don't need to decompress all to extract data of few positions.
