X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fhistory.h;h=2eb93d85926045632dc8b7f0211565e74f56715a;hp=c265777b42a6c4d0bcf60485aae9d80a64625f43;hb=3c675db3d0c2ddf41036c3481f0891d208d4b6f5;hpb=0fcda095df1caa860e8e3f3a714d5545ec9dc122

diff --git a/src/history.h b/src/history.h
index c265777b..2eb93d85 100644
--- a/src/history.h
+++ b/src/history.h
@@ -1,7 +1,7 @@
 /*
   Stockfish, a UCI chess playing engine derived from Glaurung 2.1
   Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
-  Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+  Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
 
   Stockfish is free software: you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
@@ -20,8 +20,9 @@
 #if !defined(HISTORY_H_INCLUDED)
 #define HISTORY_H_INCLUDED
 
-#include <cstring>
 #include "types.h"
+#include <cstring>
+#include <algorithm>
 
 /// The History class stores statistics about how often different moves
 /// have been successful or unsuccessful during the current search. These
@@ -35,11 +36,11 @@ class History {
 public:
   void clear();
   Value value(Piece p, Square to) const;
-  void update(Piece p, Square to, Value bonus);
+  void add(Piece p, Square to, Value bonus);
   Value gain(Piece p, Square to) const;
-  void update_gain(Piece p, Square to, Value gain);
+  void update_gain(Piece p, Square to, Value g);
 
-  static const Value MaxValue = Value(1 << 29); // To avoid an overflow
+  static const Value MaxValue = Value(2000);
 
 private:
   Value history[16][64];  // [piece][to_square]
@@ -55,7 +56,7 @@ inline Value History::value(Piece p, Square to) const {
   return history[p][to];
 }
 
-inline void History::update(Piece p, Square to, Value bonus) {
+inline void History::add(Piece p, Square to, Value bonus) {
   if (abs(history[p][to] + bonus) < MaxValue) history[p][to] += bonus;
 }
 
@@ -63,8 +64,8 @@ inline Value History::gain(Piece p, Square to) const {
   return maxGains[p][to];
 }
 
-inline void History::update_gain(Piece p, Square to, Value gain) {
-  maxGains[p][to] = Max(gain, maxGains[p][to] - 1);
+inline void History::update_gain(Piece p, Square to, Value g) {
+  maxGains[p][to] = std::max(g, maxGains[p][to] - 1);
 }
 
 #endif // !defined(HISTORY_H_INCLUDED)