Author: Dave Gomboc
Date: 01:18:58 04/17/04
Go up one level in this thread
On April 16, 2004 at 16:40:49, Dann Corbit wrote: >Why not probe memory-resident bitbase EGTB files for every non-pv node and >Nalimov (or other advanced EGTB) probes for every pv node? > >If it is not a PV node, then we don't really care what the move to make is. And >if we get a fail high on a bitbase probe, it will get researched as a PV node >anyway. > >It seems like it would cut EGTB probes to 1/30 or so of probing all the time, >and the probes would always be where they are needed the most. > >Have others already tried this? Hmm, I think what matters is your search window. e.g. if the search window is below the minimum tablebase win, you just need to know if the position is winning, but once your window includes the various won-in-x scores then you want the real value. Dave
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.