int game_ply() const;
bool is_chess960() const;
Thread* this_thread() const;
- int64_t nodes_searched() const;
- void set_nodes_searched(int64_t n);
+ uint64_t nodes_searched() const;
+ void set_nodes_searched(uint64_t n);
bool is_draw() const;
// Position consistency check, for debugging
// Helper functions
void do_castling(Square kfrom, Square kto, Square rfrom, Square rto);
- Bitboard hidden_checkers(Color c, Color kingColor) const;
+ Bitboard check_blockers(Color c, Color kingColor) const;
void put_piece(Square s, Color c, PieceType pt);
void remove_piece(Square s, Color c, PieceType pt);
void move_piece(Square from, Square to, Color c, PieceType pt);
Square castlingRookSquare[COLOR_NB][CASTLING_SIDE_NB];
Bitboard castlingPath[COLOR_NB][CASTLING_SIDE_NB];
StateInfo startState;
- int64_t nodes;
+ uint64_t nodes;
int gamePly;
Color sideToMove;
Thread* thisThread;
int chess960;
};
-inline int64_t Position::nodes_searched() const {
+inline uint64_t Position::nodes_searched() const {
return nodes;
}
-inline void Position::set_nodes_searched(int64_t n) {
+inline void Position::set_nodes_searched(uint64_t n) {
nodes = n;
}
}
inline Bitboard Position::discovered_check_candidates() const {
- return hidden_checkers(sideToMove, ~sideToMove);
+ return check_blockers(sideToMove, ~sideToMove);
}
inline Bitboard Position::pinned_pieces(Color c) const {
- return hidden_checkers(c, c);
+ return check_blockers(c, c);
}
inline bool Position::pawn_passed(Color c, Square s) const {