#include <cstring>
#include <iostream>
+#include <algorithm>
#include "bitboard.h"
#include "bitcount.h"
Bitboard QueenPseudoAttacks[64];
uint8_t BitCount8Bit[256];
+int SquareDistance[64][64];
namespace {
void init_bitboards() {
+ for (Bitboard b = 0; b < 256; b++)
+ BitCount8Bit[b] = (uint8_t)count_1s<CNT32_MAX15>(b);
+
+ 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));
+
SquaresByColorBB[DARK] = 0xAA55AA55AA55AA55ULL;
SquaresByColorBB[LIGHT] = ~SquaresByColorBB[DARK];
AttackSpanMask[c][s] = in_front_bb(c, s) & neighboring_files_bb(s);
}
- for (Bitboard b = 0; b < 256; b++)
- BitCount8Bit[b] = (uint8_t)count_1s<CNT32_MAX15>(b);
-
for (int i = 0; i < 64; i++)
if (!CpuIs64Bit) // Matt Taylor's folding trick for 32 bit systems
{
int f = file_distance(s1, s2);
int r = rank_distance(s1, s2);
- Square d = (s2 - s1) / Max(f, r);
+ Square d = (s2 - s1) / std::max(f, r);
for (Square s3 = s1 + d; s3 != s2; s3 += d)
set_bit(&BetweenBB[s1][s2], s3);
} while (b);
offset += maxKey;
- booster = MagicBoosters[CpuIs64Bit][square_rank(s)];
+ booster = MagicBoosters[CpuIs64Bit][rank_of(s)];
// Then find a possible magic and the corresponding attacks
do {