2011-11-12 20:44:06 +01:00
|
|
|
/*
|
|
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
|
|
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
|
2014-05-31 14:23:03 +02:00
|
|
|
Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, Tord Romstad
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
Stockfish is free software: you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
|
|
|
|
Stockfish is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <cassert>
|
|
|
|
|
|
|
|
#include "movepick.h"
|
2012-09-16 17:16:15 +02:00
|
|
|
#include "thread.h"
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
enum Stages {
|
2012-06-04 18:25:51 +02:00
|
|
|
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
|
2011-11-12 20:44:06 +01:00
|
|
|
};
|
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
// Our insertion sort, which is guaranteed (and also needed) to be stable
|
2013-08-20 20:02:33 +02:00
|
|
|
void insertion_sort(ExtMove* begin, ExtMove* end)
|
2013-05-03 19:03:42 +02:00
|
|
|
{
|
2013-08-20 20:02:33 +02:00
|
|
|
ExtMove tmp, *p, *q;
|
2013-05-03 19:03:42 +02:00
|
|
|
|
|
|
|
for (p = begin + 1; p < end; ++p)
|
|
|
|
{
|
|
|
|
tmp = *p;
|
|
|
|
for (q = p; q != begin && *(q-1) < tmp; --q)
|
|
|
|
*q = *(q-1);
|
|
|
|
*q = tmp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
// Unary predicate used by std::partition to split positive values from remaining
|
|
|
|
// ones so as to sort the two sets separately, with the second sort delayed.
|
|
|
|
inline bool has_positive_value(const ExtMove& ms) { return ms.value > 0; }
|
2012-01-01 01:52:19 +01:00
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
// Picks 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. possible captures.
|
2013-08-20 20:02:33 +02:00
|
|
|
inline ExtMove* pick_best(ExtMove* begin, ExtMove* end)
|
2012-01-01 01:52:19 +01:00
|
|
|
{
|
2012-09-16 17:16:15 +02:00
|
|
|
std::swap(*begin, *std::max_element(begin, end));
|
|
|
|
return begin;
|
2012-01-01 01:52:19 +01:00
|
|
|
}
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
|
|
|
|
/// Constructors of the MovePicker class. As arguments we pass information
|
2014-05-31 14:23:03 +02:00
|
|
|
/// to help it to return the (presumably) good moves first, to decide which
|
2011-11-12 20:44:06 +01:00
|
|
|
/// moves to return (in the quiescence search, for instance, we only want to
|
2014-05-31 14:23:03 +02:00
|
|
|
/// search captures, promotions and some checks) and how important good move
|
|
|
|
/// ordering is at the current node.
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const HistoryStats& h,
|
2014-05-31 14:23:03 +02:00
|
|
|
Move* cm, Move* fm, Search::Stack* s) : pos(p), history(h), depth(d) {
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
assert(d > DEPTH_ZERO);
|
|
|
|
|
2012-09-16 17:16:15 +02:00
|
|
|
cur = end = moves;
|
|
|
|
endBadCaptures = moves + MAX_MOVES - 1;
|
2013-08-20 20:02:33 +02:00
|
|
|
countermoves = cm;
|
2014-05-31 14:23:03 +02:00
|
|
|
followupmoves = fm;
|
2012-09-16 17:16:15 +02:00
|
|
|
ss = s;
|
2012-06-04 18:25:51 +02:00
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
if (pos.checkers())
|
2013-08-20 20:02:33 +02:00
|
|
|
stage = EVASION;
|
2012-06-04 18:25:51 +02:00
|
|
|
|
2011-11-12 20:44:06 +01:00
|
|
|
else
|
2013-08-20 20:02:33 +02:00
|
|
|
stage = MAIN_SEARCH;
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2013-11-30 20:12:34 +01:00
|
|
|
ttMove = (ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE);
|
2012-09-16 17:16:15 +02:00
|
|
|
end += (ttMove != MOVE_NONE);
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const HistoryStats& h,
|
2014-05-31 14:23:03 +02:00
|
|
|
Square s) : pos(p), history(h), cur(moves), end(moves) {
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
assert(d <= DEPTH_ZERO);
|
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
if (pos.checkers())
|
2013-08-20 20:02:33 +02:00
|
|
|
stage = EVASION;
|
2012-06-04 18:25:51 +02:00
|
|
|
|
|
|
|
else if (d > DEPTH_QS_NO_CHECKS)
|
2013-08-20 20:02:33 +02:00
|
|
|
stage = QSEARCH_0;
|
2012-06-04 18:25:51 +02:00
|
|
|
|
|
|
|
else if (d > DEPTH_QS_RECAPTURES)
|
2011-11-12 20:44:06 +01:00
|
|
|
{
|
2013-08-20 20:02:33 +02:00
|
|
|
stage = QSEARCH_1;
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
// Skip TT move if is not a capture or a promotion. This avoids qsearch
|
2012-06-04 18:25:51 +02:00
|
|
|
// tree explosion due to a possible perpetual check or similar rare cases
|
|
|
|
// when TT table is full.
|
2013-11-30 20:12:34 +01:00
|
|
|
if (ttm && !pos.capture_or_promotion(ttm))
|
2012-01-01 01:52:19 +01:00
|
|
|
ttm = MOVE_NONE;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2013-08-20 20:02:33 +02:00
|
|
|
stage = RECAPTURE;
|
2014-05-31 14:23:03 +02:00
|
|
|
recaptureSquare = s;
|
2012-01-01 01:52:19 +01:00
|
|
|
ttm = MOVE_NONE;
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|
|
|
|
|
2013-11-30 20:12:34 +01:00
|
|
|
ttMove = (ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE);
|
2012-09-16 17:16:15 +02:00
|
|
|
end += (ttMove != MOVE_NONE);
|
2012-01-01 01:52:19 +01:00
|
|
|
}
|
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
MovePicker::MovePicker(const Position& p, Move ttm, const HistoryStats& h, PieceType pt)
|
|
|
|
: pos(p), history(h), cur(moves), end(moves) {
|
2012-01-01 01:52:19 +01:00
|
|
|
|
2013-05-03 19:03:42 +02:00
|
|
|
assert(!pos.checkers());
|
2012-01-01 01:52:19 +01:00
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
stage = PROBCUT;
|
2012-01-01 01:52:19 +01:00
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
// In ProbCut we generate only captures that are better than the parent's
|
|
|
|
// captured piece.
|
2013-05-03 19:03:42 +02:00
|
|
|
captureThreshold = PieceValue[MG][pt];
|
2013-11-30 20:12:34 +01:00
|
|
|
ttMove = (ttm && pos.pseudo_legal(ttm) ? ttm : MOVE_NONE);
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2013-11-30 20:12:34 +01:00
|
|
|
if (ttMove && (!pos.capture(ttMove) || pos.see(ttMove) <= captureThreshold))
|
2012-06-04 18:25:51 +02:00
|
|
|
ttMove = MOVE_NONE;
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2012-09-16 17:16:15 +02:00
|
|
|
end += (ttMove != MOVE_NONE);
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
/// score() assign a numerical value to each move in a move list. The moves with
|
|
|
|
/// highest values will be picked first.
|
2013-05-03 19:03:42 +02:00
|
|
|
template<>
|
|
|
|
void MovePicker::score<CAPTURES>() {
|
2011-11-12 20:44:06 +01:00
|
|
|
// Winning and equal captures in the main search are ordered by MVV/LVA.
|
|
|
|
// 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
|
|
|
|
// 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.
|
2014-05-31 14:23:03 +02:00
|
|
|
// 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.
|
2011-11-12 20:44:06 +01:00
|
|
|
Move m;
|
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
for (ExtMove* it = moves; it != end; ++it)
|
2011-11-12 20:44:06 +01:00
|
|
|
{
|
2012-09-16 17:16:15 +02:00
|
|
|
m = it->move;
|
2014-05-31 14:23:03 +02:00
|
|
|
it->value = PieceValue[MG][pos.piece_on(to_sq(m))]
|
|
|
|
- Value(type_of(pos.moved_piece(m)));
|
2012-01-01 01:52:19 +01:00
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
if (type_of(m) == ENPASSANT)
|
|
|
|
it->value += PieceValue[MG][PAWN];
|
2013-05-03 19:03:42 +02:00
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
else if (type_of(m) == PROMOTION)
|
|
|
|
it->value += PieceValue[MG][promotion_type(m)] - PieceValue[MG][PAWN];
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-03 19:03:42 +02:00
|
|
|
template<>
|
|
|
|
void MovePicker::score<QUIETS>() {
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
Move m;
|
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
for (ExtMove* it = moves; it != end; ++it)
|
2011-11-12 20:44:06 +01:00
|
|
|
{
|
2012-09-16 17:16:15 +02:00
|
|
|
m = it->move;
|
2014-05-31 14:23:03 +02:00
|
|
|
it->value = history[pos.moved_piece(m)][to_sq(m)];
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-03 19:03:42 +02:00
|
|
|
template<>
|
|
|
|
void MovePicker::score<EVASIONS>() {
|
2012-06-04 18:25:51 +02:00
|
|
|
// 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
|
2014-05-31 14:23:03 +02:00
|
|
|
// moves with a negative SEE. This last group is ordered by the SEE value.
|
2011-11-12 20:44:06 +01:00
|
|
|
Move m;
|
2014-05-31 14:23:03 +02:00
|
|
|
Value see;
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
for (ExtMove* it = moves; it != end; ++it)
|
2011-11-12 20:44:06 +01:00
|
|
|
{
|
2012-09-16 17:16:15 +02:00
|
|
|
m = it->move;
|
2014-05-31 14:23:03 +02:00
|
|
|
if ((see = pos.see_sign(m)) < VALUE_ZERO)
|
|
|
|
it->value = see - HistoryStats::Max; // At the bottom
|
2013-05-03 19:03:42 +02:00
|
|
|
|
2013-11-30 20:12:34 +01:00
|
|
|
else if (pos.capture(m))
|
2014-05-31 14:23:03 +02:00
|
|
|
it->value = PieceValue[MG][pos.piece_on(to_sq(m))]
|
|
|
|
- Value(type_of(pos.moved_piece(m))) + HistoryStats::Max;
|
2011-11-12 20:44:06 +01:00
|
|
|
else
|
2014-05-31 14:23:03 +02:00
|
|
|
it->value = history[pos.moved_piece(m)][to_sq(m)];
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
/// generate_next_stage() generates, scores and sorts the next bunch of moves,
|
|
|
|
/// when there are no more moves to try for the current stage.
|
2012-06-04 18:25:51 +02:00
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
void MovePicker::generate_next_stage() {
|
2012-06-04 18:25:51 +02:00
|
|
|
|
2012-09-16 17:16:15 +02:00
|
|
|
cur = moves;
|
2012-06-04 18:25:51 +02:00
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
switch (++stage) {
|
2012-06-04 18:25:51 +02:00
|
|
|
|
|
|
|
case CAPTURES_S1: case CAPTURES_S3: case CAPTURES_S4: case CAPTURES_S5: case CAPTURES_S6:
|
2012-09-16 17:16:15 +02:00
|
|
|
end = generate<CAPTURES>(pos, moves);
|
2013-05-03 19:03:42 +02:00
|
|
|
score<CAPTURES>();
|
2012-06-04 18:25:51 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
case KILLERS_S1:
|
2012-09-16 17:16:15 +02:00
|
|
|
cur = killers;
|
|
|
|
end = cur + 2;
|
2013-08-20 20:02:33 +02:00
|
|
|
|
|
|
|
killers[0].move = ss->killers[0];
|
|
|
|
killers[1].move = ss->killers[1];
|
|
|
|
killers[2].move = killers[3].move = MOVE_NONE;
|
2014-05-31 14:23:03 +02:00
|
|
|
killers[4].move = killers[5].move = MOVE_NONE;
|
|
|
|
|
|
|
|
// Please note that following code is racy and could yield to rare (less
|
|
|
|
// than 1 out of a million) duplicated entries in SMP case. This is harmless.
|
2013-08-20 20:02:33 +02:00
|
|
|
|
|
|
|
// Be sure countermoves are different from killers
|
2013-11-30 20:12:34 +01:00
|
|
|
for (int i = 0; i < 2; ++i)
|
2014-05-31 14:23:03 +02:00
|
|
|
if ( countermoves[i] != (cur+0)->move
|
|
|
|
&& countermoves[i] != (cur+1)->move)
|
2013-08-20 20:02:33 +02:00
|
|
|
(end++)->move = countermoves[i];
|
|
|
|
|
2014-05-31 14:23:03 +02:00
|
|
|
// Be sure followupmoves are different from killers and countermoves
|
|
|
|
for (int i = 0; i < 2; ++i)
|
|
|
|
if ( followupmoves[i] != (cur+0)->move
|
|
|
|
&& followupmoves[i] != (cur+1)->move
|
|
|
|
&& followupmoves[i] != (cur+2)->move
|
|
|
|
&& followupmoves[i] != (cur+3)->move)
|
|
|
|
(end++)->move = followupmoves[i];
|
2012-06-04 18:25:51 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
case QUIETS_1_S1:
|
2012-09-16 17:16:15 +02:00
|
|
|
endQuiets = end = generate<QUIETS>(pos, moves);
|
2013-05-03 19:03:42 +02:00
|
|
|
score<QUIETS>();
|
2014-05-31 14:23:03 +02:00
|
|
|
end = std::partition(cur, end, has_positive_value);
|
2013-05-03 19:03:42 +02:00
|
|
|
insertion_sort(cur, end);
|
2012-06-04 18:25:51 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
case QUIETS_2_S1:
|
2012-09-16 17:16:15 +02:00
|
|
|
cur = end;
|
|
|
|
end = endQuiets;
|
2012-06-04 18:25:51 +02:00
|
|
|
if (depth >= 3 * ONE_PLY)
|
2013-05-03 19:03:42 +02:00
|
|
|
insertion_sort(cur, end);
|
2012-06-04 18:25:51 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
case BAD_CAPTURES_S1:
|
|
|
|
// Just pick them in reverse order to get MVV/LVA ordering
|
2012-09-16 17:16:15 +02:00
|
|
|
cur = moves + MAX_MOVES - 1;
|
|
|
|
end = endBadCaptures;
|
2012-06-04 18:25:51 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
case EVASIONS_S2:
|
2012-09-16 17:16:15 +02:00
|
|
|
end = generate<EVASIONS>(pos, moves);
|
2013-05-03 19:03:42 +02:00
|
|
|
if (end > moves + 1)
|
|
|
|
score<EVASIONS>();
|
2012-06-04 18:25:51 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
case QUIET_CHECKS_S3:
|
2012-09-16 17:16:15 +02:00
|
|
|
end = generate<QUIET_CHECKS>(pos, moves);
|
2012-06-04 18:25:51 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT: case RECAPTURE:
|
2013-08-20 20:02:33 +02:00
|
|
|
stage = STOP;
|
2014-05-31 14:23:03 +02:00
|
|
|
/* Fall through */
|
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
case STOP:
|
2012-09-16 17:16:15 +02:00
|
|
|
end = cur + 1; // Avoid another next_phase() call
|
2012-06-04 18:25:51 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
default:
|
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-05-03 19:03:42 +02:00
|
|
|
/// next_move() is the most important method of the MovePicker class. It returns
|
2014-05-31 14:23:03 +02:00
|
|
|
/// 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.
|
2012-09-16 17:16:15 +02:00
|
|
|
template<>
|
|
|
|
Move MovePicker::next_move<false>() {
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
Move move;
|
|
|
|
|
|
|
|
while (true)
|
|
|
|
{
|
2012-09-16 17:16:15 +02:00
|
|
|
while (cur == end)
|
2014-05-31 14:23:03 +02:00
|
|
|
generate_next_stage();
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2013-08-20 20:02:33 +02:00
|
|
|
switch (stage) {
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
case MAIN_SEARCH: case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT:
|
2013-11-30 20:12:34 +01:00
|
|
|
++cur;
|
2012-01-01 01:52:19 +01:00
|
|
|
return ttMove;
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
case CAPTURES_S1:
|
2012-09-16 17:16:15 +02:00
|
|
|
move = pick_best(cur++, end)->move;
|
2012-01-01 01:52:19 +01:00
|
|
|
if (move != ttMove)
|
2011-11-12 20:44:06 +01:00
|
|
|
{
|
2014-05-31 14:23:03 +02:00
|
|
|
if (pos.see_sign(move) >= VALUE_ZERO)
|
2011-11-12 20:44:06 +01:00
|
|
|
return move;
|
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
// Losing capture, move it to the tail of the array
|
2012-09-16 17:16:15 +02:00
|
|
|
(endBadCaptures--)->move = move;
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
case KILLERS_S1:
|
2012-09-16 17:16:15 +02:00
|
|
|
move = (cur++)->move;
|
2012-06-04 18:25:51 +02:00
|
|
|
if ( move != MOVE_NONE
|
|
|
|
&& move != ttMove
|
2014-05-31 14:23:03 +02:00
|
|
|
&& pos.pseudo_legal(move)
|
2013-11-30 20:12:34 +01:00
|
|
|
&& !pos.capture(move))
|
2011-11-12 20:44:06 +01:00
|
|
|
return move;
|
|
|
|
break;
|
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
case QUIETS_1_S1: case QUIETS_2_S1:
|
2012-09-16 17:16:15 +02:00
|
|
|
move = (cur++)->move;
|
2012-01-01 01:52:19 +01:00
|
|
|
if ( move != ttMove
|
2011-11-12 20:44:06 +01:00
|
|
|
&& move != killers[0].move
|
2013-08-20 20:02:33 +02:00
|
|
|
&& move != killers[1].move
|
|
|
|
&& move != killers[2].move
|
2014-05-31 14:23:03 +02:00
|
|
|
&& move != killers[3].move
|
|
|
|
&& move != killers[4].move
|
|
|
|
&& move != killers[5].move)
|
2011-11-12 20:44:06 +01:00
|
|
|
return move;
|
|
|
|
break;
|
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
case BAD_CAPTURES_S1:
|
2012-09-16 17:16:15 +02:00
|
|
|
return (cur--)->move;
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
case EVASIONS_S2: case CAPTURES_S3: case CAPTURES_S4:
|
2012-09-16 17:16:15 +02:00
|
|
|
move = pick_best(cur++, end)->move;
|
2012-01-01 01:52:19 +01:00
|
|
|
if (move != ttMove)
|
|
|
|
return move;
|
|
|
|
break;
|
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
case CAPTURES_S5:
|
2012-09-16 17:16:15 +02:00
|
|
|
move = pick_best(cur++, end)->move;
|
2012-06-04 18:25:51 +02:00
|
|
|
if (move != ttMove && pos.see(move) > captureThreshold)
|
|
|
|
return move;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CAPTURES_S6:
|
2012-09-16 17:16:15 +02:00
|
|
|
move = pick_best(cur++, end)->move;
|
2012-01-07 03:07:28 +01:00
|
|
|
if (to_sq(move) == recaptureSquare)
|
2011-11-12 20:44:06 +01:00
|
|
|
return move;
|
|
|
|
break;
|
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
case QUIET_CHECKS_S3:
|
2012-09-16 17:16:15 +02:00
|
|
|
move = (cur++)->move;
|
2012-01-01 01:52:19 +01:00
|
|
|
if (move != ttMove)
|
2011-11-12 20:44:06 +01:00
|
|
|
return move;
|
|
|
|
break;
|
|
|
|
|
2012-06-04 18:25:51 +02:00
|
|
|
case STOP:
|
2011-11-12 20:44:06 +01:00
|
|
|
return MOVE_NONE;
|
|
|
|
|
|
|
|
default:
|
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2012-09-16 17:16:15 +02:00
|
|
|
|
|
|
|
|
|
|
|
/// 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
|
2013-05-03 19:03:42 +02:00
|
|
|
/// safe so must be lock protected by the caller.
|
2012-09-16 17:16:15 +02:00
|
|
|
template<>
|
2013-05-03 19:03:42 +02:00
|
|
|
Move MovePicker::next_move<true>() { return ss->splitPoint->movePicker->next_move<false>(); }
|