X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fsearch.cpp;h=8cdd7a21323033bd46706ef5264bb1911eb4a385;hb=6849f0800e82845271ad5888600c141857e744ec;hp=e98ea81debb47f443ec70aefb3d98d8c6e8871a6;hpb=5194b2bb06bbd0d29975bb35eda4d600e6bd8dcf;p=stockfish

diff --git a/src/search.cpp b/src/search.cpp
index e98ea81d..8cdd7a21 100644
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -233,11 +233,6 @@ namespace {
   template <NodeType PV>
   inline Depth reduction(Depth d, int mn) { return (Depth) ReductionMatrix[PV][Min(d / 2, 63)][Min(mn, 63)]; }
 
-  // Common adjustments
-
-  // Search depth at iteration 1
-  const Depth InitialDepth = ONE_PLY;
-
   // Easy move margin. An easy move candidate must be at least this much
   // better than the second best move.
   const Value EasyMoveMargin = Value(0x200);
@@ -656,7 +651,7 @@ namespace {
         cout << "info depth " << iteration << endl;
 
         Rml.bestMoveChanges = researchCountFL = researchCountFH = 0;
-        depth = (iteration - 2) * ONE_PLY + InitialDepth;
+        depth = (iteration - 1) * ONE_PLY;
 
         // Calculate dynamic aspiration window based on previous iterations
         if (MultiPV == 1 && iteration >= 6 && abs(bestValues[iteration - 1]) < VALUE_KNOWN_WIN)