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

Simplify reduction when best move doesn't change frequently.

Browse source 
STC:
LLR: 2.94 (-2.94,2.94) <-2.50,0.50>
Total: 40400 W: 3468 L: 3377 D: 33555
Ptnml(0-2): 134, 2734, 14388, 2795, 149
https://tests.stockfishchess.org/tests/view/60c93e5a457376eb8bcab15f

LTC:
LLR: 2.94 (-2.94,2.94) <-2.50,0.50>
Total: 34200 W: 1190 L: 1128 D: 31882
Ptnml(0-2): 22, 998, 15001, 1054, 25
https://tests.stockfishchess.org/tests/view/60c96a1a457376eb8bcab180

closes https://github.com/official-stockfish/Stockfish/pull/3559

bench: 5629669
This commit is contained in:
bmc4 2021-06-15 20:56:09 -03:00 • committed by Stéphane Nicolet
parent 68bf362ea2
commit 55e69dc88d
1 changed files with 0 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
src/search.cpp
View file

@ -1157,7 +1157,6 @@ moves_loop: // When in check, search starts from here
// Increase reduction at root and non-PV nodes when the best move does not change frequently // Increase reduction at root and non-PV nodes when the best move does not change frequently
if ( (rootNode || !PvNode) if ( (rootNode || !PvNode)
&& thisThread->rootDepth > 10
&& thisThread->bestMoveChanges <= 2) && thisThread->bestMoveChanges <= 2)
r++; r++;