Simplify reduction for consecutive fails

[stockfish] / src / search.cpp

diff --git a/src/search.cpp b/src/search.cpp
index 359a774fd706cb4f7341b81c86e3675a85dad6c8..f8f956fa9375241536e3a61eadc23eff83e1b467 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -377,7 +377,7 @@ void Thread::search() {
           // Start with a small aspiration window and, in the case of a fail
           // high/low, re-search with a bigger window until we don't fail
           // high/low anymore.
-          failedHighCnt = 0;
+          int failedHighCnt = 0;
           while (true)
           {
               Depth adjustedDepth = std::max(1, rootDepth - failedHighCnt - searchAgainCounter);
@@ -1157,10 +1157,6 @@ moves_loop: // When in check, search starts from here
               if (ttCapture)
                   r++;
 
-              // Increase reduction at root if failing high
-              if (rootNode)
-                  r += thisThread->failedHighCnt * thisThread->failedHighCnt * moveCount / 512;
-
               // Increase reduction for cut nodes (~3 Elo)
               if (cutNode)
                   r += 2;