#include "bitboard.h"
#include "color.h"
-#include "direction.h"
#include "move.h"
#include "piece.h"
#include "square.h"
//// Types
////
+class Position;
+
/// struct checkInfo is initialized at c'tor time and keeps
/// info used to detect if a move gives check.
// Constructors
Position(const Position& pos, int threadID);
- Position(const std::string& fen, int threadID);
+ Position(const std::string& fen, bool isChess960, int threadID);
// Text input/output
- void from_fen(const std::string& fen);
+ void from_fen(const std::string& fen, bool isChess960);
const std::string to_fen() const;
void print(Move m = MOVE_NONE) const;
// 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;
bool square_is_weak(Square s, Color c) const;
// Doing and undoing moves
- void detach();
+ void do_setup_move(Move m);
void do_move(Move m, StateInfo& st);
void do_move(Move m, StateInfo& st, const CheckInfo& ci, bool moveIsCheck);
void undo_move(Move m);
// Check if side to move could be mated in one
bool has_mate_threat();
- // Number of plies since the last non-reversible move
- int rule_50_counter() const;
-
+ // Number of plies from starting position
int startpos_ply_counter() const;
// Other properties of the position
// 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);
// Initialization helper functions (used while setting up a position)
void clear();
+ void detach();
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
static Score PieceSquareTable[16][64];
static Key zobExclusion;
static const Value seeValues[8];
+ static const Value PieceValueMidgame[17];
+ static const Value PieceValueEndgame[17];
};
}
inline Bitboard Position::empty_squares() const {
- return ~(occupied_squares());
+ return ~occupied_squares();
}
inline Bitboard Position::pieces_of_color(Color c) const {
template<>
inline Bitboard Position::attacks_from<PAWN>(Square s, Color c) const {
- return StepAttackBB[piece_of_color_and_type(c, PAWN)][s];
+ return NonSlidingAttacksBB[piece_of_color_and_type(c, PAWN)][s];
}
template<PieceType Piece> // Knight and King and white pawns
inline Bitboard Position::attacks_from(Square s) const {
- return StepAttackBB[Piece][s];
+ return NonSlidingAttacksBB[Piece][s];
}
template<>
&& pawn_is_passed(c, move_to(m));
}
-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;
}
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)