opelly/Stockfish
1
0
Fork 0
mirror of https://github.com/opelly27/Stockfish.git synced 2026-05-20 02:47:45 +00:00
Code Issues Packages Projects Releases Wiki Activity

Reduce full depth search twice

Browse Source 
Passed STC:
https://tests.stockfishchess.org/tests/view/679f429e0774dfd78deb10a5
LLR: 2.95 (-2.94,2.94) <0.00,2.00>
Total: 71584 W: 18905 L: 18529 D: 34150
Ptnml(0-2): 302, 8372, 18081, 8722, 315

Passed LTC:
https://tests.stockfishchess.org/tests/view/679f72a00774dfd78deb1102
LLR: 2.94 (-2.94,2.94) <0.50,2.50>
Total: 353952 W: 91007 L: 90024 D: 172921
Ptnml(0-2): 375, 39163, 96921, 40138, 379

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

Bench: 3642363
This commit is contained in:
Nonlinear2
2025-02-02 19:37:13 +01:00
committed by Disservin
parent c12dbdedd9
commit fccc6f624e
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/search.cpp
+2 -2
View File
@@ -1248,8 +1248,8 @@ moves_loop: // When in check, search starts here
r += 2111; r += 2111;
// Note that if expected reduction is high, we reduce search depth here // Note that if expected reduction is high, we reduce search depth here
value = value = -search<NonPV>(pos, ss + 1, -(alpha + 1), -alpha,
-search<NonPV>(pos, ss + 1, -(alpha + 1), -alpha, newDepth - (r > 3444), !cutNode); newDepth - (r > 3444) - (r > 5588 && newDepth > 2), !cutNode);
} }
// For PV nodes only, do a full PV search on the first move or after a fail high, // For PV nodes only, do a full PV search on the first move or after a fail high,