X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fhistory.h;h=5c394cc8f17e2ed75f043ba01b0251e607127222;hp=ae8345345ac73d85f6288a0eb89687b758ac1cbe;hb=c12364bb67741daff123c50770b1fd6923fa9530;hpb=b98bcf858ba0cac58d52b76eb1bea40e25adcaa1

diff --git a/src/history.h b/src/history.h
index ae834534..5c394cc8 100644
--- a/src/history.h
+++ b/src/history.h
@@ -47,14 +47,11 @@ public:
   History();
   void clear();
   void success(Piece p, Square to, Depth d);
-  void failure(Piece p, Square to);
+  void failure(Piece p, Square to, Depth d);
   int move_ordering_score(Piece p, Square to) const;
-  bool ok_to_prune(Piece p, Square to, Depth d) const;
 
 private:
   int history[16][64];  // [piece][square]
-  int successCount[16][64];
-  int failureCount[16][64];
 };
 
 
@@ -64,7 +61,7 @@ private:
 
 /// HistoryMax controls how often the history counters will be scaled down:
 /// When the history score for a move gets bigger than HistoryMax, all
-/// entries in the table are divided by 2. It is difficult to guess what
+/// entries in the table are divided by 4. It is difficult to guess what
 /// the ideal value of this constant is. Scaling down the scores often has
 /// the effect that parts of the search tree which have been searched
 /// recently have a bigger importance for move ordering than the moves which