kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-30 08:43:09 +00:00
Code Issues Releases Wiki Activity

More accurate 'go nodes' searches at low count

Browse source 
Makes the actual number of nodes searched match closely
the number of nodes requested, by increasing the frequency
of checking the number of nodes searched at low node count.
All other searches retain the default checking frequency of
once per 4096 nodes, and are thus unaffected.

Passed STC as non-regression
LLR: 2.95 (-2.94,2.94) [-3.00,1.00]
Total: 26643 W: 4766 L: 4655 D: 17222

No functional change.
This commit is contained in:
Joost VandeVondele 2016-11-13 11:08:30 +01:00 • committed by Marco Costalba
parent a90fc4c877
commit cddc8d4546
1 changed files with 6 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
src/search.cpp
View file

@ -573,9 +573,13 @@ namespace {
if (thisThread->resetCalls.load(std::memory_order_relaxed))
{
thisThread->resetCalls = false;
thisThread->callsCnt = 0;
// At low node count increase the checking rate to about 0.1% of nodes
// otherwise use a default value.
thisThread->callsCnt = Limits.nodes ? std::min(4096LL, Limits.nodes / 1024)
: 4096;
}
if (++thisThread->callsCnt > 4096)
if (--thisThread->callsCnt <= 0)
{
for (Thread* th : Threads)
th->resetCalls = true;