X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fhistory.h;h=c5f72f22afb6fed41da0d5b6ad694fe2d17cabda;hp=0f3fbc10405e8789219c2af0ff1d294ec1263522;hb=e304db9d1ecf6a2318708483c90fadecf4fac4ee;hpb=04108d45414c70c796d9378b247207b574e22414 diff --git a/src/history.h b/src/history.h index 0f3fbc10..c5f72f22 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,7 +20,9 @@ #if !defined(HISTORY_H_INCLUDED) #define HISTORY_H_INCLUDED +#include #include + #include "types.h" /// The History class stores statistics about how often different moves @@ -35,15 +37,15 @@ 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 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] - Value maxGains[16][64]; // [piece][to_square] + Value history[PIECE_NB][SQUARE_NB]; + Value maxGains[PIECE_NB][SQUARE_NB]; }; inline void History::clear() { @@ -55,7 +57,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; } @@ -64,7 +66,7 @@ inline Value History::gain(Piece p, Square to) const { } inline void History::update_gain(Piece p, Square to, Value g) { - maxGains[p][to] = Max(g, maxGains[p][to] - 1); + maxGains[p][to] = std::max(g, maxGains[p][to] - 1); } #endif // !defined(HISTORY_H_INCLUDED)