2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
5 Stockfish is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
10 Stockfish is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
29 MAIN_TT, CAPTURE_INIT, GOOD_CAPTURE, REFUTATION, QUIET_INIT, QUIET, BAD_CAPTURE,
30 EVASION_TT, EVASION_INIT, EVASION,
31 PROBCUT_TT, PROBCUT_INIT, PROBCUT,
32 QSEARCH_TT, QCAPTURE_INIT, QCAPTURE, QCHECK_INIT, QCHECK
35 // partial_insertion_sort() sorts moves in descending order up to and including
36 // a given limit. The order of moves smaller than the limit is left unspecified.
37 void partial_insertion_sort(ExtMove* begin, ExtMove* end, int limit) {
39 for (ExtMove *sortedEnd = begin, *p = begin + 1; p < end; ++p)
40 if (p->value >= limit)
44 for (q = sortedEnd; q != begin && *(q - 1) < tmp; --q)
53 /// Constructors of the MovePicker class. As arguments we pass information
54 /// to help it to return the (presumably) good moves first, to decide which
55 /// moves to return (in the quiescence search, for instance, we only want to
56 /// search captures, promotions, and some checks) and how important good move
57 /// ordering is at the current node.
59 /// MovePicker constructor for the main search
60 MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const ButterflyHistory* mh,
61 const CapturePieceToHistory* cph,
62 const PieceToHistory** ch,
65 : pos(p), mainHistory(mh), captureHistory(cph), continuationHistory(ch),
66 ttMove(ttm), refutations{{killers[0], 0}, {killers[1], 0}, {cm, 0}}, depth(d)
70 stage = (pos.checkers() ? EVASION_TT : MAIN_TT) +
71 !(ttm && pos.pseudo_legal(ttm));
75 /// MovePicker constructor for quiescence search
76 MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const ButterflyHistory* mh,
77 const CapturePieceToHistory* cph,
78 const PieceToHistory** ch,
80 : pos(p), mainHistory(mh), captureHistory(cph), continuationHistory(ch), ttMove(ttm), recaptureSquare(rs), depth(d)
84 stage = (pos.checkers() ? EVASION_TT : QSEARCH_TT) +
86 && (pos.checkers() || depth > DEPTH_QS_RECAPTURES || to_sq(ttm) == recaptureSquare)
87 && pos.pseudo_legal(ttm));
90 /// MovePicker constructor for ProbCut: we generate captures with SEE greater
91 /// than or equal to the given threshold.
92 MovePicker::MovePicker(const Position& p, Move ttm, Value th, Depth d, const CapturePieceToHistory* cph)
93 : pos(p), captureHistory(cph), ttMove(ttm), threshold(th), depth(d)
95 assert(!pos.checkers());
97 stage = PROBCUT_TT + !(ttm && pos.capture(ttm)
98 && pos.pseudo_legal(ttm)
99 && pos.see_ge(ttm, threshold));
102 /// MovePicker::score() assigns a numerical value to each move in a list, used
103 /// for sorting. Captures are ordered by Most Valuable Victim (MVV), preferring
104 /// captures with a good history. Quiets moves are ordered using the histories.
105 template<GenType Type>
106 void MovePicker::score() {
108 static_assert(Type == CAPTURES || Type == QUIETS || Type == EVASIONS, "Wrong type");
110 [[maybe_unused]] Bitboard threatenedByPawn, threatenedByMinor, threatenedByRook;
111 if constexpr (Type == QUIETS)
113 Color us = pos.side_to_move();
115 threatenedByPawn = pos.attacks_by<PAWN>(~us);
116 threatenedByMinor = pos.attacks_by<KNIGHT>(~us) | pos.attacks_by<BISHOP>(~us) | threatenedByPawn;
117 threatenedByRook = pos.attacks_by<ROOK>(~us) | threatenedByMinor;
119 // Pieces threatened by pieces of lesser material value
120 threatenedPieces = (pos.pieces(us, QUEEN) & threatenedByRook)
121 | (pos.pieces(us, ROOK) & threatenedByMinor)
122 | (pos.pieces(us, KNIGHT, BISHOP) & threatenedByPawn);
125 for (auto& m : *this)
126 if constexpr (Type == CAPTURES)
127 m.value = 6 * int(PieceValue[MG][pos.piece_on(to_sq(m))])
128 + (*captureHistory)[pos.moved_piece(m)][to_sq(m)][type_of(pos.piece_on(to_sq(m)))];
130 else if constexpr (Type == QUIETS)
131 m.value = 2 * (*mainHistory)[pos.side_to_move()][from_to(m)]
132 + 2 * (*continuationHistory[0])[pos.moved_piece(m)][to_sq(m)]
133 + (*continuationHistory[1])[pos.moved_piece(m)][to_sq(m)]
134 + (*continuationHistory[3])[pos.moved_piece(m)][to_sq(m)]
135 + (*continuationHistory[5])[pos.moved_piece(m)][to_sq(m)]
136 + (threatenedPieces & from_sq(m) ?
137 (type_of(pos.moved_piece(m)) == QUEEN && !(to_sq(m) & threatenedByRook) ? 50000
138 : type_of(pos.moved_piece(m)) == ROOK && !(to_sq(m) & threatenedByMinor) ? 25000
139 : !(to_sq(m) & threatenedByPawn) ? 15000
142 + bool(pos.check_squares(type_of(pos.moved_piece(m))) & to_sq(m)) * 16384;
143 else // Type == EVASIONS
146 m.value = PieceValue[MG][pos.piece_on(to_sq(m))]
147 - Value(type_of(pos.moved_piece(m)))
150 m.value = (*mainHistory)[pos.side_to_move()][from_to(m)]
151 + (*continuationHistory[0])[pos.moved_piece(m)][to_sq(m)];
155 /// MovePicker::select() returns the next move satisfying a predicate function.
156 /// It never returns the TT move.
157 template<MovePicker::PickType T, typename Pred>
158 Move MovePicker::select(Pred filter) {
160 while (cur < endMoves)
163 std::swap(*cur, *std::max_element(cur, endMoves));
165 if (*cur != ttMove && filter())
173 /// MovePicker::next_move() is the most important method of the MovePicker class. It
174 /// returns a new pseudo-legal move every time it is called until there are no more
175 /// moves left, picking the move with the highest score from a list of generated moves.
176 Move MovePicker::next_move(bool skipQuiets) {
191 cur = endBadCaptures = moves;
192 endMoves = generate<CAPTURES>(pos, cur);
195 partial_insertion_sort(cur, endMoves, -3000 * depth);
200 if (select<Next>([&](){
201 return pos.see_ge(*cur, Value(-69 * cur->value / 1024)) ?
202 // Move losing capture to endBadCaptures to be tried later
203 true : (*endBadCaptures++ = *cur, false); }))
206 // Prepare the pointers to loop over the refutations array
207 cur = std::begin(refutations);
208 endMoves = std::end(refutations);
210 // If the countermove is the same as a killer, skip it
211 if ( refutations[0].move == refutations[2].move
212 || refutations[1].move == refutations[2].move)
219 if (select<Next>([&](){ return *cur != MOVE_NONE
220 && !pos.capture(*cur)
221 && pos.pseudo_legal(*cur); }))
229 cur = endBadCaptures;
230 endMoves = generate<QUIETS>(pos, cur);
233 partial_insertion_sort(cur, endMoves, -3000 * depth);
241 && select<Next>([&](){return *cur != refutations[0].move
242 && *cur != refutations[1].move
243 && *cur != refutations[2].move;}))
246 // Prepare the pointers to loop over the bad captures
248 endMoves = endBadCaptures;
254 return select<Next>([](){ return true; });
258 endMoves = generate<EVASIONS>(pos, cur);
265 return select<Best>([](){ return true; });
268 return select<Next>([&](){ return pos.see_ge(*cur, threshold); });
271 if (select<Next>([&](){ return depth > DEPTH_QS_RECAPTURES
272 || to_sq(*cur) == recaptureSquare; }))
275 // If we did not find any move and we do not try checks, we have finished
276 if (depth != DEPTH_QS_CHECKS)
284 endMoves = generate<QUIET_CHECKS>(pos, cur);
290 return select<Next>([](){ return true; });
294 return MOVE_NONE; // Silence warning
297 } // namespace Stockfish