Author: Urban Koistinen
Date: 10:11:59 04/09/01
Go up one level in this thread
On April 09, 2001 at 12:59:38, Bruce Moreland wrote: >On April 07, 2001 at 11:18:34, Urban Koistinen wrote: > >>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 www.abc.se/~m10051/eg.txt >>It is ok to copy it verbatim. > >What is the end-product? Win/loss/draw? Win/non-win? Mate in N? Convert in >N? For each position with white to move: Win/No win Distance to game50 conversion For each position with black to move: Loss/No loss Urban Koistinen
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.