explicit CheckInfo(const Position&);
Bitboard dcCandidates;
+ Bitboard pinned;
Bitboard checkSq[8];
- Square ksq;
};
/// Castle rights, encoded as bit fields
// The piece on a given square
Piece piece_on(Square s) const;
- PieceType type_of_piece_on(Square s) const;
- Color color_of_piece_on(Square s) const;
bool square_is_empty(Square s) const;
bool square_is_occupied(Square s) const;
- Value midgame_value_of_piece_on(Square s) const;
- Value endgame_value_of_piece_on(Square s) const;
// Side to move
Color side_to_move() const;
// Properties of moves
bool pl_move_is_legal(Move m, Bitboard pinned) const;
bool move_is_pl(const Move m) const;
- bool move_gives_check(Move m) const;
bool move_gives_check(Move m, const CheckInfo& ci) const;
bool move_is_capture(Move m) const;
+ bool move_is_capture_or_promotion(Move m) const;
bool move_is_passed_pawn_push(Move m) const;
bool move_attacks_square(Move m, Square s) const;
// Static exchange evaluation
int see(Move m) const;
int see_sign(Move m) const;
- static int see_value(PieceType pt);
// Accessing hash keys
Key get_key() const;
template<bool SkipRepetition> bool is_draw() const;
// Number of plies from starting position
- int startpos_ply_counter() const;
+ int full_moves() const;
// Other properties of the position
bool opposite_colored_bishops() const;
void put_piece(Piece p, Square s);
void set_castle_kingside(Color c);
void set_castle_queenside(Color c);
- bool set_castling_rights(char token);
+ void set_castling_rights(char token);
bool move_is_pl_slow(const Move m) const;
// Helper functions for doing and undoing moves
StateInfo startState;
File initialKFile, initialKRFile, initialQRFile;
bool chess960;
- int startPosPlyCounter;
+ int fullMoves;
int threadID;
int64_t nodes;
StateInfo* st;
static Key zobSideToMove;
static Score PieceSquareTable[16][64];
static Key zobExclusion;
- static const Value seeValues[8];
- static const Value PieceValueMidgame[17];
- static const Value PieceValueEndgame[17];
};
inline int64_t Position::nodes_searched() const {
return board[s];
}
-inline Color Position::color_of_piece_on(Square s) const {
- return color_of_piece(piece_on(s));
-}
-
-inline PieceType Position::type_of_piece_on(Square s) const {
- return type_of_piece(piece_on(s));
-}
-
inline bool Position::square_is_empty(Square s) const {
return piece_on(s) == PIECE_NONE;
}
return !square_is_empty(s);
}
-inline Value Position::midgame_value_of_piece_on(Square s) const {
- return PieceValueMidgame[piece_on(s)];
-}
-
-inline Value Position::endgame_value_of_piece_on(Square s) const {
- return PieceValueEndgame[piece_on(s)];
-}
-
inline Color Position::side_to_move() const {
return sideToMove;
}
return !(pieces(PAWN, opposite_color(c)) & attack_span_mask(c, s));
}
-inline int Position::see_value(PieceType pt) {
- return seeValues[pt];
-}
-
inline Key Position::get_key() const {
return st->key;
}
&& pawn_is_passed(c, move_to(m));
}
-inline int Position::startpos_ply_counter() const {
- return startPosPlyCounter;
+inline int Position::full_moves() const {
+ return fullMoves;
}
inline bool Position::opposite_colored_bishops() const {
return chess960;
}
+inline bool Position::move_is_capture_or_promotion(Move m) const {
+
+ assert(m != MOVE_NONE && m != MOVE_NULL);
+ return move_is_special(m) ? !move_is_castle(m) : !square_is_empty(move_to(m));
+}
+
inline bool Position::move_is_capture(Move m) const {
- assert (m != MOVE_NONE && m != MOVE_NULL);
- return !move_is_special(m) ? !square_is_empty(move_to(m)) : move_is_ep(m);
+ assert(m != MOVE_NONE && m != MOVE_NULL);
+
+ // Note that castle is coded as "king captures the rook"
+ return (!square_is_empty(move_to(m)) && !move_is_castle(m)) || move_is_ep(m);
}
inline PieceType Position::captured_piece_type() const {