Temporarily removed the unfinished UCI_Elo code in preparation for

[stockfish] / src / search.cpp

diff --git a/src/search.cpp b/src/search.cpp
index 06cc9b60fc97155cf6687422ad5d2b8b2de1eb5b..4ba85b4861d38839e80ba78cc2f1d1e76275296c 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -193,16 +193,6 @@ namespace {
 
   /// Variables initialized by UCI options
 
-  // Adjustable playing strength
-  int Slowdown = 0;
-  const int SlowdownArray[32] = {
-    19, 41, 70, 110, 160, 230, 320, 430, 570, 756, 1000, 1300, 1690, 2197,
-    2834, 3600, 4573, 5809, 7700, 9863, 12633, 16181, 20726, 26584, 34005,
-    43557, 55792, 71463, 91536, 117247, 150180, 192363
-  };
-  int Strength;
-  const int MaxStrength = 25;
-
   // Minimum number of full depth (i.e. non-reduced) moves at PV and non-PV nodes
   int LMRPVMoves, LMRNonPVMoves; // heavy SMP read access for the latter
 
@@ -302,7 +292,6 @@ namespace {
   bool ok_to_history(const Position& pos, Move m);
   void update_history(const Position& pos, Move m, Depth depth, Move movesSearched[], int moveCount);
   void update_killers(Move m, SearchStack& ss);
-  void slowdown(const Position& pos);
 
   bool fail_high_ply_1();
   int current_search_time();
@@ -423,10 +412,8 @@ bool think(const Position& pos, bool infinite, bool ponder, int side_to_move,
 
   read_weights(pos.side_to_move());
 
-  // Set the number of active threads. If UCI_LimitStrength is enabled, never
-  // use more than one thread.
-  int newActiveThreads =
-    get_option_value_bool("UCI_LimitStrength")? 1 : get_option_value_int("Threads");
+  // Set the number of active threads.
+  int newActiveThreads = get_option_value_int("Threads");
   if (newActiveThreads != ActiveThreads)
   {
       ActiveThreads = newActiveThreads;
@@ -439,19 +426,6 @@ bool think(const Position& pos, bool infinite, bool ponder, int side_to_move,
   for (int i = 1; i < ActiveThreads; i++)
       assert(thread_is_available(i, 0));
 
-  // Set playing strength
-  if (get_option_value_bool("UCI_LimitStrength"))
-  {
-      Strength = (get_option_value_int("UCI_Elo") - 2100) / 25;
-      Slowdown =
-        (Strength == MaxStrength)? 0 : SlowdownArray[Max(0, 31-Strength)];
-  }
-  else
-  {
-      Strength = MaxStrength;
-      Slowdown = 0;
-  }
-
   // Set thinking time
   int myTime = time[side_to_move];
   int myIncrement = increment[side_to_move];
@@ -496,13 +470,6 @@ bool think(const Position& pos, bool infinite, bool ponder, int side_to_move,
       NodesBetweenPolls = Min(MaxNodes, 30000);
       InfiniteSearch = true; // HACK
   }
-  else if (Slowdown) {
-      if (Slowdown > 50000) NodesBetweenPolls = 30;
-      else if (Slowdown > 10000) NodesBetweenPolls = 100;
-      else if (Slowdown > 1000) NodesBetweenPolls = 500;
-      else if (Slowdown > 100) NodesBetweenPolls = 3000;
-      else NodesBetweenPolls = 15000;
-  }
   else
       NodesBetweenPolls = 30000;
 
@@ -658,6 +625,15 @@ namespace {
     // searchMoves are verified, copied, scored and sorted
     RootMoveList rml(p, searchMoves);
 
+    // Print RootMoveList c'tor startup scoring to the standard output,
+    // so that we print information also for iteration 1.
+    std::cout << "info depth " << 1 << "\ninfo depth " << 1
+              << " score " << value_to_string(rml.get_move_score(0))
+              << " time " << current_search_time()
+              << " nodes " << nodes_searched()
+              << " nps " << nps()
+              << " pv " << rml.get_move(0) << "\n";
+
     // Initialize
     TT.new_search();
     H.clear();
@@ -1535,15 +1511,15 @@ namespace {
     if (isCheck)
         staticValue = -VALUE_INFINITE;
 
-    else if (tte && tte->type() == VALUE_TYPE_EVAL)
+    else if (tte && (tte->type() & VALUE_TYPE_EVAL))
     {
         // Use the cached evaluation score if possible
         assert(ei.futilityMargin == Value(0));
 
-        staticValue = tte->value() + 7;
+        staticValue = tte->value();
     }
     else
-        staticValue = evaluate(pos, ei, threadID) + 7;
+        staticValue = evaluate(pos, ei, threadID);
 
     if (ply == PLY_MAX - 1)
         return evaluate(pos, ei, threadID);
@@ -1556,7 +1532,7 @@ namespace {
     {
         // Store the score to avoid a future costly evaluation() call
         if (!isCheck && !tte && ei.futilityMargin == 0)
-            TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EVAL, Depth(-127*OnePly), MOVE_NONE);
+            TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EV_LO, Depth(-127*OnePly), MOVE_NONE);
 
         return bestValue;
     }
@@ -1644,9 +1620,13 @@ namespace {
     Move m = ss[ply].pv[ply];
     if (!pvNode)
     {
+        // If bestValue isn't changed it means it is still the static evaluation of
+        // the node, so keep this info to avoid a future costly evaluation() call.
+        ValueType type = (bestValue == staticValue && !ei.futilityMargin ? VALUE_TYPE_EV_UP : VALUE_TYPE_UPPER);
         Depth d = (depth == Depth(0) ? Depth(0) : Depth(-1));
+
         if (bestValue < beta)
-            TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, d, MOVE_NONE);
+            TT.store(pos.get_key(), value_to_tt(bestValue, ply), type, d, MOVE_NONE);
         else
             TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, d, m);
     }
@@ -1962,7 +1942,7 @@ namespace {
     bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
 
     // Generate all legal moves
-    MoveStack* last = generate_legal_moves(pos, mlist);
+    MoveStack* last = generate_moves(pos, mlist);
 
     // Add each move to the moves[] array
     for (MoveStack* cur = mlist; cur != last; cur++)
@@ -2094,9 +2074,6 @@ namespace {
     assert(ply >= 0 && ply < PLY_MAX);
     assert(threadID >= 0 && threadID < ActiveThreads);
 
-    if (Slowdown && Iteration >= 3)
-      slowdown(pos);
-
     Threads[threadID].nodes++;
 
     if (threadID == 0)
@@ -2434,21 +2411,6 @@ namespace {
   }
 
 
-  // slowdown() simply wastes CPU cycles doing nothing useful. It's used
-  // in strength handicap mode.
-
-  void slowdown(const Position &pos) {
-    int i, n;
-    n = Slowdown;
-    for (i = 0; i < n; i++)  {
-        Square s = Square(i&63);
-        if (count_1s(pos.attackers_to(s)) > 63)
-            std::cout << "This can't happen, but I put this string here anyway, in order to "
-                         "prevent the compiler from optimizing away the useless computation." << std::endl;
-    }
-  }
-
-
   // fail_high_ply_1() checks if some thread is currently resolving a fail
   // high at ply 1 at the node below the first root node.  This information
   // is used for time managment.