Author: Aaron Tay
Date: 03:47:56 04/08/01
Go up one level in this thread
On April 08, 2001 at 06:14:44, José Carlos 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, > > Thank you. Too technical algorithms are not for a crowded-of-programmers forum like this. We wouldn't understand anything. > > José C. Hey , be nice. He's new here. He is just feeling a little fustrated after posting at r.g.c.c and getting only one response. Knowing the high level of general technicial expertise here, I suggested to him that he should post here. So what do the experts think? Is the algorithim as good as he claims? Layman like me want to know!
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.