Computer Chess Club Archives




Subject: EGTB: Better algorithm

Author: Urban Koistinen

Date: 08:18:34 04/07/01

I have written down a algorithm for computing endgame tablebases that should be
about 10 times quicker than the Nalimov algorithm and requires much less ram.
It is similar to the Arlazarov&Futer algorithm of 1979 but is more general as it
does not require a pawn.
It might be too technical for most here, but if anyone has questions I will try
to answer them.

The text is available at
It is ok to copy it verbatim.

This page took 0.01 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.