X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbitboard.cpp;h=9adf1407bd5471436e360b79aa4af7eb30f4065a;hp=fd3db6715b6e15278a5c8d382d37798132adc37b;hb=c9dcda6ac488c0058ebd567e1f52e30b8cd0db20;hpb=1ff5ce8863cb71f42dc0f707dd566e566c658eb5 diff --git a/src/bitboard.cpp b/src/bitboard.cpp index fd3db671..9adf1407 100644 --- a/src/bitboard.cpp +++ b/src/bitboard.cpp @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2013 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2014 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 @@ -119,7 +119,7 @@ Square msb(Bitboard b) { result += 8; } - return (Square)(result + MS1BTable[b32]); + return Square(result + MS1BTable[b32]); } #endif // ifndef USE_BSFQ @@ -146,8 +146,8 @@ const std::string Bitboards::pretty(Bitboard b) { } -/// Bitboards::init() initializes various bitboard arrays. It is called during -/// program initialization. +/// Bitboards::init() initializes various bitboard tables. It is called at +/// startup and relies on global objects to be already zero-initialized. void Bitboards::init() { @@ -157,14 +157,11 @@ void Bitboards::init() { for (Bitboard b = 1; b < 256; ++b) MS1BTable[b] = more_than_one(b) ? MS1BTable[b - 1] : lsb(b); - FileBB[FILE_A] = FileABB; - RankBB[RANK_1] = Rank1BB; + for (File f = FILE_A; f <= FILE_H; ++f) + FileBB[f] = f > FILE_A ? FileBB[f - 1] << 1 : FileABB; - for (int i = 1; i < 8; ++i) - { - FileBB[i] = FileBB[i - 1] << 1; - RankBB[i] = RankBB[i - 1] << 8; - } + for (Rank r = RANK_1; r <= RANK_8; ++r) + RankBB[r] = r > RANK_1 ? RankBB[r - 1] << 8 : Rank1BB; for (File f = FILE_A; f <= FILE_H; ++f) AdjacentFilesBB[f] = (f > FILE_A ? FileBB[f - 1] : 0) | (f < FILE_H ? FileBB[f + 1] : 0); @@ -182,11 +179,11 @@ void Bitboards::init() { for (Square s1 = SQ_A1; s1 <= SQ_H8; ++s1) for (Square s2 = SQ_A1; s2 <= SQ_H8; ++s2) - { - SquareDistance[s1][s2] = std::max(file_distance(s1, s2), rank_distance(s1, s2)); if (s1 != s2) - DistanceRingsBB[s1][SquareDistance[s1][s2] - 1] |= s2; - } + { + SquareDistance[s1][s2] = std::max(file_distance(s1, s2), rank_distance(s1, s2)); + DistanceRingsBB[s1][SquareDistance[s1][s2] - 1] |= s2; + } int steps[][9] = { {}, { 7, 9 }, { 17, 15, 10, 6, -6, -10, -15, -17 }, {}, {}, {}, { 9, 7, -7, -9, 8, 1, -1, -8 } };