Move depth computation out of fail low loop

[stockfish] / src / search.cpp

diff --git a/src/search.cpp b/src/search.cpp
index 2ab983970dcceb8f8466db7398b875ef9962709c..fff00026c6cdad7380c32d1e4b53471f65efae05 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -715,6 +715,7 @@ namespace {
     alpha = *alphaPtr;
     beta = *betaPtr;
     isCheck = pos.is_check();
     alpha = *alphaPtr;
     beta = *betaPtr;
     isCheck = pos.is_check();

+    depth = (Iteration - 2) * OnePly + InitialDepth;

 
     // Step 1. Initialize node (polling is omitted at root)
     ss->currentMove = ss->bestMove = MOVE_NONE;
 
     // Step 1. Initialize node (polling is omitted at root)
     ss->currentMove = ss->bestMove = MOVE_NONE;


@@ -764,7 +765,6 @@ namespace {
             captureOrPromotion = pos.move_is_capture_or_promotion(move);
 
             // Step 11. Decide the new search depth
             captureOrPromotion = pos.move_is_capture_or_promotion(move);
 
             // Step 11. Decide the new search depth

-            depth = (Iteration - 2) * OnePly + InitialDepth;

             ext = extension<PV>(pos, move, captureOrPromotion, moveIsCheck, false, false, &dangerous);
             newDepth = depth + ext;
 
             ext = extension<PV>(pos, move, captureOrPromotion, moveIsCheck, false, false, &dangerous);
             newDepth = depth + ext;