X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fhistory.h;h=bbe2aab3fffb8302d81f90afbda1c7eb71786814;hb=20524070901db89bd6e97b54d28dc3a2f717b0e3;hp=ce87b7e137e03ba002636b5c47741a0df01db168;hpb=d6fdd4f6d95a2a958a73484fb7505460b12af28e;p=stockfish

diff --git a/src/history.h b/src/history.h
index ce87b7e1..bbe2aab3 100644
--- a/src/history.h
+++ b/src/history.h
@@ -17,24 +17,15 @@
   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
-
 #if !defined(HISTORY_H_INCLUDED)
 #define HISTORY_H_INCLUDED
 
-////
-//// Includes
-////
-
 #include "depth.h"
 #include "move.h"
 #include "piece.h"
 #include "value.h"
 
 
-////
-//// Types
-////
-
 /// The History class stores statistics about how often different moves
 /// have been successful or unsuccessful during the current search. These
 /// statistics are used for reduction and move ordering decisions. History
@@ -58,27 +49,6 @@ private:
   int maxStaticValueDelta[16][64];  // [piece][from_square][to_square]
 };
 
-
-////
-//// Constants and variables
-////
-
-/// 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
-/// 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
-/// have been searched a long time ago.
-/// Current policy is to set this as high as possible, but avoid overflow.
-
-const int HistoryMax = (1 << 28);
-
-
-////
-//// Inline functions
-////
-
 inline int History::value(Piece p, Square to) const {
   return history[p][to];
 }