int searchTT = ttm;
ttMoves[0].move = ttm;
badCaptureThreshold = 0;
- lastBadCapture = badCaptures;
+ badCaptures = moves + MOVES_MAX;
pinned = p.pinned_pieces(pos.side_to_move());
return;
case PH_BAD_CAPTURES:
- // Bad captures SEE value is already calculated so just sort them
- // to get SEE move ordering.
+ // Bad captures SEE value is already calculated so just pick
+ // them in order to get SEE move ordering.
curMove = badCaptures;
- lastMove = lastBadCapture;
+ lastMove = moves + MOVES_MAX;
return;
case PH_EVASIONS:
assert(pos.is_check());
lastMove = generate_evasions(pos, moves);
- score_evasions_or_checks();
+ score_evasions();
return;
case PH_QCAPTURES:
case PH_QCHECKS:
lastMove = generate_non_capture_checks(pos, moves);
- score_evasions_or_checks();
return;
case PH_STOP:
}
}
-void MovePicker::score_evasions_or_checks() {
+void MovePicker::score_evasions() {
// Try good captures ordered by MVV/LVA, then non-captures if
// destination square is not under attack, ordered by history
// value, and at the end bad-captures and non-captures with a
if (seeValue >= badCaptureThreshold)
return move;
- // Losing capture, move it to the badCaptures[] array, note
+ // Losing capture, move it to the tail of the array, note
// that move has now been already checked for legality.
- assert(int(lastBadCapture - badCaptures) < 63);
- lastBadCapture->move = move;
- lastBadCapture->score = seeValue;
- lastBadCapture++;
+ (--badCaptures)->move = move;
+ badCaptures->score = seeValue;
}
break;