Endgame tablebase shredder how to#
Endgame tablebase shredder software#
Endgame tablebase shredder code#

Are nalimov EGTB's a copyright from chessbase? by Vincent Diepeveen, CCC, June 07, 2004.To Eugene Nalimov: Copyright of Tablebase files by Karl-Heinz Milaster, CCC, June 05, 2004.

Endgame tablebase shredder code#

Bug/glitch in Nalimov Code (and in Wilhelm)? by Dieter BГјrГџner, CCC, May 09, 2004.

Compressed Nalimov EGTBs by Leonardo Ljubicic, rgcc, November 18, 2003.

Questions about the new Nalimov tablebase files.

Nalimov TB question by Bas Hamstra, CCC, November 11, 2001.

Nalimov's EGTBs (long post with code) by Heiner Marxen, CCC, October 13, 2001.

Nalimov endgames by Jean-Christophe Weill, CCC, February 20, 2001.

) by Eugene Nalimov, CCC, December 05, 2000

Endgame tablebase shredder software#

Re: Usage of egtb.cpp in GPL software (Amy, ExChess. ) by Gian-Carlo Pascutto, CCC, December 05, 2000В В» Amy, EXchess

Usage of egtb.cpp in GPL software (Amy, ExChess.

Nalimov-EGTBs in ANSI-C? by Heiner Marxen, CCC, January 21, 2000.

Re: difference betrween nalimov and thompson EGTB by Frederic Friedel, CCC, Decem2000.

difference betrween nalimov and thompson EGTB by Rajen Gupta, CCC, December 10, 1999.

EGTBs by Frank Phillips, CCC, September 03, 1999.

Nalimov TB cachingВ ? by Ulrich TГјrke from CCC, August 06, 1999.

Re: Q: Nalimov EGTB? by Eugene Nalimov, CCC, August 05, 1999

Q: Nalimov EGTB? by Dennis Breuker, CCC, August 05, 1999.

Re: Nalimov's TBs: one question by Eugene Nalimov, CCC, November 18, 1998

Nalimov's TBs: one question by Jouni Uski, CCC, November 18, 1998.

Eugene NalimovВ ? by Michael Diosi, rgcc, November 6, 1998

Tablebases by Eugene Nalimov, CCC, August 28, 1998.

Invited Lecture, 7th Computer Olympiad Workshop

Guy Haworth, Peter Karrer, John Tamplin, Christoph Wirth ( 2001).

Space-efficient Indexing of Endgame Tables for Chess. Space-Efficient Indexing of Chess Endgame Tables. Probing could easily incorporated into own chess engines, however the license policy requires explicit permission by Eugene Nalimov. A reference implementation by Eugene Nalimov and Robert Hyatt was realized in Crafty, with Tablebases and probing code previously available from Bob Hyatt's site. In the late 90s Nalimov Tablebases became defacto standard and were used in many commercial, private and free chess engines and GUI's.

One cannot capture enemy's king, so, if one knows where it's located, there are some forbidden squares for the pieces of the side-to-move.

Kings never can be near each other, so there are only 3612 ways to place 2 kings on the empty board (not using symmetries), versus 4096 when using SJE's format.

Even if one wants to handle en passant, there are better ways to do that than to reserve entire rank (or two) for possible en passant target Then one has not N*(N-1) total combinations, but N*(N-1)/2 force second piece to occupy square with smaller number. as in knnkp), one can order their locations - e.g.

If there are two identical pieces (e.g.

When one places a second piece on the board, one square is occupied already, so there are only 63 possible squares, for third - only 62, etc.

But if that piece happens to be on a1-d4 diagonal, one can restrict other piece to 'large' a1-h1-h8 triangle (exploit one more symmetry).

For pawnless ending, one can restrict one piece to a1-d1-d4 triangle (that was done in SJE's generator).

Endgame tablebase shredder how to#

In CCC, Eugene Nalimov gave a brief summary, how to realize the space savings В :

5-man Nalimov Tablebases are about two times smaller than Edwards' Tablebases when uncompressed, and about eight times smaller than Edwards' when compressed.