assert(d > DEPTH_ZERO);
- cur = end = moves;
+ cur = end = moves = pos.this_thread()->get_moves_array();
endBadCaptures = moves + MAX_MOVES - 1;
countermoves = cm;
ss = s;
}
MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const HistoryStats& h,
- Square sq) : pos(p), history(h), cur(moves), end(moves) {
+ Square sq) : pos(p), history(h) {
assert(d <= DEPTH_ZERO);
+ cur = end = moves = pos.this_thread()->get_moves_array();
if (p.checkers())
stage = EVASION;
}
MovePicker::MovePicker(const Position& p, Move ttm, const HistoryStats& h, PieceType pt)
- : pos(p), history(h), cur(moves), end(moves) {
+ : pos(p), history(h) {
assert(!pos.checkers());
+ cur = end = moves = pos.this_thread()->get_moves_array();
stage = PROBCUT;
// In ProbCut we generate only captures better than parent's captured piece
end += (ttMove != MOVE_NONE);
}
+MovePicker::~MovePicker() { pos.this_thread()->free_moves_array(); }
/// score() assign a numerical move ordering score to each move in a move list.
/// The moves with highest scores will be picked first.
killers[2].move = killers[3].move = MOVE_NONE;
// Be sure countermoves are different from killers
- for (int i = 0; i < 2; i++)
+ for (int i = 0; i < 2; ++i)
if (countermoves[i] != cur->move && countermoves[i] != (cur+1)->move)
(end++)->move = countermoves[i];