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-2015 Marco Costalba, Joona Kiiski, Tord Romstad
5 Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
7 Stockfish is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
12 Stockfish is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>.
21 #ifndef MOVEPICK_H_INCLUDED
22 #define MOVEPICK_H_INCLUDED
24 #include <algorithm> // For std::max
25 #include <cstring> // For std::memset
32 /// The Stats struct stores moves statistics. According to the template parameter
33 /// the class can store History and Countermoves. History records how often
34 /// different moves have been successful or unsuccessful during the current search
35 /// and is used for reduction and move ordering decisions.
36 /// Countermoves store the move that refute a previous one. Entries are stored
37 /// using only the moving piece and destination square, hence two moves with
38 /// different origin but same destination and piece will be considered identical.
39 template<typename T, bool CM = false>
42 static const Value Max = Value(1 << 28);
45 const T* operator[](Piece pc) const { return table[pc]; }
46 T* operator[](Piece pc) { return table[pc]; }
47 void clear() { std::memset(table, 0, sizeof(table)); }
48 void update(Piece pc, Square to, Move m) { table[pc][to] = m; }
49 void update(Piece pc, Square to, Value v) {
51 if (abs(int(v)) >= 324)
54 table[pc][to] -= table[pc][to] * abs(int(v)) / (CM ? 936 : 324);
55 table[pc][to] += int(v) * 32;
59 T table[PIECE_NB][SQUARE_NB];
62 typedef Stats<Move> MoveStats;
63 typedef Stats<Value, false> HistoryStats;
64 typedef Stats<Value, true> CounterMoveStats;
65 typedef Stats<CounterMoveStats> CounterMoveHistoryStats;
69 Value get(Color c, Move m) const { return table[c][from_sq(m)][to_sq(m)]; }
70 void clear() { std::memset(table, 0, sizeof(table)); }
71 void update(Color c, Move m, Value v) {
73 if (abs(int(v)) >= 324)
76 Square from = from_sq(m);
79 table[c][from][to] -= table[c][from][to] * abs(int(v)) / 324;
80 table[c][from][to] += int(v) * 32;
84 Value table[COLOR_NB][SQUARE_NB][SQUARE_NB];
88 /// MovePicker class is used to pick one pseudo legal move at a time from the
89 /// current position. The most important method is next_move(), which returns a
90 /// new pseudo legal move each time it is called, until there are no moves left,
91 /// when MOVE_NONE is returned. In order to improve the efficiency of the alpha
92 /// beta algorithm, MovePicker attempts to return the moves which are most likely
93 /// to get a cut-off first.
94 namespace Search { struct Stack; }
98 MovePicker(const MovePicker&) = delete;
99 MovePicker& operator=(const MovePicker&) = delete;
101 MovePicker(const Position&, Move, Value);
102 MovePicker(const Position&, Move, Depth, Square);
103 MovePicker(const Position&, Move, Depth, Search::Stack*);
108 template<GenType> void score();
109 ExtMove* begin() { return cur; }
110 ExtMove* end() { return endMoves; }
113 const Search::Stack* ss;
117 Square recaptureSquare;
120 ExtMove *cur, *endMoves, *endBadCaptures;
121 ExtMove moves[MAX_MOVES];
124 #endif // #ifndef MOVEPICK_H_INCLUDED