/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2009 Marco Costalba
+ 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
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
-
-////
-//// Includes
-////
-
#include <cassert>
-#include "history.h"
-#include "movegen.h"
#include "movepick.h"
-#include "search.h"
-#include "value.h"
-
-
-////
-//// Local definitions
-////
+#include "thread.h"
namespace {
- enum MovegenPhase {
- PH_TT_MOVES, // Transposition table move and mate killer
- PH_GOOD_CAPTURES, // Queen promotions and captures with SEE values >= 0
- PH_KILLERS, // Killer moves from the current ply
- PH_NONCAPTURES, // Non-captures and underpromotions
- PH_BAD_CAPTURES, // Queen promotions and captures with SEE values < 0
- PH_EVASIONS, // Check evasions
- PH_QCAPTURES, // Captures in quiescence search
- PH_QCHECKS, // Non-capture checks in quiescence search
- PH_STOP
+ 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,
+ QSEARCH_1, CAPTURES_S4,
+ PROBCUT, CAPTURES_S5,
+ RECAPTURE, CAPTURES_S6,
+ STOP
};
- CACHE_LINE_ALIGNMENT
- const uint8_t MainSearchPhaseTable[] = { PH_TT_MOVES, PH_GOOD_CAPTURES, PH_KILLERS, PH_NONCAPTURES, PH_BAD_CAPTURES, PH_STOP};
- const uint8_t EvasionsPhaseTable[] = { PH_TT_MOVES, PH_EVASIONS, PH_STOP};
- const uint8_t QsearchWithChecksPhaseTable[] = { PH_TT_MOVES, PH_QCAPTURES, PH_QCHECKS, PH_STOP};
- const uint8_t QsearchWithoutChecksPhaseTable[] = { PH_TT_MOVES, PH_QCAPTURES, PH_STOP};
-}
+ // Our insertion sort, which is guaranteed to be stable, as it should be
+ void insertion_sort(ExtMove* begin, ExtMove* end)
+ {
+ ExtMove tmp, *p, *q;
+
+ for (p = begin + 1; p < end; ++p)
+ {
+ tmp = *p;
+ for (q = p; q != begin && *(q-1) < tmp; --q)
+ *q = *(q-1);
+ *q = tmp;
+ }
+ }
+ // 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.
+ Move pick_best(ExtMove* begin, ExtMove* end)
+ {
+ std::swap(*begin, *std::max_element(begin, end));
+ return *begin;
+ }
-////
-//// Functions
-////
+} // namespace
-/// Constructor for the MovePicker class. Apart from the position for which
-/// it is asked to pick legal moves, MovePicker also wants some information
-/// to help it to return the presumably good moves first, to decide which
+/// Constructors of the MovePicker class. As arguments we pass information
+/// 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, SearchStack* ss) : pos(p), H(h) {
- int searchTT = ttm;
- ttMoves[0].move = ttm;
- lastBadCapture = badCaptures;
+MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const HistoryStats& h, const CounterMovesHistoryStats& cmh,
+ Move cm, Search::Stack* s) : pos(p), history(h), counterMovesHistory(cmh), depth(d) {
- pinned = p.pinned_pieces(pos.side_to_move());
+ assert(d > DEPTH_ZERO);
+
+ endBadCaptures = moves + MAX_MOVES - 1;
+ countermove = cm;
+ ss = s;
+
+ if (pos.checkers())
+ stage = EVASION;
- if (ss && !p.is_check())
- {
- ttMoves[1].move = (ss->mateKiller == ttm)? MOVE_NONE : ss->mateKiller;
- searchTT |= ttMoves[1].move;
- killers[0].move = ss->killers[0];
- killers[1].move = ss->killers[1];
- } else
- ttMoves[1].move = killers[0].move = killers[1].move = MOVE_NONE;
-
- if (p.is_check())
- phasePtr = EvasionsPhaseTable;
- else if (d > Depth(0))
- phasePtr = MainSearchPhaseTable;
- else if (d == Depth(0))
- phasePtr = QsearchWithChecksPhaseTable;
else
- phasePtr = QsearchWithoutChecksPhaseTable;
+ stage = MAIN_SEARCH;
- phasePtr += !searchTT - 1;
- go_next_phase();
+ ttMove = (ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE);
+ endMoves += (ttMove != MOVE_NONE);
}
+MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const HistoryStats& h, const CounterMovesHistoryStats& cmh,
+ Square s) : pos(p), history(h), counterMovesHistory(cmh) {
-/// MovePicker::go_next_phase() generates, scores and sorts the next bunch
-/// of moves when there are no more moves to try for the current phase.
+ assert(d <= DEPTH_ZERO);
-void MovePicker::go_next_phase() {
+ if (pos.checkers())
+ stage = EVASION;
- curMove = moves;
- phase = *(++phasePtr);
- switch (phase) {
+ else if (d > DEPTH_QS_NO_CHECKS)
+ stage = QSEARCH_0;
- case PH_TT_MOVES:
- curMove = ttMoves;
- lastMove = curMove + 2;
- return;
+ else if (d > DEPTH_QS_RECAPTURES)
+ stage = QSEARCH_1;
- case PH_GOOD_CAPTURES:
- lastMove = generate_captures(pos, moves);
- score_captures();
- return;
-
- case PH_KILLERS:
- curMove = killers;
- lastMove = curMove + 2;
- return;
+ else
+ {
+ stage = RECAPTURE;
+ recaptureSquare = s;
+ ttm = MOVE_NONE;
+ }
- case PH_NONCAPTURES:
- lastMove = generate_noncaptures(pos, moves);
- score_noncaptures();
- sort_moves(moves, lastMove);
- return;
+ ttMove = (ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE);
+ endMoves += (ttMove != MOVE_NONE);
+}
- case PH_BAD_CAPTURES:
- // Bad captures SEE value is already calculated so just sort them
- // to get SEE move ordering.
- curMove = badCaptures;
- lastMove = lastBadCapture;
- return;
+MovePicker::MovePicker(const Position& p, Move ttm, const HistoryStats& h, const CounterMovesHistoryStats& cmh, PieceType pt)
+ : pos(p), history(h), counterMovesHistory(cmh) {
- case PH_EVASIONS:
- assert(pos.is_check());
- lastMove = generate_evasions(pos, moves);
- score_evasions_or_checks();
- return;
+ assert(!pos.checkers());
- case PH_QCAPTURES:
- lastMove = generate_captures(pos, moves);
- score_captures();
- return;
+ stage = PROBCUT;
- case PH_QCHECKS:
- lastMove = generate_non_capture_checks(pos, moves);
- score_evasions_or_checks();
- return;
+ // 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);
- case PH_STOP:
- lastMove = curMove + 1; // Avoids another go_next_phase() call
- return;
+ if (ttMove && (!pos.capture(ttMove) || pos.see(ttMove) <= captureThreshold))
+ ttMove = MOVE_NONE;
- default:
- assert(false);
- return;
- }
+ endMoves += (ttMove != MOVE_NONE);
}
-/// MovePicker::score_captures(), MovePicker::score_noncaptures() and
-/// MovePicker::score_evasions() assign a numerical move ordering score
-/// to each move in a move list. The moves with highest scores will be
-/// picked first by get_next_move().
-
-void MovePicker::score_captures() {
- // Winning and equal captures in the main search are ordered by MVV/LVA.
+/// 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<CAPTURES>() {
+ // Winning and equal captures in the main search are ordered by MVV.
// Suprisingly, this appears to perform slightly better than SEE based
// move ordering. The reason is probably that in a position with a winning
- // capture, capturing a more valuable (but sufficiently defended) piece
+ // capture, capturing a valuable (but sufficiently defended) piece
// first usually doesn't hurt. The opponent will have to recapture, and
// the hanging piece will still be hanging (except in the unusual cases
// 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;
-
- // Use MVV/LVA ordering
- for (MoveStack* cur = moves; cur != lastMove; cur++)
- {
- m = cur->move;
- if (move_is_promotion(m))
- cur->score = QueenValueMidgame;
- else
- cur->score = pos.midgame_value_of_piece_on(move_to(m))
- - pos.type_of_piece_on(move_from(m));
+ // 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){
+ m.value = PieceValue[MG][pos.piece_on(to_sq(m))] - 200*relative_rank(pos.side_to_move(), to_sq(m));
}
}
-void MovePicker::score_noncaptures() {
- // First score by history, when no history is available then use
- // piece/square tables values. This seems to be better then a
- // random choice when we don't have an history for any move.
- Move m;
- Piece piece;
- Square from, to;
- int hs;
+template<>
+void MovePicker::score<QUIETS>() {
- for (MoveStack* cur = moves; cur != lastMove; cur++)
- {
- m = cur->move;
- from = move_from(m);
- to = move_to(m);
- piece = pos.piece_on(from);
- hs = H.move_ordering_score(piece, to);
-
- // Ensure history is always preferred to pst
- if (hs > 0)
- hs += 1000;
-
- // pst based scoring
- cur->score = hs + mg_value(pos.pst_delta(piece, from, to));
- }
+ Square prevSq = to_sq((ss-1)->currentMove);
+ const HistoryStats& cmh = counterMovesHistory[pos.piece_on(prevSq)][prevSq];
+
+ for (auto& m : *this)
+ m.value = history[pos.moved_piece(m)][to_sq(m)]
+ + cmh[pos.moved_piece(m)][to_sq(m)] * 3;
}
-void MovePicker::score_evasions_or_checks() {
- // 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
- // negative SEE. This last group is ordered by the SEE score.
- Move m;
- int seeScore;
+template<>
+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, then bad-captures and quiet
+ // moves with a negative SEE. This last group is ordered by the SEE value.
+ Value see;
- // Skip if we don't have at least two moves to order
- if (lastMove < moves + 2)
- return;
+ for (auto& m : *this)
+ if ((see = pos.see_sign(m)) < VALUE_ZERO)
+ m.value = see - HistoryStats::Max; // At the bottom
- for (MoveStack* cur = moves; cur != lastMove; cur++)
- {
- m = cur->move;
- if ((seeScore = pos.see_sign(m)) < 0)
- cur->score = seeScore;
- else if (pos.move_is_capture(m))
- cur->score = pos.midgame_value_of_piece_on(move_to(m))
- - pos.type_of_piece_on(move_from(m)) + HistoryMax;
+ 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
- cur->score = H.move_ordering_score(pos.piece_on(move_from(m)), move_to(m));
+ m.value = history[pos.moved_piece(m)][to_sq(m)];
+}
+
+
+/// 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_stage() {
+
+ cur = moves;
+
+ switch (++stage) {
+
+ case CAPTURES_S1: case CAPTURES_S3: case CAPTURES_S4: case CAPTURES_S5: case CAPTURES_S6:
+ endMoves = generate<CAPTURES>(pos, moves);
+ score<CAPTURES>();
+ break;
+
+ case KILLERS_S1:
+ cur = killers;
+ endMoves = cur + 2;
+
+ killers[0] = ss->killers[0];
+ killers[1] = ss->killers[1];
+ killers[2].move = MOVE_NONE;
+
+ // Be sure countermoves are different from killers
+ if ( countermove != killers[0]
+ && countermove != killers[1])
+ *endMoves++ = countermove;
+ break;
+
+ case QUIETS_1_S1:
+ endQuiets = endMoves = generate<QUIETS>(pos, moves);
+ score<QUIETS>();
+ endMoves = std::partition(cur, endMoves, [](const ExtMove& m) { return m.value > VALUE_ZERO; });
+ insertion_sort(cur, endMoves);
+ break;
+
+ case QUIETS_2_S1:
+ cur = endMoves;
+ endMoves = endQuiets;
+ if (depth >= 3 * ONE_PLY)
+ 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;
+ endMoves = endBadCaptures;
+ break;
+
+ case EVASIONS_S2:
+ endMoves = generate<EVASIONS>(pos, moves);
+ if (endMoves - moves > 1)
+ score<EVASIONS>();
+ break;
+
+ case QUIET_CHECKS_S3:
+ endMoves = generate<QUIET_CHECKS>(pos, moves);
+ break;
+
+ case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT: case RECAPTURE:
+ stage = STOP;
+ /* Fall through */
+
+ case STOP:
+ endMoves = cur + 1; // Avoid another generate_next_stage() call
+ break;
+
+ default:
+ assert(false);
}
}
-/// MovePicker::get_next_move() is the most important method of the MovePicker
-/// class. It returns a new legal move every time it 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 to return the tt move if has already been searched previously.
-/// Note that this function is not thread safe so should be lock protected by
-/// caller when accessed through a shared MovePicker object.
-Move MovePicker::get_next_move() {
+/// next_move() is the most important method of the MovePicker class. It returns
+/// 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<false>() {
Move move;
while (true)
{
- while (curMove != lastMove)
- {
- switch (phase) {
-
- case PH_TT_MOVES:
- move = (curMove++)->move;
- if ( move != MOVE_NONE
- && move_is_legal(pos, move, pinned))
- return move;
- break;
-
- case PH_GOOD_CAPTURES:
- move = pick_best(curMove++, lastMove).move;
- if ( move != ttMoves[0].move
- && move != ttMoves[1].move
- && pos.pl_move_is_legal(move, pinned))
- {
- // Check for a non negative SEE now
- int seeValue = pos.see_sign(move);
- if (seeValue >= 0)
- return move;
-
- // Losing capture, move it to the badCaptures[] array, note
- // that move has now been already checked for legality.
- assert(int(lastBadCapture - badCaptures) < 63);
- lastBadCapture->move = move;
- lastBadCapture->score = seeValue;
- lastBadCapture++;
- }
- break;
-
- case PH_KILLERS:
- move = (curMove++)->move;
- if ( move != MOVE_NONE
- && move != ttMoves[0].move
- && move != ttMoves[1].move
- && move_is_legal(pos, move, pinned)
- && !pos.move_is_capture(move))
- return move;
- break;
-
- case PH_NONCAPTURES:
- move = (curMove++)->move;
- if ( move != ttMoves[0].move
- && move != ttMoves[1].move
- && move != killers[0].move
- && move != killers[1].move
- && pos.pl_move_is_legal(move, pinned))
+ while (cur == endMoves)
+ generate_next_stage();
+
+ switch (stage) {
+
+ case MAIN_SEARCH: case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT:
+ ++cur;
+ return ttMove;
+
+ case CAPTURES_S1:
+ move = pick_best(cur++, endMoves);
+ if (move != ttMove)
+ {
+ if (pos.see_sign(move) >= VALUE_ZERO)
return move;
- break;
- case PH_BAD_CAPTURES:
- move = pick_best(curMove++, lastMove).move;
+ // Losing capture, move it to the tail of the array
+ *endBadCaptures-- = move;
+ }
+ break;
+
+ case KILLERS_S1:
+ move = *cur++;
+ if ( move != MOVE_NONE
+ && move != ttMove
+ && pos.pseudo_legal(move)
+ && !pos.capture(move))
+ return move;
+ break;
+
+ case QUIETS_1_S1: case QUIETS_2_S1:
+ move = *cur++;
+ if ( move != ttMove
+ && move != killers[0]
+ && move != killers[1]
+ && move != killers[2])
return move;
+ break;
- case PH_EVASIONS:
- case PH_QCAPTURES:
- move = pick_best(curMove++, lastMove).move;
- if ( move != ttMoves[0].move
- && pos.pl_move_is_legal(move, pinned))
- return move;
- break;
+ case BAD_CAPTURES_S1:
+ return *cur--;
- case PH_QCHECKS:
- move = (curMove++)->move;
- if ( move != ttMoves[0].move
- && pos.pl_move_is_legal(move, pinned))
- return move;
- break;
+ case EVASIONS_S2: case CAPTURES_S3: case CAPTURES_S4:
+ move = pick_best(cur++, endMoves);
+ if (move != ttMove)
+ return move;
+ break;
- case PH_STOP:
- return MOVE_NONE;
+ case CAPTURES_S5:
+ move = pick_best(cur++, endMoves);
+ if (move != ttMove && pos.see(move) > captureThreshold)
+ return move;
+ break;
- default:
- assert(false);
- break;
- }
+ case CAPTURES_S6:
+ move = pick_best(cur++, endMoves);
+ if (to_sq(move) == recaptureSquare)
+ return move;
+ break;
+
+ case QUIET_CHECKS_S3:
+ move = *cur++;
+ if (move != ttMove)
+ return move;
+ break;
+
+ case STOP:
+ return MOVE_NONE;
+
+ default:
+ assert(false);
}
- go_next_phase();
}
}
+
+/// Version of next_move() to use at split point nodes where the move is grabbed
+/// from the split point's shared MovePicker object. This function is not thread
+/// safe so must be lock protected by the caller.
+template<>
+Move MovePicker::next_move<true>() { return ss->splitPoint->movePicker->next_move<false>(); }
projects / stockfish / blobdiff