X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fhistory.h;h=9206cdf4bc7d8a45ad34612e12244ec23a55dcc2;hp=b12169471842a50a6b85be1314082646462f1062;hb=13a42284b6b2097c45c6973a034bcfdc5a04e05d;hpb=f37741cc83e620588d49bbb3a2349c9505e87f61

diff --git a/src/history.h b/src/history.h
index b1216947..9206cdf4 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-2009 Marco Costalba
+  Copyright (C) 2008-2010 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
@@ -17,13 +17,10 @@
   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
-
 #if !defined(HISTORY_H_INCLUDED)
 #define HISTORY_H_INCLUDED
 
-////
-//// Includes
-////
+#include <cstring>
 
 #include "depth.h"
 #include "move.h"
@@ -31,10 +28,6 @@
 #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
@@ -45,33 +38,41 @@
 class History {
 
 public:
-  History();
+  History() { clear(); }
   void clear();
-  void success(Piece p, Square to, Depth d);
-  void failure(Piece p, Square to, Depth d);
-  int move_ordering_score(Piece p, Square to) const;
-  void set_gain(Piece p, Square from, Square to, Value delta);
-  Value gain(Piece p, Square from, Square to) const;
+  int value(Piece p, Square to) const;
+  void update(Piece p, Square to, Value delta);
+  Value gain(Piece p, Square to) const;
+  void update_gain(Piece p, Square to, Value delta);
 
 private:
-  int history[16][64];  // [piece][square]
-  int maxStaticValueDelta[16][64][64];  // [piece][from_square][to_square]
+  Value history[16][64];  // [piece][to_square]
+  Value maxGains[16][64]; // [piece][to_square]
 };
 
+inline void History::clear() {
+  memset(history,  0, 16 * 64 * sizeof(int));
+  memset(maxGains, 0, 16 * 64 * sizeof(int));
+}
+
+inline int History::value(Piece p, Square to) const {
+  return history[p][to];
+}
 
-////
-//// Constants and variables
-////
+inline void History::update(Piece p, Square to, Value bonus) {
+  history[p][to] += bonus;
+}
 
-/// 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.
+inline Value History::gain(Piece p, Square to) const {
+  return maxGains[p][to];
+}
 
-const int HistoryMax = 50000 * OnePly;
+inline void History::update_gain(Piece p, Square to, Value gain) {
 
+  if (gain >= maxGains[p][to])
+      maxGains[p][to] = gain;
+  else
+      maxGains[p][to]--;
+}
 
 #endif // !defined(HISTORY_H_INCLUDED)