Disable insert_pv

[stockfish] / src / search.cpp

diff --git a/src/search.cpp b/src/search.cpp
index b47b8b243e85d2cc1b0c69828f9b726a0afd2948..7bacb89c87fe988e53dd504869b945921d148904 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -173,14 +173,14 @@ namespace {
 
   // If the TT move is at least SingleReplyMargin better then the
   // remaining ones we will extend it.
-  const Value SingleReplyMargin = Value(0x64);
+  const Value SingleReplyMargin = Value(0x20);
 
   // Margins for futility pruning in the quiescence search, and at frontier
   // and near frontier nodes.
   const Value FutilityMarginQS = Value(0x80);
 
   // Each move futility margin is decreased
-  const Value IncrementalFutilityMargin = Value(0x4);
+  const Value IncrementalFutilityMargin = Value(0x8);
 
   // Razoring
   const Depth RazorDepth = 4*OnePly;
@@ -743,7 +743,7 @@ namespace {
 
         // Write PV to transposition table, in case the relevant entries have
         // been overwritten during the search.
-        TT.insert_pv(p, ss[0].pv);
+        //TT.insert_pv(p, ss[0].pv);
 
         if (AbortSearch)
             break; // Value cannot be trusted. Break out immediately!
@@ -2523,8 +2523,8 @@ namespace {
     Value v = value_from_tt(tte->value(), ply);
 
     return   (   tte->depth() >= depth
-              || v >= Max(value_mate_in(100), beta)
-              || v < Min(value_mated_in(100), beta))
+              || v >= Max(value_mate_in(PLY_MAX), beta)
+              || v < Min(value_mated_in(PLY_MAX), beta))
 
           && (   (is_lower_bound(tte->type()) && v >= beta)
               || (is_upper_bound(tte->type()) && v < beta));