X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fhistory.h;h=c265777b42a6c4d0bcf60485aae9d80a64625f43;hp=bbe2aab3fffb8302d81f90afbda1c7eb71786814;hb=d372f2e39a65e2b14fc0335841e652a9d208d3ec;hpb=20524070901db89bd6e97b54d28dc3a2f717b0e3 diff --git a/src/history.h b/src/history.h index bbe2aab3..c265777b 100644 --- a/src/history.h +++ b/src/history.h @@ -20,11 +20,8 @@ #if !defined(HISTORY_H_INCLUDED) #define HISTORY_H_INCLUDED -#include "depth.h" -#include "move.h" -#include "piece.h" -#include "value.h" - +#include +#include "types.h" /// The History class stores statistics about how often different moves /// have been successful or unsuccessful during the current search. These @@ -36,25 +33,38 @@ class History { public: - History(); void clear(); - void success(Piece p, Square to, Depth d); - void failure(Piece p, Square to, Depth d); - int value(Piece p, Square to) const; - void set_gain(Piece p, Square to, Value delta); + Value value(Piece p, Square to) const; + void update(Piece p, Square to, Value bonus); Value gain(Piece p, Square to) const; + void update_gain(Piece p, Square to, Value gain); + + static const Value MaxValue = Value(1 << 29); // To avoid an overflow private: - int history[16][64]; // [piece][square] - int maxStaticValueDelta[16][64]; // [piece][from_square][to_square] + Value history[16][64]; // [piece][to_square] + Value maxGains[16][64]; // [piece][to_square] }; -inline int History::value(Piece p, Square to) const { +inline void History::clear() { + memset(history, 0, 16 * 64 * sizeof(Value)); + memset(maxGains, 0, 16 * 64 * sizeof(Value)); +} + +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] + bonus) < MaxValue) history[p][to] += bonus; +} + inline Value History::gain(Piece p, Square to) const { - return Value(maxStaticValueDelta[p][to]); + return maxGains[p][to]; +} + +inline void History::update_gain(Piece p, Square to, Value gain) { + maxGains[p][to] = Max(gain, maxGains[p][to] - 1); } #endif // !defined(HISTORY_H_INCLUDED)