2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2020 The Stockfish developers (see AUTHORS file)
5 Stockfish is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
10 Stockfish is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
25 uint8_t PopCnt16[1 << 16];
26 uint8_t SquareDistance[SQUARE_NB][SQUARE_NB];
28 Bitboard SquareBB[SQUARE_NB];
29 Bitboard LineBB[SQUARE_NB][SQUARE_NB];
30 Bitboard PseudoAttacks[PIECE_TYPE_NB][SQUARE_NB];
31 Bitboard PawnAttacks[COLOR_NB][SQUARE_NB];
33 Magic RookMagics[SQUARE_NB];
34 Magic BishopMagics[SQUARE_NB];
38 Bitboard RookTable[0x19000]; // To store rook attacks
39 Bitboard BishopTable[0x1480]; // To store bishop attacks
41 void init_magics(PieceType pt, Bitboard table[], Magic magics[]);
45 /// Bitboards::pretty() returns an ASCII representation of a bitboard suitable
46 /// to be printed to standard output. Useful for debugging.
48 const std::string Bitboards::pretty(Bitboard b) {
50 std::string s = "+---+---+---+---+---+---+---+---+\n";
52 for (Rank r = RANK_8; r >= RANK_1; --r)
54 for (File f = FILE_A; f <= FILE_H; ++f)
55 s += b & make_square(f, r) ? "| X " : "| ";
57 s += "| " + std::to_string(1 + r) + "\n+---+---+---+---+---+---+---+---+\n";
59 s += " a b c d e f g h\n";
65 /// Bitboards::init() initializes various bitboard tables. It is called at
66 /// startup and relies on global objects to be already zero-initialized.
68 void Bitboards::init() {
70 for (unsigned i = 0; i < (1 << 16); ++i)
71 PopCnt16[i] = uint8_t(std::bitset<16>(i).count());
73 for (Square s = SQ_A1; s <= SQ_H8; ++s)
74 SquareBB[s] = (1ULL << s);
76 for (Square s1 = SQ_A1; s1 <= SQ_H8; ++s1)
77 for (Square s2 = SQ_A1; s2 <= SQ_H8; ++s2)
78 SquareDistance[s1][s2] = std::max(distance<File>(s1, s2), distance<Rank>(s1, s2));
80 init_magics(ROOK, RookTable, RookMagics);
81 init_magics(BISHOP, BishopTable, BishopMagics);
83 for (Square s1 = SQ_A1; s1 <= SQ_H8; ++s1)
85 PawnAttacks[WHITE][s1] = pawn_attacks_bb<WHITE>(square_bb(s1));
86 PawnAttacks[BLACK][s1] = pawn_attacks_bb<BLACK>(square_bb(s1));
88 for (int step : {-9, -8, -7, -1, 1, 7, 8, 9} )
89 PseudoAttacks[KING][s1] |= safe_destination(s1, step);
91 for (int step : {-17, -15, -10, -6, 6, 10, 15, 17} )
92 PseudoAttacks[KNIGHT][s1] |= safe_destination(s1, step);
94 PseudoAttacks[QUEEN][s1] = PseudoAttacks[BISHOP][s1] = attacks_bb<BISHOP>(s1, 0);
95 PseudoAttacks[QUEEN][s1] |= PseudoAttacks[ ROOK][s1] = attacks_bb< ROOK>(s1, 0);
97 for (PieceType pt : { BISHOP, ROOK })
98 for (Square s2 = SQ_A1; s2 <= SQ_H8; ++s2)
99 if (PseudoAttacks[pt][s1] & s2)
100 LineBB[s1][s2] = (attacks_bb(pt, s1, 0) & attacks_bb(pt, s2, 0)) | s1 | s2;
107 Bitboard sliding_attack(PieceType pt, Square sq, Bitboard occupied) {
109 Bitboard attacks = 0;
110 Direction RookDirections[4] = {NORTH, SOUTH, EAST, WEST};
111 Direction BishopDirections[4] = {NORTH_EAST, SOUTH_EAST, SOUTH_WEST, NORTH_WEST};
113 for(Direction d : (pt == ROOK ? RookDirections : BishopDirections))
116 while(safe_destination(s, d) && !(occupied & s))
124 // init_magics() computes all rook and bishop attacks at startup. Magic
125 // bitboards are used to look up attacks of sliding pieces. As a reference see
126 // www.chessprogramming.org/Magic_Bitboards. In particular, here we use the so
127 // called "fancy" approach.
129 void init_magics(PieceType pt, Bitboard table[], Magic magics[]) {
131 // Optimal PRNG seeds to pick the correct magics in the shortest time
132 int seeds[][RANK_NB] = { { 8977, 44560, 54343, 38998, 5731, 95205, 104912, 17020 },
133 { 728, 10316, 55013, 32803, 12281, 15100, 16645, 255 } };
135 Bitboard occupancy[4096], reference[4096], edges, b;
136 int epoch[4096] = {}, cnt = 0, size = 0;
138 for (Square s = SQ_A1; s <= SQ_H8; ++s)
140 // Board edges are not considered in the relevant occupancies
141 edges = ((Rank1BB | Rank8BB) & ~rank_bb(s)) | ((FileABB | FileHBB) & ~file_bb(s));
143 // Given a square 's', the mask is the bitboard of sliding attacks from
144 // 's' computed on an empty board. The index must be big enough to contain
145 // all the attacks for each possible subset of the mask and so is 2 power
146 // the number of 1s of the mask. Hence we deduce the size of the shift to
147 // apply to the 64 or 32 bits word to get the index.
148 Magic& m = magics[s];
149 m.mask = sliding_attack(pt, s, 0) & ~edges;
150 m.shift = (Is64Bit ? 64 : 32) - popcount(m.mask);
152 // Set the offset for the attacks table of the square. We have individual
153 // table sizes for each square with "Fancy Magic Bitboards".
154 m.attacks = s == SQ_A1 ? table : magics[s - 1].attacks + size;
156 // Use Carry-Rippler trick to enumerate all subsets of masks[s] and
157 // store the corresponding sliding attack bitboard in reference[].
161 reference[size] = sliding_attack(pt, s, b);
164 m.attacks[pext(b, m.mask)] = reference[size];
167 b = (b - m.mask) & m.mask;
173 PRNG rng(seeds[Is64Bit][rank_of(s)]);
175 // Find a magic for square 's' picking up an (almost) random number
176 // until we find the one that passes the verification test.
177 for (int i = 0; i < size; )
179 for (m.magic = 0; popcount((m.magic * m.mask) >> 56) < 6; )
180 m.magic = rng.sparse_rand<Bitboard>();
182 // A good magic must map every possible occupancy to an index that
183 // looks up the correct sliding attack in the attacks[s] database.
184 // Note that we build up the database for square 's' as a side
185 // effect of verifying the magic. Keep track of the attempt count
186 // and save it in epoch[], little speed-up trick to avoid resetting
187 // m.attacks[] after every failed attempt.
188 for (++cnt, i = 0; i < size; ++i)
190 unsigned idx = m.index(occupancy[i]);
192 if (epoch[idx] < cnt)
195 m.attacks[idx] = reference[i];
197 else if (m.attacks[idx] != reference[i])