X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbook.cpp;h=cc433a90abe47580b25b074fa01d65fa22a6f0cc;hp=720471a3688ba2cb4a82c0bb2ff124d797efa328;hb=6828325881eb823ddfb2e6ea72122c3a4576d240;hpb=8300ab149cec54c2124898285bdc9308f78de4cd diff --git a/src/book.cpp b/src/book.cpp index 720471a3..cc433a90 100644 --- a/src/book.cpp +++ b/src/book.cpp @@ -306,25 +306,23 @@ namespace { const Key* ZobEnPassant = PolyGlotRandoms + 772; const Key* ZobTurn = PolyGlotRandoms + 780; - // PieceOffset is calculated as 64 * (PolyPiece ^ 1) where PolyPiece - // is: BP = 0, WP = 1, BN = 2, WN = 3 ... BK = 10, WK = 11 - const int PieceOffset[] = { 0, 64, 192, 320, 448, 576, 704, 0, - 0, 0, 128, 256, 384, 512, 640 }; - // book_key() returns the PolyGlot hash key of the given position uint64_t book_key(const Position& pos) { uint64_t key = 0; - Bitboard b = pos.occupied_squares(); + Bitboard b = pos.pieces(); while (b) { + // Piece offset is at 64 * polyPiece where polyPiece is defined as: + // BP = 0, WP = 1, BN = 2, WN = 3, ... BK = 10, WK = 11 Square s = pop_1st_bit(&b); - key ^= ZobPiece[PieceOffset[pos.piece_on(s)] + s]; + Piece p = pos.piece_on(s); + int polyPiece = 2 * (type_of(p) - 1) + (color_of(p) == WHITE); + key ^= ZobPiece[64 * polyPiece + s]; } - b = (pos.can_castle(WHITE_OO) << 0) | (pos.can_castle(WHITE_OOO) << 1) - | (pos.can_castle(BLACK_OO) << 2) | (pos.can_castle(BLACK_OOO) << 3); + b = pos.can_castle(ALL_CASTLES); while (b) key ^= ZobCastle[pop_1st_bit(&b)]; @@ -342,7 +340,7 @@ namespace { Book::Book() : size(0) { - for (int i = abs(system_time() % 10000); i > 0; i--) + for (int i = Time::current_time().msec() % 10000; i > 0; i--) RKiss.rand(); // Make random number generation less deterministic } @@ -383,7 +381,7 @@ bool Book::open(const char* fName) { return false; // Silently fail if the file is not found // Get the book size in number of entries, we are already at the end of file - size = tellg() / sizeof(BookEntry); + size = (size_t)tellg() / sizeof(BookEntry); if (!good()) { @@ -404,7 +402,8 @@ Move Book::probe(const Position& pos, const string& fName, bool pickBest) { BookEntry e; uint16_t best = 0; - unsigned sum = 0, bookMove = 0; + unsigned sum = 0; + Move move = MOVE_NONE; uint64_t key = book_key(pos); if (fileName != fName && !open(fName.c_str())) @@ -420,12 +419,12 @@ Move Book::probe(const Position& pos, const string& fName, bool pickBest) { // Choose book move according to its score. If a move has a very // high score it has higher probability to be choosen than a move // with lower score. Note that first entry is always chosen. - if ( (RKiss.rand() % sum < e.count) + if ( (sum && RKiss.rand() % sum < e.count) || (pickBest && e.count == best)) - bookMove = e.move; + move = Move(e.move); } - if (!bookMove) + if (!move) return MOVE_NONE; // A PolyGlot book move is encoded as follows: @@ -438,16 +437,13 @@ Move Book::probe(const Position& pos, const string& fName, bool pickBest) { // move is a promotion we have to convert to our representation, in all the // other cases we can directly compare with a Move after having masked out // the special Move's flags (bit 14-15) that are not supported by PolyGlot. - int promotion = (bookMove >> 12) & 7; - - if (promotion) - bookMove = make_promotion_move(move_from(Move(bookMove)), - move_to(Move(bookMove)), - PieceType(promotion + 1)); + int pt = (move >> 12) & 7; + if (pt) + move = make_promotion(from_sq(move), to_sq(move), PieceType(pt + 1)); - // Convert bookMove to our internal Move format (and verify it is legal) + // Add 'special move' flags and verify it is legal for (MoveList ml(pos); !ml.end(); ++ml) - if (bookMove == unsigned(ml.move() & ~(3 << 14))) + if (move == (ml.move() & 0x3FFF)) return ml.move(); return MOVE_NONE; @@ -460,30 +456,30 @@ Move Book::probe(const Position& pos, const string& fName, bool pickBest) { void Book::binary_search(uint64_t key) { - size_t left, right, mid; + size_t low, high, mid; BookEntry e; - left = 0; - right = size - 1; + low = 0; + high = size - 1; - assert(left <= right); + assert(low <= high); - while (left < right && good()) + while (low < high && good()) { - mid = (left + right) / 2; + mid = (low + high) / 2; - assert(mid >= left && mid < right); + assert(mid >= low && mid < high); seekg(mid * sizeof(BookEntry), ios_base::beg); *this >> e; if (key <= e.key) - right = mid; + high = mid; else - left = mid + 1; + low = mid + 1; } - assert(left == right); + assert(low == high); - seekg(left * sizeof(BookEntry), ios_base::beg); + seekg(low * sizeof(BookEntry), ios_base::beg); }