Changes

'''[[Main Page|Home]] * [[Knowledge]] * [[Endgame Tablebases]] * Edwards' Tablebases'''

are three-, four and some five-piece tablebases constructed by [[Steven Edwards]] in the early 90s, initially for his chess program [[Spector]]. Edwards' Tablebases rely on [[Endgame Tablebases#DTM|Depth to Mate]] and the complete coverage for both sides, using one [[Byte|byte]] per [[Chess Position|position]], with evaluations of the forms "mate in N", "lose (get mated) in N", "draw", and "illegal". Values for the number N (measured in fullmoves, not [[Ply|ply]]) for mates range from mate in 1 upto mate in 126 and for losses in 0 (lose in 0 means [[Checkmate|checkmated]]) to lose in 125 moves. Each file is for a given class (e.g., KBNK) and for a given [[Side to move|side to move]] (e.g., White) <ref>[https://www.stmintz.com/ccc/index.php?id=11493 Steve Edward's Endgame Tablebase generator is now available for WIN95] by [[Michael Byrne|Mike Byrne]], [[CCC]], November 01, 1997</ref>. After finishing the construction procedure in 1994, Steven Edwards made the whole data, documentation and a test program written in [[C|ANSI-C]] publicly available on the Internet. Until the advent of the compressed [[Nalimov Tablebases]], Edwards' Tablebases were quite popular and used in several chess programs, such as [[Crafty]], [[Gromit]], and the commercial [[MChess|MChess Pro]], to name a few.

=Publications=

* [[Steven Edwards]] ('''1996'''). ''An Examination of the Endgame KBBKN.'' [[ICGA Journal#19_1|ICCA Journal, Vol. 19, No. 1]]