X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbitboard.h;h=945791249a212b6d3f327b5447c460d223981966;hp=09c005979b2bf4e58c836673759a4b82152bef44;hb=dfd030b67af4e651a73232ab15182fe669909ef1;hpb=22b9307aba0f78aa92abcf85e807af8b64011c7a diff --git a/src/bitboard.h b/src/bitboard.h index 09c00597..94579124 100644 --- a/src/bitboard.h +++ b/src/bitboard.h @@ -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-2010 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2012 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 @@ -23,30 +23,9 @@ #include "types.h" -const Bitboard EmptyBoardBB = 0; - -const Bitboard FileABB = 0x0101010101010101ULL; -const Bitboard FileBBB = FileABB << 1; -const Bitboard FileCBB = FileABB << 2; -const Bitboard FileDBB = FileABB << 3; -const Bitboard FileEBB = FileABB << 4; -const Bitboard FileFBB = FileABB << 5; -const Bitboard FileGBB = FileABB << 6; -const Bitboard FileHBB = FileABB << 7; - -const Bitboard Rank1BB = 0xFF; -const Bitboard Rank2BB = Rank1BB << (8 * 1); -const Bitboard Rank3BB = Rank1BB << (8 * 2); -const Bitboard Rank4BB = Rank1BB << (8 * 3); -const Bitboard Rank5BB = Rank1BB << (8 * 4); -const Bitboard Rank6BB = Rank1BB << (8 * 5); -const Bitboard Rank7BB = Rank1BB << (8 * 6); -const Bitboard Rank8BB = Rank1BB << (8 * 7); - -extern Bitboard SquaresByColorBB[2]; extern Bitboard FileBB[8]; -extern Bitboard NeighboringFilesBB[8]; -extern Bitboard ThisAndNeighboringFilesBB[8]; +extern Bitboard AdjacentFilesBB[8]; +extern Bitboard ThisAndAdjacentFilesBB[8]; extern Bitboard RankBB[8]; extern Bitboard InFrontBB[2][8]; @@ -70,9 +49,7 @@ extern int BShifts[64]; extern Bitboard BMasks[64]; extern Bitboard* BAttacks[64]; -extern Bitboard BishopPseudoAttacks[64]; -extern Bitboard RookPseudoAttacks[64]; -extern Bitboard QueenPseudoAttacks[64]; +extern Bitboard PseudoAttacks[6][64]; extern uint8_t BitCount8Bit[256]; @@ -125,27 +102,19 @@ inline Bitboard file_bb(Square s) { } -/// neighboring_files_bb takes a file or a square as input and returns a -/// bitboard representing all squares on the neighboring files. +/// adjacent_files_bb takes a file as input and returns a bitboard representing +/// all squares on the adjacent files. -inline Bitboard neighboring_files_bb(File f) { - return NeighboringFilesBB[f]; +inline Bitboard adjacent_files_bb(File f) { + return AdjacentFilesBB[f]; } -inline Bitboard neighboring_files_bb(Square s) { - return NeighboringFilesBB[file_of(s)]; -} - - -/// this_and_neighboring_files_bb takes a file or a square as input and returns -/// a bitboard representing all squares on the given and neighboring files. -inline Bitboard this_and_neighboring_files_bb(File f) { - return ThisAndNeighboringFilesBB[f]; -} +/// this_and_adjacent_files_bb takes a file as input and returns a bitboard +/// representing all squares on the given and adjacent files. -inline Bitboard this_and_neighboring_files_bb(Square s) { - return ThisAndNeighboringFilesBB[file_of(s)]; +inline Bitboard this_and_adjacent_files_bb(File f) { + return ThisAndAdjacentFilesBB[f]; } @@ -171,37 +140,34 @@ inline Bitboard in_front_bb(Color c, Square s) { #if defined(IS_64BIT) -FORCE_INLINE unsigned rook_index(Square s, Bitboard occ) { +FORCE_INLINE unsigned r_index(Square s, Bitboard occ) { return unsigned(((occ & RMasks[s]) * RMagics[s]) >> RShifts[s]); } -FORCE_INLINE unsigned bishop_index(Square s, Bitboard occ) { +FORCE_INLINE unsigned b_index(Square s, Bitboard occ) { return unsigned(((occ & BMasks[s]) * BMagics[s]) >> BShifts[s]); } #else // if !defined(IS_64BIT) -FORCE_INLINE unsigned rook_index(Square s, Bitboard occ) { +FORCE_INLINE unsigned r_index(Square s, Bitboard occ) { Bitboard b = occ & RMasks[s]; return unsigned(int(b) * int(RMagics[s]) ^ int(b >> 32) * int(RMagics[s] >> 32)) >> RShifts[s]; } -FORCE_INLINE unsigned bishop_index(Square s, Bitboard occ) { +FORCE_INLINE unsigned b_index(Square s, Bitboard occ) { Bitboard b = occ & BMasks[s]; return unsigned(int(b) * int(BMagics[s]) ^ int(b >> 32) * int(BMagics[s] >> 32)) >> BShifts[s]; } + #endif inline Bitboard rook_attacks_bb(Square s, Bitboard occ) { - return RAttacks[s][rook_index(s, occ)]; + return RAttacks[s][r_index(s, occ)]; } inline Bitboard bishop_attacks_bb(Square s, Bitboard occ) { - return BAttacks[s][bishop_index(s, occ)]; -} - -inline Bitboard queen_attacks_bb(Square s, Bitboard blockers) { - return rook_attacks_bb(s, blockers) | bishop_attacks_bb(s, blockers); + return BAttacks[s][b_index(s, occ)]; } @@ -228,7 +194,7 @@ inline Bitboard squares_in_front_of(Color c, Square s) { /// passed_pawn_mask takes a color and a square as input, and returns a /// bitboard mask which can be used to test if a pawn of the given color on /// the given square is a passed pawn. Definition of the table is: -/// PassedPawnMask[c][s] = in_front_bb(c, s) & this_and_neighboring_files_bb(s) +/// PassedPawnMask[c][s] = in_front_bb(c, s) & this_and_adjacent_files_bb(s) inline Bitboard passed_pawn_mask(Color c, Square s) { return PassedPawnMask[c][s]; @@ -238,7 +204,7 @@ inline Bitboard passed_pawn_mask(Color c, Square s) { /// attack_span_mask takes a color and a square as input, and returns a bitboard /// representing all squares that can be attacked by a pawn of the given color /// when it moves along its file starting from the given square. Definition is: -/// AttackSpanMask[c][s] = in_front_bb(c, s) & neighboring_files_bb(s); +/// AttackSpanMask[c][s] = in_front_bb(c, s) & adjacent_files_bb(s); inline Bitboard attack_span_mask(Color c, Square s) { return AttackSpanMask[c][s]; @@ -254,6 +220,15 @@ inline bool squares_aligned(Square s1, Square s2, Square s3) { } +/// same_color_squares() returns a bitboard representing all squares with +/// the same color of the given square. + +inline Bitboard same_color_squares(Square s) { + return bit_is_set(0xAA55AA55AA55AA55ULL, s) ? 0xAA55AA55AA55AA55ULL + : ~0xAA55AA55AA55AA55ULL; +} + + /// 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. @@ -291,6 +266,6 @@ extern Square pop_1st_bit(Bitboard* b); extern void print_bitboard(Bitboard b); -extern void init_bitboards(); +extern void bitboards_init(); #endif // !defined(BITBOARD_H_INCLUDED)