From 62f08568cd724f10f86781bc58dabce616546478 Mon Sep 17 00:00:00 2001 From: Daniel Monroe Date: Sun, 15 Jun 2025 12:49:44 -0700 Subject: [PATCH] Simplify PV term in lmr Passed simplification STC LLR: 2.93 (-2.94,2.94) <-1.75,0.25> Total: 204000 W: 52541 L: 52506 D: 98953 Ptnml(0-2): 561, 24133, 52589, 24144, 573 https://tests.stockfishchess.org/tests/view/684f24ce703522d4f129cab5 Passed simplification LTC LLR: 2.96 (-2.94,2.94) <-1.75,0.25> Total: 156150 W: 39890 L: 39807 D: 76453 Ptnml(0-2): 82, 16882, 44043, 17007, 61 https://tests.stockfishchess.org/tests/view/6855d8bf1d0d9fc6587538f8 closes https://github.com/official-stockfish/Stockfish/pull/6148 bench 2766493 --- src/search.cpp | 3 +-- src/search.h | 1 - 2 files changed, 1 insertion(+), 3 deletions(-) diff --git a/src/search.cpp b/src/search.cpp index 394070458..6430c3e32 100644 --- a/src/search.cpp +++ b/src/search.cpp @@ -655,7 +655,6 @@ Value Search::Worker::search( priorReduction = (ss - 1)->reduction; (ss - 1)->reduction = 0; ss->statScore = 0; - ss->isPvNode = PvNode; (ss + 2)->cutoffCnt = 0; // Step 4. Transposition table lookup @@ -1238,7 +1237,7 @@ moves_loop: // When in check, search starts here // std::clamp has been replaced by a more robust implementation. Depth d = std::max(1, std::min(newDepth - r / 1024, newDepth + !allNode + (PvNode && !bestMove))) - + (ss - 1)->isPvNode; + + PvNode; ss->reduction = newDepth - d; value = -search(pos, ss + 1, -(alpha + 1), -alpha, d, true); diff --git a/src/search.h b/src/search.h index 5caff10e8..e0b57e30b 100644 --- a/src/search.h +++ b/src/search.h @@ -75,7 +75,6 @@ struct Stack { bool ttHit; int cutoffCnt; int reduction; - bool isPvNode; int quietMoveStreak; };