-template MoveStack* generate<CAPTURES>(const Position& pos, MoveStack* mlist);
-template MoveStack* generate<QUIETS>(const Position& pos, MoveStack* mlist);
-template MoveStack* generate<NON_EVASIONS>(const Position& pos, MoveStack* mlist);
-
-
-/// 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);
- }
-
- mlist = (us == WHITE ? generate_pawn_moves<WHITE, QUIET_CHECKS>(pos, mlist, ci.dcCandidates, ci.ksq)
- : generate_pawn_moves<BLACK, QUIET_CHECKS>(pos, mlist, ci.dcCandidates, ci.ksq));
-
- mlist = generate_direct_checks<KNIGHT>(pos, mlist, us, ci);
- mlist = generate_direct_checks<BISHOP>(pos, mlist, us, ci);
- mlist = generate_direct_checks<ROOK>(pos, mlist, us, ci);
- mlist = generate_direct_checks<QUEEN>(pos, mlist, us, ci);
-
- if (pos.can_castle(us))
- {
- mlist = generate_castle<KING_SIDE, true>(pos, mlist, us);
- mlist = generate_castle<QUEEN_SIDE, true>(pos, mlist, us);
- }
-
- return mlist;
-}
-
-
-/// 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());
-
- Bitboard b, target;
- Square from, checksq;
- int checkersCnt = 0;
- Color us = pos.side_to_move();
- Square ksq = pos.king_square(us);
- Bitboard sliderAttacks = 0;
- Bitboard checkers = pos.checkers();
-
- assert(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.
- b = checkers;
- 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);
-
- // Generate evasions for other pieces only if not under a double check
- if (checkersCnt > 1)
- return mlist;
-
- // Blocking evasions or captures of the checking piece
- target = between_bb(checksq, ksq) | checkers;
-
- mlist = (us == WHITE ? generate_pawn_moves<WHITE, EVASIONS>(pos, mlist, target)
- : generate_pawn_moves<BLACK, EVASIONS>(pos, mlist, target));
-
- mlist = generate_moves<KNIGHT>(pos, mlist, us, target);
- mlist = generate_moves<BISHOP>(pos, mlist, us, target);
- mlist = generate_moves<ROOK>(pos, mlist, us, target);
- return generate_moves<QUEEN>(pos, mlist, us, target);
-}