X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbitbase.cpp;h=570a9771419099aec3bc929b469a1b0b598e61dd;hp=19cf3f7901f7eae4fc205bb065b426adf8368624;hb=4ede49cd850392f28bc9da9537c111d2c3f0b297;hpb=5dc23121215039938a9ef4e59ae934312774571c diff --git a/src/bitbase.cpp b/src/bitbase.cpp index 19cf3f79..570a9771 100644 --- a/src/bitbase.cpp +++ b/src/bitbase.cpp @@ -1,349 +1,175 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008 Marco Costalba + Copyright (C) 2008-2013 Marco Costalba, Joona Kiiski, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. - + Stockfish is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. - + You should have received a copy of the GNU General Public License along with this program. If not, see . */ - -//// -//// Includes -//// - #include +#include -#include "bitbase.h" #include "bitboard.h" -#include "move.h" -#include "square.h" - - -//// -//// Local definitions -//// +#include "types.h" namespace { - enum Result { - RESULT_UNKNOWN, - RESULT_INVALID, - RESULT_WIN, - RESULT_LOSS, - RESULT_DRAW - }; - - struct KPKPosition { - void from_index(int index); - int to_index() const; - bool is_legal() const; - bool is_immediate_draw() const; - bool is_immediate_win() const; - Bitboard wk_attacks() const; - Bitboard bk_attacks() const; - Bitboard pawn_attacks() const; - - Square whiteKingSquare, blackKingSquare, pawnSquare; - Color sideToMove; - }; - - - Result *Bitbase; - const int IndexMax = 2*24*64*64; - int UnknownCount = 0; - - void initialize(); - bool next_iteration(); - Result classify_wtm(const KPKPosition &p); - Result classify_btm(const KPKPosition &p); - int compute_index(Square wksq, Square bksq, Square psq, Color stm); - int compress_result(Result r); - -} - - -//// -//// Functions -//// - -void generate_kpk_bitbase(uint8_t bitbase[]) { - // Allocate array and initialize: - Bitbase = new Result[IndexMax]; - initialize(); - - // Iterate until all positions are classified: - while(next_iteration()); - - // Compress bitbase into the supplied parameter: - int i, j, b; - for(i = 0; i < 24576; i++) { - for(b = 0, j = 0; j < 8; b |= (compress_result(Bitbase[8*i+j]) << j), j++); - bitbase[i] = b; - } - - // Release allocated memory: - delete [] Bitbase; -} - - -namespace { - - void KPKPosition::from_index(int index) { - int s; - sideToMove = Color(index % 2); - blackKingSquare = Square((index / 2) % 64); - whiteKingSquare = Square((index / 128) % 64); - s = (index / 8192) % 24; - pawnSquare = make_square(File(s % 4), Rank(s / 4 + 1)); - } - - - int KPKPosition::to_index() const { - return compute_index(whiteKingSquare, blackKingSquare, pawnSquare, - sideToMove); - } - - - bool KPKPosition::is_legal() const { - if(whiteKingSquare == pawnSquare || whiteKingSquare == blackKingSquare || - pawnSquare == blackKingSquare) - return false; - if(sideToMove == WHITE) { - if(bit_is_set(this->wk_attacks(), blackKingSquare)) - return false; - if(bit_is_set(this->pawn_attacks(), blackKingSquare)) - return false; - } - else { - if(bit_is_set(this->bk_attacks(), whiteKingSquare)) - return false; - } - return true; + // The possible pawns squares are 24, the first 4 files and ranks from 2 to 7 + const unsigned IndexMax = 2*24*64*64; // stm * psq * wksq * bksq = 196608 + + // Each uint32_t stores results of 32 positions, one per bit + uint32_t KPKBitbase[IndexMax / 32]; + + // A KPK bitbase index is an integer in [0, IndexMax] range + // + // Information is mapped in a way that minimizes number of iterations: + // + // bit 0- 5: white king square (from SQ_A1 to SQ_H8) + // bit 6-11: black king square (from SQ_A1 to SQ_H8) + // bit 12: side to move (WHITE or BLACK) + // bit 13-14: white pawn file (from FILE_A to FILE_D) + // bit 15-17: white pawn RANK_7 - rank (from RANK_7 - RANK_7 to RANK_7 - RANK_2) + unsigned index(Color us, Square bksq, Square wksq, Square psq) { + return wksq + (bksq << 6) + (us << 12) + (file_of(psq) << 13) + ((RANK_7 - rank_of(psq)) << 15); } + enum Result { + INVALID = 0, + UNKNOWN = 1, + DRAW = 2, + WIN = 4 + }; - bool KPKPosition::is_immediate_draw() const { - if(sideToMove == BLACK) { - Bitboard wka = this->wk_attacks(); - Bitboard bka = this->bk_attacks(); - - // Case 1: Stalemate - if((bka & ~(wka | this->pawn_attacks())) == EmptyBoardBB) - return true; + inline Result& operator|=(Result& r, Result v) { return r = Result(r | v); } - // Case 2: King can capture pawn - if(bit_is_set(bka, pawnSquare) && !bit_is_set(wka, pawnSquare)) - return true; - } - else { - // Case 1: Stalemate - if(whiteKingSquare == SQ_A8 && pawnSquare == SQ_A7 && - (blackKingSquare == SQ_C7 || blackKingSquare == SQ_C8)) - return true; - } + struct KPKPosition { - return false; - } + operator Result() const { return res; } + Result classify_leaf(unsigned idx); + Result classify(const std::vector& db) + { return us == WHITE ? classify(db) : classify(db); } + private: + template Result classify(const std::vector& db); - bool KPKPosition::is_immediate_win() const { - // The position is an immediate win if it is white to move and the white - // pawn can be promoted without getting captured: - return - sideToMove == WHITE && - square_rank(pawnSquare) == RANK_7 && - (square_distance(blackKingSquare, pawnSquare+DELTA_N) > 1 || - bit_is_set(this->wk_attacks(), pawnSquare+DELTA_N)); - } - + Color us; + Square bksq, wksq, psq; + Result res; + }; - Bitboard KPKPosition::wk_attacks() const { - return StepAttackBB[WK][whiteKingSquare]; - } +} // namespace - Bitboard KPKPosition::bk_attacks() const { - return StepAttackBB[BK][blackKingSquare]; - } +bool Bitbases::probe_kpk(Square wksq, Square wpsq, Square bksq, Color us) { + assert(file_of(wpsq) <= FILE_D); - Bitboard KPKPosition::pawn_attacks() const { - return StepAttackBB[WP][pawnSquare]; - } + unsigned idx = index(us, bksq, wksq, wpsq); + return KPKBitbase[idx / 32] & (1 << (idx & 0x1F)); +} - void initialize() { - KPKPosition p; - for(int i = 0; i < IndexMax; i++) { - p.from_index(i); - if(!p.is_legal()) - Bitbase[i] = RESULT_INVALID; - else if(p.is_immediate_draw()) - Bitbase[i] = RESULT_DRAW; - else if(p.is_immediate_win()) - Bitbase[i] = RESULT_WIN; - else { - Bitbase[i] = RESULT_UNKNOWN; - UnknownCount++; - } - } - } +void Bitbases::init_kpk() { + unsigned idx, repeat = 1; + std::vector db(IndexMax); - bool next_iteration() { - KPKPosition p; - int previousUnknownCount = UnknownCount; - - for(int i = 0; i < IndexMax; i++) - if(Bitbase[i] == RESULT_UNKNOWN) { - p.from_index(i); + // Initialize db with known win / draw positions + for (idx = 0; idx < IndexMax; idx++) + db[idx].classify_leaf(idx); - Bitbase[i] = (p.sideToMove == WHITE)? classify_wtm(p) : classify_btm(p); + // Iterate through the positions until no more of the unknown positions can be + // changed to either wins or draws (15 cycles needed). + while (repeat) + for (repeat = idx = 0; idx < IndexMax; idx++) + if (db[idx] == UNKNOWN && db[idx].classify(db) != UNKNOWN) + repeat = 1; - if(Bitbase[i] == RESULT_WIN || Bitbase[i] == RESULT_LOSS || - Bitbase[i] == RESULT_DRAW) - UnknownCount--; - } + // Map 32 results into one KPKBitbase[] entry + for (idx = 0; idx < IndexMax; idx++) + if (db[idx] == WIN) + KPKBitbase[idx / 32] |= 1 << (idx & 0x1F); +} - return UnknownCount != previousUnknownCount; - } +namespace { - Result classify_wtm(const KPKPosition &p) { - - // If one move leads to a position classified as RESULT_LOSS, the result - // of the current position is RESULT_WIN. If all moves lead to positions - // classified as RESULT_DRAW, the current position is classified as - // RESULT_DRAW. Otherwise, the current position is classified as - // RESULT_UNKNOWN. - - bool unknownFound = false; - Bitboard b; - Square s; - - // King moves - b = p.wk_attacks(); - while(b) { - s = pop_1st_bit(&b); - switch(Bitbase[compute_index(s, p.blackKingSquare, p.pawnSquare, - BLACK)]) { - case RESULT_LOSS: - return RESULT_WIN; - - case RESULT_UNKNOWN: - unknownFound = true; - break; - - case RESULT_DRAW: case RESULT_INVALID: - break; - - default: - assert(false); - } + Result KPKPosition::classify_leaf(unsigned idx) { + + wksq = Square((idx >> 0) & 0x3F); + bksq = Square((idx >> 6) & 0x3F); + us = Color ((idx >> 12) & 0x01); + psq = File ((idx >> 13) & 0x03) | Rank(RANK_7 - (idx >> 15)); + + // Check if two pieces are on the same square or if a king can be captured + if ( wksq == psq || wksq == bksq || bksq == psq + || (StepAttacksBB[KING][wksq] & bksq) + || (us == WHITE && (StepAttacksBB[PAWN][psq] & bksq))) + return res = INVALID; + + if (us == WHITE) + { + // Immediate win if pawn can be promoted without getting captured + if ( rank_of(psq) == RANK_7 + && wksq != psq + DELTA_N + && ( square_distance(bksq, psq + DELTA_N) > 1 + ||(StepAttacksBB[KING][wksq] & (psq + DELTA_N)))) + return res = WIN; } + // Immediate draw if is stalemate or king captures undefended pawn + else if ( !(StepAttacksBB[KING][bksq] & ~(StepAttacksBB[KING][wksq] | StepAttacksBB[PAWN][psq])) + || (StepAttacksBB[KING][bksq] & psq & ~StepAttacksBB[KING][wksq])) + return res = DRAW; - // Pawn moves - if(square_rank(p.pawnSquare) < RANK_7) { - s = p.pawnSquare + DELTA_N; - switch(Bitbase[compute_index(p.whiteKingSquare, p.blackKingSquare, s, - BLACK)]) { - case RESULT_LOSS: - return RESULT_WIN; - - case RESULT_UNKNOWN: - unknownFound = true; - break; - - case RESULT_DRAW: case RESULT_INVALID: - break; - - default: - assert(false); - } - - if(square_rank(s) == RANK_3 && - s != p.whiteKingSquare && s != p.blackKingSquare) { - s += DELTA_N; - switch(Bitbase[compute_index(p.whiteKingSquare, p.blackKingSquare, s, - BLACK)]) { - case RESULT_LOSS: - return RESULT_WIN; - - case RESULT_UNKNOWN: - unknownFound = true; - break; - - case RESULT_DRAW: case RESULT_INVALID: - break; - - default: - assert(false); - } - } - } - - return unknownFound? RESULT_UNKNOWN : RESULT_DRAW; + return res = UNKNOWN; } + template + Result KPKPosition::classify(const std::vector& db) { - Result classify_btm(const KPKPosition &p) { + // White to Move: If one move leads to a position classified as WIN, the result + // of the current position is WIN. If all moves lead to positions classified + // as DRAW, the current position is classified DRAW otherwise the current + // position is classified as UNKNOWN. + // + // Black to Move: If one move leads to a position classified as DRAW, the result + // of the current position is DRAW. If all moves lead to positions classified + // as WIN, the position is classified WIN otherwise the current position is + // classified UNKNOWN. - // If one move leads to a position classified as RESULT_DRAW, the result - // of the current position is RESULT_DRAW. If all moves lead to positions - // classified as RESULT_WIN, the current position is classified as - // RESULT_LOSS. Otherwise, the current position is classified as - // RESULT_UNKNOWN. + const Color Them = (Us == WHITE ? BLACK : WHITE); - bool unknownFound = false; - Bitboard b; - Square s; + Result r = INVALID; + Bitboard b = StepAttacksBB[KING][Us == WHITE ? wksq : bksq]; - // King moves - b = p.bk_attacks(); - while(b) { - s = pop_1st_bit(&b); - switch(Bitbase[compute_index(p.whiteKingSquare, s, p.pawnSquare, - WHITE)]) { - case RESULT_DRAW: - return RESULT_DRAW; + while (b) + r |= Us == WHITE ? db[index(Them, bksq, pop_lsb(&b), psq)] + : db[index(Them, pop_lsb(&b), wksq, psq)]; - case RESULT_UNKNOWN: - unknownFound = true; - break; + if (Us == WHITE && rank_of(psq) < RANK_7) + { + Square s = psq + DELTA_N; + r |= db[index(BLACK, bksq, wksq, s)]; // Single push - case RESULT_WIN: case RESULT_INVALID: - break; - - default: - assert(false); - } + if (rank_of(s) == RANK_3 && s != wksq && s != bksq) + r |= db[index(BLACK, bksq, wksq, s + DELTA_N)]; // Double push } - return unknownFound? RESULT_UNKNOWN : RESULT_LOSS; - } - - - int compute_index(Square wksq, Square bksq, Square psq, Color stm) { - int p = int(square_file(psq)) + (int(square_rank(psq)) - 1) * 4; - int result = int(stm) + 2*int(bksq) + 128*int(wksq) + 8192*p; - assert(result >= 0 && result < IndexMax); - return result; + if (Us == WHITE) + return res = r & WIN ? WIN : r & UNKNOWN ? UNKNOWN : DRAW; + else + return res = r & DRAW ? DRAW : r & UNKNOWN ? UNKNOWN : WIN; } - - int compress_result(Result r) { - return (r == RESULT_WIN || r == RESULT_LOSS)? 1 : 0; - } - -} +} // namespace