X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.cpp;h=c7c8e78271150e82b5bb3312f7330b7476462609;hp=14de2377b142c06ead3aa642683f9de583586be2;hb=a8330d5c3bfeb4c9d5c55083223792e0989bb9c6;hpb=717d6c5ed503543c66eb7a2c10e8a97c88d99862

diff --git a/src/search.cpp b/src/search.cpp
index 14de2377..c7c8e782 100644
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -1209,10 +1209,11 @@ moves_loop: // When in check, search starts here
           // In general we want to cap the LMR depth search at newDepth. But if reductions
           // are really negative and movecount is low, we allow this move to be searched
           // deeper than the first move (this may lead to hidden double extensions).
-          int deeper =   r >= -1             ? 0
-                       : moveCount <= 5      ? 2
-                       : PvNode && depth > 6 ? 1
-                       :                       0;
+          int deeper =   r >= -1                   ? 0
+                       : moveCount <= 5            ? 2
+                       : PvNode && depth > 6       ? 1
+                       : cutNode && moveCount <= 7 ? 1
+                       :                             0;
 
           Depth d = std::clamp(newDepth - r, 1, newDepth + deeper);