Author: Dann Corbit
Date: 10:38:15 04/19/04
Go up one level in this thread
On April 17, 2004 at 12:15:10, Robert Hyatt wrote: >On April 17, 2004 at 01:44:23, Dann Corbit wrote: > >>On April 16, 2004 at 22:37:36, Robert Hyatt wrote: >> >>>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? >>> >>>How do you know which is which, before the fact??? >> >>The node I search first will be the pv node 90+% of the time. > > >If you go to depth=15,there are exactly _fifteen_ of those nodes. What about >the other one billion??? They get a bitbase lookup instead, that is memory resident. If the bitbase lookup shows a mate score and my current pv node is not a mate, then the bitbase lookup will cause a fail high and the new pv node will be searched.
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.