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