X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Fhistory.h;h=ce87b7e137e03ba002636b5c47741a0df01db168;hb=d6fdd4f6d95a2a958a73484fb7505460b12af28e;hp=b1121d85d54ea40f470762e6d2af7ca46990191d;hpb=439aea9ab79373f4520d157ef5feac6cff0ded56;p=stockfish

diff --git a/src/history.h b/src/history.h
index b1121d85..ce87b7e1 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
@@ -49,7 +49,7 @@ public:
   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;
+  int value(Piece p, Square to) const;
   void set_gain(Piece p, Square to, Value delta);
   Value gain(Piece p, Square to) const;
 
@@ -70,8 +70,21 @@ private:
 /// 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 = 50000 * OnePly;
+const int HistoryMax = (1 << 28);
 
 
+////
+//// Inline functions
+////
+
+inline int History::value(Piece p, Square to) const {
+  return history[p][to];
+}
+
+inline Value History::gain(Piece p, Square to) const {
+  return Value(maxStaticValueDelta[p][to]);
+}
+
 #endif // !defined(HISTORY_H_INCLUDED)