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/>.
30 // There are 24 possible pawn squares: files A to D and ranks from 2 to 7.
31 // Positions with the pawn on files E to H will be mirrored before probing.
32 constexpr unsigned MAX_INDEX = 2*24*64*64; // stm * psq * wksq * bksq = 196608
34 // Each uint32_t stores results of 32 positions, one per bit
35 uint32_t KPKBitbase[MAX_INDEX / 32];
37 // A KPK bitbase index is an integer in [0, IndexMax] range
39 // Information is mapped in a way that minimizes the number of iterations:
41 // bit 0- 5: white king square (from SQ_A1 to SQ_H8)
42 // bit 6-11: black king square (from SQ_A1 to SQ_H8)
43 // bit 12: side to move (WHITE or BLACK)
44 // bit 13-14: white pawn file (from FILE_A to FILE_D)
45 // bit 15-17: white pawn RANK_7 - rank (from RANK_7 - RANK_7 to RANK_7 - RANK_2)
46 unsigned index(Color stm, Square bksq, Square wksq, Square psq) {
47 return int(wksq) | (bksq << 6) | (stm << 12) | (file_of(psq) << 13) | ((RANK_7 - rank_of(psq)) << 15);
57 Result& operator|=(Result& r, Result v) { return r = Result(r | v); }
60 KPKPosition() = default;
61 explicit KPKPosition(unsigned idx);
62 operator Result() const { return result; }
63 Result classify(const std::vector<KPKPosition>& db);
66 Square ksq[COLOR_NB], psq;
73 bool Bitbases::probe(Square wksq, Square wpsq, Square bksq, Color stm) {
75 assert(file_of(wpsq) <= FILE_D);
77 unsigned idx = index(stm, bksq, wksq, wpsq);
78 return KPKBitbase[idx / 32] & (1 << (idx & 0x1F));
82 void Bitbases::init() {
84 std::vector<KPKPosition> db(MAX_INDEX);
85 unsigned idx, repeat = 1;
87 // Initialize db with known win / draw positions
88 for (idx = 0; idx < MAX_INDEX; ++idx)
89 db[idx] = KPKPosition(idx);
91 // Iterate through the positions until none of the unknown positions can be
92 // changed to either wins or draws (15 cycles needed).
94 for (repeat = idx = 0; idx < MAX_INDEX; ++idx)
95 repeat |= (db[idx] == UNKNOWN && db[idx].classify(db) != UNKNOWN);
97 // Map 32 results into one KPKBitbase[] entry
98 for (idx = 0; idx < MAX_INDEX; ++idx)
100 KPKBitbase[idx / 32] |= 1 << (idx & 0x1F);
106 KPKPosition::KPKPosition(unsigned idx) {
108 ksq[WHITE] = Square((idx >> 0) & 0x3F);
109 ksq[BLACK] = Square((idx >> 6) & 0x3F);
110 stm = Color ((idx >> 12) & 0x01);
111 psq = make_square(File((idx >> 13) & 0x3), Rank(RANK_7 - ((idx >> 15) & 0x7)));
113 // Check if two pieces are on the same square or if a king can be captured
114 if ( distance(ksq[WHITE], ksq[BLACK]) <= 1
117 || (stm == WHITE && (PawnAttacks[WHITE][psq] & ksq[BLACK])))
120 // Immediate win if a pawn can be promoted without getting captured
121 else if ( stm == WHITE
122 && rank_of(psq) == RANK_7
123 && ksq[stm] != psq + NORTH
124 && ( distance(ksq[~stm], psq + NORTH) > 1
125 || (PseudoAttacks[KING][ksq[stm]] & (psq + NORTH))))
128 // Immediate draw if it is a stalemate or a king captures undefended pawn
129 else if ( stm == BLACK
130 && ( !(PseudoAttacks[KING][ksq[stm]] & ~(PseudoAttacks[KING][ksq[~stm]] | PawnAttacks[~stm][psq]))
131 || (PseudoAttacks[KING][ksq[stm]] & psq & ~PseudoAttacks[KING][ksq[~stm]])))
134 // Position will be classified later
139 Result KPKPosition::classify(const std::vector<KPKPosition>& db) {
141 // White to move: If one move leads to a position classified as WIN, the result
142 // of the current position is WIN. If all moves lead to positions classified
143 // as DRAW, the current position is classified as DRAW, otherwise the current
144 // position is classified as UNKNOWN.
146 // Black to move: If one move leads to a position classified as DRAW, the result
147 // of the current position is DRAW. If all moves lead to positions classified
148 // as WIN, the position is classified as WIN, otherwise the current position is
149 // classified as UNKNOWN.
150 const Result Good = (stm == WHITE ? WIN : DRAW);
151 const Result Bad = (stm == WHITE ? DRAW : WIN);
154 Bitboard b = PseudoAttacks[KING][ksq[stm]];
157 r |= stm == WHITE ? db[index(BLACK, ksq[BLACK] , pop_lsb(&b), psq)]
158 : db[index(WHITE, pop_lsb(&b), ksq[WHITE], psq)];
162 if (rank_of(psq) < RANK_7) // Single push
163 r |= db[index(BLACK, ksq[BLACK], ksq[WHITE], psq + NORTH)];
165 if ( rank_of(psq) == RANK_2 // Double push
166 && psq + NORTH != ksq[WHITE]
167 && psq + NORTH != ksq[BLACK])
168 r |= db[index(BLACK, ksq[BLACK], ksq[WHITE], psq + NORTH + NORTH)];
171 return result = r & Good ? Good : r & UNKNOWN ? UNKNOWN : Bad;