summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
4808d15)
The teqnique used is actually MultiCut:
https://chessprogramming.wikispaces.com/Multi-Cut
And not ProbCut:
https://chessprogramming.wikispaces.com/ProbCut
No functional change.
EVASION, EVASIONS_S2,
QSEARCH_0, CAPTURES_S3, QUIET_CHECKS_S3,
QSEARCH_1, CAPTURES_S4,
EVASION, EVASIONS_S2,
QSEARCH_0, CAPTURES_S3, QUIET_CHECKS_S3,
QSEARCH_1, CAPTURES_S4,
RECAPTURE, CAPTURES_S6,
STOP
};
RECAPTURE, CAPTURES_S6,
STOP
};
- // In ProbCut we generate only captures that are better than the parent's
+ // In MultiCut 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);
// captured piece.
captureThreshold = PieceValue[MG][pt];
ttMove = (ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE);
end = generate<QUIET_CHECKS>(pos, moves);
return;
end = generate<QUIET_CHECKS>(pos, moves);
return;
- case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT: case RECAPTURE:
+ case EVASION: case QSEARCH_0: case QSEARCH_1: case MULTICUT: case RECAPTURE:
stage = STOP;
case STOP:
end = cur + 1; // Avoid another next_phase() call
stage = STOP;
case STOP:
end = cur + 1; // Avoid another next_phase() call
- case MAIN_SEARCH: case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT:
+ case MAIN_SEARCH: case EVASION: case QSEARCH_0: case QSEARCH_1: case MULTICUT: