}
}
+
+/// Intel PEXT (parallel extraction) software implementation
+Bitboard pext(Bitboard b, Bitboard mask) {
+
+ Bitboard res = 0;
+
+ for (Bitboard bb = 1; mask; bb += bb)
+ {
+ if (b & mask & -mask)
+ res |= bb;
+
+ mask &= mask - 1;
+ }
+ return res;
+}
+
+
/// lsb()/msb() finds the least/most significant bit in a non-zero bitboard.
/// pop_lsb() finds and clears the least significant bit in a non-zero bitboard.
std::string s = "+---+---+---+---+---+---+---+---+\n";
- for (Rank rank = RANK_8; rank >= RANK_1; --rank)
+ for (Rank r = RANK_8; r >= RANK_1; --r)
{
- for (File file = FILE_A; file <= FILE_H; ++file)
- s.append(b & make_square(file, rank) ? "| X " : "| ");
+ for (File f = FILE_A; f <= FILE_H; ++f)
+ s.append(b & make_square(f, r) ? "| X " : "| ");
s.append("|\n+---+---+---+---+---+---+---+---+\n");
}
b = size = 0;
do {
occupancy[size] = b;
- reference[size++] = sliding_attack(deltas, s, b);
+ reference[size] = sliding_attack(deltas, s, b);
+
+ if (HasPext)
+ attacks[s][pext(occupancy[size], masks[s])] = reference[size];
+
+ size++;
b = (b - masks[s]) & masks[s];
} while (b);
if (s < SQ_H8)
attacks[s + 1] = attacks[s] + size;
+ if (HasPext)
+ continue;
+
booster = MagicBoosters[Is64Bit][rank_of(s)];
// Find a magic for square 's' picking up an (almost) random number