threadID = th;
nodes = 0;
- assert(is_ok());
+ assert(pos_is_ok());
}
Position::Position(const string& fen, bool isChess960, int th) {
st->npMaterial[WHITE] = compute_non_pawn_material(WHITE);
st->npMaterial[BLACK] = compute_non_pawn_material(BLACK);
- assert(is_ok());
+ assert(pos_is_ok());
}
sideToMove = flip(sideToMove);
st->value += (sideToMove == WHITE ? TempoValue : -TempoValue);
- assert(is_ok());
+ assert(pos_is_ok());
}
sideToMove = flip(sideToMove);
st->value += (sideToMove == WHITE ? TempoValue : -TempoValue);
- assert(is_ok());
+ assert(pos_is_ok());
}
// Finally point our state pointer back to the previous state
st = st->previous;
- assert(is_ok());
+ assert(pos_is_ok());
}
// Finally point our state pointer back to the previous state
st = st->previous;
- assert(is_ok());
+ assert(pos_is_ok());
}
st->pliesFromNull = 0;
st->value += (sideToMove == WHITE) ? TempoValue : -TempoValue;
- assert(is_ok());
+ assert(pos_is_ok());
}
sideToMove = flip(sideToMove);
st->rule50--;
- assert(is_ok());
+ assert(pos_is_ok());
}
st->npMaterial[WHITE] = compute_non_pawn_material(WHITE);
st->npMaterial[BLACK] = compute_non_pawn_material(BLACK);
- assert(is_ok());
+ assert(pos_is_ok());
}
-/// Position::is_ok() performs some consitency checks for the position object.
+/// Position::pos_is_ok() performs some consitency checks for the position object.
/// This is meant to be helpful when debugging.
-bool Position::is_ok(int* failedStep) const {
+bool Position::pos_is_ok(int* failedStep) const {
// What features of the position should be verified?
const bool debugAll = false;
void set_nodes_searched(int64_t n);
// Position consistency check, for debugging
- bool is_ok(int* failedStep = NULL) const;
+ bool pos_is_ok(int* failedStep = NULL) const;
void flip_me();
// Global initialization
Value ThreadsManager::split(Position& pos, SearchStack* ss, Value alpha, Value beta,
Value bestValue, Depth depth, Move threatMove,
int moveCount, MovePicker* mp, int nodeType) {
- assert(pos.is_ok());
+ assert(pos.pos_is_ok());
assert(bestValue >= -VALUE_INFINITE);
assert(bestValue <= alpha);
assert(alpha < beta);