Fix a comment in HistoryMax description

[stockfish] / src / history.h

diff --git a/src/history.h b/src/history.h
index ae8345345ac73d85f6288a0eb89687b758ac1cbe..5c394cc8f17e2ed75f043ba01b0251e607127222 100644 (file)
--- a/src/history.h
+++ b/src/history.h
@@ -47,14 +47,11 @@ public:
   History();
   void clear();
   void success(Piece p, Square to, Depth d);
   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;
   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]
 
 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
 
 /// 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
 /// 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