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/>.
29 MAIN_SEARCH, GOOD_CAPTURES_INIT, GOOD_CAPTURES, KILLERS, KILLERS_2,
30 QUIET_INIT, QUIET, BAD_CAPTURES,
31 EVASION, ALL_EVASIONS,
32 QSEARCH_WITH_CHECKS, QCAPTURES_CHECKS_INIT, QCAPTURES_CHECKS, CHECKS,
33 QSEARCH_WITHOUT_CHECKS, QCAPTURES_NO_CHECKS, REMAINING,
34 RECAPTURE, RECAPTURES,
35 PROBCUT, PROBCUT_INIT, PROBCUT_CAPTURES
38 // Our insertion sort, which is guaranteed to be stable, as it should be
39 void insertion_sort(ExtMove* begin, ExtMove* end)
43 for (p = begin + 1; p < end; ++p)
46 for (q = p; q != begin && *(q-1) < tmp; --q)
52 // pick_best() finds the best move in the range (begin, end) and moves it to
53 // the front. It's faster than sorting all the moves in advance when there
54 // are few moves, e.g., the possible captures.
55 Move pick_best(ExtMove* begin, ExtMove* end)
57 std::swap(*begin, *std::max_element(begin, end));
64 /// Constructors of the MovePicker class. As arguments we pass information
65 /// to help it to return the (presumably) good moves first, to decide which
66 /// moves to return (in the quiescence search, for instance, we only want to
67 /// search captures, promotions, and some checks) and how important good move
68 /// ordering is at the current node.
70 MovePicker::MovePicker(const Position& p, Move ttm, Depth d, Search::Stack* s)
71 : pos(p), ss(s), depth(d) {
73 assert(d > DEPTH_ZERO);
75 Square prevSq = to_sq((ss-1)->currentMove);
76 countermove = pos.this_thread()->counterMoves[pos.piece_on(prevSq)][prevSq];
78 stage = pos.checkers() ? EVASION : MAIN_SEARCH;
79 ttMove = ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE;
80 stage += (ttMove == MOVE_NONE);
83 MovePicker::MovePicker(const Position& p, Move ttm, Depth d, Square s)
86 assert(d <= DEPTH_ZERO);
91 else if (d > DEPTH_QS_NO_CHECKS)
92 stage = QSEARCH_WITH_CHECKS;
94 else if (d > DEPTH_QS_RECAPTURES)
95 stage = QSEARCH_WITHOUT_CHECKS;
104 ttMove = ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE;
105 stage += (ttMove == MOVE_NONE);
108 MovePicker::MovePicker(const Position& p, Move ttm, Value th)
109 : pos(p), threshold(th) {
111 assert(!pos.checkers());
115 // In ProbCut we generate captures with SEE higher than the given threshold
117 && pos.pseudo_legal(ttm)
119 && pos.see(ttm) > threshold ? ttm : MOVE_NONE;
121 stage += (ttMove == MOVE_NONE);
125 /// score() assigns a numerical value to each move in a move list. The moves with
126 /// highest values will be picked first.
128 void MovePicker::score<CAPTURES>() {
129 // Winning and equal captures in the main search are ordered by MVV, preferring
130 // captures near our home rank. Surprisingly, this appears to perform slightly
131 // better than SEE-based move ordering: exchanging big pieces before capturing
132 // a hanging piece probably helps to reduce the subtree size.
133 // In the main search we want to push captures with negative SEE values to the
134 // badCaptures[] array, but instead of doing it now we delay until the move
135 // has been picked up, saving some SEE calls in case we get a cutoff.
136 for (auto& m : *this)
137 m.value = PieceValue[MG][pos.piece_on(to_sq(m))]
138 - Value(200 * relative_rank(pos.side_to_move(), to_sq(m)));
142 void MovePicker::score<QUIETS>() {
144 const HistoryStats& history = pos.this_thread()->history;
145 const FromToStats& fromTo = pos.this_thread()->fromTo;
147 const CounterMoveStats* cm = (ss-1)->counterMoves;
148 const CounterMoveStats* fm = (ss-2)->counterMoves;
149 const CounterMoveStats* f2 = (ss-4)->counterMoves;
151 Color c = pos.side_to_move();
153 for (auto& m : *this)
154 m.value = history[pos.moved_piece(m)][to_sq(m)]
155 + (cm ? (*cm)[pos.moved_piece(m)][to_sq(m)] : VALUE_ZERO)
156 + (fm ? (*fm)[pos.moved_piece(m)][to_sq(m)] : VALUE_ZERO)
157 + (f2 ? (*f2)[pos.moved_piece(m)][to_sq(m)] : VALUE_ZERO)
162 void MovePicker::score<EVASIONS>() {
163 // Try winning and equal captures ordered by MVV/LVA, then non-captures ordered
164 // by history value, then bad captures and quiet moves with a negative SEE ordered
166 const HistoryStats& history = pos.this_thread()->history;
167 const FromToStats& fromTo = pos.this_thread()->fromTo;
168 Color c = pos.side_to_move();
171 for (auto& m : *this)
172 if ((see = pos.see_sign(m)) < VALUE_ZERO)
173 m.value = see - HistoryStats::Max; // At the bottom
175 else if (pos.capture(m))
176 m.value = PieceValue[MG][pos.piece_on(to_sq(m))]
177 - Value(type_of(pos.moved_piece(m))) + HistoryStats::Max;
179 m.value = history[pos.moved_piece(m)][to_sq(m)] + fromTo.get(c, m);
183 /// next_move() is the most important method of the MovePicker class. It returns
184 /// a new pseudo legal move every time it is called, until there are no more moves
185 /// left. It picks the move with the biggest value from a list of generated moves
186 /// taking care not to return the ttMove if it has already been searched.
188 Move MovePicker::next_move() {
194 case MAIN_SEARCH: case EVASION: case QSEARCH_WITH_CHECKS:
195 case QSEARCH_WITHOUT_CHECKS: case PROBCUT:
199 case GOOD_CAPTURES_INIT:
200 endBadCaptures = cur = moves;
201 endMoves = generate<CAPTURES>(pos, cur);
206 while (cur < endMoves)
208 move = pick_best(cur++, endMoves);
211 if (pos.see_sign(move) >= VALUE_ZERO)
214 // Losing capture, move it to the beginning of the array
215 *endBadCaptures++ = move;
221 move = ss->killers[0];
222 if ( move != MOVE_NONE
224 && pos.pseudo_legal(move)
225 && !pos.capture(move))
230 move = ss->killers[1]; // Second killer move
231 if ( move != MOVE_NONE
233 && pos.pseudo_legal(move)
234 && !pos.capture(move))
240 if ( move != MOVE_NONE
242 && move != ss->killers[0]
243 && move != ss->killers[1]
244 && pos.pseudo_legal(move)
245 && !pos.capture(move))
249 cur = endBadCaptures;
250 endMoves = generate<QUIETS>(pos, cur);
252 if (depth < 3 * ONE_PLY)
254 ExtMove* goodQuiet = std::partition(cur, endMoves, [](const ExtMove& m)
255 { return m.value > VALUE_ZERO; });
256 insertion_sort(cur, goodQuiet);
258 insertion_sort(cur, endMoves);
262 while (cur < endMoves)
266 && move != ss->killers[0]
267 && move != ss->killers[1]
268 && move != countermove)
272 cur = moves; // Point to beginning of bad captures
275 if (cur < endBadCaptures)
281 endMoves = generate<EVASIONS>(pos, cur);
282 if (endMoves - cur > 1)
287 case QCAPTURES_CHECKS_INIT:
288 case QCAPTURES_NO_CHECKS:
290 endMoves = generate<CAPTURES>(pos, cur);
295 case QCAPTURES_CHECKS:
297 while (cur < endMoves)
299 move = pick_best(cur++, endMoves);
303 if (stage == REMAINING)
306 endMoves = generate<QUIET_CHECKS>(pos, cur);
310 while (cur < endMoves)
320 endMoves = generate<CAPTURES>(pos, cur);
325 while (cur < endMoves)
327 move = pick_best(cur++, endMoves);
328 if (to_sq(move) == recaptureSquare)
335 endMoves = generate<CAPTURES>(pos, cur);
339 case PROBCUT_CAPTURES:
340 while (cur < endMoves)
342 move = pick_best(cur++, endMoves);
344 && pos.see(move) > threshold)