X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbitboard.cpp;h=b1bf4d91e583b3f07f1ac53cb669dce2a4522eb0;hp=380c5985c1603ac50afc4a616673998f1e9ac83c;hb=3092f0c6460c831e666d54389710394c52a86ed9;hpb=990d83a72d430aef47151a1ff39e5f97ee14618a
diff --git a/src/bitboard.cpp b/src/bitboard.cpp
index 380c5985..b1bf4d91 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-2009 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
@@ -17,68 +17,94 @@
along with this program. If not, see .
*/
-
-////
-//// Includes
-////
-
#include
#include "bitboard.h"
#include "bitcount.h"
-#include "direction.h"
+// Global bitboards definitions with static storage duration are
+// automatically set to zero before enter main().
+Bitboard RAttacks[0x19000];
+Bitboard BAttacks[0x1480];
+
+Magics RMagics[64];
+Magics BMagics[64];
+
+Bitboard SetMaskBB[65];
+Bitboard ClearMaskBB[65];
+
+Bitboard SquaresByColorBB[2];
+Bitboard FileBB[8];
+Bitboard RankBB[8];
+Bitboard NeighboringFilesBB[8];
+Bitboard ThisAndNeighboringFilesBB[8];
+Bitboard InFrontBB[2][8];
+Bitboard StepAttacksBB[16][64];
+Bitboard BetweenBB[64][64];
+Bitboard SquaresInFrontMask[2][64];
+Bitboard PassedPawnMask[2][64];
+Bitboard AttackSpanMask[2][64];
+
+Bitboard BishopPseudoAttacks[64];
+Bitboard RookPseudoAttacks[64];
+Bitboard QueenPseudoAttacks[64];
+
+uint8_t BitCount8Bit[256];
+
+namespace {
#if defined(IS_64BIT)
+const uint64_t DeBruijnMagic = 0x218A392CD3D5DBFULL;
+
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,
+ 0x0440049104032280ULL, 0x1021023C82008040ULL, 0x0404040082000048ULL,
+ 0x48C4440084048090ULL, 0x2801104026490000ULL, 0x4100880442040800ULL,
+ 0x0181011002E06040ULL, 0x9101004104200E00ULL, 0x1240848848310401ULL,
+ 0x2000142828050024ULL, 0x00001004024D5000ULL, 0x0102044400800200ULL,
+ 0x8108108820112000ULL, 0xA880818210C00046ULL, 0x4008008801082000ULL,
+ 0x0060882404049400ULL, 0x0104402004240810ULL, 0x000A002084250200ULL,
+ 0x00100B0880801100ULL, 0x0004080201220101ULL, 0x0044008080A00000ULL,
+ 0x0000202200842000ULL, 0x5006004882D00808ULL, 0x0000200045080802ULL,
+ 0x0086100020200601ULL, 0xA802080A20112C02ULL, 0x0080411218080900ULL,
+ 0x000200A0880080A0ULL, 0x9A01010000104000ULL, 0x0028008003100080ULL,
+ 0x0211021004480417ULL, 0x0401004188220806ULL, 0x00825051400C2006ULL,
+ 0x00140C0210943000ULL, 0x0000242800300080ULL, 0x00C2208120080200ULL,
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
+ 0x0000822081014405ULL, 0x800C049E40400804ULL, 0x4A0404028A000820ULL,
+ 0x0022060201041200ULL, 0x0360904200840801ULL, 0x0881A08208800400ULL,
+ 0x0060202C00400420ULL, 0x1204440086061400ULL, 0x0008184042804040ULL,
+ 0x0064040315300400ULL, 0x0C01008801090A00ULL, 0x0808010401140C00ULL,
+ 0x04004830C2020040ULL, 0x0080005002020054ULL, 0x40000C14481A0490ULL,
+ 0x0010500101042048ULL, 0x1010100200424000ULL, 0x0000640901901040ULL,
+ 0x00000A0201014840ULL, 0x00840082AA011002ULL, 0x010010840084240AULL,
+ 0x0420400810420608ULL, 0x8D40230408102100ULL, 0x4A00200612222409ULL,
+ 0x0A08520292120600ULL
};
const uint64_t RMult[64] = {
- 0xa8002c000108020ULL, 0x4440200140003000ULL, 0x8080200010011880ULL,
- 0x380180080141000ULL, 0x1a00060008211044ULL, 0x410001000a0c0008ULL,
- 0x9500060004008100ULL, 0x100024284a20700ULL, 0x802140008000ULL,
- 0x80c01002a00840ULL, 0x402004282011020ULL, 0x9862000820420050ULL,
- 0x1001448011100ULL, 0x6432800200800400ULL, 0x40100010002000cULL,
- 0x2800d0010c080ULL, 0x90c0008000803042ULL, 0x4010004000200041ULL,
- 0x3010010200040ULL, 0xa40828028001000ULL, 0x123010008000430ULL,
- 0x24008004020080ULL, 0x60040001104802ULL, 0x582200028400d1ULL,
- 0x4000802080044000ULL, 0x408208200420308ULL, 0x610038080102000ULL,
- 0x3601000900100020ULL, 0x80080040180ULL, 0xc2020080040080ULL,
- 0x80084400100102ULL, 0x4022408200014401ULL, 0x40052040800082ULL,
- 0xb08200280804000ULL, 0x8a80a008801000ULL, 0x4000480080801000ULL,
- 0x911808800801401ULL, 0x822a003002001894ULL, 0x401068091400108aULL,
- 0x4a10a00004cULL, 0x2000800640008024ULL, 0x1486408102020020ULL,
- 0x100a000d50041ULL, 0x810050020b0020ULL, 0x204000800808004ULL,
- 0x20048100a000cULL, 0x112000831020004ULL, 0x9000040810002ULL,
- 0x440490200208200ULL, 0x8910401000200040ULL, 0x6404200050008480ULL,
- 0x4b824a2010010100ULL, 0x4080801810c0080ULL, 0x400802a0080ULL,
- 0x8224080110026400ULL, 0x40002c4104088200ULL, 0x1002100104a0282ULL,
- 0x1208400811048021ULL, 0x3201014a40d02001ULL, 0x5100019200501ULL,
- 0x101000208001005ULL, 0x2008450080702ULL, 0x1002080301d00cULL,
- 0x410201ce5c030092ULL
+ 0x0A8002C000108020ULL, 0x4440200140003000ULL, 0x8080200010011880ULL,
+ 0x0380180080141000ULL, 0x1A00060008211044ULL, 0x410001000A0C0008ULL,
+ 0x9500060004008100ULL, 0x0100024284A20700ULL, 0x0000802140008000ULL,
+ 0x0080C01002A00840ULL, 0x0402004282011020ULL, 0x9862000820420050ULL,
+ 0x0001001448011100ULL, 0x6432800200800400ULL, 0x040100010002000CULL,
+ 0x0002800D0010C080ULL, 0x90C0008000803042ULL, 0x4010004000200041ULL,
+ 0x0003010010200040ULL, 0x0A40828028001000ULL, 0x0123010008000430ULL,
+ 0x0024008004020080ULL, 0x0060040001104802ULL, 0x00582200028400D1ULL,
+ 0x4000802080044000ULL, 0x0408208200420308ULL, 0x0610038080102000ULL,
+ 0x3601000900100020ULL, 0x0000080080040180ULL, 0x00C2020080040080ULL,
+ 0x0080084400100102ULL, 0x4022408200014401ULL, 0x0040052040800082ULL,
+ 0x0B08200280804000ULL, 0x008A80A008801000ULL, 0x4000480080801000ULL,
+ 0x0911808800801401ULL, 0x822A003002001894ULL, 0x401068091400108AULL,
+ 0x000004A10A00004CULL, 0x2000800640008024ULL, 0x1486408102020020ULL,
+ 0x000100A000D50041ULL, 0x00810050020B0020ULL, 0x0204000800808004ULL,
+ 0x00020048100A000CULL, 0x0112000831020004ULL, 0x0009000040810002ULL,
+ 0x0440490200208200ULL, 0x8910401000200040ULL, 0x6404200050008480ULL,
+ 0x4B824A2010010100ULL, 0x04080801810C0080ULL, 0x00000400802A0080ULL,
+ 0x8224080110026400ULL, 0x40002C4104088200ULL, 0x01002100104A0282ULL,
+ 0x1208400811048021ULL, 0x3201014A40D02001ULL, 0x0005100019200501ULL,
+ 0x0101000208001005ULL, 0x0002008450080702ULL, 0x001002080301D00CULL,
+ 0x410201CE5C030092ULL
};
const int BShift[64] = {
@@ -97,54 +123,56 @@ const int RShift[64] = {
#else // if !defined(IS_64BIT)
+const uint32_t DeBruijnMagic = 0x783A9B23;
+
const uint64_t BMult[64] = {
- 0x54142844c6a22981ULL, 0x710358a6ea25c19eULL, 0x704f746d63a4a8dcULL,
- 0xbfed1a0b80f838c5ULL, 0x90561d5631e62110ULL, 0x2804260376e60944ULL,
- 0x84a656409aa76871ULL, 0xf0267f64c28b6197ULL, 0x70764ebb762f0585ULL,
- 0x92aa09e0cfe161deULL, 0x41ee1f6bb266f60eULL, 0xddcbf04f6039c444ULL,
- 0x5a3fab7bac0d988aULL, 0xd3727877fa4eaa03ULL, 0xd988402d868ddaaeULL,
- 0x812b291afa075c7cULL, 0x94faf987b685a932ULL, 0x3ed867d8470d08dbULL,
- 0x92517660b8901de8ULL, 0x2d97e43e058814b4ULL, 0x880a10c220b25582ULL,
- 0xc7c6520d1f1a0477ULL, 0xdbfc7fbcd7656aa6ULL, 0x78b1b9bfb1a2b84fULL,
- 0x2f20037f112a0bc1ULL, 0x657171ea2269a916ULL, 0xc08302b07142210eULL,
- 0x880a4403064080bULL, 0x3602420842208c00ULL, 0x852800dc7e0b6602ULL,
- 0x595a3fbbaa0f03b2ULL, 0x9f01411558159d5eULL, 0x2b4a4a5f88b394f2ULL,
- 0x4afcbffc292dd03aULL, 0x4a4094a3b3f10522ULL, 0xb06f00b491f30048ULL,
- 0xd5b3820280d77004ULL, 0x8b2e01e7c8e57a75ULL, 0x2d342794e886c2e6ULL,
- 0xc302c410cde21461ULL, 0x111f426f1379c274ULL, 0xe0569220abb31588ULL,
- 0x5026d3064d453324ULL, 0xe2076040c343cd8aULL, 0x93efd1e1738021eeULL,
- 0xb680804bed143132ULL, 0x44e361b21986944cULL, 0x44c60170ef5c598cULL,
- 0xf4da475c195c9c94ULL, 0xa3afbb5f72060b1dULL, 0xbc75f410e41c4ffcULL,
- 0xb51c099390520922ULL, 0x902c011f8f8ec368ULL, 0x950b56b3d6f5490aULL,
- 0x3909e0635bf202d0ULL, 0x5744f90206ec10ccULL, 0xdc59fd76317abbc1ULL,
- 0x881c7c67fcbfc4f6ULL, 0x47ca41e7e440d423ULL, 0xeb0c88112048d004ULL,
- 0x51c60e04359aef1aULL, 0x1aa1fe0e957a5554ULL, 0xdd9448db4f5e3104ULL,
- 0xdc01f6dca4bebbdcULL,
+ 0x54142844C6A22981ULL, 0x710358A6EA25C19EULL, 0x704F746D63A4A8DCULL,
+ 0xBFED1A0B80F838C5ULL, 0x90561D5631E62110ULL, 0x2804260376E60944ULL,
+ 0x84A656409AA76871ULL, 0xF0267F64C28B6197ULL, 0x70764EBB762F0585ULL,
+ 0x92AA09E0CFE161DEULL, 0x41EE1F6BB266F60EULL, 0xDDCBF04F6039C444ULL,
+ 0x5A3FAB7BAC0D988AULL, 0xD3727877FA4EAA03ULL, 0xD988402D868DDAAEULL,
+ 0x812B291AFA075C7CULL, 0x94FAF987B685A932ULL, 0x3ED867D8470D08DBULL,
+ 0x92517660B8901DE8ULL, 0x2D97E43E058814B4ULL, 0x880A10C220B25582ULL,
+ 0xC7C6520D1F1A0477ULL, 0xDBFC7FBCD7656AA6ULL, 0x78B1B9BFB1A2B84FULL,
+ 0x2F20037F112A0BC1ULL, 0x657171EA2269A916ULL, 0xC08302B07142210EULL,
+ 0x0880A4403064080BULL, 0x3602420842208C00ULL, 0x852800DC7E0B6602ULL,
+ 0x595A3FBBAA0F03B2ULL, 0x9F01411558159D5EULL, 0x2B4A4A5F88B394F2ULL,
+ 0x4AFCBFFC292DD03AULL, 0x4A4094A3B3F10522ULL, 0xB06F00B491F30048ULL,
+ 0xD5B3820280D77004ULL, 0x8B2E01E7C8E57A75ULL, 0x2D342794E886C2E6ULL,
+ 0xC302C410CDE21461ULL, 0x111F426F1379C274ULL, 0xE0569220ABB31588ULL,
+ 0x5026D3064D453324ULL, 0xE2076040C343CD8AULL, 0x93EFD1E1738021EEULL,
+ 0xB680804BED143132ULL, 0x44E361B21986944CULL, 0x44C60170EF5C598CULL,
+ 0xF4DA475C195C9C94ULL, 0xA3AFBB5F72060B1DULL, 0xBC75F410E41C4FFCULL,
+ 0xB51C099390520922ULL, 0x902C011F8F8EC368ULL, 0x950B56B3D6F5490AULL,
+ 0x3909E0635BF202D0ULL, 0x5744F90206EC10CCULL, 0xDC59FD76317ABBC1ULL,
+ 0x881C7C67FCBFC4F6ULL, 0x47CA41E7E440D423ULL, 0xEB0C88112048D004ULL,
+ 0x51C60E04359AEF1AULL, 0x1AA1FE0E957A5554ULL, 0xDD9448DB4F5E3104ULL,
+ 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,
+ 0xD7445CDEC88002C0ULL, 0xD0A505C1F2001722ULL, 0xE065D1C896002182ULL,
+ 0x9A8C41E75A000892ULL, 0x8900B10C89002AA8ULL, 0x9B28D1C1D60005A2ULL,
+ 0x015D6C88DE002D9AULL, 0xB1DBFC802E8016A9ULL, 0x149A1042D9D60029ULL,
+ 0xB9C08050599E002FULL, 0x132208C3AF300403ULL, 0xC1000CE2E9C50070ULL,
+ 0x9D9AA13C99020012ULL, 0xB6B078DAF71E0046ULL, 0x9D880182FB6E002EULL,
+ 0x52889F467E850037ULL, 0xDA6DC008D19A8480ULL, 0x468286034F902420ULL,
+ 0x7140AC09DC54C020ULL, 0xD76FFFFA39548808ULL, 0xEA901C4141500808ULL,
+ 0xC91004093F953A02ULL, 0x02882AFA8F6BB402ULL, 0xAEBE335692442C01ULL,
+ 0x0E904A22079FB91EULL, 0x13A514851055F606ULL, 0x76C782018C8FE632ULL,
+ 0x1DC012A9D116DA06ULL, 0x3C9E0037264FFFA6ULL, 0x2036002853C6E4A2ULL,
+ 0xE3FE08500AFB47D4ULL, 0xF38AF25C86B025C2ULL, 0xC0800E2182CF9A40ULL,
+ 0x72002480D1F60673ULL, 0x2500200BAE6E9B53ULL, 0xC60018C1EEFCA252ULL,
+ 0x0600590473E3608AULL, 0x46002C4AB3FE51B2ULL, 0xA200011486BCC8D2ULL,
+ 0xB680078095784C63ULL, 0x2742002639BF11AEULL, 0xC7D60021A5BDB142ULL,
+ 0xC8C04016BB83D820ULL, 0xBD520028123B4842ULL, 0x9D1600344AC2A832ULL,
+ 0x6A808005631C8A05ULL, 0x604600A148D5389AULL, 0xE2E40103D40DEA65ULL,
+ 0x945B5A0087C62A81ULL, 0x012DC200CD82D28EULL, 0x2431C600B5F9EF76ULL,
+ 0xFB142A006A9B314AULL, 0x06870E00A1C97D62ULL, 0x2A9DB2004A2689A2ULL,
+ 0xD3594600CAF5D1A2ULL, 0xEE0E4900439344A7ULL, 0x89C4D266CA25007AULL,
+ 0x3E0013A2743F97E3ULL, 0x0180E31A0431378AULL, 0x3A9E465A4D42A512ULL,
+ 0x98D0A11A0C0D9CC2ULL, 0x8E711C1ABA19B01EULL, 0x8DCDC836DD201142ULL,
+ 0x5AC08A4735370479ULL,
};
const int BShift[64] = {
@@ -163,131 +191,27 @@ const int RShift[64] = {
#endif // defined(IS_64BIT)
-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 }
-};
+ CACHE_LINE_ALIGNMENT int BSFTable[64];
-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
- }
-};
-
-Bitboard RMask[64];
-int RAttackIndex[64];
-Bitboard RAttacks[0x19000];
-
-Bitboard BMask[64];
-int BAttackIndex[64];
-Bitboard BAttacks[0x1480];
-
-Bitboard SetMaskBB[65];
-Bitboard ClearMaskBB[65];
-
-Bitboard StepAttackBB[16][64];
-Bitboard RayBB[64][8];
-Bitboard BetweenBB[64][64];
-
-Bitboard PassedPawnMask[2][64];
-Bitboard OutpostMask[2][64];
-
-Bitboard BishopPseudoAttacks[64];
-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();
- 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();
+ void init_sliding_attacks(Bitboard attacks[], Magics m[], const int shift[],
+ const Bitboard mult[], Square deltas[]);
}
-////
-//// Functions
-////
-
/// print_bitboard() prints a bitboard in an easily readable format to the
-/// standard output. This is sometimes useful for debugging.
+/// 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;
- }
- std::cout << "+---+---+---+---+---+---+---+---+" << std::endl;
-}
+ for (Rank r = RANK_8; r >= RANK_1; r--)
+ {
+ std::cout << "+---+---+---+---+---+---+---+---+" << '\n';
+ for (File f = FILE_A; f <= FILE_H; f++)
+ std::cout << "| " << (bit_is_set(b, make_square(f, r)) ? 'X' : ' ') << ' ';
-/// init_bitboards() initializes various bitboard arrays. It is called during
-/// 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();
- init_sliding_attacks(RAttacks, RAttackIndex, RMask, RShift, RMult, rookDeltas);
- init_sliding_attacks(BAttacks, BAttackIndex, BMask, BShift, BMult, bishopDeltas);
- init_pseudo_attacks();
+ std::cout << "|\n";
+ }
+ std::cout << "+---+---+---+---+---+---+---+---+" << std::endl;
}
@@ -297,38 +221,22 @@ void init_bitboards() {
#if defined(IS_64BIT) && !defined(USE_BSFQ)
-CACHE_LINE_ALIGNMENT
-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
-};
-
Square first_1(Bitboard b) {
- return Square(BitTable[((b & -b) * 0x218a392cd3d5dbfULL) >> 58]);
+ return Square(BSFTable[((b & -b) * DeBruijnMagic) >> 58]);
}
Square pop_1st_bit(Bitboard* b) {
Bitboard bb = *b;
*b &= (*b - 1);
- return Square(BitTable[((bb & -bb) * 0x218a392cd3d5dbfULL) >> 58]);
+ return Square(BSFTable[((bb & -bb) * DeBruijnMagic) >> 58]);
}
#elif !defined(USE_BSFQ)
-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
-};
-
Square first_1(Bitboard b) {
b ^= (b - 1);
- uint32_t fold = int(b) ^ int(b >> 32);
- return Square(BitTable[(fold * 0x783a9b23) >> 26]);
+ uint32_t fold = unsigned(b) ^ unsigned(b >> 32);
+ return Square(BSFTable[(fold * DeBruijnMagic) >> 26]);
}
// Use type-punning
@@ -355,201 +263,185 @@ Square pop_1st_bit(Bitboard* bb) {
if (u.dw.l)
{
- ret = Square(BitTable[((u.dw.l ^ (u.dw.l - 1)) * 0x783a9b23) >> 26]);
+ ret = Square(BSFTable[((u.dw.l ^ (u.dw.l - 1)) * DeBruijnMagic) >> 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]);
+ ret = Square(BSFTable[((~(u.dw.h ^ (u.dw.h - 1))) * DeBruijnMagic) >> 26]);
u.dw.h &= (u.dw.h - 1);
*bb = u.b;
return ret;
}
-#endif
-
-// 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
-};
+#endif // !defined(USE_BSFQ)
-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];
-}
+/// init_bitboards() initializes various bitboard arrays. It is called during
+/// program initialization.
-namespace {
+void init_bitboards() {
- // All functions below are used to precompute various bitboards during
- // program initialization. Some of the functions may be difficult to
- // understand, but they all seem to work correctly, and it should never
- // be necessary to touch any of them.
+ SquaresByColorBB[DARK] = 0xAA55AA55AA55AA55ULL;
+ SquaresByColorBB[LIGHT] = ~SquaresByColorBB[DARK];
- void init_masks() {
- SetMaskBB[SQ_NONE] = 0ULL;
- ClearMaskBB[SQ_NONE] = ~SetMaskBB[SQ_NONE];
- for(Square s = SQ_A1; s <= SQ_H8; s++) {
+ 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 (Bitboard b = 0ULL; b < 256ULL; b++)
- BitCount8Bit[b] = (uint8_t)count_1s(b);
}
+ ClearMaskBB[SQ_NONE] = ~EmptyBoardBB;
- 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)));
- }
- }
- }
+ FileBB[FILE_A] = FileABB;
+ RankBB[RANK_1] = Rank1BB;
+ for (int f = FILE_B; f <= FILE_H; f++)
+ {
+ FileBB[f] = FileBB[f - 1] << 1;
+ RankBB[f] = RankBB[f - 1] << 8;
+ }
- void init_attacks() {
- int i, j, k, l;
- 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},
- {-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}
- };
-
- 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 f = FILE_A; f <= FILE_H; f++)
+ {
+ NeighboringFilesBB[f] = (f > FILE_A ? FileBB[f - 1] : 0) | (f < FILE_H ? FileBB[f + 1] : 0);
+ ThisAndNeighboringFilesBB[f] = FileBB[f] | NeighboringFilesBB[f];
}
+ for (int rw = RANK_7, rb = RANK_2; rw >= RANK_1; rw--, rb++)
+ {
+ InFrontBB[WHITE][rw] = InFrontBB[WHITE][rw + 1] | RankBB[rw + 1];
+ InFrontBB[BLACK][rb] = InFrontBB[BLACK][rb - 1] | RankBB[rb - 1];
+ }
- 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;
+ for (Color c = WHITE; c <= BLACK; c++)
+ for (Square s = SQ_A1; s <= SQ_H8; s++)
+ {
+ SquaresInFrontMask[c][s] = in_front_bb(c, s) & file_bb(s);
+ PassedPawnMask[c][s] = in_front_bb(c, s) & this_and_neighboring_files_bb(s);
+ AttackSpanMask[c][s] = in_front_bb(c, s) & neighboring_files_bb(s);
}
- }
- return result;
- }
+ for (Bitboard b = 0; b < 256; b++)
+ BitCount8Bit[b] = (uint8_t)count_1s(b);
- 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);
+ for (int i = 1; i < 64; i++)
+ if (!CpuIs64Bit) // Matt Taylor's folding trick for 32 bit systems
+ {
+ Bitboard b = 1ULL << i;
+ b ^= b - 1;
+ b ^= b >> 32;
+ BSFTable[uint32_t(b * DeBruijnMagic) >> 26] = i;
}
+ else
+ BSFTable[((1ULL << i) * DeBruijnMagic) >> 58] = i;
+
+ int steps[][9] = {
+ {0}, {7,9,0}, {17,15,10,6,-6,-10,-15,-17,0}, {0}, {0}, {0}, {9,7,-7,-9,8,1,-1,-8,0}
+ };
+
+ for (Color c = WHITE; c <= BLACK; c++)
+ for (Square s = SQ_A1; s <= SQ_H8; s++)
+ for (PieceType pt = PAWN; pt <= KING; pt++)
+ for (int k = 0; steps[pt][k]; k++)
+ {
+ Square to = s + Square(c == WHITE ? steps[pt][k] : -steps[pt][k]);
+
+ if (square_is_ok(to) && square_distance(s, to) < 3)
+ set_bit(&StepAttacksBB[make_piece(c, pt)][s], to);
+ }
+
+ Square RDeltas[] = { DELTA_N, DELTA_E, DELTA_S, DELTA_W };
+ Square BDeltas[] = { DELTA_NE, DELTA_SE, DELTA_SW, DELTA_NW };
+
+ init_sliding_attacks(RAttacks, RMagics, RShift, RMult, RDeltas);
+ init_sliding_attacks(BAttacks, BMagics, BShift, BMult, BDeltas);
+
+ 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);
}
+ for (Square s1 = SQ_A1; s1 <= SQ_H8; s1++)
+ for (Square s2 = SQ_A1; s2 <= SQ_H8; s2++)
+ if (bit_is_set(QueenPseudoAttacks[s1], s2))
+ {
+ int f = file_distance(s1, s2);
+ int r = rank_distance(s1, s2);
- 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);
- }
- return result;
+ Square d = (s2 - s1) / Max(f, r);
+
+ for (Square s3 = s1 + d; s3 != s2; s3 += d)
+ set_bit(&BetweenBB[s1][s2], s3);
+ }
+}
+
+
+namespace {
+
+ Bitboard submask(Bitboard mask, int key) {
+
+ Bitboard subMask = 0;
+ int bitNum = -1;
+
+ // Extract an unique submask out of a mask according to the given key
+ for (Square s = SQ_A1; s <= SQ_H8; s++)
+ if (bit_is_set(mask, s) && bit_is_set(key, Square(++bitNum)))
+ set_bit(&subMask, s);
+
+ return subMask;
}
+ Bitboard sliding_attacks(Square sq, Bitboard occupied, Square deltas[], bool skipLast) {
- 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);
+ Bitboard attacks = 0;
-#if defined(IS_64BIT)
- j = (1 << (64 - shift[i]));
-#else
- j = (1 << (32 - shift[i]));
-#endif
+ for (int i = 0; i < 4; i++)
+ {
+ Square s = sq + deltas[i];
- for(k = 0; k < j; k++) {
+ while ( square_is_ok(s)
+ && square_distance(s, s - deltas[i]) == 1
+ && (!skipLast || !file_distance(s, sq) || (square_file(s) != FILE_A && square_file(s) != FILE_H))
+ && (!skipLast || !rank_distance(s, sq) || (square_rank(s) != RANK_1 && square_rank(s) != RANK_8)))
+ {
+ attacks |= 1ULL << s;
-#if defined(IS_64BIT)
- b = index_to_bitboard(k, mask[i]);
- attacks[index + ((b * mult[i]) >> shift[i])] =
- sliding_attacks(i, b, 4, deltas);
-#else
- 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);
-#endif
- }
- index += j;
+ if (occupied & (1ULL << s))
+ break;
+
+ s += deltas[i];
+ }
}
+ return attacks;
}
+ void init_sliding_attacks(Bitboard attacks[], Magics m[], const int shift[],
+ const Bitboard mult[], Square deltas[]) {
+ Bitboard occupancy, index;
+ int maxKey, offset = 0;
- 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);
+ for (Square s = SQ_A1; s <= SQ_H8; s++)
+ {
+ m[s].offset = offset;
+ m[s].mult = mult[s];
+ m[s].shift = shift[s];
+ m[s].mask = sliding_attacks(s, EmptyBoardBB, deltas, true);
+
+ maxKey = 1 << (CpuIs64Bit ? 64 - shift[s] : 32 - shift[s]);
+
+ for (int key = 0; key < maxKey; key++)
+ {
+ occupancy = submask(m[s].mask, key);
+
+ index = CpuIs64Bit ? occupancy * mult[s]
+ : unsigned(occupancy * mult[s] ^ (occupancy >> 32) * (mult[s] >> 32));
+
+ attacks[offset + (index >> shift[s])] = sliding_attacks(s, occupancy, deltas, false);
+ }
+ offset += maxKey;
}
}
-
}