/*
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-2010 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
//// Includes
////
-#ifdef _MSC_VER
- #include <intrin.h>
- #ifdef _WIN64
- #pragma intrinsic(_BitScanForward64)
- #else
- #pragma intrinsic(_BitScanForward)
- #endif
- #define USING_INTRINSICS
-#endif
-
#include <iostream>
#include "bitboard.h"
+#include "bitcount.h"
#include "direction.h"
-////
-//// Constants and variables
-////
-
-const Bitboard SquaresByColorBB[2] = {BlackSquaresBB, WhiteSquaresBB};
-
-const Bitboard FileBB[8] = {
- FileABB, FileBBB, FileCBB, FileDBB, FileEBB, FileFBB, FileGBB, FileHBB
-};
-
-const Bitboard NeighboringFilesBB[8] = {
- FileBBB, FileABB|FileCBB, FileBBB|FileDBB, FileCBB|FileEBB,
- FileDBB|FileFBB, FileEBB|FileGBB, FileFBB|FileHBB, FileGBB
-};
-
-const Bitboard ThisAndNeighboringFilesBB[8] = {
- FileABB|FileBBB, FileABB|FileBBB|FileCBB,
- FileBBB|FileCBB|FileDBB, FileCBB|FileDBB|FileEBB,
- FileDBB|FileEBB|FileFBB, FileEBB|FileFBB|FileGBB,
- FileFBB|FileGBB|FileHBB, FileGBB|FileHBB
-};
-
-const Bitboard RankBB[8] = {
- Rank1BB, Rank2BB, Rank3BB, Rank4BB, Rank5BB, Rank6BB, Rank7BB, Rank8BB
-};
-
-const Bitboard RelativeRankBB[2][8] = {
- {
- Rank1BB, Rank2BB, Rank3BB, Rank4BB, Rank5BB, Rank6BB, Rank7BB, Rank8BB
- },
- {
- Rank8BB, Rank7BB, Rank6BB, Rank5BB, Rank4BB, Rank3BB, Rank2BB, Rank1BB
- }
-};
+#if defined(IS_64BIT)
-const Bitboard InFrontBB[2][8] = {
- {
- Rank2BB | Rank3BB | Rank4BB | Rank5BB | Rank6BB | Rank7BB | Rank8BB,
- Rank3BB | Rank4BB | Rank5BB | Rank6BB | Rank7BB | Rank8BB,
- Rank4BB | Rank5BB | Rank6BB | Rank7BB | Rank8BB,
- Rank5BB | Rank6BB | Rank7BB | Rank8BB,
- Rank6BB | Rank7BB | Rank8BB,
- Rank7BB | Rank8BB,
- Rank8BB,
- EmptyBoardBB
- },
- {
- EmptyBoardBB,
- Rank1BB,
- Rank2BB | Rank1BB,
- Rank3BB | Rank2BB | Rank1BB,
- Rank4BB | Rank3BB | Rank2BB | Rank1BB,
- Rank5BB | Rank4BB | Rank3BB | Rank2BB | Rank1BB,
- Rank6BB | Rank5BB | Rank4BB | Rank3BB | Rank2BB | Rank1BB,
- Rank7BB | Rank6BB | Rank5BB | Rank4BB | Rank3BB | Rank2BB | Rank1BB
- }
-};
-
-#if defined(USE_COMPACT_ROOK_ATTACKS)
-
-Bitboard RankAttacks[8][64], FileAttacks[8][64];
-
-#elif defined(USE_32BIT_ATTACKS)
-
-const uint64_t RMult[64] = {
- 0xd7445cdec88002c0ULL, 0xd0a505c1f2001722ULL, 0xe065d1c896002182ULL,
- 0x9a8c41e75a000892ULL, 0x8900b10c89002aa8ULL, 0x9b28d1c1d60005a2ULL,
- 0x15d6c88de002d9aULL, 0xb1dbfc802e8016a9ULL, 0x149a1042d9d60029ULL,
- 0xb9c08050599e002fULL, 0x132208c3af300403ULL, 0xc1000ce2e9c50070ULL,
- 0x9d9aa13c99020012ULL, 0xb6b078daf71e0046ULL, 0x9d880182fb6e002eULL,
- 0x52889f467e850037ULL, 0xda6dc008d19a8480ULL, 0x468286034f902420ULL,
- 0x7140ac09dc54c020ULL, 0xd76ffffa39548808ULL, 0xea901c4141500808ULL,
- 0xc91004093f953a02ULL, 0x2882afa8f6bb402ULL, 0xaebe335692442c01ULL,
- 0xe904a22079fb91eULL, 0x13a514851055f606ULL, 0x76c782018c8fe632ULL,
- 0x1dc012a9d116da06ULL, 0x3c9e0037264fffa6ULL, 0x2036002853c6e4a2ULL,
- 0xe3fe08500afb47d4ULL, 0xf38af25c86b025c2ULL, 0xc0800e2182cf9a40ULL,
- 0x72002480d1f60673ULL, 0x2500200bae6e9b53ULL, 0xc60018c1eefca252ULL,
- 0x600590473e3608aULL, 0x46002c4ab3fe51b2ULL, 0xa200011486bcc8d2ULL,
- 0xb680078095784c63ULL, 0x2742002639bf11aeULL, 0xc7d60021a5bdb142ULL,
- 0xc8c04016bb83d820ULL, 0xbd520028123b4842ULL, 0x9d1600344ac2a832ULL,
- 0x6a808005631c8a05ULL, 0x604600a148d5389aULL, 0xe2e40103d40dea65ULL,
- 0x945b5a0087c62a81ULL, 0x12dc200cd82d28eULL, 0x2431c600b5f9ef76ULL,
- 0xfb142a006a9b314aULL, 0x6870e00a1c97d62ULL, 0x2a9db2004a2689a2ULL,
- 0xd3594600caf5d1a2ULL, 0xee0e4900439344a7ULL, 0x89c4d266ca25007aULL,
- 0x3e0013a2743f97e3ULL, 0x180e31a0431378aULL, 0x3a9e465a4d42a512ULL,
- 0x98d0a11a0c0d9cc2ULL, 0x8e711c1aba19b01eULL, 0x8dcdc836dd201142ULL,
- 0x5ac08a4735370479ULL,
-};
-
-const int RShift[64] = {
- 20, 21, 21, 21, 21, 21, 21, 20, 21, 22, 22, 22, 22, 22, 22, 21,
- 21, 22, 22, 22, 22, 22, 22, 21, 21, 22, 22, 22, 22, 22, 22, 21,
- 21, 22, 22, 22, 22, 22, 22, 21, 21, 22, 22, 22, 22, 22, 22, 21,
- 21, 22, 22, 22, 22, 22, 22, 21, 20, 21, 21, 21, 21, 21, 21, 20
+const uint64_t BMult[64] = {
+ 0x440049104032280ULL, 0x1021023c82008040ULL, 0x404040082000048ULL,
+ 0x48c4440084048090ULL, 0x2801104026490000ULL, 0x4100880442040800ULL,
+ 0x181011002e06040ULL, 0x9101004104200e00ULL, 0x1240848848310401ULL,
+ 0x2000142828050024ULL, 0x1004024d5000ULL, 0x102044400800200ULL,
+ 0x8108108820112000ULL, 0xa880818210c00046ULL, 0x4008008801082000ULL,
+ 0x60882404049400ULL, 0x104402004240810ULL, 0xa002084250200ULL,
+ 0x100b0880801100ULL, 0x4080201220101ULL, 0x44008080a00000ULL,
+ 0x202200842000ULL, 0x5006004882d00808ULL, 0x200045080802ULL,
+ 0x86100020200601ULL, 0xa802080a20112c02ULL, 0x80411218080900ULL,
+ 0x200a0880080a0ULL, 0x9a01010000104000ULL, 0x28008003100080ULL,
+ 0x211021004480417ULL, 0x401004188220806ULL, 0x825051400c2006ULL,
+ 0x140c0210943000ULL, 0x242800300080ULL, 0xc2208120080200ULL,
+ 0x2430008200002200ULL, 0x1010100112008040ULL, 0x8141050100020842ULL,
+ 0x822081014405ULL, 0x800c049e40400804ULL, 0x4a0404028a000820ULL,
+ 0x22060201041200ULL, 0x360904200840801ULL, 0x881a08208800400ULL,
+ 0x60202c00400420ULL, 0x1204440086061400ULL, 0x8184042804040ULL,
+ 0x64040315300400ULL, 0xc01008801090a00ULL, 0x808010401140c00ULL,
+ 0x4004830c2020040ULL, 0x80005002020054ULL, 0x40000c14481a0490ULL,
+ 0x10500101042048ULL, 0x1010100200424000ULL, 0x640901901040ULL,
+ 0xa0201014840ULL, 0x840082aa011002ULL, 0x10010840084240aULL,
+ 0x420400810420608ULL, 0x8d40230408102100ULL, 0x4a00200612222409ULL,
+ 0xa08520292120600ULL
};
-#else // if defined(USE_32BIT_ATTACKS)
-
const uint64_t RMult[64] = {
0xa8002c000108020ULL, 0x4440200140003000ULL, 0x8080200010011880ULL,
0x380180080141000ULL, 0x1a00060008211044ULL, 0x410001000a0c0008ULL,
0x410201ce5c030092ULL
};
+const int BShift[64] = {
+ 58, 59, 59, 59, 59, 59, 59, 58, 59, 59, 59, 59, 59, 59, 59, 59,
+ 59, 59, 57, 57, 57, 57, 59, 59, 59, 59, 57, 55, 55, 57, 59, 59,
+ 59, 59, 57, 55, 55, 57, 59, 59, 59, 59, 57, 57, 57, 57, 59, 59,
+ 59, 59, 59, 59, 59, 59, 59, 59, 58, 59, 59, 59, 59, 59, 59, 58
+};
+
const int RShift[64] = {
52, 53, 53, 53, 53, 53, 53, 52, 53, 54, 54, 54, 54, 54, 54, 53,
53, 54, 54, 54, 54, 54, 54, 53, 53, 54, 54, 54, 54, 54, 54, 53,
53, 54, 54, 54, 54, 54, 54, 53, 52, 53, 53, 53, 53, 53, 53, 52
};
-#endif // defined(USE_32BIT_ATTACKS)
-
-#if !defined(USE_COMPACT_ROOK_ATTACKS)
-Bitboard RMask[64];
-int RAttackIndex[64];
-Bitboard RAttacks[0x19000];
-#endif
-
-#if defined(USE_32BIT_ATTACKS)
+#else // if !defined(IS_64BIT)
const uint64_t BMult[64] = {
0x54142844c6a22981ULL, 0x710358a6ea25c19eULL, 0x704f746d63a4a8dcULL,
0xdc01f6dca4bebbdcULL,
};
+const uint64_t RMult[64] = {
+ 0xd7445cdec88002c0ULL, 0xd0a505c1f2001722ULL, 0xe065d1c896002182ULL,
+ 0x9a8c41e75a000892ULL, 0x8900b10c89002aa8ULL, 0x9b28d1c1d60005a2ULL,
+ 0x15d6c88de002d9aULL, 0xb1dbfc802e8016a9ULL, 0x149a1042d9d60029ULL,
+ 0xb9c08050599e002fULL, 0x132208c3af300403ULL, 0xc1000ce2e9c50070ULL,
+ 0x9d9aa13c99020012ULL, 0xb6b078daf71e0046ULL, 0x9d880182fb6e002eULL,
+ 0x52889f467e850037ULL, 0xda6dc008d19a8480ULL, 0x468286034f902420ULL,
+ 0x7140ac09dc54c020ULL, 0xd76ffffa39548808ULL, 0xea901c4141500808ULL,
+ 0xc91004093f953a02ULL, 0x2882afa8f6bb402ULL, 0xaebe335692442c01ULL,
+ 0xe904a22079fb91eULL, 0x13a514851055f606ULL, 0x76c782018c8fe632ULL,
+ 0x1dc012a9d116da06ULL, 0x3c9e0037264fffa6ULL, 0x2036002853c6e4a2ULL,
+ 0xe3fe08500afb47d4ULL, 0xf38af25c86b025c2ULL, 0xc0800e2182cf9a40ULL,
+ 0x72002480d1f60673ULL, 0x2500200bae6e9b53ULL, 0xc60018c1eefca252ULL,
+ 0x600590473e3608aULL, 0x46002c4ab3fe51b2ULL, 0xa200011486bcc8d2ULL,
+ 0xb680078095784c63ULL, 0x2742002639bf11aeULL, 0xc7d60021a5bdb142ULL,
+ 0xc8c04016bb83d820ULL, 0xbd520028123b4842ULL, 0x9d1600344ac2a832ULL,
+ 0x6a808005631c8a05ULL, 0x604600a148d5389aULL, 0xe2e40103d40dea65ULL,
+ 0x945b5a0087c62a81ULL, 0x12dc200cd82d28eULL, 0x2431c600b5f9ef76ULL,
+ 0xfb142a006a9b314aULL, 0x6870e00a1c97d62ULL, 0x2a9db2004a2689a2ULL,
+ 0xd3594600caf5d1a2ULL, 0xee0e4900439344a7ULL, 0x89c4d266ca25007aULL,
+ 0x3e0013a2743f97e3ULL, 0x180e31a0431378aULL, 0x3a9e465a4d42a512ULL,
+ 0x98d0a11a0c0d9cc2ULL, 0x8e711c1aba19b01eULL, 0x8dcdc836dd201142ULL,
+ 0x5ac08a4735370479ULL,
+};
+
const int BShift[64] = {
26, 27, 27, 27, 27, 27, 27, 26, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 25, 25, 25, 25, 27, 27, 27, 27, 25, 23, 23, 25, 27, 27,
27, 27, 27, 27, 27, 27, 27, 27, 26, 27, 27, 27, 27, 27, 27, 26
};
-#else // if defined(USE_32BIT_ATTACKS)
+const int RShift[64] = {
+ 20, 21, 21, 21, 21, 21, 21, 20, 21, 22, 22, 22, 22, 22, 22, 21,
+ 21, 22, 22, 22, 22, 22, 22, 21, 21, 22, 22, 22, 22, 22, 22, 21,
+ 21, 22, 22, 22, 22, 22, 22, 21, 21, 22, 22, 22, 22, 22, 22, 21,
+ 21, 22, 22, 22, 22, 22, 22, 21, 20, 21, 21, 21, 21, 21, 21, 20
+};
-const uint64_t BMult[64] = {
- 0x440049104032280ULL, 0x1021023c82008040ULL, 0x404040082000048ULL,
- 0x48c4440084048090ULL, 0x2801104026490000ULL, 0x4100880442040800ULL,
- 0x181011002e06040ULL, 0x9101004104200e00ULL, 0x1240848848310401ULL,
- 0x2000142828050024ULL, 0x1004024d5000ULL, 0x102044400800200ULL,
- 0x8108108820112000ULL, 0xa880818210c00046ULL, 0x4008008801082000ULL,
- 0x60882404049400ULL, 0x104402004240810ULL, 0xa002084250200ULL,
- 0x100b0880801100ULL, 0x4080201220101ULL, 0x44008080a00000ULL,
- 0x202200842000ULL, 0x5006004882d00808ULL, 0x200045080802ULL,
- 0x86100020200601ULL, 0xa802080a20112c02ULL, 0x80411218080900ULL,
- 0x200a0880080a0ULL, 0x9a01010000104000ULL, 0x28008003100080ULL,
- 0x211021004480417ULL, 0x401004188220806ULL, 0x825051400c2006ULL,
- 0x140c0210943000ULL, 0x242800300080ULL, 0xc2208120080200ULL,
- 0x2430008200002200ULL, 0x1010100112008040ULL, 0x8141050100020842ULL,
- 0x822081014405ULL, 0x800c049e40400804ULL, 0x4a0404028a000820ULL,
- 0x22060201041200ULL, 0x360904200840801ULL, 0x881a08208800400ULL,
- 0x60202c00400420ULL, 0x1204440086061400ULL, 0x8184042804040ULL,
- 0x64040315300400ULL, 0xc01008801090a00ULL, 0x808010401140c00ULL,
- 0x4004830c2020040ULL, 0x80005002020054ULL, 0x40000c14481a0490ULL,
- 0x10500101042048ULL, 0x1010100200424000ULL, 0x640901901040ULL,
- 0xa0201014840ULL, 0x840082aa011002ULL, 0x10010840084240aULL,
- 0x420400810420608ULL, 0x8d40230408102100ULL, 0x4a00200612222409ULL,
- 0xa08520292120600ULL
+#endif // defined(IS_64BIT)
+
+const Bitboard SquaresByColorBB[2] = { BlackSquaresBB, WhiteSquaresBB };
+
+const Bitboard FileBB[8] = {
+ FileABB, FileBBB, FileCBB, FileDBB, FileEBB, FileFBB, FileGBB, FileHBB
};
-const int BShift[64] = {
- 58, 59, 59, 59, 59, 59, 59, 58, 59, 59, 59, 59, 59, 59, 59, 59,
- 59, 59, 57, 57, 57, 57, 59, 59, 59, 59, 57, 55, 55, 57, 59, 59,
- 59, 59, 57, 55, 55, 57, 59, 59, 59, 59, 57, 57, 57, 57, 59, 59,
- 59, 59, 59, 59, 59, 59, 59, 59, 58, 59, 59, 59, 59, 59, 59, 58
+const Bitboard NeighboringFilesBB[8] = {
+ FileBBB, FileABB|FileCBB, FileBBB|FileDBB, FileCBB|FileEBB,
+ FileDBB|FileFBB, FileEBB|FileGBB, FileFBB|FileHBB, FileGBB
+};
+
+const Bitboard ThisAndNeighboringFilesBB[8] = {
+ FileABB|FileBBB, FileABB|FileBBB|FileCBB,
+ FileBBB|FileCBB|FileDBB, FileCBB|FileDBB|FileEBB,
+ FileDBB|FileEBB|FileFBB, FileEBB|FileFBB|FileGBB,
+ FileFBB|FileGBB|FileHBB, FileGBB|FileHBB
+};
+
+const Bitboard RankBB[8] = {
+ Rank1BB, Rank2BB, Rank3BB, Rank4BB, Rank5BB, Rank6BB, Rank7BB, Rank8BB
+};
+
+const Bitboard RelativeRankBB[2][8] = {
+ { Rank1BB, Rank2BB, Rank3BB, Rank4BB, Rank5BB, Rank6BB, Rank7BB, Rank8BB },
+ { Rank8BB, Rank7BB, Rank6BB, Rank5BB, Rank4BB, Rank3BB, Rank2BB, Rank1BB }
+};
+
+const Bitboard InFrontBB[2][8] = {
+ { Rank2BB | Rank3BB | Rank4BB | Rank5BB | Rank6BB | Rank7BB | Rank8BB,
+ Rank3BB | Rank4BB | Rank5BB | Rank6BB | Rank7BB | Rank8BB,
+ Rank4BB | Rank5BB | Rank6BB | Rank7BB | Rank8BB,
+ Rank5BB | Rank6BB | Rank7BB | Rank8BB,
+ Rank6BB | Rank7BB | Rank8BB,
+ Rank7BB | Rank8BB,
+ Rank8BB,
+ EmptyBoardBB
+ },
+ { EmptyBoardBB,
+ Rank1BB,
+ Rank2BB | Rank1BB,
+ Rank3BB | Rank2BB | Rank1BB,
+ Rank4BB | Rank3BB | Rank2BB | Rank1BB,
+ Rank5BB | Rank4BB | Rank3BB | Rank2BB | Rank1BB,
+ Rank6BB | Rank5BB | Rank4BB | Rank3BB | Rank2BB | Rank1BB,
+ Rank7BB | Rank6BB | Rank5BB | Rank4BB | Rank3BB | Rank2BB | Rank1BB
+ }
};
-#endif // defined(USE_32BIT_ATTACKS)
+Bitboard RMask[64];
+int RAttackIndex[64];
+Bitboard RAttacks[0x19000];
Bitboard BMask[64];
int BAttackIndex[64];
Bitboard BAttacks[0x1480];
-Bitboard SetMaskBB[64];
-Bitboard ClearMaskBB[64];
+Bitboard SetMaskBB[65];
+Bitboard ClearMaskBB[65];
Bitboard StepAttackBB[16][64];
Bitboard RayBB[64][8];
Bitboard RookPseudoAttacks[64];
Bitboard QueenPseudoAttacks[64];
+uint8_t BitCount8Bit[256];
+
////
//// Local definitions
////
namespace {
+
void init_masks();
void init_ray_bitboards();
void init_attacks();
void init_between_bitboards();
+ void init_pseudo_attacks();
+ Bitboard index_to_bitboard(int index, Bitboard mask);
Bitboard sliding_attacks(int sq, Bitboard block, int dirs, int deltas[][2],
int fmin, int fmax, int rmin, int rmax);
- Bitboard index_to_bitboard(int index, Bitboard mask);
- void init_sliding_attacks(Bitboard attacks[],
- int attackIndex[], Bitboard mask[],
- const int shift[2], const Bitboard mult[],
- int deltas[][2]);
- void init_pseudo_attacks();
-#if defined(USE_COMPACT_ROOK_ATTACKS)
- void init_file_and_rank_attacks();
-#endif
+ void init_sliding_attacks(Bitboard attacks[], int attackIndex[], Bitboard mask[],
+ const int shift[], const Bitboard mult[], int deltas[][2]);
}
/// standard output. This is sometimes useful for debugging.
void print_bitboard(Bitboard b) {
- for(Rank r = RANK_8; r >= RANK_1; r--) {
- std::cout << "+---+---+---+---+---+---+---+---+" << std::endl;
- for(File f = FILE_A; f <= FILE_H; f++)
- std::cout << "| " << (bit_is_set(b, make_square(f, r))? 'X' : ' ') << ' ';
- std::cout << "|" << std::endl;
+
+ for (Rank r = RANK_8; r >= RANK_1; r--)
+ {
+ std::cout << "+---+---+---+---+---+---+---+---+" << std::endl;
+ for (File f = FILE_A; f <= FILE_H; f++)
+ std::cout << "| " << (bit_is_set(b, make_square(f, r))? 'X' : ' ') << ' ';
+
+ std::cout << "|" << std::endl;
}
std::cout << "+---+---+---+---+---+---+---+---+" << std::endl;
}
/// program initialization.
void init_bitboards() {
+
int rookDeltas[4][2] = {{0,1},{0,-1},{1,0},{-1,0}};
int bishopDeltas[4][2] = {{1,1},{-1,1},{1,-1},{-1,-1}};
+
init_masks();
init_ray_bitboards();
init_attacks();
init_between_bitboards();
-#if defined(USE_COMPACT_ROOK_ATTACKS)
- init_file_and_rank_attacks();
-#else
- init_sliding_attacks(RAttacks, RAttackIndex, RMask, RShift,
- RMult, rookDeltas);
-#endif
- init_sliding_attacks(BAttacks, BAttackIndex, BMask, BShift,
- BMult, bishopDeltas);
+ init_sliding_attacks(RAttacks, RAttackIndex, RMask, RShift, RMult, rookDeltas);
+ init_sliding_attacks(BAttacks, BAttackIndex, BMask, BShift, BMult, bishopDeltas);
init_pseudo_attacks();
}
-#if defined(USE_FOLDED_BITSCAN)
+/// first_1() finds the least significant nonzero bit in a nonzero bitboard.
+/// pop_1st_bit() finds and clears the least significant nonzero bit in a
+/// nonzero bitboard.
+
+#if defined(IS_64BIT) && !defined(USE_BSFQ)
+
+static CACHE_LINE_ALIGNMENT
+const int BitTable[64] = {
+ 0, 1, 2, 7, 3, 13, 8, 19, 4, 25, 14, 28, 9, 34, 20, 40, 5, 17, 26, 38, 15,
+ 46, 29, 48, 10, 31, 35, 54, 21, 50, 41, 57, 63, 6, 12, 18, 24, 27, 33, 39,
+ 16, 37, 45, 47, 30, 53, 49, 56, 62, 11, 23, 32, 36, 44, 52, 55, 61, 22, 43,
+ 51, 60, 42, 59, 58
+};
+
+Square first_1(Bitboard b) {
+ return Square(BitTable[((b & -b) * 0x218a392cd3d5dbfULL) >> 58]);
+}
+
+Square pop_1st_bit(Bitboard* b) {
+ Bitboard bb = *b;
+ *b &= (*b - 1);
+ return Square(BitTable[((bb & -bb) * 0x218a392cd3d5dbfULL) >> 58]);
+}
+
+#elif !defined(USE_BSFQ)
-static const int BitTable[64] = {
+static CACHE_LINE_ALIGNMENT
+const int BitTable[64] = {
63, 30, 3, 32, 25, 41, 22, 33, 15, 50, 42, 13, 11, 53, 19, 34, 61, 29, 2,
51, 21, 43, 45, 10, 18, 47, 1, 54, 9, 57, 0, 35, 62, 31, 40, 4, 49, 5, 52,
26, 60, 6, 23, 44, 46, 27, 56, 16, 7, 39, 48, 24, 59, 14, 12, 55, 38, 28,
58, 20, 37, 17, 36, 8
};
-
-/// first_1() finds the least significant nonzero bit in a nonzero bitboard.
-
Square first_1(Bitboard b) {
+
b ^= (b - 1);
uint32_t fold = int(b) ^ int(b >> 32);
return Square(BitTable[(fold * 0x783a9b23) >> 26]);
}
-
-/// pop_1st_bit() finds and clears the least significant nonzero bit in a
-/// nonzero bitboard.
-
-#if defined(USE_32BIT_ATTACKS)
-
// Use type-punning
union b_union {
Bitboard b;
struct {
+#if defined (BIGENDIAN)
+ uint32_t h;
+ uint32_t l;
+#else
uint32_t l;
uint32_t h;
- };
+#endif
+ } dw;
};
-// WARNING: Needs -fno-strict-aliasing compiler option
-Square pop_1st_bit(Bitboard *bb) {
+Square pop_1st_bit(Bitboard* bb) {
- b_union u;
- uint32_t b;
+ b_union u;
+ Square ret;
- u.b = *bb;
+ u.b = *bb;
- if (u.l)
- {
- b = u.l;
- *((uint32_t*)bb) = b & (b - 1);
- b ^= (b - 1);
- }
- else
- {
- b = u.h;
- *((uint32_t*)bb+1) = b & (b - 1); // Little endian only?
- b = ~(b ^ (b - 1));
- }
- return Square(BitTable[(b * 0x783a9b23) >> 26]);
-}
-
-#else
-
-Square pop_1st_bit(Bitboard *b) {
- Bitboard bb = *b ^ (*b - 1);
- uint32_t fold = int(bb) ^ int(bb >> 32);
- *b &= (*b - 1);
- return Square(BitTable[(fold * 0x783a9b23) >> 26]);
+ if (u.dw.l)
+ {
+ ret = Square(BitTable[((u.dw.l ^ (u.dw.l - 1)) * 0x783a9b23) >> 26]);
+ u.dw.l &= (u.dw.l - 1);
+ *bb = u.b;
+ return ret;
+ }
+ ret = Square(BitTable[((~(u.dw.h ^ (u.dw.h - 1))) * 0x783a9b23) >> 26]);
+ u.dw.h &= (u.dw.h - 1);
+ *bb = u.b;
+ return ret;
}
#endif
-#else
-
-static const int BitTable[64] = {
- 0, 1, 2, 7, 3, 13, 8, 19, 4, 25, 14, 28, 9, 34, 20, 40, 5, 17, 26, 38, 15,
- 46, 29, 48, 10, 31, 35, 54, 21, 50, 41, 57, 63, 6, 12, 18, 24, 27, 33, 39,
- 16, 37, 45, 47, 30, 53, 49, 56, 62, 11, 23, 32, 36, 44, 52, 55, 61, 22, 43,
- 51, 60, 42, 59, 58
+// Optimized bitScanReverse32() implementation by Pascal Georges. Note
+// that first bit is 1, this allow to differentiate between 0 and 1.
+static CACHE_LINE_ALIGNMENT
+const char MsbTable[256] = {
+ 0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5,
+ 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+ 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7,
+ 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
+ 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
+ 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+ 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+ 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+ 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+ 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+ 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8
};
-
-/// first_1() finds the least significant nonzero bit in a nonzero bitboard.
-
-Square first_1(Bitboard b) {
- return Square(BitTable[((b & -b) * 0x218a392cd3d5dbfULL) >> 58]);
-}
-
-
-/// pop_1st_bit() finds and clears the least significant nonzero bit in a
-/// nonzero bitboard.
-
-Square pop_1st_bit(Bitboard *b) {
- Bitboard bb = *b;
- *b &= (*b - 1);
- return Square(BitTable[((bb & -bb) * 0x218a392cd3d5dbfULL) >> 58]);
+int bitScanReverse32(uint32_t b)
+{
+ int result = 0;
+
+ if (b > 0xFFFF)
+ {
+ b >>= 16;
+ result += 16;
+ }
+ if (b > 0xFF)
+ {
+ b >>= 8;
+ result += 8;
+ }
+ return result + MsbTable[b];
}
-#endif // defined(USE_FOLDED_BITSCAN)
-
-
namespace {
// All functions below are used to precompute various bitboards during
// be necessary to touch any of them.
void init_masks() {
- for(Square s = SQ_A1; s <= SQ_H8; s++) {
- SetMaskBB[s] = (1ULL << s);
- ClearMaskBB[s] = ~SetMaskBB[s];
+
+ SetMaskBB[SQ_NONE] = 0ULL;
+ ClearMaskBB[SQ_NONE] = ~SetMaskBB[SQ_NONE];
+
+ for (Square s = SQ_A1; s <= SQ_H8; s++)
+ {
+ SetMaskBB[s] = (1ULL << s);
+ ClearMaskBB[s] = ~SetMaskBB[s];
}
- for(Color c = WHITE; c <= BLACK; c++)
- for(Square s = SQ_A1; s <= SQ_H8; s++) {
- PassedPawnMask[c][s] =
- in_front_bb(c, s) & this_and_neighboring_files_bb(s);
- OutpostMask[c][s] = in_front_bb(c, s) & neighboring_files_bb(s);
- }
+
+ for (Color c = WHITE; c <= BLACK; c++)
+ for (Square s = SQ_A1; s <= SQ_H8; s++)
+ {
+ PassedPawnMask[c][s] = in_front_bb(c, s) & this_and_neighboring_files_bb(s);
+ OutpostMask[c][s] = in_front_bb(c, s) & neighboring_files_bb(s);
+ }
+
+ for (Bitboard b = 0ULL; b < 256ULL; b++)
+ BitCount8Bit[b] = (uint8_t)count_1s(b);
}
+ int remove_bit_8(int i) { return ((i & ~15) >> 1) | (i & 7); }
void init_ray_bitboards() {
+
int d[8] = {1, -1, 16, -16, 17, -17, 15, -15};
- for(int i = 0; i < 128; i = i + 9 & ~8) {
- for(int j = 0; j < 8; j++) {
- RayBB[(i&7)|((i>>4)<<3)][j] = EmptyBoardBB;
- for(int k = i + d[j]; (k & 0x88) == 0; k += d[j])
- set_bit(&(RayBB[(i&7)|((i>>4)<<3)][j]), Square((k&7)|((k>>4)<<3)));
- }
- }
- }
+ for (int i = 0; i < 128; i = (i + 9) & ~8)
+ for (int j = 0; j < 8; j++)
+ {
+ RayBB[remove_bit_8(i)][j] = EmptyBoardBB;
+ for (int k = i + d[j]; (k & 0x88) == 0; k += d[j])
+ set_bit(&(RayBB[remove_bit_8(i)][j]), Square(remove_bit_8(k)));
+ }
+ }
void init_attacks() {
- int i, j, k, l;
- int step[16][8] = {
+
+ const int step[16][8] = {
{0},
{7,9,0}, {17,15,10,6,-6,-10,-15,-17}, {9,7,-7,-9,0}, {8,1,-1,-8,0},
{9,7,-7,-9,8,1,-1,-8}, {9,7,-7,-9,8,1,-1,-8}, {0}, {0},
{9,7,-7,-9,8,1,-1,-8}, {9,7,-7,-9,8,1,-1,-8}
};
- for(i = 0; i < 64; i++) {
- for(j = 0; j <= int(BK); j++) {
- StepAttackBB[j][i] = EmptyBoardBB;
- for(k = 0; k < 8 && step[j][k] != 0; k++) {
- l = i + step[j][k];
- if(l >= 0 && l < 64 && abs((i&7) - (l&7)) < 3)
- StepAttackBB[j][i] |= (1ULL << l);
+ for (int i = 0; i < 64; i++)
+ for (int j = 0; j <= int(BK); j++)
+ {
+ StepAttackBB[j][i] = EmptyBoardBB;
+ for (int k = 0; k < 8 && step[j][k] != 0; k++)
+ {
+ int l = i + step[j][k];
+ if (l >= 0 && l < 64 && abs((i & 7) - (l & 7)) < 3)
+ StepAttackBB[j][i] |= (1ULL << l);
+ }
}
- }
- }
}
-
Bitboard sliding_attacks(int sq, Bitboard block, int dirs, int deltas[][2],
int fmin=0, int fmax=7, int rmin=0, int rmax=7) {
Bitboard result = 0ULL;
- int rk = sq / 8, fl = sq % 8, r, f, i;
- for(i = 0; i < dirs; i++) {
- int dx = deltas[i][0], dy = deltas[i][1];
- for(f = fl+dx, r = rk+dy;
- (dx==0 || (f>=fmin && f<=fmax)) && (dy==0 || (r>=rmin && r<=rmax));
- f += dx, r += dy) {
- result |= (1ULL << (f + r*8));
- if(block & (1ULL << (f + r*8))) break;
- }
+ int rk = sq / 8;
+ int fl = sq % 8;
+
+ for (int i = 0; i < dirs; i++)
+ {
+ int dx = deltas[i][0];
+ int dy = deltas[i][1];
+ int f = fl + dx;
+ int r = rk + dy;
+
+ while ( (dx == 0 || (f >= fmin && f <= fmax))
+ && (dy == 0 || (r >= rmin && r <= rmax)))
+ {
+ result |= (1ULL << (f + r*8));
+ if (block & (1ULL << (f + r*8)))
+ break;
+
+ f += dx;
+ r += dy;
+ }
}
return result;
}
-
void init_between_bitboards() {
- SquareDelta step[8] = {
- DELTA_E, DELTA_W, DELTA_N, DELTA_S, DELTA_NE, DELTA_SW, DELTA_NW, DELTA_SE
- };
- SignedDirection d;
- for(Square s1 = SQ_A1; s1 <= SQ_H8; s1++)
- for(Square s2 = SQ_A1; s2 <= SQ_H8; s2++) {
- BetweenBB[s1][s2] = EmptyBoardBB;
- d = signed_direction_between_squares(s1, s2);
- if(d != SIGNED_DIR_NONE)
- for(Square s3 = s1 + step[d]; s3 != s2; s3 += step[d])
- set_bit(&(BetweenBB[s1][s2]), s3);
+
+ const SquareDelta step[8] = { DELTA_E, DELTA_W, DELTA_N, DELTA_S,
+ DELTA_NE, DELTA_SW, DELTA_NW, DELTA_SE };
+
+ for (Square s1 = SQ_A1; s1 <= SQ_H8; s1++)
+ for (Square s2 = SQ_A1; s2 <= SQ_H8; s2++)
+ {
+ BetweenBB[s1][s2] = EmptyBoardBB;
+ SignedDirection d = signed_direction_between_squares(s1, s2);
+
+ if (d != SIGNED_DIR_NONE)
+ {
+ for (Square s3 = s1 + step[d]; s3 != s2; s3 += step[d])
+ set_bit(&(BetweenBB[s1][s2]), s3);
+ }
}
}
-
Bitboard index_to_bitboard(int index, Bitboard mask) {
- int i, j, bits = count_1s(mask);
+
Bitboard result = 0ULL;
- for(i = 0; i < bits; i++) {
- j = pop_1st_bit(&mask);
- if(index & (1 << i)) result |= (1ULL << j);
+ int bits = count_1s(mask);
+
+ for (int i = 0; i < bits; i++)
+ {
+ int j = pop_1st_bit(&mask);
+ if (index & (1 << i))
+ result |= (1ULL << j);
}
return result;
}
+ void init_sliding_attacks(Bitboard attacks[], int attackIndex[], Bitboard mask[],
+ const int shift[], const Bitboard mult[], int deltas[][2]) {
- void init_sliding_attacks(Bitboard attacks[],
- int attackIndex[], Bitboard mask[],
- const int shift[2], const Bitboard mult[],
- int deltas[][2]) {
- int i, j, k, index = 0;
- Bitboard b;
- for(i = 0; i < 64; i++) {
- attackIndex[i] = index;
- mask[i] = sliding_attacks(i, 0ULL, 4, deltas, 1, 6, 1, 6);
- j = (1 << (64 - shift[i]));
- for(k = 0; k < j; k++) {
-#if defined(USE_32BIT_ATTACKS)
- b = index_to_bitboard(k, mask[i]);
- attacks[index +
- (unsigned(int(b) * int(mult[i]) ^
- int(b >> 32) * int(mult[i] >> 32))
- >> shift[i])] =
- sliding_attacks(i, b, 4, deltas);
+ for (int i = 0, index = 0; i < 64; i++)
+ {
+ attackIndex[i] = index;
+ mask[i] = sliding_attacks(i, 0ULL, 4, deltas, 1, 6, 1, 6);
+
+#if defined(IS_64BIT)
+ int j = (1 << (64 - shift[i]));
#else
- b = index_to_bitboard(k, mask[i]);
- attacks[index + ((b * mult[i]) >> shift[i])] =
- sliding_attacks(i, b, 4, deltas);
+ int j = (1 << (32 - shift[i]));
#endif
- }
- index += j;
+
+ for (int k = 0; k < j; k++)
+ {
+#if defined(IS_64BIT)
+ Bitboard b = index_to_bitboard(k, mask[i]);
+ attacks[index + ((b * mult[i]) >> shift[i])] = sliding_attacks(i, b, 4, deltas);
+#else
+ Bitboard b = index_to_bitboard(k, mask[i]);
+ unsigned v = int(b) * int(mult[i]) ^ int(b >> 32) * int(mult[i] >> 32);
+ attacks[index + (v >> shift[i])] = sliding_attacks(i, b, 4, deltas);
+#endif
+ }
+ index += j;
}
}
-
void init_pseudo_attacks() {
- Square s;
- for(s = SQ_A1; s <= SQ_H8; s++) {
- BishopPseudoAttacks[s] = bishop_attacks_bb(s, EmptyBoardBB);
- RookPseudoAttacks[s] = rook_attacks_bb(s, EmptyBoardBB);
- QueenPseudoAttacks[s] = queen_attacks_bb(s, EmptyBoardBB);
- }
- }
-#if defined(USE_COMPACT_ROOK_ATTACKS)
- void init_file_and_rank_attacks() {
- int i, j, k, l, m, s;
- Bitboard b1, b2;
- for(i = 0; i < 64; i++) {
-
- for(m = 0; m <= 1; m++) {
- b1 = 0ULL;
- for(j = 0; j < 6; j++) if(i & (1<<j)) b1 |= (1ULL << ((j+1)*(1+m*7)));
- for(j = 0; j < 8; j++) {
- b2 = 0ULL;
- for(k = 0, s = 1; k < 2; k++, s *= -1) {
- for(l = j+s; l >= 0 && l <= 7; l += s) {
- b2 |= (m? RankBB[l] : FileBB[l]);
- if(b1 & (1ULL << (l*(1+m*7)))) break;
- }
- }
- if(m) FileAttacks[j][(b1*0xd6e8802041d0c441ULL) >> 58] = b2;
- else RankAttacks[j][i] = b2;
- }
- }
+ for (Square s = SQ_A1; s <= SQ_H8; s++)
+ {
+ BishopPseudoAttacks[s] = bishop_attacks_bb(s, EmptyBoardBB);
+ RookPseudoAttacks[s] = rook_attacks_bb(s, EmptyBoardBB);
+ QueenPseudoAttacks[s] = queen_attacks_bb(s, EmptyBoardBB);
}
}
-#endif // defined(USE_COMPACT_ROOK_ATTACKS)
}
projects / stockfish / blobdiff