Double extend search even more via LMR

[stockfish] / src / search.cpp

diff --git a/src/search.cpp b/src/search.cpp
index 0aa590f402441e71367c45b340a7bfdc487d9837..36329f8fe4205066f168f04c7e88cb084d36923d 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -1159,10 +1159,9 @@ moves_loop: // When in check, search starts here
       // cases where we extend a son if it has good chances to be "interesting".
       if (    depth >= 3
           &&  moveCount > 1 + 2 * rootNode
-          && (  !captureOrPromotion
-              || (cutNode && (ss-1)->moveCount > 1)
-              || !ss->ttPv)
-          && (!PvNode || ss->ply > 1 || thisThread->id() % 4 != 3))
+          && (   !ss->ttPv
+              || !captureOrPromotion
+              || (cutNode && (ss-1)->moveCount > 1)))
       {
           Depth r = reduction(improving, depth, moveCount, rangeReduction > 2);
 
@@ -1211,8 +1210,7 @@ moves_loop: // When in check, search starts here
           // 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 <= 3      ? 2
-                       : moveCount <= 5      ? 1
+                       : moveCount <= 5      ? 2
                        : PvNode && depth > 6 ? 1
                        :                       0;