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-2020 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 && (attacks_bb<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 constexpr Color Them = ~Us;
56 constexpr Bitboard TRank7BB = (Us == WHITE ? Rank7BB : Rank2BB);
57 constexpr Bitboard TRank3BB = (Us == WHITE ? Rank3BB : Rank6BB);
58 constexpr Direction Up = pawn_push(Us);
59 constexpr Direction UpRight = (Us == WHITE ? NORTH_EAST : SOUTH_WEST);
60 constexpr Direction UpLeft = (Us == WHITE ? NORTH_WEST : SOUTH_EAST);
62 const Square ksq = pos.square<KING>(Them);
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 b1 &= pawn_attacks_bb(Them, ksq);
88 b2 &= pawn_attacks_bb(Them, ksq);
90 // Add pawn pushes which give discovered check. This is possible only
91 // if the pawn is not on the same file as the enemy king, because we
92 // don't generate captures. Note that a possible discovery check
93 // promotion has been already generated amongst the captures.
94 Bitboard dcCandidateQuiets = pos.blockers_for_king(Them) & pawnsNotOn7;
95 if (dcCandidateQuiets)
97 Bitboard dc1 = shift<Up>(dcCandidateQuiets) & emptySquares & ~file_bb(ksq);
98 Bitboard dc2 = shift<Up>(dc1 & TRank3BB) & emptySquares;
107 Square to = pop_lsb(&b1);
108 *moveList++ = make_move(to - Up, to);
113 Square to = pop_lsb(&b2);
114 *moveList++ = make_move(to - Up - Up, to);
118 // Promotions and underpromotions
121 if (Type == CAPTURES)
122 emptySquares = ~pos.pieces();
124 if (Type == EVASIONS)
125 emptySquares &= target;
127 Bitboard b1 = shift<UpRight>(pawnsOn7) & enemies;
128 Bitboard b2 = shift<UpLeft >(pawnsOn7) & enemies;
129 Bitboard b3 = shift<Up >(pawnsOn7) & emptySquares;
132 moveList = make_promotions<Type, UpRight>(moveList, pop_lsb(&b1), ksq);
135 moveList = make_promotions<Type, UpLeft >(moveList, pop_lsb(&b2), ksq);
138 moveList = make_promotions<Type, Up >(moveList, pop_lsb(&b3), ksq);
141 // Standard and en-passant captures
142 if (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
144 Bitboard b1 = shift<UpRight>(pawnsNotOn7) & enemies;
145 Bitboard b2 = shift<UpLeft >(pawnsNotOn7) & enemies;
149 Square to = pop_lsb(&b1);
150 *moveList++ = make_move(to - UpRight, to);
155 Square to = pop_lsb(&b2);
156 *moveList++ = make_move(to - UpLeft, to);
159 if (pos.ep_square() != SQ_NONE)
161 assert(rank_of(pos.ep_square()) == relative_rank(Us, RANK_6));
163 // An en passant capture can be an evasion only if the checking piece
164 // is the double pushed pawn and so is in the target. Otherwise this
165 // is a discovery check and we are forced to do otherwise.
166 if (Type == EVASIONS && !(target & (pos.ep_square() - Up)))
169 b1 = pawnsNotOn7 & pawn_attacks_bb(Them, pos.ep_square());
174 *moveList++ = make<ENPASSANT>(pop_lsb(&b1), pos.ep_square());
182 template<Color Us, PieceType Pt, bool Checks>
183 ExtMove* generate_moves(const Position& pos, ExtMove* moveList, Bitboard target) {
185 static_assert(Pt != KING && Pt != PAWN, "Unsupported piece type in generate_moves()");
187 const Square* pl = pos.squares<Pt>(Us);
189 for (Square from = *pl; from != SQ_NONE; from = *++pl)
193 if ( (Pt == BISHOP || Pt == ROOK || Pt == QUEEN)
194 && !(attacks_bb<Pt>(from) & target & pos.check_squares(Pt)))
197 if (pos.blockers_for_king(~Us) & from)
201 Bitboard b = attacks_bb<Pt>(from, pos.pieces()) & target;
204 b &= pos.check_squares(Pt);
207 *moveList++ = make_move(from, pop_lsb(&b));
214 template<Color Us, GenType Type>
215 ExtMove* generate_all(const Position& pos, ExtMove* moveList) {
216 constexpr bool Checks = Type == QUIET_CHECKS; // Reduce template instantations
222 target = pos.pieces(~Us);
226 target = ~pos.pieces();
230 Square checksq = lsb(pos.checkers());
231 target = between_bb(pos.square<KING>(Us), checksq) | checksq;
235 target = ~pos.pieces(Us);
238 static_assert(true, "Unsupported type in generate_all()");
241 moveList = generate_pawn_moves<Us, Type>(pos, moveList, target);
242 moveList = generate_moves<Us, KNIGHT, Checks>(pos, moveList, target);
243 moveList = generate_moves<Us, BISHOP, Checks>(pos, moveList, target);
244 moveList = generate_moves<Us, ROOK, Checks>(pos, moveList, target);
245 moveList = generate_moves<Us, QUEEN, Checks>(pos, moveList, target);
247 if (Type != QUIET_CHECKS && Type != EVASIONS)
249 Square ksq = pos.square<KING>(Us);
250 Bitboard b = attacks_bb<KING>(ksq) & target;
252 *moveList++ = make_move(ksq, pop_lsb(&b));
254 if ((Type != CAPTURES) && pos.can_castle(Us & ANY_CASTLING))
255 for(CastlingRights cr : { Us & KING_SIDE, Us & QUEEN_SIDE } )
256 if (!pos.castling_impeded(cr) && pos.can_castle(cr))
257 *moveList++ = make<CASTLING>(ksq, pos.castling_rook_square(cr));
266 /// <CAPTURES> Generates all pseudo-legal captures and queen promotions
267 /// <QUIETS> Generates all pseudo-legal non-captures and underpromotions
268 /// <NON_EVASIONS> Generates all pseudo-legal captures and non-captures
270 /// Returns a pointer to the end of the move list.
272 template<GenType Type>
273 ExtMove* generate(const Position& pos, ExtMove* moveList) {
275 static_assert(Type == CAPTURES || Type == QUIETS || Type == NON_EVASIONS, "Unsupported type in generate()");
276 assert(!pos.checkers());
278 Color us = pos.side_to_move();
280 return us == WHITE ? generate_all<WHITE, Type>(pos, moveList)
281 : generate_all<BLACK, Type>(pos, moveList);
284 // Explicit template instantiations
285 template ExtMove* generate<CAPTURES>(const Position&, ExtMove*);
286 template ExtMove* generate<QUIETS>(const Position&, ExtMove*);
287 template ExtMove* generate<NON_EVASIONS>(const Position&, ExtMove*);
290 /// generate<QUIET_CHECKS> generates all pseudo-legal non-captures and knight
291 /// underpromotions that give check. Returns a pointer to the end of the move list.
293 ExtMove* generate<QUIET_CHECKS>(const Position& pos, ExtMove* moveList) {
295 assert(!pos.checkers());
297 Color us = pos.side_to_move();
298 Bitboard dc = pos.blockers_for_king(~us) & pos.pieces(us) & ~pos.pieces(PAWN);
302 Square from = pop_lsb(&dc);
303 PieceType pt = type_of(pos.piece_on(from));
305 Bitboard b = attacks_bb(pt, from, pos.pieces()) & ~pos.pieces();
308 b &= ~attacks_bb<QUEEN>(pos.square<KING>(~us));
311 *moveList++ = make_move(from, pop_lsb(&b));
314 return us == WHITE ? generate_all<WHITE, QUIET_CHECKS>(pos, moveList)
315 : generate_all<BLACK, QUIET_CHECKS>(pos, moveList);
319 /// generate<EVASIONS> generates all pseudo-legal check evasions when the side
320 /// to move is in check. Returns a pointer to the end of the move list.
322 ExtMove* generate<EVASIONS>(const Position& pos, ExtMove* moveList) {
324 assert(pos.checkers());
326 Color us = pos.side_to_move();
327 Square ksq = pos.square<KING>(us);
328 Bitboard sliderAttacks = 0;
329 Bitboard sliders = pos.checkers() & ~pos.pieces(KNIGHT, PAWN);
331 // Find all the squares attacked by slider checkers. We will remove them from
332 // the king evasions in order to skip known illegal moves, which avoids any
333 // useless legality checks later on.
335 sliderAttacks |= line_bb(ksq, pop_lsb(&sliders)) & ~pos.checkers();
337 // Generate evasions for king, capture and non capture moves
338 Bitboard b = attacks_bb<KING>(ksq) & ~pos.pieces(us) & ~sliderAttacks;
340 *moveList++ = make_move(ksq, pop_lsb(&b));
342 if (more_than_one(pos.checkers()))
343 return moveList; // Double check, only a king move can save the day
345 // Generate blocking evasions or captures of the checking piece
346 return us == WHITE ? generate_all<WHITE, EVASIONS>(pos, moveList)
347 : generate_all<BLACK, EVASIONS>(pos, moveList);
351 /// generate<LEGAL> generates all the legal moves in the given position
354 ExtMove* generate<LEGAL>(const Position& pos, ExtMove* moveList) {
356 Color us = pos.side_to_move();
357 Bitboard pinned = pos.blockers_for_king(us) & pos.pieces(us);
358 Square ksq = pos.square<KING>(us);
359 ExtMove* cur = moveList;
361 moveList = pos.checkers() ? generate<EVASIONS >(pos, moveList)
362 : generate<NON_EVASIONS>(pos, moveList);
363 while (cur != moveList)
364 if ( (pinned || from_sq(*cur) == ksq || type_of(*cur) == ENPASSANT)
366 *cur = (--moveList)->move;