Explanation
Nalimov tablebases are precomputed databases for endgame positions with three to six pieces, counting both kings. Eugene Nalimov developed them, and for many years they became a practical standard for engines and interfaces that needed exact answers in small endings.
Their main metric is DTM, or distance to mate. A probe does not estimate which side is better. It determines win, draw, or loss within the covered material and, when applicable, reports the distance to mate under play that shortens or delays it.
Nalimov introduced efficient indexing and compression methods that made tablebase probing practical during an engine search. Even so, the complete six-piece collection requires substantial storage, and its historic probing code has different integration conditions from newer alternatives.
Because DTM is not organized around the fifty-move counter, a position can be a forced mate mathematically yet a draw in a game where that rule can be claimed. uses WDL and DTZ to address that issue differently. also supplies DTM, but normally only through five pieces.
Usage and context
Although many modern tools prefer Syzygy, Nalimov remains relevant for historic formats, DTM results, and software that still supports it.
Common confusions
Six pieces
The limit counts both kings. King, queen, and pawn against king, rook, and pawn already totals six pieces.
Exactness and the fifty-move rule
The DTM answer is exact for its metric. The rules-based result may change if the line exceeds the limit without a capture or pawn move.
Sources
- 1.Nalimov Tablebases, Chess Programming Wiki
- 2.Web Query for Nalimov Endgame Tablebases, Knowledge4IT
