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-2019 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/>.
28 template<GenType Type, Direction D>
29 ExtMove* make_promotions(ExtMove* moveList, Square to, Square ksq) {
31 if (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
32 *moveList++ = make<PROMOTION>(to - D, to, QUEEN);
34 if (Type == QUIETS || Type == EVASIONS || Type == NON_EVASIONS)
36 *moveList++ = make<PROMOTION>(to - D, to, ROOK);
37 *moveList++ = make<PROMOTION>(to - D, to, BISHOP);
38 *moveList++ = make<PROMOTION>(to - D, to, KNIGHT);
41 // Knight promotion is the only promotion that can give a direct check
42 // that's not already included in the queen promotion.
43 if (Type == QUIET_CHECKS && (PseudoAttacks[KNIGHT][to] & ksq))
44 *moveList++ = make<PROMOTION>(to - D, to, KNIGHT);
46 (void)ksq; // Silence a warning under MSVC
52 template<Color Us, GenType Type>
53 ExtMove* generate_pawn_moves(const Position& pos, ExtMove* moveList, Bitboard target) {
55 // Compute some compile time parameters relative to the white side
56 constexpr Color Them = (Us == WHITE ? BLACK : WHITE);
57 constexpr Bitboard TRank7BB = (Us == WHITE ? Rank7BB : Rank2BB);
58 constexpr Bitboard TRank3BB = (Us == WHITE ? Rank3BB : Rank6BB);
59 constexpr Direction Up = (Us == WHITE ? NORTH : SOUTH);
60 constexpr Direction UpRight = (Us == WHITE ? NORTH_EAST : SOUTH_WEST);
61 constexpr Direction UpLeft = (Us == WHITE ? NORTH_WEST : SOUTH_EAST);
63 Bitboard emptySquares;
65 Bitboard pawnsOn7 = pos.pieces(Us, PAWN) & TRank7BB;
66 Bitboard pawnsNotOn7 = pos.pieces(Us, PAWN) & ~TRank7BB;
68 Bitboard enemies = (Type == EVASIONS ? pos.pieces(Them) & target:
69 Type == CAPTURES ? target : pos.pieces(Them));
71 // Single and double pawn pushes, no promotions
74 emptySquares = (Type == QUIETS || Type == QUIET_CHECKS ? target : ~pos.pieces());
76 Bitboard b1 = shift<Up>(pawnsNotOn7) & emptySquares;
77 Bitboard b2 = shift<Up>(b1 & TRank3BB) & emptySquares;
79 if (Type == EVASIONS) // Consider only blocking squares
85 if (Type == QUIET_CHECKS)
87 Square ksq = pos.square<KING>(Them);
89 b1 &= pos.attacks_from<PAWN>(ksq, Them);
90 b2 &= pos.attacks_from<PAWN>(ksq, Them);
92 // Add pawn pushes which give discovered check. This is possible only
93 // if the pawn is not on the same file as the enemy king, because we
94 // don't generate captures. Note that a possible discovery check
95 // promotion has been already generated amongst the captures.
96 Bitboard dcCandidateQuiets = pos.blockers_for_king(Them) & pawnsNotOn7;
97 if (dcCandidateQuiets)
99 Bitboard dc1 = shift<Up>(dcCandidateQuiets) & emptySquares & ~file_bb(ksq);
100 Bitboard dc2 = shift<Up>(dc1 & TRank3BB) & emptySquares;
109 Square to = pop_lsb(&b1);
110 *moveList++ = make_move(to - Up, to);
115 Square to = pop_lsb(&b2);
116 *moveList++ = make_move(to - Up - Up, to);
120 // Promotions and underpromotions
123 if (Type == CAPTURES)
124 emptySquares = ~pos.pieces();
126 if (Type == EVASIONS)
127 emptySquares &= target;
129 Bitboard b1 = shift<UpRight>(pawnsOn7) & enemies;
130 Bitboard b2 = shift<UpLeft >(pawnsOn7) & enemies;
131 Bitboard b3 = shift<Up >(pawnsOn7) & emptySquares;
133 Square ksq = pos.square<KING>(Them);
136 moveList = make_promotions<Type, UpRight>(moveList, pop_lsb(&b1), ksq);
139 moveList = make_promotions<Type, UpLeft >(moveList, pop_lsb(&b2), ksq);
142 moveList = make_promotions<Type, Up >(moveList, pop_lsb(&b3), ksq);
145 // Standard and en-passant captures
146 if (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
148 Bitboard b1 = shift<UpRight>(pawnsNotOn7) & enemies;
149 Bitboard b2 = shift<UpLeft >(pawnsNotOn7) & enemies;
153 Square to = pop_lsb(&b1);
154 *moveList++ = make_move(to - UpRight, to);
159 Square to = pop_lsb(&b2);
160 *moveList++ = make_move(to - UpLeft, to);
163 if (pos.ep_square() != SQ_NONE)
165 assert(rank_of(pos.ep_square()) == relative_rank(Us, RANK_6));
167 // An en passant capture can be an evasion only if the checking piece
168 // is the double pushed pawn and so is in the target. Otherwise this
169 // is a discovery check and we are forced to do otherwise.
170 if (Type == EVASIONS && !(target & (pos.ep_square() - Up)))
173 b1 = pawnsNotOn7 & pos.attacks_from<PAWN>(pos.ep_square(), Them);
178 *moveList++ = make<ENPASSANT>(pop_lsb(&b1), pos.ep_square());
186 template<PieceType Pt, bool Checks>
187 ExtMove* generate_moves(const Position& pos, ExtMove* moveList, Color us,
190 assert(Pt != KING && Pt != PAWN);
192 const Square* pl = pos.squares<Pt>(us);
194 for (Square from = *pl; from != SQ_NONE; from = *++pl)
198 if ( (Pt == BISHOP || Pt == ROOK || Pt == QUEEN)
199 && !(PseudoAttacks[Pt][from] & target & pos.check_squares(Pt)))
202 if (pos.blockers_for_king(~us) & from)
206 Bitboard b = pos.attacks_from<Pt>(from) & target;
209 b &= pos.check_squares(Pt);
212 *moveList++ = make_move(from, pop_lsb(&b));
219 template<Color Us, GenType Type>
220 ExtMove* generate_all(const Position& pos, ExtMove* moveList, Bitboard target) {
222 constexpr CastlingRight OO = Us | KING_SIDE;
223 constexpr CastlingRight OOO = Us | QUEEN_SIDE;
224 constexpr bool Checks = Type == QUIET_CHECKS; // Reduce template instantations
226 moveList = generate_pawn_moves<Us, Type>(pos, moveList, target);
227 moveList = generate_moves<KNIGHT, Checks>(pos, moveList, Us, target);
228 moveList = generate_moves<BISHOP, Checks>(pos, moveList, Us, target);
229 moveList = generate_moves< ROOK, Checks>(pos, moveList, Us, target);
230 moveList = generate_moves< QUEEN, Checks>(pos, moveList, Us, target);
232 if (Type != QUIET_CHECKS && Type != EVASIONS)
234 Square ksq = pos.square<KING>(Us);
235 Bitboard b = pos.attacks_from<KING>(ksq) & target;
237 *moveList++ = make_move(ksq, pop_lsb(&b));
239 if (Type != CAPTURES && pos.can_castle(CastlingRight(OO | OOO)))
241 if (!pos.castling_impeded(OO) && pos.can_castle(OO))
242 *moveList++ = make<CASTLING>(ksq, pos.castling_rook_square(OO));
244 if (!pos.castling_impeded(OOO) && pos.can_castle(OOO))
245 *moveList++ = make<CASTLING>(ksq, pos.castling_rook_square(OOO));
255 /// <CAPTURES> Generates all pseudo-legal captures and queen promotions
256 /// <QUIETS> Generates all pseudo-legal non-captures and underpromotions
257 /// <NON_EVASIONS> Generates all pseudo-legal captures and non-captures
259 /// Returns a pointer to the end of the move list.
261 template<GenType Type>
262 ExtMove* generate(const Position& pos, ExtMove* moveList) {
264 assert(Type == CAPTURES || Type == QUIETS || Type == NON_EVASIONS);
265 assert(!pos.checkers());
267 Color us = pos.side_to_move();
269 Bitboard target = Type == CAPTURES ? pos.pieces(~us)
270 : Type == QUIETS ? ~pos.pieces()
271 : Type == NON_EVASIONS ? ~pos.pieces(us) : 0;
273 return us == WHITE ? generate_all<WHITE, Type>(pos, moveList, target)
274 : generate_all<BLACK, Type>(pos, moveList, target);
277 // Explicit template instantiations
278 template ExtMove* generate<CAPTURES>(const Position&, ExtMove*);
279 template ExtMove* generate<QUIETS>(const Position&, ExtMove*);
280 template ExtMove* generate<NON_EVASIONS>(const Position&, ExtMove*);
283 /// generate<QUIET_CHECKS> generates all pseudo-legal non-captures and knight
284 /// underpromotions that give check. Returns a pointer to the end of the move list.
286 ExtMove* generate<QUIET_CHECKS>(const Position& pos, ExtMove* moveList) {
288 assert(!pos.checkers());
290 Color us = pos.side_to_move();
291 Bitboard dc = pos.blockers_for_king(~us) & pos.pieces(us);
295 Square from = pop_lsb(&dc);
296 PieceType pt = type_of(pos.piece_on(from));
299 continue; // Will be generated together with direct checks
301 Bitboard b = pos.attacks_from(pt, from) & ~pos.pieces();
304 b &= ~PseudoAttacks[QUEEN][pos.square<KING>(~us)];
307 *moveList++ = make_move(from, pop_lsb(&b));
310 return us == WHITE ? generate_all<WHITE, QUIET_CHECKS>(pos, moveList, ~pos.pieces())
311 : generate_all<BLACK, QUIET_CHECKS>(pos, moveList, ~pos.pieces());
315 /// generate<EVASIONS> generates all pseudo-legal check evasions when the side
316 /// to move is in check. Returns a pointer to the end of the move list.
318 ExtMove* generate<EVASIONS>(const Position& pos, ExtMove* moveList) {
320 assert(pos.checkers());
322 Color us = pos.side_to_move();
323 Square ksq = pos.square<KING>(us);
324 Bitboard sliderAttacks = 0;
325 Bitboard sliders = pos.checkers() & ~pos.pieces(KNIGHT, PAWN);
327 // Find all the squares attacked by slider checkers. We will remove them from
328 // the king evasions in order to skip known illegal moves, which avoids any
329 // useless legality checks later on.
332 Square checksq = pop_lsb(&sliders);
333 sliderAttacks |= LineBB[checksq][ksq] ^ checksq;
336 // Generate evasions for king, capture and non capture moves
337 Bitboard b = pos.attacks_from<KING>(ksq) & ~pos.pieces(us) & ~sliderAttacks;
339 *moveList++ = make_move(ksq, pop_lsb(&b));
341 if (more_than_one(pos.checkers()))
342 return moveList; // Double check, only a king move can save the day
344 // Generate blocking evasions or captures of the checking piece
345 Square checksq = lsb(pos.checkers());
346 Bitboard target = between_bb(checksq, ksq) | checksq;
348 return us == WHITE ? generate_all<WHITE, EVASIONS>(pos, moveList, target)
349 : generate_all<BLACK, EVASIONS>(pos, moveList, target);
353 /// generate<LEGAL> generates all the legal moves in the given position
356 ExtMove* generate<LEGAL>(const Position& pos, ExtMove* moveList) {
358 Color us = pos.side_to_move();
359 Bitboard pinned = pos.blockers_for_king(us) & pos.pieces(us);
360 Square ksq = pos.square<KING>(us);
361 ExtMove* cur = moveList;
363 moveList = pos.checkers() ? generate<EVASIONS >(pos, moveList)
364 : generate<NON_EVASIONS>(pos, moveList);
365 while (cur != moveList)
366 if ( (pinned || from_sq(*cur) == ksq || type_of(*cur) == ENPASSANT)
368 *cur = (--moveList)->move;