X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbitboard.h;h=eec8342fb61b0e8ebe7443db0238022d1f5140fb;hp=6aa35874df7d3a244a8be9a919c81e09cc46105e;hb=17d41b386117f3b93daeb3a183f7a12e46812cdb;hpb=7f9ebf8e86e90ea1eb68388f1be12503a3f31e56 diff --git a/src/bitboard.h b/src/bitboard.h index 6aa35874..eec8342f 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-2012 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2013 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 @@ -33,36 +33,56 @@ void print(Bitboard b); namespace Bitbases { void init_kpk(); -uint32_t probe_kpk(Square wksq, Square wpsq, Square bksq, Color stm); +bool probe_kpk(Square wksq, Square wpsq, Square bksq, Color us); } -CACHE_LINE_ALIGNMENT +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 RMasks[64]; -extern Bitboard RMagics[64]; -extern Bitboard* RAttacks[64]; -extern unsigned RShifts[64]; - -extern Bitboard BMasks[64]; -extern Bitboard BMagics[64]; -extern Bitboard* BAttacks[64]; -extern unsigned BShifts[64]; - -extern Bitboard SquareBB[64]; -extern Bitboard FileBB[8]; -extern Bitboard RankBB[8]; -extern Bitboard AdjacentFilesBB[8]; -extern Bitboard ThisAndAdjacentFilesBB[8]; -extern Bitboard InFrontBB[2][8]; -extern Bitboard StepAttacksBB[16][64]; -extern Bitboard BetweenBB[64][64]; -extern Bitboard DistanceRingsBB[64][8]; -extern Bitboard ForwardBB[2][64]; -extern Bitboard PassedPawnMask[2][64]; -extern Bitboard AttackSpanMask[2][64]; -extern Bitboard PseudoAttacks[6][64]; +CACHE_LINE_ALIGNMENT +extern Bitboard RMasks[SQUARE_NB]; +extern Bitboard RMagics[SQUARE_NB]; +extern Bitboard* RAttacks[SQUARE_NB]; +extern unsigned RShifts[SQUARE_NB]; + +extern Bitboard BMasks[SQUARE_NB]; +extern Bitboard BMagics[SQUARE_NB]; +extern Bitboard* BAttacks[SQUARE_NB]; +extern unsigned BShifts[SQUARE_NB]; + +extern Bitboard SquareBB[SQUARE_NB]; +extern Bitboard FileBB[FILE_NB]; +extern Bitboard RankBB[RANK_NB]; +extern Bitboard AdjacentFilesBB[FILE_NB]; +extern Bitboard InFrontBB[COLOR_NB][RANK_NB]; +extern Bitboard StepAttacksBB[PIECE_NB][SQUARE_NB]; +extern Bitboard BetweenBB[SQUARE_NB][SQUARE_NB]; +extern Bitboard DistanceRingsBB[SQUARE_NB][8]; +extern Bitboard ForwardBB[COLOR_NB][SQUARE_NB]; +extern Bitboard PassedPawnMask[COLOR_NB][SQUARE_NB]; +extern Bitboard PawnAttackSpan[COLOR_NB][SQUARE_NB]; +extern Bitboard PseudoAttacks[PIECE_TYPE_NB][SQUARE_NB]; + +extern int SquareDistance[SQUARE_NB][SQUARE_NB]; + +const Bitboard BlackSquares = 0xAA55AA55AA55AA55ULL; /// Overloads of bitwise operators between a Bitboard and a Square for testing /// whether a given bit is set in a bitboard, and for setting and clearing bits. @@ -87,13 +107,34 @@ inline Bitboard operator^(Bitboard b, Square s) { return b ^ SquareBB[s]; } - -/// more_than_one() returns true if in 'b' there is more than one bit set - inline bool more_than_one(Bitboard b) { return b & (b - 1); } +inline int square_distance(Square s1, Square s2) { + return SquareDistance[s1][s2]; +} + +inline int file_distance(Square s1, Square s2) { + return abs(file_of(s1) - file_of(s2)); +} + +inline int rank_distance(Square s1, Square s2) { + return abs(rank_of(s1) - rank_of(s2)); +} + + +/// shift_bb() moves bitboard one step along direction Delta. Mainly for pawns. + +template +inline Bitboard shift_bb(Bitboard b) { + + return Delta == DELTA_N ? b << 8 : Delta == DELTA_S ? b >> 8 + : Delta == DELTA_NE ? (b & ~FileHBB) << 9 : Delta == DELTA_SE ? (b & ~FileHBB) >> 7 + : Delta == DELTA_NW ? (b & ~FileABB) << 7 : Delta == DELTA_SW ? (b & ~FileABB) >> 9 + : 0; +} + /// rank_bb() and file_bb() take a file or a square as input and return /// a bitboard representing all squares on the given file or rank. @@ -115,7 +156,7 @@ inline Bitboard file_bb(Square s) { } -/// adjacent_files_bb takes a file as input and returns a bitboard representing +/// adjacent_files_bb() takes a file as input and returns a bitboard representing /// all squares on the adjacent files. inline Bitboard adjacent_files_bb(File f) { @@ -123,30 +164,17 @@ inline Bitboard adjacent_files_bb(File 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_adjacent_files_bb(File f) { - return ThisAndAdjacentFilesBB[f]; -} - - -/// in_front_bb() takes a color and a rank or square as input, and returns a -/// bitboard representing all the squares on all ranks in front of the rank -/// (or square), from the given color's point of view. For instance, -/// in_front_bb(WHITE, RANK_5) will give all squares on ranks 6, 7 and 8, while -/// in_front_bb(BLACK, SQ_D3) will give all squares on ranks 1 and 2. +/// in_front_bb() takes a color and a rank as input, and returns a bitboard +/// representing all the squares on all ranks in front of the rank, from the +/// given color's point of view. For instance, in_front_bb(BLACK, RANK_3) will +/// give all squares on ranks 1 and 2. inline Bitboard in_front_bb(Color c, Rank r) { return InFrontBB[c][r]; } -inline Bitboard in_front_bb(Color c, Square s) { - return InFrontBB[c][rank_of(s)]; -} - -/// between_bb returns a bitboard representing all squares between two squares. +/// between_bb() returns a bitboard representing all squares between two squares. /// For instance, between_bb(SQ_C4, SQ_F7) returns a bitboard with the bits for /// square d5 and e6 set. If s1 and s2 are not on the same line, file or diagonal, /// 0 is returned. @@ -156,7 +184,7 @@ inline Bitboard between_bb(Square s1, Square s2) { } -/// forward_bb takes a color and a square as input, and returns a bitboard +/// forward_bb() takes a color and a square as input, and returns a bitboard /// representing all squares along the line in front of the square, from the /// point of view of the given color. Definition of the table is: /// ForwardBB[c][s] = in_front_bb(c, s) & file_bb(s) @@ -166,27 +194,27 @@ inline Bitboard forward_bb(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_adjacent_files_bb(s) +/// pawn_attack_span() 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: +/// PawnAttackSpan[c][s] = in_front_bb(c, s) & adjacent_files_bb(s); -inline Bitboard passed_pawn_mask(Color c, Square s) { - return PassedPawnMask[c][s]; +inline Bitboard pawn_attack_span(Color c, Square s) { + return PawnAttackSpan[c][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) & adjacent_files_bb(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] = pawn_attack_span(c, s) | forward_bb(c, s) -inline Bitboard attack_span_mask(Color c, Square s) { - return AttackSpanMask[c][s]; +inline Bitboard passed_pawn_mask(Color c, Square s) { + return PassedPawnMask[c][s]; } -/// squares_aligned returns true if the squares s1, s2 and s3 are aligned +/// squares_aligned() returns true if the squares s1, s2 and s3 are aligned /// either on a straight or on a diagonal line. inline bool squares_aligned(Square s1, Square s2, Square s3) { @@ -199,8 +227,7 @@ inline bool squares_aligned(Square s1, Square s2, Square s3) { /// the same color of the given square. inline Bitboard same_color_squares(Square s) { - return Bitboard(0xAA55AA55AA55AA55ULL) & s ? 0xAA55AA55AA55AA55ULL - : ~0xAA55AA55AA55AA55ULL; + return BlackSquares & s ? BlackSquares : ~BlackSquares; } @@ -280,7 +307,7 @@ FORCE_INLINE Square msb(Bitboard b) { FORCE_INLINE Square pop_lsb(Bitboard* b) { const Square s = lsb(*b); - *b &= ~(1ULL << s); + *b &= *b - 1; return s; }