Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
- Copyright (C) 2015-2017 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
+ Copyright (C) 2015-2018 Marco Costalba, Joona Kiiski, Gary Linscott, 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
Bitboard checkSquares[PIECE_TYPE_NB];
};
-// In a std::deque references to elements are unaffected upon resizing
+/// A list to keep track of the position states along the setup moves (from the
+/// start position to the position just before the search starts). Needed by
+/// 'draw by repetition' detection. Use a std::deque because pointers to
+/// elements are not invalidated upon list resizing.
typedef std::unique_ptr<std::deque<StateInfo>> StateListPtr;
// Checking
Bitboard checkers() const;
- Bitboard discovered_check_candidates() const;
- Bitboard pinned_pieces(Color c) const;
+ Bitboard blockers_for_king(Color c) const;
Bitboard check_squares(PieceType pt) const;
// Attacks to/from a given square
void undo_null_move();
// Static Exchange Evaluation
- bool see_ge(Move m, Value value) const;
+ bool see_ge(Move m, Value threshold = VALUE_ZERO) const;
// Accessing hash keys
Key key() const;
// Other properties of the position
Color side_to_move() const;
- Phase game_phase() const;
int game_ply() const;
bool is_chess960() const;
Thread* this_thread() const;
- uint64_t nodes_searched() const;
bool is_draw(int ply) const;
int rule50_count() const;
Score psq_score() const;
Value non_pawn_material() const;
// Position consistency check, for debugging
- bool pos_is_ok(int* failedStep = nullptr) const;
+ bool pos_is_ok() const;
void flip();
private:
int castlingRightsMask[SQUARE_NB];
Square castlingRookSquare[CASTLING_RIGHT_NB];
Bitboard castlingPath[CASTLING_RIGHT_NB];
- uint64_t nodes;
int gamePly;
Color sideToMove;
Thread* thisThread;
return st->checkersBB;
}
-inline Bitboard Position::discovered_check_candidates() const {
- return st->blockersForKing[~sideToMove] & pieces(sideToMove);
-}
-
-inline Bitboard Position::pinned_pieces(Color c) const {
- return st->blockersForKing[c] & pieces(c);
+inline Bitboard Position::blockers_for_king(Color c) const {
+ return st->blockersForKing[c];
}
inline Bitboard Position::check_squares(PieceType pt) const {
return st->rule50;
}
-inline uint64_t Position::nodes_searched() const {
- return nodes;
-}
-
inline bool Position::opposite_bishops() const {
return pieceCount[W_BISHOP] == 1
&& pieceCount[B_BISHOP] == 1