STC:
LLR: 2.95 (-2.94,2.94) [-3.00,1.00]
Total: 58613 W: 10779 L: 10723 D: 37111
LTC:
LLR: 2.95 (-2.94,2.94) [-3.00,1.00]
Total: 33608 W: 4539 L: 4436 D: 24633
Bench:
9441294
namespace {
enum Stages {
namespace {
enum Stages {
- MAIN_SEARCH, GOOD_CAPTURES, KILLERS, GOOD_QUIETS, BAD_QUIETS, BAD_CAPTURES,
+ MAIN_SEARCH, GOOD_CAPTURES, KILLERS, QUIET, BAD_CAPTURES,
EVASION, ALL_EVASIONS,
QSEARCH_WITH_CHECKS, QCAPTURES_1, CHECKS,
QSEARCH_WITHOUT_CHECKS, QCAPTURES_2,
EVASION, ALL_EVASIONS,
QSEARCH_WITH_CHECKS, QCAPTURES_1, CHECKS,
QSEARCH_WITHOUT_CHECKS, QCAPTURES_2,
endMoves = cur + 2 + (countermove != killers[0] && countermove != killers[1]);
break;
endMoves = cur + 2 + (countermove != killers[0] && countermove != killers[1]);
break;
- case GOOD_QUIETS:
- endQuiets = endMoves = generate<QUIETS>(pos, moves);
+ case QUIET:
+ endMoves = generate<QUIETS>(pos, moves);
- endMoves = std::partition(cur, endMoves, [](const ExtMove& m) { return m.value > VALUE_ZERO; });
- insertion_sort(cur, endMoves);
- break;
-
- case BAD_QUIETS:
- cur = endMoves;
- endMoves = endQuiets;
- if (depth >= 3 * ONE_PLY)
+ if (depth < 3 * ONE_PLY)
+ {
+ ExtMove* goodQuiet = std::partition(cur, endMoves, [](const ExtMove& m)
+ { return m.value > VALUE_ZERO; });
+ insertion_sort(cur, goodQuiet);
+ } else
insertion_sort(cur, endMoves);
break;
insertion_sort(cur, endMoves);
break;
- case GOOD_QUIETS: case BAD_QUIETS:
move = *cur++;
if ( move != ttMove
&& move != killers[0]
move = *cur++;
if ( move != ttMove
&& move != killers[0]
Square recaptureSquare;
Value threshold;
int stage;
Square recaptureSquare;
Value threshold;
int stage;
- ExtMove *endQuiets, *endBadCaptures = moves + MAX_MOVES - 1;
+ ExtMove* endBadCaptures = moves + MAX_MOVES - 1;
ExtMove moves[MAX_MOVES], *cur = moves, *endMoves = moves;
};
ExtMove moves[MAX_MOVES], *cur = moves, *endMoves = moves;
};