X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fhistory.h;h=f04a6f165bf611795a653cb85aebd5d3d90e0d77;hp=47543d54db7ad2995791246a763e843c5bf79464;hb=c2d42ea8339b49e52a116e488214a14fda09d413;hpb=877b468e3e8a3b7f7482266007237c6974f7f282 diff --git a/src/history.h b/src/history.h index 47543d54..f04a6f16 100644 --- a/src/history.h +++ b/src/history.h @@ -20,13 +20,9 @@ #if !defined(HISTORY_H_INCLUDED) #define HISTORY_H_INCLUDED +#include "types.h" #include - -#include "depth.h" -#include "move.h" -#include "piece.h" -#include "value.h" - +#include /// The History class stores statistics about how often different moves /// have been successful or unsuccessful during the current search. These @@ -38,14 +34,13 @@ class History { public: - History() { clear(); } void clear(); - int value(Piece p, Square to) const; - void update(Piece p, Square to, Value delta); + Value value(Piece p, Square to) const; + void add(Piece p, Square to, Value bonus); Value gain(Piece p, Square to) const; - void update_gain(Piece p, Square to, Value delta); + void update_gain(Piece p, Square to, Value g); - static const int MaxValue = (1 << 29); // To avoid an overflow + static const Value MaxValue = Value(2000); private: Value history[16][64]; // [piece][to_square] @@ -53,24 +48,24 @@ private: }; inline void History::clear() { - memset(history, 0, 16 * 64 * sizeof(int)); - memset(maxGains, 0, 16 * 64 * sizeof(int)); + memset(history, 0, 16 * 64 * sizeof(Value)); + memset(maxGains, 0, 16 * 64 * sizeof(Value)); } -inline int History::value(Piece p, Square to) const { +inline Value History::value(Piece p, Square to) const { return history[p][to]; } -inline void History::update(Piece p, Square to, Value bonus) { - if (abs(history[p][to]) < MaxValue) history[p][to] += bonus; +inline void History::add(Piece p, Square to, Value bonus) { + if (abs(history[p][to] + bonus) < MaxValue) history[p][to] += bonus; } 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] = (gain >= maxGains[p][to] ? 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)