2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
20 #if !defined(HISTORY_H_INCLUDED)
21 #define HISTORY_H_INCLUDED
26 /// The History class stores statistics about how often different moves
27 /// have been successful or unsuccessful during the current search. These
28 /// statistics are used for reduction and move ordering decisions. History
29 /// entries are stored according only to moving piece and destination square,
30 /// in particular two moves with different origin but same destination and
31 /// same piece will be considered identical.
37 Value value(Piece p, Square to) const;
38 void update(Piece p, Square to, Value bonus);
39 Value gain(Piece p, Square to) const;
40 void update_gain(Piece p, Square to, Value g);
42 static const Value MaxValue = Value(2000);
45 Value history[16][64]; // [piece][to_square]
46 Value maxGains[16][64]; // [piece][to_square]
49 inline void History::clear() {
50 memset(history, 0, 16 * 64 * sizeof(Value));
51 memset(maxGains, 0, 16 * 64 * sizeof(Value));
54 inline Value History::value(Piece p, Square to) const {
55 return history[p][to];
58 inline void History::update(Piece p, Square to, Value bonus) {
59 if (abs(history[p][to] + bonus) < MaxValue) history[p][to] += bonus;
62 inline Value History::gain(Piece p, Square to) const {
63 return maxGains[p][to];
66 inline void History::update_gain(Piece p, Square to, Value g) {
67 maxGains[p][to] = Max(g, maxGains[p][to] - 1);
70 #endif // !defined(HISTORY_H_INCLUDED)