Futility pruning simplification

[stockfish] / src / movepick.h

diff --git a/src/movepick.h b/src/movepick.h
index c444615f5b9f2e8ab4a0952ff47e3c97bf642079..93061ee6fc6a81c8aaf277b817dab41a0d02dd34 100644 (file)
--- a/src/movepick.h
+++ b/src/movepick.h
@@ -30,14 +30,13 @@
 
 
 /// The Stats struct stores moves statistics. According to the template parameter
-/// the class can store History, Gains and Countermoves. History records how often
+/// the class can store History and Countermoves. History records how often
 /// different moves have been successful or unsuccessful during the current search
-/// and is used for reduction and move ordering decisions. Gains records the move's
-/// best evaluation gain from one ply to the next and is used for pruning decisions.
+/// and is used for reduction and move ordering decisions.
 /// Countermoves store the move that refute a previous one. Entries are stored
 /// according only to moving piece and destination square, hence two moves with
 /// different origin but same destination and piece will be considered identical.
-template<bool Gain, typename T>
+template<typename T>
 struct Stats {
 
   static const Value Max = Value(2000);
@@ -56,10 +55,7 @@ struct Stats {
 
   void update(Piece p, Square to, Value v) {
 
-    if (Gain)
-        table[p][to] = std::max(v, table[p][to] - 1);
-
-    else if (abs(table[p][to] + v) < Max)
+    if (abs(table[p][to] + v) < Max)
         table[p][to] +=  v;
   }
 
@@ -67,9 +63,8 @@ private:
   T table[PIECE_NB][SQUARE_NB];
 };
 
-typedef Stats< true, Value> GainsStats;
-typedef Stats<false, Value> HistoryStats;
-typedef Stats<false, std::pair<Move, Move> > CountermovesStats;
+typedef Stats<Value> HistoryStats;
+typedef Stats<std::pair<Move, Move> > CountermovesStats;
 
 
 /// MovePicker class is used to pick one pseudo legal move at a time from the