Create useNullMove local variable

[stockfish] / src / search.cpp

diff --git a/src/search.cpp b/src/search.cpp
index 61475a2f3f3be641fc19b2222d5665cc85d1f214..704cf720008d76e300b512ad378c99a14c0900ca 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -190,9 +190,6 @@ namespace {
   // Remaining depth:                 1 ply         1.5 ply       2 ply         2.5 ply       3 ply         3.5 ply
   const Value RazorApprMargins[6] = { Value(0x520), Value(0x300), Value(0x300), Value(0x300), Value(0x300), Value(0x300) };
 
-  // The main transposition table
-  TranspositionTable TT;
-
 
   /// Variables initialized by UCI options
 
@@ -1126,7 +1123,6 @@ namespace {
       // Make and search the move
       StateInfo st;
       pos.do_move(move, st, dcCandidates);
-      TT.prefetch(pos.get_key());
 
       if (moveCount == 1) // The first move in list is the PV
           value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
@@ -1285,20 +1281,20 @@ namespace {
     bool mateThreat = false;
     bool isCheck = pos.is_check();
 
+    bool useNullMove = (    allowNullmove
+                        &&  depth > OnePly
+                        && !isCheck
+                        && !value_is_mate(beta)
+                        &&  ok_to_do_nullmove(pos)
+                        &&  approximateEval >= beta - NullMoveMargin);
+
     // Null move search
-    if (    allowNullmove
-        &&  depth > OnePly
-        && !isCheck
-        && !value_is_mate(beta)
-        &&  ok_to_do_nullmove(pos)
-        &&  approximateEval >= beta - NullMoveMargin)
+    if (useNullMove)
     {
         ss[ply].currentMove = MOVE_NULL;
 
         StateInfo st;
         pos.do_null_move(st);
-        TT.prefetch(pos.get_key());
-
         int R = (depth >= 5 * OnePly ? 4 : 3); // Null move dynamic reduction
 
         Value nullValue = -search(pos, ss, -(beta-1), depth-R*OnePly, ply+1, false, threadID);
@@ -1332,12 +1328,13 @@ namespace {
         }
     }
     // Null move search not allowed, try razoring
-    else if (   !value_is_mate(beta)
-             && depth < RazorDepth
-             && approximateEval < beta - RazorApprMargins[int(depth) - 2]
-             && ss[ply - 1].currentMove != MOVE_NULL
-             && ttMove == MOVE_NONE
-             && !pos.has_pawn_on_7th(pos.side_to_move()))
+    if (    !useNullMove
+         && !value_is_mate(beta)
+         && depth < RazorDepth
+         && approximateEval < beta - RazorApprMargins[int(depth) - 2]
+         && ss[ply - 1].currentMove != MOVE_NULL
+         && ttMove == MOVE_NONE
+         && !pos.has_pawn_on_7th(pos.side_to_move()))
     {
         Value v = qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
         if (v < beta - RazorMargins[int(depth) - 2])
@@ -1413,7 +1410,6 @@ namespace {
       // Make and search the move
       StateInfo st;
       pos.do_move(move, st, dcCandidates);
-      TT.prefetch(pos.get_key());
 
       // Try to reduce non-pv search depth by one ply if move seems not problematic,
       // if the move fails high will be re-searched at full depth.
@@ -1623,7 +1619,6 @@ namespace {
       // Make and search the move.
       StateInfo st;
       pos.do_move(move, st, dcCandidates);
-      TT.prefetch(pos.get_key());
       Value value = -qsearch(pos, ss, -beta, -alpha, depth-OnePly, ply+1, threadID);
       pos.undo_move(move);
 
@@ -2275,12 +2270,13 @@ namespace {
 
     if (pos.type_of_piece_on(move_from(m)) == PAWN)
     {
-        if (pos.move_is_pawn_push_to_7th(m))
+        Color c = pos.side_to_move();
+        if (relative_rank(c, move_to(m)) == RANK_7)
         {
             result += PawnPushTo7thExtension[pvNode];
             *dangerous = true;
         }
-        if (pos.move_is_passed_pawn_push(m))
+        if (pos.pawn_is_passed(c, move_to(m)))
         {
             result += PassedPawnExtension[pvNode];
             *dangerous = true;