585
edits
Changes
→Data
=Data=
An EGTB is a set of endgames. Each endgame is a set of positions of that endgame that (they have similar the same material). Each position has 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 an array two arrays of integers(one array for one side). In other words, each item in that array those arrays is an integer and its index on an array is mapped to a unique position.
The array of an endgame can be stored in one or a few files, in none or compressed formats.
The size of an endgame depends on:
* The number of involving pieces: more pieces , the bigger size
* Type of pieces: for standard chess, more Pawns is the smaller size
* Type of metric
* The largest value: the integer number: should be large enough to cover the largest value. Different endgames will have different largest values. Thus some endgames need only one byte to store a number of a position per item but some need 2 bytes
* Indexing: The algorithms to map between an array item and a position
* Compress ratio
