Author: Dann Corbit
Date: 17:10:24 02/23/99
Go up one level in this thread
On February 23, 1999 at 19:44:48, James Long wrote:
>Just added support for Eugene Nalimov's tablebases.
>Do they handle en passants correctly, or shouldn't the
>tablebases be probed when an ep is possible?
From the Crafty main.c header, we see the explanation that e.p. is taken into
account. IIRC, this (besides being faster and smaller and conversion
differences) was described as one of the large benefits of the new format.
From main.c:
"
16.1 bug in EGTBProbe() which used the wrong variable to access the
enpassant target square was fixed. the cache=x command now
checks for a failed malloc() and reverts to the default cache
size to avoid crashes. major eval tuning changes. cache bug
would do an extra malloc() and if it is done after the "egtb"
command it would crash. analyze mode now turns off the "swindle"
mode.
"
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.