- Square rsq = pos.initial_kr_square(us);
- Square g1 = relative_square(us, SQ_G1);
- Square f1 = relative_square(us, SQ_F1);
- Square s;
- bool illegal = false;
-
- assert(pos.piece_on(rsq) == rook_of_color(us));
-
- for (s = Min(ksq, g1); s <= Max(ksq, g1); s++)
- if ( (s != ksq && s != rsq && pos.square_is_occupied(s))
- || pos.square_is_attacked(s, them))
- illegal = true;
-
- for (s = Min(rsq, f1); s <= Max(rsq, f1); s++)
- if (s != ksq && s != rsq && pos.square_is_occupied(s))
- illegal = true;
-
- if (!illegal)
- mlist[n++].move = make_castle_move(ksq, rsq);
- }
-
- if (pos.can_castle_queenside(us))
- {
- Square rsq = pos.initial_qr_square(us);
- Square c1 = relative_square(us, SQ_C1);
- Square d1 = relative_square(us, SQ_D1);
- Square s;
- bool illegal = false;
-
- assert(pos.piece_on(rsq) == rook_of_color(us));
-
- for (s = Min(ksq, c1); s <= Max(ksq, c1); s++)
- if ( (s != ksq && s != rsq && pos.square_is_occupied(s))
- || pos.square_is_attacked(s, them))
- illegal = true;
-
- for (s = Min(rsq, d1); s <= Max(rsq, d1); s++)
- if (s != ksq && s != rsq && pos.square_is_occupied(s))
- illegal = true;
-
- if ( square_file(rsq) == FILE_B
- && ( pos.piece_on(relative_square(us, SQ_A1)) == rook_of_color(them)
- || pos.piece_on(relative_square(us, SQ_A1)) == queen_of_color(them)))
- illegal = true;
-
- if (!illegal)
- mlist[n++].move = make_castle_move(ksq, rsq);
- }
- }
- return n;
- }
-
-
- template<Color C>
- int generate_pawn_checks(const Position& pos, Bitboard dc, Square ksq, MoveStack* mlist, int n)
- {
- static const PawnOffsets ofs = (C == WHITE ? WhitePawnOffsets : BlackPawnOffsets);
-
- // Pawn moves which give discovered check. This is possible only if the
- // pawn is not on the same file as the enemy king, because we don't
- // generate captures.
- Bitboard empty = pos.empty_squares();
-
- // Find all friendly pawns not on the enemy king's file
- Bitboard b1 = pos.pawns(pos.side_to_move()) & ~file_bb(ksq), b2, b3;
-
- // Discovered checks, single pawn pushes
- b2 = b3 = (ofs.forward)(b1 & dc) & ~ofs.Rank8BB & empty;
- while (b3)
- {
- Square to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(to - ofs.DELTA_N, to);
+ // Consider only pawn moves which give direct checks
+ b1 &= pos.attacks_from<PAWN>(ksq, Them);
+ b2 &= pos.attacks_from<PAWN>(ksq, Them);
+
+ // Add pawn moves which gives discovered check. This is possible only
+ // if the pawn is not on the same file as the enemy king, because we
+ // don't generate captures.
+ if (pawns & target) // For CHECK type target is dc bitboard
+ {
+ dc1 = move_pawns<UP>(pawns & target & ~file_bb(ksq)) & emptySquares;
+ dc2 = move_pawns<UP>(dc1 & TRank3BB) & emptySquares;
+
+ b1 |= dc1;
+ b2 |= dc2;
+ }
+ }
+ SERIALIZE_MOVES_D(b1, -UP);
+ SERIALIZE_MOVES_D(b2, -UP -UP);