- template<CastlingSide Side, bool Checks, bool Chess960>
- MoveStack* generate_castle(const Position& pos, MoveStack* mlist, Color us) {
-
- if (pos.castle_impeded(us, Side) || !pos.can_castle(make_castle_right(us, Side)))
- return mlist;
-
- // After castling, the rook and king final positions are the same in Chess960
- // as they would be in standard chess.
- Square kfrom = pos.king_square(us);
- Square rfrom = pos.castle_rook_square(us, Side);
- Square kto = relative_square(us, Side == KING_SIDE ? SQ_G1 : SQ_C1);
- Bitboard enemies = pos.pieces(~us);
-
- assert(!pos.checkers());
-
- const int K = Chess960 ? kto > kfrom ? -1 : 1
- : Side == KING_SIDE ? -1 : 1;
-
- for (Square s = kto; s != kfrom; s += (Square)K)
- if (pos.attackers_to(s) & enemies)
- return mlist;
-
- // Because we generate only legal castling moves we need to verify that
- // when moving the castling rook we do not discover some hidden checker.
- // For instance an enemy queen in SQ_A1 when castling rook is in SQ_B1.
- if (Chess960 && (pos.attackers_to(kto, pos.pieces() ^ rfrom) & enemies))
- return mlist;
-
- (*mlist++).move = make<CASTLE>(kfrom, rfrom);
-
- if (Checks && !pos.move_gives_check((mlist - 1)->move, CheckInfo(pos)))
- mlist--;
-
- return mlist;
- }
-
-
- template<Square Delta>
- inline Bitboard move_pawns(Bitboard p) {
-
- return Delta == DELTA_N ? p << 8
- : Delta == DELTA_S ? p >> 8
- : Delta == DELTA_NE ? (p & ~FileHBB) << 9
- : Delta == DELTA_SE ? (p & ~FileHBB) >> 7
- : Delta == DELTA_NW ? (p & ~FileABB) << 7
- : Delta == DELTA_SW ? (p & ~FileABB) >> 9 : 0;
- }
-