X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.cpp;h=b82e68b66a8019160998e7c0880c71ef58bbac2a;hp=a604fe14bd72efd81b065e38743914d9b4f154fe;hb=13d4df95cd4c56c0e730328648de54d9ed8bd81e;hpb=19dd0de4ff83e682bafa56d27f302d8f00d3040d diff --git a/src/movepick.cpp b/src/movepick.cpp index a604fe14..b82e68b6 100644 --- a/src/movepick.cpp +++ b/src/movepick.cpp @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2013 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -25,7 +25,7 @@ namespace { - enum Sequencer { + enum Stages { MAIN_SEARCH, CAPTURES_S1, KILLERS_S1, QUIETS_1_S1, QUIETS_2_S1, BAD_CAPTURES_S1, EVASION, EVASIONS_S2, QSEARCH_0, CAPTURES_S3, QUIET_CHECKS_S3, @@ -35,10 +35,10 @@ namespace { STOP }; - // Our insertion sort, guaranteed to be stable, as is needed - void insertion_sort(MoveStack* begin, MoveStack* end) + // Our insertion sort, which is guaranteed to be stable, as it should be + void insertion_sort(ExtMove* begin, ExtMove* end) { - MoveStack tmp, *p, *q; + ExtMove tmp, *p, *q; for (p = begin + 1; p < end; ++p) { @@ -49,114 +49,90 @@ namespace { } } - // Unary predicate used by std::partition to split positive scores from remaining - // ones so to sort separately the two sets, and with the second sort delayed. - inline bool has_positive_score(const MoveStack& ms) { return ms.score > 0; } - - // Picks and moves to the front the best move in the range [begin, end), - // it is faster than sorting all the moves in advance when moves are few, as - // normally are the possible captures. - inline MoveStack* pick_best(MoveStack* begin, MoveStack* end) + // pick_best() finds the best move in the range (begin, end) and moves it to + // the front. It's faster than sorting all the moves in advance when there + // are few moves e.g. the possible captures. + inline Move pick_best(ExtMove* begin, ExtMove* end) { std::swap(*begin, *std::max_element(begin, end)); - return begin; + return *begin; } -} + +} // namespace /// Constructors of the MovePicker class. As arguments we pass information -/// to help it to return the presumably good moves first, to decide which +/// to help it to return the (presumably) good moves first, to decide which /// moves to return (in the quiescence search, for instance, we only want to -/// search captures, promotions and some checks) and about how important good -/// move ordering is at the current node. +/// search captures, promotions and some checks) and how important good move +/// ordering is at the current node. -MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const History& h, const Refutations& r, - Search::Stack* s, Value beta) : pos(p), Hist(h), depth(d) { +MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const HistoryStats& h, const CounterMovesHistoryStats& cmh, + Move* cm, Move* fm, Search::Stack* s) : pos(p), history(h), counterMovesHistory(cmh), depth(d) { assert(d > DEPTH_ZERO); - captureThreshold = 0; - cur = end = moves; endBadCaptures = moves + MAX_MOVES - 1; + countermoves = cm; + followupmoves = fm; ss = s; - if (p.checkers()) - phase = EVASION; + if (pos.checkers()) + stage = EVASION; else - { - phase = MAIN_SEARCH; - - killers[0].move = ss->killers[0]; - killers[1].move = ss->killers[1]; - Square prevSq = to_sq((ss-1)->currentMove); - killers[2].move = r[pos.piece_on(prevSq)][prevSq]; - - // Consider sligtly negative captures as good if at low depth and far from beta - if (ss && ss->staticEval < beta - PawnValueMg && d < 3 * ONE_PLY) - captureThreshold = -PawnValueMg; + stage = MAIN_SEARCH; - // Consider negative captures as good if still enough to reach beta - else if (ss && ss->staticEval > beta) - captureThreshold = beta - ss->staticEval; - } - - ttMove = (ttm && pos.is_pseudo_legal(ttm) ? ttm : MOVE_NONE); - end += (ttMove != MOVE_NONE); + ttMove = (ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE); + endMoves += (ttMove != MOVE_NONE); } -MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const History& h, - Square sq) : pos(p), Hist(h), cur(moves), end(moves) { +MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const HistoryStats& h, const CounterMovesHistoryStats& cmh, + Square s) : pos(p), history(h), counterMovesHistory(cmh) { assert(d <= DEPTH_ZERO); - if (p.checkers()) - phase = EVASION; + if (pos.checkers()) + stage = EVASION; else if (d > DEPTH_QS_NO_CHECKS) - phase = QSEARCH_0; + stage = QSEARCH_0; else if (d > DEPTH_QS_RECAPTURES) - { - phase = QSEARCH_1; + stage = QSEARCH_1; - // Skip TT move if is not a capture or a promotion, this avoids qsearch - // tree explosion due to a possible perpetual check or similar rare cases - // when TT table is full. - if (ttm && !pos.is_capture_or_promotion(ttm)) - ttm = MOVE_NONE; - } else { - phase = RECAPTURE; - recaptureSquare = sq; + stage = RECAPTURE; + recaptureSquare = s; ttm = MOVE_NONE; } - ttMove = (ttm && pos.is_pseudo_legal(ttm) ? ttm : MOVE_NONE); - end += (ttMove != MOVE_NONE); + ttMove = (ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE); + endMoves += (ttMove != MOVE_NONE); } -MovePicker::MovePicker(const Position& p, Move ttm, const History& h, PieceType pt) - : pos(p), Hist(h), cur(moves), end(moves) { +MovePicker::MovePicker(const Position& p, Move ttm, const HistoryStats& h, const CounterMovesHistoryStats& cmh, PieceType pt) + : pos(p), history(h), counterMovesHistory(cmh) { assert(!pos.checkers()); - phase = PROBCUT; + stage = PROBCUT; - // In ProbCut we generate only captures better than parent's captured piece + // In ProbCut we generate only captures that are better than the parent's + // captured piece. captureThreshold = PieceValue[MG][pt]; - ttMove = (ttm && pos.is_pseudo_legal(ttm) ? ttm : MOVE_NONE); + ttMove = (ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE); - if (ttMove && (!pos.is_capture(ttMove) || pos.see(ttMove) <= captureThreshold)) + if (ttMove && (!pos.capture(ttMove) || pos.see(ttMove) <= captureThreshold)) ttMove = MOVE_NONE; - end += (ttMove != MOVE_NONE); + endMoves += (ttMove != MOVE_NONE); } -/// score() assign a numerical move ordering score to each move in a move list. -/// The moves with highest scores will be picked first. +/// score() assign a numerical value to each move in a move list. The moves with +/// highest values will be picked first. template<> void MovePicker::score() { // Winning and equal captures in the main search are ordered by MVV/LVA. @@ -168,115 +144,129 @@ void MovePicker::score() { // where it is possible to recapture with the hanging piece). Exchanging // big pieces before capturing a hanging piece probably helps to reduce // the subtree size. - // In main search we want to push captures with negative SEE values to - // badCaptures[] array, but instead of doing it now we delay till when - // the move has been picked up in pick_move_from_list(), this way we save - // some SEE calls in case we get a cutoff (idea from Pablo Vazquez). - Move m; - - for (MoveStack* it = moves; it != end; ++it) - { - m = it->move; - it->score = PieceValue[MG][pos.piece_on(to_sq(m))] - - type_of(pos.piece_moved(m)); - - if (type_of(m) == PROMOTION) - it->score += PieceValue[MG][promotion_type(m)] - PieceValue[MG][PAWN]; - - else if (type_of(m) == ENPASSANT) - it->score += PieceValue[MG][PAWN]; - } + // In main search we want to push captures with negative SEE values to the + // badCaptures[] array, but instead of doing it now we delay until the move + // has been picked up in pick_move_from_list(). This way we save some SEE + // calls in case we get a cutoff. + for (auto& m : *this) + if (type_of(m) == ENPASSANT) + m.value = PieceValue[MG][PAWN] - Value(PAWN); + + else if (type_of(m) == PROMOTION) + m.value = PieceValue[MG][pos.piece_on(to_sq(m))] - Value(PAWN) + + PieceValue[MG][promotion_type(m)] - PieceValue[MG][PAWN]; + else + m.value = PieceValue[MG][pos.piece_on(to_sq(m))] + - Value(type_of(pos.moved_piece(m))); } template<> void MovePicker::score() { - Move m; + Square prevSq = to_sq((ss-1)->currentMove); + const HistoryStats& cmh = counterMovesHistory[pos.piece_on(prevSq)][prevSq]; - for (MoveStack* it = moves; it != end; ++it) - { - m = it->move; - it->score = Hist[pos.piece_moved(m)][to_sq(m)]; - } + for (auto& m : *this) + m.value = history[pos.moved_piece(m)][to_sq(m)] + + cmh[pos.moved_piece(m)][to_sq(m)]; } template<> void MovePicker::score() { // Try good captures ordered by MVV/LVA, then non-captures if destination square // is not under attack, ordered by history value, then bad-captures and quiet - // moves with a negative SEE. This last group is ordered by the SEE score. - Move m; - int seeScore; + // moves with a negative SEE. This last group is ordered by the SEE value. + Value see; - for (MoveStack* it = moves; it != end; ++it) - { - m = it->move; - if ((seeScore = pos.see_sign(m)) < 0) - it->score = seeScore - History::Max; // At the bottom + for (auto& m : *this) + if ((see = pos.see_sign(m)) < VALUE_ZERO) + m.value = see - HistoryStats::Max; // At the bottom - else if (pos.is_capture(m)) - it->score = PieceValue[MG][pos.piece_on(to_sq(m))] - - type_of(pos.piece_moved(m)) + History::Max; + else if (pos.capture(m)) + m.value = PieceValue[MG][pos.piece_on(to_sq(m))] + - Value(type_of(pos.moved_piece(m))) + HistoryStats::Max; else - it->score = Hist[pos.piece_moved(m)][to_sq(m)]; - } + m.value = history[pos.moved_piece(m)][to_sq(m)]; } -/// generate_next() generates, scores and sorts the next bunch of moves, when -/// there are no more moves to try for the current phase. +/// generate_next_stage() generates, scores and sorts the next bunch of moves, +/// when there are no more moves to try for the current stage. -void MovePicker::generate_next() { +void MovePicker::generate_next_stage() { cur = moves; - switch (++phase) { + switch (++stage) { case CAPTURES_S1: case CAPTURES_S3: case CAPTURES_S4: case CAPTURES_S5: case CAPTURES_S6: - end = generate(pos, moves); + endMoves = generate(pos, moves); score(); - return; + break; case KILLERS_S1: cur = killers; - end = cur + 3; - return; + endMoves = cur + 2; + + killers[0] = ss->killers[0]; + killers[1] = ss->killers[1]; + killers[2].move = killers[3].move = MOVE_NONE; + killers[4].move = killers[5].move = MOVE_NONE; + + // In SMP case countermoves[] and followupmoves[] could have duplicated entries + // in rare cases (less than 1 out of a million). This is harmless. + + // Be sure countermoves and followupmoves are different from killers + for (int i = 0; i < 2; ++i) + if ( countermoves[i] != killers[0] + && countermoves[i] != killers[1]) + *endMoves++ = countermoves[i]; + + for (int i = 0; i < 2; ++i) + if ( followupmoves[i] != killers[0] + && followupmoves[i] != killers[1] + && followupmoves[i] != killers[2] + && followupmoves[i] != killers[3]) + *endMoves++ = followupmoves[i]; + break; case QUIETS_1_S1: - endQuiets = end = generate(pos, moves); + endQuiets = endMoves = generate(pos, moves); score(); - end = std::partition(cur, end, has_positive_score); - insertion_sort(cur, end); - return; + endMoves = std::partition(cur, endMoves, [](const ExtMove& m) { return m.value > VALUE_ZERO; }); + insertion_sort(cur, endMoves); + break; case QUIETS_2_S1: - cur = end; - end = endQuiets; + cur = endMoves; + endMoves = endQuiets; if (depth >= 3 * ONE_PLY) - insertion_sort(cur, end); - return; + insertion_sort(cur, endMoves); + break; case BAD_CAPTURES_S1: // Just pick them in reverse order to get MVV/LVA ordering cur = moves + MAX_MOVES - 1; - end = endBadCaptures; - return; + endMoves = endBadCaptures; + break; case EVASIONS_S2: - end = generate(pos, moves); - if (end > moves + 1) + endMoves = generate(pos, moves); + if (endMoves - moves > 1) score(); - return; + break; case QUIET_CHECKS_S3: - end = generate(pos, moves); - return; + endMoves = generate(pos, moves); + break; case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT: case RECAPTURE: - phase = STOP; + stage = STOP; + /* Fall through */ + case STOP: - end = cur + 1; // Avoid another next_phase() call - return; + endMoves = cur + 1; // Avoid another generate_next_stage() call + break; default: assert(false); @@ -285,9 +275,9 @@ void MovePicker::generate_next() { /// next_move() is the most important method of the MovePicker class. It returns -/// a new pseudo legal move every time is called, until there are no more moves -/// left. It picks the move with the biggest score from a list of generated moves -/// taking care not returning the ttMove if has already been searched previously. +/// a new pseudo legal move every time it is called, until there are no more moves +/// left. It picks the move with the biggest value from a list of generated moves +/// taking care not to return the ttMove if it has already been searched. template<> Move MovePicker::next_move() { @@ -295,70 +285,71 @@ Move MovePicker::next_move() { while (true) { - while (cur == end) - generate_next(); + while (cur == endMoves) + generate_next_stage(); - switch (phase) { + switch (stage) { case MAIN_SEARCH: case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT: - cur++; + ++cur; return ttMove; case CAPTURES_S1: - move = pick_best(cur++, end)->move; + move = pick_best(cur++, endMoves); if (move != ttMove) { - assert(captureThreshold <= 0); // Otherwise we cannot use see_sign() - - if (pos.see_sign(move) >= captureThreshold) + if (pos.see_sign(move) >= VALUE_ZERO) return move; // Losing capture, move it to the tail of the array - (endBadCaptures--)->move = move; + *endBadCaptures-- = move; } break; case KILLERS_S1: - move = (cur++)->move; + move = *cur++; if ( move != MOVE_NONE - && pos.is_pseudo_legal(move) && move != ttMove - && !pos.is_capture(move)) + && pos.pseudo_legal(move) + && !pos.capture(move)) return move; break; case QUIETS_1_S1: case QUIETS_2_S1: - move = (cur++)->move; + move = *cur++; if ( move != ttMove - && move != killers[0].move - && move != killers[1].move - && move != killers[2].move) + && move != killers[0] + && move != killers[1] + && move != killers[2] + && move != killers[3] + && move != killers[4] + && move != killers[5]) return move; break; case BAD_CAPTURES_S1: - return (cur--)->move; + return *cur--; case EVASIONS_S2: case CAPTURES_S3: case CAPTURES_S4: - move = pick_best(cur++, end)->move; + move = pick_best(cur++, endMoves); if (move != ttMove) return move; break; case CAPTURES_S5: - move = pick_best(cur++, end)->move; + move = pick_best(cur++, endMoves); if (move != ttMove && pos.see(move) > captureThreshold) return move; break; case CAPTURES_S6: - move = pick_best(cur++, end)->move; + move = pick_best(cur++, endMoves); if (to_sq(move) == recaptureSquare) return move; break; case QUIET_CHECKS_S3: - move = (cur++)->move; + move = *cur++; if (move != ttMove) return move; break;