/// when traversing the search tree.
class Position {
+
+ friend std::ostream& operator<<(std::ostream&, const Position&);
+
public:
Position() {}
Position(const Position& pos, Thread* t) { *this = pos; thisThread = t; }
Position& operator=(const Position&);
static void init();
- // Text input/output
+ // FEN string input/output
void set(const std::string& fenStr, bool isChess960, Thread* th);
const std::string fen() const;
- const std::string pretty() const;
// Position representation
Bitboard pieces() const;
// Accessing hash keys
Key key() const;
+ Key key_after(Move m) const;
Key exclusion_key() const;
Key pawn_key() const;
Key material_key() const;
uint64_t nodes_searched() const;
void set_nodes_searched(uint64_t n);
bool is_draw() const;
+ int rule50_count() const;
// Position consistency check, for debugging
bool pos_is_ok(int* step = NULL) const;
return gamePly;
}
+inline int Position::rule50_count() const {
+ return st->rule50;
+}
+
inline bool Position::opposite_bishops() const {
return pieceCount[WHITE][BISHOP] == 1
byColorBB[c] |= s;
index[s] = pieceCount[c][pt]++;
pieceList[c][pt][index[s]] = s;
+ pieceCount[c][ALL_PIECES]++;
}
inline void Position::move_piece(Square from, Square to, Color c, PieceType pt) {
index[lastSquare] = index[s];
pieceList[c][pt][index[lastSquare]] = lastSquare;
pieceList[c][pt][pieceCount[c][pt]] = SQ_NONE;
+ pieceCount[c][ALL_PIECES]--;
}
#endif // #ifndef POSITION_H_INCLUDED