jirayu_sri/stockfish
1
0
Fork 0
mirror of https://github.com/official-stockfish/Stockfish.git synced 2026-07-22 20:57:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge commit '5d3517c601c64d026824251784dd44f0cbf14873' into cluster

Browse Source
This commit is contained in:
Steinar H. Gunderson
2025-12-25 15:30:32 +01:00
parent d7cf6e22fd 5d3517c601
commit d83e63c163
1 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/search.cpp
+5 -4
View File
@@ -397,9 +397,10 @@ void Search::Worker::iterative_deepening() {
break; break;
// When failing high/low give some update before a re-search. // When failing high/low give some update before a re-search.
// To avoid excessive output, only start at rootDepth > 30. // To avoid excessive output that could hang GUIs like Fritz 19, only start
// at nodes > 10M (rather than depth N, which can be reached quickly)
if (Distributed::is_root() && mainThread && multiPV == 1 if (Distributed::is_root() && mainThread && multiPV == 1
&& (bestValue <= alpha || bestValue >= beta) && rootDepth > 30) && (bestValue <= alpha || bestValue >= beta) && nodes > 10000000)
{ {
main_manager()->pv(*this, threads, tt, rootDepth); main_manager()->pv(*this, threads, tt, rootDepth);
Distributed::cluster_info(threads, rootDepth, elapsed()); Distributed::cluster_info(threads, rootDepth, elapsed());
@@ -433,7 +434,7 @@ void Search::Worker::iterative_deepening() {
std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1); std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
if (Distributed::is_root() && mainThread if (Distributed::is_root() && mainThread
&& (threads.stop || pvIdx + 1 == multiPV || rootDepth > 30) && (threads.stop || pvIdx + 1 == multiPV || nodes > 10000000)
// A thread that aborted search can have mated-in/TB-loss PV and score // A thread that aborted search can have mated-in/TB-loss PV and score
// that cannot be trusted, i.e. it can be delayed or refuted if we would have // that cannot be trusted, i.e. it can be delayed or refuted if we would have
// had time to fully search other root-moves. Thus we suppress this output and // had time to fully search other root-moves. Thus we suppress this output and
@@ -1019,7 +1020,7 @@ moves_loop: // When in check, search starts here
ss->moveCount = ++moveCount; ss->moveCount = ++moveCount;
if (rootNode && Distributed::is_root() && is_mainthread() && rootDepth > 30) if (rootNode && Distributed::is_root() && is_mainthread() && nodes > 10000000)
{ {
main_manager()->updates.onIter( main_manager()->updates.onIter(
{depth, UCIEngine::move(move, pos.is_chess960()), moveCount + thisThread->pvIdx}); {depth, UCIEngine::move(move, pos.is_chess960()), moveCount + thisThread->pvIdx});