- FileBB[i] = FileBB[i - 1] << 1;
- RankBB[i] = RankBB[i - 1] << 8;
- }
-
- for (File f = FILE_A; f <= FILE_H; f++)
- {
- AdjacentFilesBB[f] = (f > FILE_A ? FileBB[f - 1] : 0) | (f < FILE_H ? FileBB[f + 1] : 0);
- ThisAndAdjacentFilesBB[f] = FileBB[f] | AdjacentFilesBB[f];
- }
-
- for (Rank r = RANK_1; r < RANK_8; r++)
- InFrontBB[WHITE][r] = ~(InFrontBB[BLACK][r + 1] = InFrontBB[BLACK][r] | RankBB[r]);
-
- for (Color c = WHITE; c <= BLACK; c++)
- for (Square s = SQ_A1; s <= SQ_H8; s++)
- {
- ForwardBB[c][s] = InFrontBB[c][rank_of(s)] & FileBB[file_of(s)];
- PassedPawnMask[c][s] = InFrontBB[c][rank_of(s)] & ThisAndAdjacentFilesBB[file_of(s)];
- AttackSpanMask[c][s] = InFrontBB[c][rank_of(s)] & AdjacentFilesBB[file_of(s)];
- }
-
- for (Square s1 = SQ_A1; s1 <= SQ_H8; s1++)
- for (Square s2 = SQ_A1; s2 <= SQ_H8; s2++)
- SquareDistance[s1][s2] = std::max(file_distance(s1, s2), rank_distance(s1, s2));
-
- for (Square s1 = SQ_A1; s1 <= SQ_H8; s1++)
- for (int d = 1; d < 8; d++)
- for (Square s2 = SQ_A1; s2 <= SQ_H8; s2++)
- if (SquareDistance[s1][s2] == d)
- DistanceRingsBB[s1][d - 1] |= s2;