Bitboard RMasks[64];
Bitboard RMagics[64];
Bitboard* RAttacks[64];
-int RShifts[64];
+unsigned RShifts[64];
Bitboard BMasks[64];
Bitboard BMagics[64];
Bitboard* BAttacks[64];
-int BShifts[64];
+unsigned BShifts[64];
Bitboard SquareBB[64];
Bitboard FileBB[8];
typedef unsigned (Fn)(Square, Bitboard);
void init_magics(Bitboard table[], Bitboard* attacks[], Bitboard magics[],
- Bitboard masks[], int shifts[], Square deltas[], Fn get_index);
+ Bitboard masks[], unsigned shifts[], Square deltas[], Fn index);
}
{
std::cout << "+---+---+---+---+---+---+---+---+" << '\n';
for (File f = FILE_A; f <= FILE_H; f++)
- std::cout << "| " << (bit_is_set(b, make_square(f, r)) ? "X " : " ");
+ std::cout << "| " << ((b & make_square(f, r)) ? "X " : " ");
std::cout << "|\n";
}
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);
+ 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_magics(RTable, RAttacks, RMagics, RMasks, RShifts, RDeltas, r_index);
- init_magics(BTable, BAttacks, BMagics, BMasks, BShifts, BDeltas, b_index);
+ init_magics(RTable, RAttacks, RMagics, RMasks, RShifts, RDeltas, magic_index<ROOK>);
+ init_magics(BTable, BAttacks, BMagics, BMasks, BShifts, BDeltas, magic_index<BISHOP>);
for (Square s = SQ_A1; s <= SQ_H8; s++)
{
- PseudoAttacks[BISHOP][s] = bishop_attacks_bb(s, 0);
- PseudoAttacks[ROOK][s] = rook_attacks_bb(s, 0);
+ PseudoAttacks[BISHOP][s] = attacks_bb<BISHOP>(s, 0);
+ PseudoAttacks[ROOK][s] = attacks_bb<ROOK>(s, 0);
PseudoAttacks[QUEEN][s] = PseudoAttacks[BISHOP][s] | PseudoAttacks[ROOK][s];
}
for (Square s1 = SQ_A1; s1 <= SQ_H8; s1++)
for (Square s2 = SQ_A1; s2 <= SQ_H8; s2++)
- if (bit_is_set(PseudoAttacks[QUEEN][s1], s2))
+ if (PseudoAttacks[QUEEN][s1] & s2)
{
Square delta = (s2 - s1) / square_distance(s1, s2);
for (Square s = s1 + delta; s != s2; s += delta)
- set_bit(&BetweenBB[s1][s2], s);
+ BetweenBB[s1][s2] |= s;
}
}
square_is_ok(s) && square_distance(s, s - deltas[i]) == 1;
s += deltas[i])
{
- set_bit(&attack, s);
+ attack |= s;
- if (bit_is_set(occupied, s))
+ if (occupied & s)
break;
}
// use the so called "fancy" approach.
void init_magics(Bitboard table[], Bitboard* attacks[], Bitboard magics[],
- Bitboard masks[], int shifts[], Square deltas[], Fn get_index) {
+ Bitboard masks[], unsigned shifts[], Square deltas[], Fn index) {
int MagicBoosters[][8] = { { 3191, 2184, 1310, 3618, 2091, 1308, 2452, 3996 },
{ 1059, 3608, 605, 3234, 3326, 38, 2029, 3043 } };
// effect of verifying the magic.
for (i = 0; i < size; i++)
{
- Bitboard& attack = attacks[s][get_index(s, occupancy[i])];
+ Bitboard& attack = attacks[s][index(s, occupancy[i])];
if (attack && attack != reference[i])
break;