2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
27 // Global bitboards definitions with static storage duration are
28 // automatically set to zero before enter main().
31 Bitboard* RAttacks[64];
36 Bitboard* BAttacks[64];
39 Bitboard SetMaskBB[65];
40 Bitboard ClearMaskBB[65];
42 Bitboard SquaresByColorBB[2];
45 Bitboard NeighboringFilesBB[8];
46 Bitboard ThisAndNeighboringFilesBB[8];
47 Bitboard InFrontBB[2][8];
48 Bitboard StepAttacksBB[16][64];
49 Bitboard BetweenBB[64][64];
50 Bitboard SquaresInFrontMask[2][64];
51 Bitboard PassedPawnMask[2][64];
52 Bitboard AttackSpanMask[2][64];
54 Bitboard BishopPseudoAttacks[64];
55 Bitboard RookPseudoAttacks[64];
56 Bitboard QueenPseudoAttacks[64];
58 uint8_t BitCount8Bit[256];
65 Bitboard RAttacksTable[0x19000];
66 Bitboard BAttacksTable[0x1480];
68 void init_sliding_attacks(Bitboard magic[], Bitboard* attack[], Bitboard attTable[],
69 Bitboard mask[], int shift[], Square delta[]);
73 /// print_bitboard() prints a bitboard in an easily readable format to the
74 /// standard output. This is sometimes useful for debugging.
76 void print_bitboard(Bitboard b) {
78 for (Rank r = RANK_8; r >= RANK_1; r--)
80 std::cout << "+---+---+---+---+---+---+---+---+" << '\n';
81 for (File f = FILE_A; f <= FILE_H; f++)
82 std::cout << "| " << (bit_is_set(b, make_square(f, r)) ? "X " : " ");
86 std::cout << "+---+---+---+---+---+---+---+---+" << std::endl;
90 /// first_1() finds the least significant nonzero bit in a nonzero bitboard.
91 /// pop_1st_bit() finds and clears the least significant nonzero bit in a
94 #if defined(IS_64BIT) && !defined(USE_BSFQ)
96 Square first_1(Bitboard b) {
97 return Square(BSFTable[((b & -b) * 0x218A392CD3D5DBFULL) >> 58]);
100 Square pop_1st_bit(Bitboard* b) {
103 return Square(BSFTable[((bb & -bb) * 0x218A392CD3D5DBFULL) >> 58]);
106 #elif !defined(USE_BSFQ)
108 Square first_1(Bitboard b) {
110 uint32_t fold = unsigned(b) ^ unsigned(b >> 32);
111 return Square(BSFTable[(fold * 0x783A9B23) >> 26]);
119 #if defined (BIGENDIAN)
129 Square pop_1st_bit(Bitboard* bb) {
138 ret = Square(BSFTable[((u.dw.l ^ (u.dw.l - 1)) * 0x783A9B23) >> 26]);
139 u.dw.l &= (u.dw.l - 1);
143 ret = Square(BSFTable[((~(u.dw.h ^ (u.dw.h - 1))) * 0x783A9B23) >> 26]);
144 u.dw.h &= (u.dw.h - 1);
149 #endif // !defined(USE_BSFQ)
152 /// init_bitboards() initializes various bitboard arrays. It is called during
153 /// program initialization.
155 void init_bitboards() {
157 SquaresByColorBB[DARK] = 0xAA55AA55AA55AA55ULL;
158 SquaresByColorBB[LIGHT] = ~SquaresByColorBB[DARK];
160 for (Square s = SQ_A1; s <= SQ_H8; s++)
162 SetMaskBB[s] = 1ULL << s;
163 ClearMaskBB[s] = ~SetMaskBB[s];
166 ClearMaskBB[SQ_NONE] = ~EmptyBoardBB;
168 FileBB[FILE_A] = FileABB;
169 RankBB[RANK_1] = Rank1BB;
171 for (int f = FILE_B; f <= FILE_H; f++)
173 FileBB[f] = FileBB[f - 1] << 1;
174 RankBB[f] = RankBB[f - 1] << 8;
177 for (int f = FILE_A; f <= FILE_H; f++)
179 NeighboringFilesBB[f] = (f > FILE_A ? FileBB[f - 1] : 0) | (f < FILE_H ? FileBB[f + 1] : 0);
180 ThisAndNeighboringFilesBB[f] = FileBB[f] | NeighboringFilesBB[f];
183 for (int rw = RANK_7, rb = RANK_2; rw >= RANK_1; rw--, rb++)
185 InFrontBB[WHITE][rw] = InFrontBB[WHITE][rw + 1] | RankBB[rw + 1];
186 InFrontBB[BLACK][rb] = InFrontBB[BLACK][rb - 1] | RankBB[rb - 1];
189 for (Color c = WHITE; c <= BLACK; c++)
190 for (Square s = SQ_A1; s <= SQ_H8; s++)
192 SquaresInFrontMask[c][s] = in_front_bb(c, s) & file_bb(s);
193 PassedPawnMask[c][s] = in_front_bb(c, s) & this_and_neighboring_files_bb(s);
194 AttackSpanMask[c][s] = in_front_bb(c, s) & neighboring_files_bb(s);
197 for (Bitboard b = 0; b < 256; b++)
198 BitCount8Bit[b] = (uint8_t)count_1s<CNT32_MAX15>(b);
200 for (int i = 0; i < 64; i++)
201 if (!CpuIs64Bit) // Matt Taylor's folding trick for 32 bit systems
203 Bitboard b = 1ULL << i;
206 BSFTable[uint32_t(b * 0x783A9B23) >> 26] = i;
209 BSFTable[((1ULL << i) * 0x218A392CD3D5DBFULL) >> 58] = i;
211 int steps[][9] = { {}, { 7, 9 }, { 17, 15, 10, 6, -6, -10, -15, -17 },
212 {}, {}, {}, { 9, 7, -7, -9, 8, 1, -1, -8 } };
214 for (Color c = WHITE; c <= BLACK; c++)
215 for (PieceType pt = PAWN; pt <= KING; pt++)
216 for (Square s = SQ_A1; s <= SQ_H8; s++)
217 for (int k = 0; steps[pt][k]; k++)
219 Square to = s + Square(c == WHITE ? steps[pt][k] : -steps[pt][k]);
221 if (square_is_ok(to) && square_distance(s, to) < 3)
222 set_bit(&StepAttacksBB[make_piece(c, pt)][s], to);
225 Square RDelta[] = { DELTA_N, DELTA_E, DELTA_S, DELTA_W };
226 Square BDelta[] = { DELTA_NE, DELTA_SE, DELTA_SW, DELTA_NW };
228 init_sliding_attacks(BMult, BAttacks, BAttacksTable, BMask, BShift, BDelta);
229 init_sliding_attacks(RMult, RAttacks, RAttacksTable, RMask, RShift, RDelta);
231 for (Square s = SQ_A1; s <= SQ_H8; s++)
233 BishopPseudoAttacks[s] = bishop_attacks_bb(s, EmptyBoardBB);
234 RookPseudoAttacks[s] = rook_attacks_bb(s, EmptyBoardBB);
235 QueenPseudoAttacks[s] = queen_attacks_bb(s, EmptyBoardBB);
238 for (Square s1 = SQ_A1; s1 <= SQ_H8; s1++)
239 for (Square s2 = SQ_A1; s2 <= SQ_H8; s2++)
240 if (bit_is_set(QueenPseudoAttacks[s1], s2))
242 int f = file_distance(s1, s2);
243 int r = rank_distance(s1, s2);
245 Square d = (s2 - s1) / Max(f, r);
247 for (Square s3 = s1 + d; s3 != s2; s3 += d)
248 set_bit(&BetweenBB[s1][s2], s3);
255 Bitboard sliding_attacks(Square sq, Bitboard occupied, Square delta[]) {
257 Bitboard attacks = 0;
259 for (int i = 0; i < 4; i++)
261 Square s = sq + delta[i];
263 while (square_is_ok(s) && square_distance(s, s - delta[i]) == 1)
265 set_bit(&attacks, s);
267 if (bit_is_set(occupied, s))
276 Bitboard pick_magic(Bitboard mask, RKISS& rk, int booster) {
280 // Values s1 and s2 are used to rotate the candidate magic of a
281 // quantity known to be the optimal to quickly find the magics.
282 int s1 = booster & 63, s2 = (booster >> 6) & 63;
286 magic = rk.rand<Bitboard>();
287 magic = (magic >> s1) | (magic << (64 - s1));
288 magic &= rk.rand<Bitboard>();
289 magic = (magic >> s2) | (magic << (64 - s2));
290 magic &= rk.rand<Bitboard>();
292 if (BitCount8Bit[(mask * magic) >> 56] >= 6)
297 void init_sliding_attacks(Bitboard magic[], Bitboard* attack[], Bitboard attTable[],
298 Bitboard mask[], int shift[], Square delta[]) {
300 const int MagicBoosters[][8] = { { 3191, 2184, 1310, 3618, 2091, 1308, 2452, 3996 },
301 { 1059, 3608, 605, 3234, 3326, 38, 2029, 3043 } };
303 Bitboard occupancy[4096], reference[4096], edges, b;
304 int key, maxKey, index, booster, offset = 0;
306 for (Square s = SQ_A1; s <= SQ_H8; s++)
308 edges = ((Rank1BB | Rank8BB) & ~rank_bb(s)) | ((FileABB | FileHBB) & ~file_bb(s));
310 attack[s] = &attTable[offset];
311 mask[s] = sliding_attacks(s, EmptyBoardBB, delta) & ~edges;
312 shift[s] = (CpuIs64Bit ? 64 : 32) - count_1s<CNT32_MAX15>(mask[s]);
314 // Use Carry-Rippler trick to enumerate all subsets of mask[s]
317 occupancy[maxKey] = b;
318 reference[maxKey++] = sliding_attacks(s, b, delta);
319 b = (b - mask[s]) & mask[s];
323 booster = MagicBoosters[CpuIs64Bit][square_rank(s)];
325 // Then find a possible magic and the corresponding attacks
327 magic[s] = pick_magic(mask[s], rk, booster);
328 memset(attack[s], 0, maxKey * sizeof(Bitboard));
330 for (key = 0; key < maxKey; key++)
332 index = CpuIs64Bit ? unsigned((occupancy[key] * magic[s]) >> shift[s])
333 : unsigned(occupancy[key] * magic[s] ^ (occupancy[key] >> 32) * (magic[s] >> 32)) >> shift[s];
335 if (!attack[s][index])
336 attack[s][index] = reference[key];
338 else if (attack[s][index] != reference[key])
341 } while (key != maxKey);