#if !defined(POSITION_H_INCLUDED)
#define POSITION_H_INCLUDED
-// Disable some silly and noisy warning from MSVC compiler
-#if defined(_MSC_VER)
-
-// Forcing value to bool 'true' or 'false' (performance warning)
-#pragma warning(disable: 4800)
-
-// Conditional expression is constant
-#pragma warning(disable: 4127)
-
-
-#endif
-
////
//// Includes
////
//// Constants
////
-/// FEN string for the initial position
-const std::string StartPositionFEN = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";
-
/// Maximum number of plies per game (220 should be enough, because the
/// maximum search depth is 100, and during position setup we reset the
/// move counter for every non-reversible move).
};
// Constructors
- explicit Position(int threadID);
Position(const Position& pos, int threadID);
Position(const std::string& fen, int threadID);
// Information about attacks to or from a given square
Bitboard attackers_to(Square s) const;
Bitboard attacks_from(Piece p, Square s) const;
+ static Bitboard attacks_from(Piece p, Square s, Bitboard occ);
template<PieceType> Bitboard attacks_from(Square s) const;
template<PieceType> Bitboard attacks_from(Square s, Color c) const;
// Static exchange evaluation
int see(Square from, Square to) const;
int see(Move m) const;
- int see(Square to) const;
int see_sign(Move m) const;
// Accessing hash keys
// Other properties of the position
bool opposite_colored_bishops() const;
bool has_pawn_on_7th(Color c) const;
+ bool is_chess960() const;
// Current thread ID searching on the position
int thread() const;
// Reset the gamePly variable to 0
void reset_game_ply();
-
void inc_startpos_ply_counter();
+ int64_t nodes_searched() const;
+ void set_nodes_searched(int64_t n);
// Position consistency check, for debugging
bool is_ok(int* failedStep = NULL) const;
// Initialization helper functions (used while setting up a position)
void clear();
void put_piece(Piece p, Square s);
- void allow_oo(Color c);
- void allow_ooo(Color c);
+ void do_allow_oo(Color c);
+ void do_allow_ooo(Color c);
bool set_castling_rights(char token);
// Helper functions for doing and undoing moves
int castleRightsMask[64];
StateInfo startState;
File initialKFile, initialKRFile, initialQRFile;
+ bool isChess960;
int startPosPlyCounter;
int threadID;
+ int64_t nodes;
StateInfo* st;
// Static variables
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 functions
////
+inline int64_t Position::nodes_searched() const {
+ return nodes;
+}
+
+inline void Position::set_nodes_searched(int64_t n) {
+ nodes = n;
+}
+
inline Piece Position::piece_on(Square s) const {
return board[s];
}
}
inline Bitboard Position::empty_squares() const {
- return ~(occupied_squares());
+ return ~occupied_squares();
}
inline Bitboard Position::pieces_of_color(Color c) const {
}
inline int Position::rule_50_counter() const {
-
return st->rule50;
}
inline int Position::startpos_ply_counter() const {
-
return startPosPlyCounter;
}
}
inline bool Position::has_pawn_on_7th(Color c) const {
-
return pieces(PAWN, c) & relative_rank_bb(c, RANK_7);
}
+inline bool Position::is_chess960() const {
+ return isChess960;
+}
+
inline bool Position::move_is_capture(Move m) const {
// Move must not be MOVE_NONE !
return threadID;
}
+inline void Position::do_allow_oo(Color c) {
+ st->castleRights |= (1 + int(c));
+}
+
+inline void Position::do_allow_ooo(Color c) {
+ st->castleRights |= (4 + 4*int(c));
+}
+
#endif // !defined(POSITION_H_INCLUDED)