WebSVN – Games.Chess Giants – Diff – /engine-stockfish/bitboard.h

   Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
-  Copyright (C) 2015-2018 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
+  Copyright (C) 2015-2019 Marco Costalba, Joona Kiiski, Gary Linscott, 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.
 void init();
 const std::string pretty(Bitboard b);
+}
-const Bitboard AllSquares = ~Bitboard(0);
+constexpr Bitboard AllSquares = ~Bitboard(0);
-const Bitboard DarkSquares = 0xAA55AA55AA55AA55ULL;
+constexpr Bitboard DarkSquares = 0xAA55AA55AA55AA55ULL;
-const Bitboard FileABB = 0x0101010101010101ULL;
+constexpr Bitboard FileABB = 0x0101010101010101ULL;
-const Bitboard FileBBB = FileABB << 1;
+constexpr Bitboard FileBBB = FileABB << 1;
-const Bitboard FileCBB = FileABB << 2;
+constexpr Bitboard FileCBB = FileABB << 2;
-const Bitboard FileDBB = FileABB << 3;
+constexpr Bitboard FileDBB = FileABB << 3;
-const Bitboard FileEBB = FileABB << 4;
+constexpr Bitboard FileEBB = FileABB << 4;
-const Bitboard FileFBB = FileABB << 5;
+constexpr Bitboard FileFBB = FileABB << 5;
-const Bitboard FileGBB = FileABB << 6;
+constexpr Bitboard FileGBB = FileABB << 6;
-const Bitboard FileHBB = FileABB << 7;
+constexpr Bitboard FileHBB = FileABB << 7;
-const Bitboard Rank1BB = 0xFF;
+constexpr Bitboard Rank1BB = 0xFF;
-const Bitboard Rank2BB = Rank1BB << (8 * 1);
+constexpr Bitboard Rank2BB = Rank1BB << (8 * 1);
-const Bitboard Rank3BB = Rank1BB << (8 * 2);
+constexpr Bitboard Rank3BB = Rank1BB << (8 * 2);
-const Bitboard Rank4BB = Rank1BB << (8 * 3);
+constexpr Bitboard Rank4BB = Rank1BB << (8 * 3);
-const Bitboard Rank5BB = Rank1BB << (8 * 4);
+constexpr Bitboard Rank5BB = Rank1BB << (8 * 4);
-const Bitboard Rank6BB = Rank1BB << (8 * 5);
+constexpr Bitboard Rank6BB = Rank1BB << (8 * 5);
-const Bitboard Rank7BB = Rank1BB << (8 * 6);
+constexpr Bitboard Rank7BB = Rank1BB << (8 * 6);
-const Bitboard Rank8BB = Rank1BB << (8 * 7);
+constexpr Bitboard Rank8BB = Rank1BB << (8 * 7);
 extern int SquareDistance[SQUARE_NB][SQUARE_NB];
 extern Bitboard SquareBB[SQUARE_NB];
 extern Bitboard FileBB[FILE_NB];
 /// Overloads of bitwise operators between a Bitboard and a Square for testing
 /// whether a given bit is set in a bitboard, and for setting and clearing bits.
 inline Bitboard operator&(Bitboard b, Square s) {
+  assert(s >= SQ_A1 && s <= SQ_H8);
   return b & SquareBB[s];
+}
 inline Bitboard operator|(Bitboard b, Square s) {
+  assert(s >= SQ_A1 && s <= SQ_H8);
   return b | SquareBB[s];
+}
 inline Bitboard operator^(Bitboard b, Square s) {
+  assert(s >= SQ_A1 && s <= SQ_H8);
   return b ^ SquareBB[s];
+}
 inline Bitboard& operator|=(Bitboard& b, Square s) {
+  assert(s >= SQ_A1 && s <= SQ_H8);
   return b |= SquareBB[s];
+}
 inline Bitboard& operator^=(Bitboard& b, Square s) {
+  assert(s >= SQ_A1 && s <= SQ_H8);
   return b ^= SquareBB[s];
+}
 constexpr bool more_than_one(Bitboard b) {
   return b & (b - 1);
 inline Bitboard file_bb(Square s) {
   return FileBB[file_of(s)];
+}
-/// shift() moves a bitboard one step along direction D. Mainly for pawns
+/// shift() moves a bitboard one step along direction D (mainly for pawns)
 template<Direction D>
 constexpr Bitboard shift(Bitboard b) {
   return  D == NORTH      ?  b             << 8 : D == SOUTH      ?  b             >> 8
+        : D == EAST       ? (b & ~FileHBB) << 1 : D == WEST       ? (b & ~FileABB) >> 1
-        : D == NORTH_EAST ? (b & ~FileHBB) << 9 : D == SOUTH_EAST ? (b & ~FileHBB) >> 7
+        : D == NORTH_EAST ? (b & ~FileHBB) << 9 : D == NORTH_WEST ? (b & ~FileABB) << 7
-        : D == NORTH_WEST ? (b & ~FileABB) << 7 : D == SOUTH_WEST ? (b & ~FileABB) >> 9
+        : D == SOUTH_EAST ? (b & ~FileHBB) >> 7 : D == SOUTH_WEST ? (b & ~FileABB) >> 9
         : 0;
+}
+/// pawn_attacks_bb() returns the pawn attacks for the given color from the
+/// squares in the given bitboard.
+template<Color C>
+constexpr Bitboard pawn_attacks_bb(Bitboard b) {
+  return C == WHITE ? shift<NORTH_WEST>(b) | shift<NORTH_EAST>(b)
+                    : shift<SOUTH_WEST>(b) | shift<SOUTH_EAST>(b);
+}
 /// adjacent_files_bb() returns a bitboard representing all the squares on the
 /// adjacent files of the given one.
 inline Bitboard between_bb(Square s1, Square s2) {
   return BetweenBB[s1][s2];
+}
-/// forward_ranks_bb() returns a bitboard representing all the squares on all the ranks
+/// forward_ranks_bb() returns a bitboard representing the squares on all the ranks
-/// in front of the given one, from the point of view of the given color. For
+/// in front of the given one, from the point of view of the given color. For instance,
-/// instance, forward_ranks_bb(BLACK, SQ_D3) will return the 16 squares on ranks 1 and 2.
+/// forward_ranks_bb(BLACK, SQ_D3) will return the 16 squares on ranks 1 and 2.
 inline Bitboard forward_ranks_bb(Color c, Square s) {
   return ForwardRanksBB[c][rank_of(s)];
+}
+}
 /// lsb() and msb() return the least/most significant bit in a non-zero bitboard
-#if defined(__GNUC__)
+#if defined(__GNUC__)  // GCC, Clang, ICC
 inline Square lsb(Bitboard b) {
   assert(b);
   return Square(__builtin_ctzll(b));
+}
 inline Square msb(Bitboard b) {
   assert(b);
   return Square(63 ^ __builtin_clzll(b));
+}
-#elif defined(_WIN64) && defined(_MSC_VER)
+#elif defined(_MSC_VER)  // MSVC
+#ifdef _WIN64  // MSVC, WIN64
 inline Square lsb(Bitboard b) {
   assert(b);
   unsigned long idx;
   _BitScanForward64(&idx, b);
   unsigned long idx;
   _BitScanReverse64(&idx, b);
   return (Square) idx;
+}
+#else  // MSVC, WIN32
+inline Square lsb(Bitboard b) {
+  assert(b);
+  unsigned long idx;
+  if (b & 0xffffffff) {
+      _BitScanForward(&idx, int32_t(b));
+      return Square(idx);
+  } else {
+      _BitScanForward(&idx, int32_t(b >> 32));
+      return Square(idx + 32);
+  }
+}
+inline Square msb(Bitboard b) {
+  assert(b);
+  unsigned long idx;
+  if (b >> 32) {
+      _BitScanReverse(&idx, int32_t(b >> 32));
+      return Square(idx + 32);
+  } else {
+      _BitScanReverse(&idx, int32_t(b));
+      return Square(idx);
+  }
+}
-#else
+#endif
-#define NO_BSF // Fallback on software implementation for other cases
+#else  // Compiler is neither GCC nor MSVC compatible
-Square lsb(Bitboard b);
-Square msb(Bitboard b);
+#error "Compiler not supported."
 #endif
 /// pop_lsb() finds and clears the least significant bit in a non-zero bitboard

Subversion Repositories Games.Chess Giants

Games.Chess Giants/engine-stockfish/bitboard.h – Rev 169 → 185