Remove useless bestValue = alpha assignement

[stockfish] / src / search.cpp

diff --git a/src/search.cpp b/src/search.cpp
index c30fe92e35c2a048ac608873a03c886614f6db06..cd8a9e461083a63fd21531fb88cf6944f67db09b 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -591,8 +591,6 @@ namespace {
             if (StopRequest)
                 break;
 
-            assert(value >= alpha);
-
             // In case of failing high/low increase aspiration window and research,
             // otherwise exit the fail high/low loop.
             if (value >= beta)
@@ -747,8 +745,6 @@ namespace {
         threatMove = sp->threatMove;
         goto split_point_start;
     }
-    else if (RootNode)
-        bestValue = alpha;
 
     // Step 1. Initialize node and poll. Polling can abort search
     ss->currentMove = ss->bestMove = threatMove = (ss+1)->excludedMove = MOVE_NONE;
@@ -1134,7 +1130,7 @@ split_point_start: // At split points actual search starts from here
           bool doFullDepthSearch = true;
           alpha = SpNode ? sp->alpha : alpha;
 
-          if (    depth >= 3 * ONE_PLY
+          if (    depth > 3 * ONE_PLY
               && !captureOrPromotion
               && !dangerous
               && !move_is_castle(move)
@@ -1393,7 +1389,7 @@ split_point_start: // At split points actual search starts from here
     // to search the moves. Because the depth is <= 0 here, only captures,
     // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
     // be generated.
-    MovePicker mp(pos, ttMove, depth, H);
+    MovePicker mp(pos, ttMove, depth, H, move_to((ss-1)->currentMove));
     CheckInfo ci(pos);
     Bitboard pinned = pos.pinned_pieces(pos.side_to_move());