Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: EGT(B) generation algorithms

Author: GuyHaworth

Date: 02:45:13 06/27/02

Go up one level in this thread



http://chess.jaet.org/endings/ is an endgame table (EGT) server site
  (but the DTC/C.Wirth side of the offering has gone offline recently)

http://chess.jaet.org/endings/docs/ points to d'loadable endgame data files, qv

http://chess.jaet.org/endings/docs/Results_and_Maximals.xls


ftp://ftp.cis.uab.edu/pub/hyatt/TB/ is the EGT/EGTB/TB side of Rob's site,
including, I believe, Eugene Nalimov's generation code.


The ICCA/ICGA Journal is probably best for papers on EGT generation and results:

1)  two papers by Ken Thompson (1986 and 1996)

2)  paper on Nalimov's work (ICGA_J, v23.3, Sept 2000)

3)  Wu/Beal DTC/DTM fully retro algorithm (ICGA_J, v24.3, Sept 2001)


Devising algorithms is harder than it looks, even before you get to 'e.p.' and
'castling options'.

Creating efficient code that will do 6-man, even before you get to parallel
algorithms, is also v hard:  Eugene focuses on performance ... and good
EGT-accessibility at runtime, courtesy of good 'clustering' of
successor-positions.

You will also need an independent verification algorithm to ensure that the
results generated are self-consistent.


The last word certainly has not been said on EGT-generation, so good luck!

g





This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.