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-2009 Marco Costalba
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/>.
21 #if !defined(HISTORY_H_INCLUDED)
22 #define HISTORY_H_INCLUDED
37 /// The History class stores statistics about how often different moves
38 /// have been successful or unsuccessful during the current search. These
39 /// statistics are used for reduction and move ordering decisions. History
40 /// entries are stored according only to moving piece and destination square,
41 /// in particular two moves with different origin but same destination and
42 /// same piece will be considered identical.
49 void success(Piece p, Square to, Depth d);
50 void failure(Piece p, Square to);
51 int move_ordering_score(Piece p, Square to) const;
52 bool ok_to_prune(Piece p, Square to, Depth d) const;
55 int history[16][64]; // [piece][square]
56 int successCount[16][64];
57 int failureCount[16][64];
62 //// Constants and variables
65 /// HistoryMax controls how often the history counters will be scaled down:
66 /// When the history score for a move gets bigger than HistoryMax, all
67 /// entries in the table are divided by 2. It is difficult to guess what
68 /// the ideal value of this constant is. Scaling down the scores often has
69 /// the effect that parts of the search tree which have been searched
70 /// recently have a bigger importance for move ordering than the moves which
71 /// have been searched a long time ago.
73 const int HistoryMax = 25000 * OnePly;
76 #endif // !defined(HISTORY_H_INCLUDED)