Relax time constraints

[stockfish] / src / search.cpp

diff --git a/src/search.cpp b/src/search.cpp
index f29041847c0ae033cc4b25d403f266fc633a15f5..f91852cd004d599968b069a2d8065db0976762b5 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -673,7 +673,7 @@ namespace {
         // Stop search if most of MaxSearchTime is consumed at the end of the
         // iteration.  We probably don't have enough time to search the first
         // move at the next iteration anyway.
-        if(current_search_time() > ((MaxSearchTime + ExtraSearchTime)*80) / 128)
+        if(current_search_time() > ((MaxSearchTime + ExtraSearchTime)*90) / 128)
           stopSearch = true;
 
         if(stopSearch) {
@@ -931,7 +931,6 @@ namespace {
     {
       assert(move_is_ok(move));
 
-      bool fewMoves = (depth <= OnePly && mp.number_of_moves() < 4);
       bool singleReply = (pos.is_check() && mp.number_of_moves() == 1);
       bool moveIsCheck = pos.move_is_check(move, dcCandidates);
       bool moveIsCapture = pos.move_is_capture(move);
@@ -943,7 +942,7 @@ namespace {
         PawnValueMidgame : pos.midgame_value_of_piece_on(move_to(move));
 
       // Decide the new search depth
-      Depth ext = extension(pos, move, true, moveIsCheck, singleReply || fewMoves, mateThreat);
+      Depth ext = extension(pos, move, true, moveIsCheck, singleReply, mateThreat);
       Depth newDepth = depth - OnePly + ext;
 
       // Make and search the move
@@ -2228,7 +2227,7 @@ namespace {
     bool overTime =     t > AbsoluteMaxSearchTime
                      || (RootMoveNumber == 1 && t > MaxSearchTime + ExtraSearchTime)
                      || (  !FailHigh && !fail_high_ply_1() && !Problem
-                         && t > 6*(MaxSearchTime + ExtraSearchTime));
+                         && t > 10*(MaxSearchTime + ExtraSearchTime));
 
     if (   (Iteration >= 2 && (!InfiniteSearch && overTime))
         || (ExactMaxTime && t >= ExactMaxTime)