-template MoveStack* generate<CAPTURES>(const Position&, MoveStack*);
-template MoveStack* generate<QUIETS>(const Position&, MoveStack*);
-template MoveStack* generate<NON_EVASIONS>(const Position&, MoveStack*);
-
-
-/// generate<QUIET_CHECKS> generates all pseudo-legal non-captures and knight
-/// underpromotions that give check. Returns a pointer to the end of the move list.
-template<>
-MoveStack* generate<QUIET_CHECKS>(const Position& pos, MoveStack* mlist) {
-
- assert(!pos.in_check());
-
- Color us = pos.side_to_move();
- CheckInfo ci(pos);
- Bitboard dc = ci.dcCandidates;
-
- while (dc)
- {
- Square from = pop_lsb(&dc);
- PieceType pt = type_of(pos.piece_on(from));
-
- if (pt == PAWN)
- continue; // Will be generated togheter with direct checks
-
- Bitboard b = pos.attacks_from(Piece(pt), from) & ~pos.pieces();
-
- if (pt == KING)
- b &= ~PseudoAttacks[QUEEN][ci.ksq];
-
- SERIALIZE(b);
- }
-
- return generate_all_moves<QUIET_CHECKS>(pos, mlist, us, ~pos.pieces(), &ci);
-}
-
-
-/// generate<EVASIONS> generates all pseudo-legal check evasions when the side
-/// to move is in check. Returns a pointer to the end of the move list.
-template<>
-MoveStack* generate<EVASIONS>(const Position& pos, MoveStack* mlist) {
-
- assert(pos.in_check());
-
- Square from, checksq;
- int checkersCnt = 0;
- Color us = pos.side_to_move();
- Square ksq = pos.king_square(us);
- Bitboard sliderAttacks = 0;
- Bitboard b = pos.checkers();
-
- assert(pos.checkers());
-
- // Find squares attacked by slider checkers, we will remove them from the king
- // evasions so to skip known illegal moves avoiding useless legality check later.
- do
- {
- checkersCnt++;
- checksq = pop_lsb(&b);
-
- assert(color_of(pos.piece_on(checksq)) == ~us);
-
- switch (type_of(pos.piece_on(checksq)))
- {
- case BISHOP: sliderAttacks |= PseudoAttacks[BISHOP][checksq]; break;
- case ROOK: sliderAttacks |= PseudoAttacks[ROOK][checksq]; break;
- case QUEEN:
- // If queen and king are far or not on a diagonal line we can safely
- // remove all the squares attacked in the other direction becuase are
- // not reachable by the king anyway.
- if (between_bb(ksq, checksq) || !(PseudoAttacks[BISHOP][checksq] & ksq))
- sliderAttacks |= PseudoAttacks[QUEEN][checksq];
-
- // Otherwise we need to use real rook attacks to check if king is safe
- // to move in the other direction. For example: king in B2, queen in A1
- // a knight in B1, and we can safely move to C1.
- else
- sliderAttacks |= PseudoAttacks[BISHOP][checksq] | pos.attacks_from<ROOK>(checksq);
-
- default:
- break;
- }
- } while (b);
-
- // Generate evasions for king, capture and non capture moves
- b = pos.attacks_from<KING>(ksq) & ~pos.pieces(us) & ~sliderAttacks;
- from = ksq;
- SERIALIZE(b);
-
- if (checkersCnt > 1)
- return mlist; // Double check, only a king move can save the day
-
- // Generate blocking evasions or captures of the checking piece
- Bitboard target = between_bb(checksq, ksq) | pos.checkers();
-
- return generate_all_moves<EVASIONS>(pos, mlist, us, target);
-}