detach(); // Always detach() in copy c'tor to avoid surprises
threadID = th;
nodes = 0;
+
+ assert(is_ok());
}
Position::Position(const string& fen, bool isChess960, int th) {
st->value = compute_value();
st->npMaterial[WHITE] = compute_non_pawn_material(WHITE);
st->npMaterial[BLACK] = compute_non_pawn_material(BLACK);
+
+ assert(is_ok());
}
bool Position::pl_move_is_legal(Move m, Bitboard pinned) const {
- assert(is_ok());
assert(move_is_ok(m));
assert(pinned == pinned_pieces());
bool Position::move_is_pl(const Move m) const {
- assert(is_ok());
-
Color us = sideToMove;
Color them = opposite_color(sideToMove);
Square from = move_from(m);
bool Position::move_gives_check(Move m, const CheckInfo& ci) const {
- assert(is_ok());
assert(move_is_ok(m));
assert(ci.dcCandidates == discovered_check_candidates());
assert(piece_color(piece_on(move_from(m))) == side_to_move());
// Our StateInfo newSt is about going out of scope so copy
// its content before it disappears.
detach();
+
+ assert(is_ok());
}
void Position::do_move(Move m, StateInfo& newSt, const CheckInfo& ci, bool moveIsCheck) {
- assert(is_ok());
assert(move_is_ok(m));
assert(&newSt != st);
void Position::undo_move(Move m) {
- assert(is_ok());
assert(move_is_ok(m));
sideToMove = opposite_color(sideToMove);
void Position::do_null_move(StateInfo& backupSt) {
- assert(is_ok());
assert(!in_check());
// Back up the information necessary to undo the null move to the supplied
st->rule50++;
st->pliesFromNull = 0;
st->value += (sideToMove == WHITE) ? TempoValue : -TempoValue;
+
+ assert(is_ok());
}
void Position::undo_null_move() {
- assert(is_ok());
assert(!in_check());
// Restore information from the our backup StateInfo object
sideToMove = opposite_color(sideToMove);
st->rule50--;
st->gamePly--;
+
+ assert(is_ok());
}
void Position::flip() {
- assert(is_ok());
-
// Make a copy of current position before to start changing
const Position pos(*this, threadID);