mirror of
https://github.com/sockspls/badfish
synced 2025-04-30 00:33:09 +00:00
Simplify increaseDepth to boolean expression
Non-functional Simplification, maintaining the same logic as before. Big thanks to @peregrineshahin for helping with the code. Passed non-regression bounds: https://tests.stockfishchess.org/tests/view/65ec93860ec64f0526c42375 LLR: 2.93 (-2.94,2.94) <-1.75,0.25> Total: 101088 W: 26196 L: 26047 D: 48845 Ptnml(0-2): 405, 11580, 26473, 11633, 453 closes https://github.com/official-stockfish/Stockfish/pull/5103 No functional change
This commit is contained in:
parent
1a26d698de
commit
daa3ef9148
1 changed files with 3 additions and 4 deletions
|
@ -464,11 +464,10 @@ void Search::Worker::iterative_deepening() {
|
||||||
else
|
else
|
||||||
threads.stop = true;
|
threads.stop = true;
|
||||||
}
|
}
|
||||||
else if (!mainThread->ponder
|
|
||||||
&& mainThread->tm.elapsed(threads.nodes_searched()) > totalTime * 0.506)
|
|
||||||
threads.increaseDepth = false;
|
|
||||||
else
|
else
|
||||||
threads.increaseDepth = true;
|
threads.increaseDepth =
|
||||||
|
mainThread->ponder
|
||||||
|
|| mainThread->tm.elapsed(threads.nodes_searched()) <= totalTime * 0.506;
|
||||||
}
|
}
|
||||||
|
|
||||||
mainThread->iterValue[iterIdx] = bestValue;
|
mainThread->iterValue[iterIdx] = bestValue;
|
||||||
|
|
Loading…
Add table
Reference in a new issue