More accurate 'go nodes' searches at low count

[stockfish] / src / search.cpp

diff --git a/src/search.cpp b/src/search.cpp
index a74e3f256833c576c4e11f19462367af32f91119..5dff67f2a86f0c0f6d4b2d3375af5676a7507f47 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -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;