EVASION, EVASIONS_S2,
QSEARCH_0, CAPTURES_S3, QUIET_CHECKS_S3,
QSEARCH_1, CAPTURES_S4,
- MULTICUT, CAPTURES_S5,
+ PROBCUT, CAPTURES_S5,
RECAPTURE, CAPTURES_S6,
STOP
};
assert(!pos.checkers());
- stage = MULTICUT;
+ stage = PROBCUT;
- // In MultiCut we generate only captures that are better than the parent's
+ // In ProbCut we generate only captures that are better than the parent's
// captured piece.
captureThreshold = PieceValue[MG][pt];
ttMove = (ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE);
end = generate<QUIET_CHECKS>(pos, moves);
return;
- case EVASION: case QSEARCH_0: case QSEARCH_1: case MULTICUT: case RECAPTURE:
+ case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT: case RECAPTURE:
stage = STOP;
case STOP:
end = cur + 1; // Avoid another next_phase() call
switch (stage) {
- case MAIN_SEARCH: case EVASION: case QSEARCH_0: case QSEARCH_1: case MULTICUT:
+ case MAIN_SEARCH: case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT:
++cur;
return ttMove;
}
}
- // Step 9. Multi-Cut (skipped when in check)
+ // Step 9. ProbCut (skipped when in check)
// If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
// and a reduced search returns a value much above beta, we can (almost) safely
// prune the previous move.