Author: Robert Hyatt
Date: 07:33:08 08/05/99
Go up one level in this thread
On August 05, 1999 at 05:25:33, Jouni Uski wrote: >On August 05, 1999 at 05:23:05, Dennis Breuker wrote: > >>I haven't read CCC for a long time, and saw some reference to >>Nalimov's EGTB. My question is: what is so special about Nalimov's EGTB? >>Is it different from the "normal" ones like Edwards' and Thompson's? >> >>Dennis Breuker (Dennis.Breuker@nospam.capgemini.nl) > >They take only about 50% of space needed for others. > >Jouni Plus they handle enpassant properly, so that kpkp and kppkp (and all the derivatives) are possible. And most importantly is execution speed. Steven's code was written in the days of small-memory PCs. Eugene's code is designed for a 512mb machine when building 5 piece files. As a result the speeds are drastically different. To build KRP with Stevens programs is measured in weeks, Eugene's is in hours.
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.