X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.cpp;h=5447ed3c6694c74b398effebbe3ad41a704e9778;hp=d59edbaeefcbf4be8ba40ea965156a21e0bf387a;hb=3cb02004596f868ae405b09fbf3a2038a680a989;hpb=2c237da54647bb7526f3512bea183eb44919cdda diff --git a/src/search.cpp b/src/search.cpp index d59edbae..5447ed3c 100644 --- a/src/search.cpp +++ b/src/search.cpp @@ -361,7 +361,7 @@ void Thread::search() { multiPV = std::min(multiPV, rootMoves.size()); // Iterative deepening loop until requested to stop or the target depth is reached - while ( (rootDepth += ONE_PLY) < DEPTH_MAX + while ( (rootDepth = rootDepth + ONE_PLY) < DEPTH_MAX && !Signals.stop && (!Limits.depth || Threads.main()->rootDepth / ONE_PLY <= Limits.depth)) { @@ -400,6 +400,9 @@ void Thread::search() { { bestValue = ::search(rootPos, ss, alpha, beta, rootDepth, false, false); + this->tbHits = rootPos.tb_hits(); + this->nodes = rootPos.nodes_searched(); + // Bring the best move to the front. It is critical that sorting // is done with a stable algorithm because all the values but the // first and eventually the new best one are set to -VALUE_INFINITE @@ -568,6 +571,9 @@ namespace { { thisThread->resetCalls = false; + thisThread->tbHits = pos.tb_hits(); + thisThread->nodes = pos.nodes_searched(); + // 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(4096, int(Limits.nodes / 1024)) @@ -668,7 +674,7 @@ namespace { if (err != TB::ProbeState::FAIL) { - thisThread->tbHits++; + pos.increment_tbHits(); int drawScore = TB::UseRule50 ? 1 : 0; @@ -1473,7 +1479,7 @@ moves_loop: // When in check search starts from here void check_time() { - static TimePoint lastInfoTime = now(); + static std::atomic lastInfoTime = { now() }; int elapsed = Time.elapsed(); TimePoint tick = Limits.startTime + elapsed;