585
edits
Changes
no edit summary
The term '''Tablebase''' opposed to endgame database was coined by [[Steven Edwards]] by means of a data vector and a single file access for both sides to move, when he introduced his [[Edwards' Tablebases]], addressing several shortcomings of [[Ken Thompson|Ken Thompson's]] earlier [[Thompson's Databases|database]] of positions with the weaker and hence potentially losing side to move only <ref>[[Ernst A. Heinz]] ('''1999'''). ''Endgame Databases and Efficient Index Schemes for Chess.'' [[ICGA Journal#22_1|ICCA Journal, Vol. 22, No. 1]], [http://people.csail.mit.edu/heinz/ps/edb_index.ps.gz ps]</ref> .
=Data=
An EGTB is a set of endgames. Each endgame is a set of positions of that endgame. Each position has an integer number which informs how far that position from mating/being mated or converting, depends on the type of its metrics. All numbers of an endgame are simply organized as an array of integers. In other words, each item in that array is an integer and mapped to a unique position.
The array can be stored in one or a few files, in none or compressed formats.
=Metrics=
