/// adjacent_files_bb() returns a bitboard representing all the squares on the
/// adjacent files of the given one.
-inline Bitboard adjacent_files_bb(File f) {
- return shift<EAST>(file_bb(f)) | shift<WEST>(file_bb(f));
+inline Bitboard adjacent_files_bb(Square s) {
+ return shift<EAST>(file_bb(s)) | shift<WEST>(file_bb(s));
}
/// starting from the given square.
inline Bitboard pawn_attack_span(Color c, Square s) {
- return forward_ranks_bb(c, s) & adjacent_files_bb(file_of(s));
+ return forward_ranks_bb(c, s) & adjacent_files_bb(s);
}
/// the given color and on the given square is a passed pawn.
inline Bitboard passed_pawn_span(Color c, Square s) {
- return forward_ranks_bb(c, s) & (adjacent_files_bb(file_of(s)) | file_bb(s));
+ return forward_ranks_bb(c, s) & (adjacent_files_bb(s) | file_bb(s));
}
{
assert(pos.piece_on(s) == make_piece(Us, PAWN));
- File f = file_of(s);
Rank r = relative_rank(Us, s);
e->pawnAttacksSpan[Us] |= pawn_attack_span(Us, s);
lever = theirPawns & PawnAttacks[Us][s];
leverPush = theirPawns & PawnAttacks[Us][s + Up];
doubled = ourPawns & (s - Up);
- neighbours = ourPawns & adjacent_files_bb(f);
+ neighbours = ourPawns & adjacent_files_bb(s);
phalanx = neighbours & rank_bb(s);
support = neighbours & rank_bb(s - Up);