const bool Slidings[18] = { 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1 };
inline bool piece_is_slider(Piece p) { return Slidings[p]; }
- // Step 6. Razoring
-
// Maximum depth for razoring
const Depth RazorDepth = 4 * ONE_PLY;
// Maximum depth for use of dynamic threat detection when null move fails low
const Depth ThreatDepth = 5 * ONE_PLY;
- // Step 9. Internal iterative deepening
-
// Minimum depth for use of internal iterative deepening
const Depth IIDDepth[] = { 8 * ONE_PLY, 5 * ONE_PLY };
// when the static evaluation is bigger then beta - IIDMargin.
const Value IIDMargin = Value(0x100);
- // Step 11. Decide the new search depth
-
- // Extensions. Array index 0 is used for non-PV nodes, index 1 for PV nodes
- const Depth CheckExtension[] = { ONE_PLY / 2, ONE_PLY / 1 };
- const Depth PawnEndgameExtension[] = { ONE_PLY / 1, ONE_PLY / 1 };
- const Depth PawnPushTo7thExtension[] = { ONE_PLY / 2, ONE_PLY / 2 };
- const Depth PassedPawnExtension[] = { DEPTH_ZERO, ONE_PLY / 2 };
-
// Minimum depth for use of singular extension
const Depth SingularExtensionDepth[] = { 8 * ONE_PLY, 6 * ONE_PLY };
- // Step 12. Futility pruning
-
// Futility margin for quiescence search
const Value FutilityMarginQS = Value(0x80);
return d < 16 * ONE_PLY ? FutilityMoveCounts[d] : MAX_MOVES;
}
- // Step 14. Reduced search
-
// Reduction lookup tables (initialized at startup) and their access function
int8_t Reductions[2][64][64]; // [pv][depth][moveNumber]
/// Namespace variables
- // Root move list
RootMoveList Rml;
-
- // MultiPV mode
- int MultiPV, UCIMultiPV, MultiPVIdx;
-
- // Time management variables
+ size_t MultiPV, UCIMultiPV, MultiPVIdx;
TimeManager TimeMgr;
-
- // Skill level adjustment
int SkillLevel;
bool SkillLevelEnabled;
-
- // History table
History H;
return os;
}
- // extension() decides whether a move should be searched with normal depth,
- // or with extended depth. Certain classes of moves (checking moves, in
- // particular) are searched with bigger depth than ordinary moves and in
- // any case are marked as 'dangerous'. Note that also if a move is not
- // extended, as example because the corresponding UCI option is set to zero,
- // the move is marked as 'dangerous' so, at least, we avoid to prune it.
- template <bool PvNode>
- FORCE_INLINE Depth extension(const Position& pos, Move m, bool captureOrPromotion,
- bool moveIsCheck, bool* dangerous) {
- assert(m != MOVE_NONE);
-
- Depth result = DEPTH_ZERO;
- *dangerous = moveIsCheck;
-
- if (moveIsCheck && pos.see_sign(m) >= 0)
- result += CheckExtension[PvNode];
+ // is_dangerous() checks whether a move belongs to some classes of known
+ // 'dangerous' moves so that we avoid to prune it.
+ FORCE_INLINE bool is_dangerous(const Position& pos, Move m, bool captureOrPromotion) {
+ // Test for a pawn pushed to 7th or a passed pawn move
if (type_of(pos.piece_on(move_from(m))) == PAWN)
{
Color c = pos.side_to_move();
- if (relative_rank(c, move_to(m)) == RANK_7)
- {
- result += PawnPushTo7thExtension[PvNode];
- *dangerous = true;
- }
- if (pos.pawn_is_passed(c, move_to(m)))
- {
- result += PassedPawnExtension[PvNode];
- *dangerous = true;
- }
+ if ( relative_rank(c, move_to(m)) == RANK_7
+ || pos.pawn_is_passed(c, move_to(m)))
+ return true;
}
+ // Test for a capture that triggers a pawn endgame
if ( captureOrPromotion
&& type_of(pos.piece_on(move_to(m))) != PAWN
&& ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
- PieceValueMidgame[pos.piece_on(move_to(m))] == VALUE_ZERO)
&& !is_special(m))
- {
- result += PawnEndgameExtension[PvNode];
- *dangerous = true;
- }
+ return true;
- return std::min(result, ONE_PLY);
+ return false;
}
} // namespace
StateInfo st;
int64_t sum = 0;
- // Generate all legal moves
MoveList<MV_LEGAL> ml(pos);
- // If we are at the last ply we don't need to do and undo
- // the moves, just to count them.
+ // At the last ply just return the number of moves (leaf nodes)
if (depth <= ONE_PLY)
return ml.size();
- // Loop through all legal moves
CheckInfo ci(pos);
for ( ; !ml.end(); ++ml)
{
static Book book; // Defined static to initialize the PRNG only once
Position& pos = RootPosition;
-
- // Reset elapsed search time
elapsed_time(true);
+ TimeMgr.init(Limits, pos.startpos_ply_counter());
// Set output stream mode: normal or chess960. Castling notation is different
cout << set960(pos.is_chess960());
- // Look for a book move
if (Options["OwnBook"].value<bool>())
{
if (Options["Book File"].value<string>() != book.name())
read_evaluation_uci_options(pos.side_to_move());
Threads.read_uci_options();
- // Set a new TT size if changed
TT.set_size(Options["Hash"].value<int>());
-
if (Options["Clear Hash"].value<bool>())
{
Options["Clear Hash"].set_value("false");
TT.clear();
}
- UCIMultiPV = Options["MultiPV"].value<int>();
- SkillLevel = Options["Skill Level"].value<int>();
+ UCIMultiPV = Options["MultiPV"].value<size_t>();
+ SkillLevel = Options["Skill Level"].value<size_t>();
// Do we have to play with skill handicap? In this case enable MultiPV that
// we will use behind the scenes to retrieve a set of possible moves.
SkillLevelEnabled = (SkillLevel < 20);
- MultiPV = (SkillLevelEnabled ? std::max(UCIMultiPV, 4) : UCIMultiPV);
+ MultiPV = (SkillLevelEnabled ? std::max(UCIMultiPV, (size_t)4) : UCIMultiPV);
- // Write current search header to log file
if (Options["Use Search Log"].value<bool>())
{
Log log(Options["Search Log Filename"].value<string>());
// Set best timer interval to avoid lagging under time pressure. Timer is
// used to check for remaining available thinking time.
- TimeMgr.init(Limits, pos.startpos_ply_counter());
-
if (TimeMgr.available_time())
Threads.set_timer(std::min(100, std::max(TimeMgr.available_time() / 8, 20)));
else
Move ponderMove = MOVE_NONE;
Move bestMove = id_loop(pos, &RootMoves[0], &ponderMove);
- // Stop timer, no need to check for available time any more
+ // Stop timer and send all the slaves to sleep, if not already sleeping
Threads.set_timer(0);
-
- // This makes all the slave threads to go to sleep, if not already sleeping
Threads.set_size(1);
- // Write current search final statistics to log file
if (Options["Use Search Log"].value<bool>())
{
int e = elapsed_time();
Move bestMove, skillBest, skillPonder;
bool bestMoveNeverChanged = true;
- // Initialize stuff before a new search
memset(ss, 0, 4 * sizeof(Stack));
TT.new_search();
H.clear();
depth = aspirationDelta = 0;
bestValue = alpha = -VALUE_INFINITE, beta = VALUE_INFINITE;
ss->currentMove = MOVE_NULL; // Hack to skip update gains
-
- // Moves to search are verified and copied
Rml.init(pos, rootMoves);
// Handle special case of searching on a mate/stalemate position
- if (!Rml.size())
+ if (Rml.empty())
{
cout << "info" << depth_to_uci(DEPTH_ZERO)
<< score_to_uci(pos.in_check() ? -VALUE_MATE : VALUE_DRAW, alpha, beta) << endl;
Rml.bestMoveChanges = 0;
// MultiPV loop. We perform a full root search for each PV line
- for (MultiPVIdx = 0; MultiPVIdx < std::min(MultiPV, (int)Rml.size()); MultiPVIdx++)
+ for (MultiPVIdx = 0; MultiPVIdx < std::min(MultiPV, Rml.size()); MultiPVIdx++)
{
// Calculate dynamic aspiration window based on previous iterations
if (depth >= 5 && abs(Rml[MultiPVIdx].prevScore) < VALUE_KNOWN_WIN)
// Write PV back to transposition table in case the relevant entries
// have been overwritten during the search.
- for (int i = 0; i <= MultiPVIdx; i++)
+ for (size_t i = 0; i <= MultiPVIdx; i++)
Rml[i].insert_pv_in_tt(pos);
// If search has been stopped exit the aspiration window loop,
// protocol requires to send all the PV lines also if are still
// to be searched and so refer to the previous search's score.
if ((bestValue > alpha && bestValue < beta) || elapsed_time() > 2000)
- for (int i = 0; i < std::min(UCIMultiPV, (int)Rml.size()); i++)
+ for (size_t i = 0; i < std::min(UCIMultiPV, Rml.size()); i++)
{
bool updated = (i <= MultiPVIdx);
} while (abs(bestValue) < VALUE_KNOWN_WIN);
}
- // Collect info about search result
bestMove = Rml[0].pv[0];
*ponderMove = Rml[0].pv[1];
bestValues[depth] = bestValue;
split_point_start: // At split points actual search starts from here
- // Initialize a MovePicker object for the current position
MovePickerExt<SpNode> mp(pos, ttMove, depth, H, ss, PvNode ? -VALUE_INFINITE : beta);
CheckInfo ci(pos);
ss->bestMove = MOVE_NONE;
&& !SpNode
&& depth >= SingularExtensionDepth[PvNode]
&& ttMove != MOVE_NONE
- && !excludedMove // Do not allow recursive singular extension search
+ && !excludedMove // Recursive singular search is not allowed
&& (tte->type() & VALUE_TYPE_LOWER)
&& tte->depth() >= depth - 3 * ONE_PLY;
if (SpNode)
{
lock_grab(&(sp->lock));
bestValue = sp->bestValue;
+ moveCount = sp->moveCount;
+
+ assert(bestValue > -VALUE_INFINITE && moveCount > 0);
}
// Step 11. Loop through moves
// This is used by time management
Signals.firstRootMove = (moveCount == 1);
- // Save the current node count before the move is searched
nodes = pos.nodes_searched();
- // For long searches send current move info to GUI
if (pos.thread() == 0 && elapsed_time() > 2000)
cout << "info" << depth_to_uci(depth)
<< " currmove " << move
}
isPvMove = (PvNode && moveCount <= 1);
- givesCheck = pos.move_gives_check(move, ci);
captureOrPromotion = pos.is_capture_or_promotion(move);
+ givesCheck = pos.move_gives_check(move, ci);
+ dangerous = givesCheck || is_dangerous(pos, move, captureOrPromotion);
+ ext = DEPTH_ZERO;
- // Step 12. Decide the new search depth
- ext = extension<PvNode>(pos, move, captureOrPromotion, givesCheck, &dangerous);
+ // Step 12. Extend checks and, in PV nodes, also dangerous moves
+ if (PvNode && dangerous)
+ ext = ONE_PLY;
+
+ else if (givesCheck && pos.see_sign(move) >= 0)
+ ext = PvNode ? ONE_PLY : ONE_PLY / 2;
// Singular extension search. If all moves but one fail low on a search of
// (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
// on all the other moves but the ttMove, if result is lower than ttValue minus
// a margin then we extend ttMove.
if ( singularExtensionNode
+ && !ext
&& move == ttMove
- && pos.pl_move_is_legal(move, ci.pinned)
- && ext < ONE_PLY)
+ && pos.pl_move_is_legal(move, ci.pinned))
{
Value ttValue = value_from_tt(tte->value(), ss->ply);
&& !inCheck
&& !dangerous
&& move != ttMove
- && !is_castle(move))
+ && !is_castle(move)
+ && (bestValue > VALUE_MATED_IN_PLY_MAX || bestValue == -VALUE_INFINITE))
{
// Move count based pruning
if ( moveCount >= futility_move_count(depth)
- && (!threatMove || !connected_threat(pos, move, threatMove))
- && bestValue > VALUE_MATED_IN_PLY_MAX) // FIXME bestValue is racy
+ && (!threatMove || !connected_threat(pos, move, threatMove)))
{
if (SpNode)
lock_grab(&(sp->lock));
if (futilityValue < beta)
{
if (SpNode)
- {
lock_grab(&(sp->lock));
- if (futilityValue > sp->bestValue)
- sp->bestValue = bestValue = futilityValue;
- }
- else if (futilityValue > bestValue)
- bestValue = futilityValue;
continue;
}
// Prune moves with negative SEE at low depths
if ( predictedDepth < 2 * ONE_PLY
- && bestValue > VALUE_MATED_IN_PLY_MAX
&& pos.see_sign(move) < 0)
{
if (SpNode)
// be trusted, and we don't update the best move and/or PV.
if (RootNode && !Signals.stop)
{
- // Remember searched nodes counts for this move
RootMove* rm = Rml.find(move);
rm->nodes += pos.nodes_searched() - nodes;
// PV move or new best move ?
if (isPvMove || value > alpha)
{
- // Update PV
rm->score = value;
rm->extract_pv_from_tt(pos);
// position in the list is preserved, just the PV is pushed up.
rm->score = -VALUE_INFINITE;
- } // RootNode
+ }
if (value > bestValue)
{
// case of StopRequest or thread.cutoff_occurred() are set, but this is
// harmless because return value is discarded anyhow in the parent nodes.
// If we are in a singular extension search then return a fail low score.
- if (!SpNode && !moveCount)
+ if (!moveCount)
return excludedMove ? oldAlpha : inCheck ? value_mated_in(ss->ply) : VALUE_DRAW;
+ // If we have pruned all the moves without searching return a fail-low score
+ if (bestValue == -VALUE_INFINITE)
+ {
+ assert(!playedMoveCount);
+
+ bestValue = alpha;
+ }
+
// Step 21. Update tables
- // If the search is not aborted, update the transposition table,
- // history counters, and killer moves.
+ // Update transposition table entry, history and killers
if (!SpNode && !Signals.stop && !thread.cutoff_occurred())
{
move = bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove;
return bestValue;
}
+
// qsearch() is the quiescence search function, which is called by the main
// search function when the remaining depth is zero (or, to be more precise,
// less than ONE_PLY).
if (PvNode && bestValue > alpha)
alpha = bestValue;
- // Futility pruning parameters, not needed when in check
futilityBase = ss->eval + evalMargin + FutilityMarginQS;
enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
}
if (!pos.pl_move_is_legal(move, ci.pinned))
continue;
- // Update current move
ss->currentMove = move;
// Make and search the move
}
- // can_return_tt() returns true if a transposition table score
- // can be used to cut-off at a given point in search.
+ // can_return_tt() returns true if a transposition table score can be used to
+ // cut-off at a given point in search.
bool can_return_tt(const TTEntry* tte, Depth depth, Value beta, int ply) {
}
- // refine_eval() returns the transposition table score if
- // possible otherwise falls back on static position evaluation.
+ // refine_eval() returns the transposition table score if possible, otherwise
+ // falls back on static position evaluation.
Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
}
- // update_history() registers a good move that produced a beta-cutoff
- // in history and marks as failures all the other moves of that ply.
+ // update_history() registers a good move that produced a beta-cutoff in
+ // history and marks as failures all the other moves of that ply.
void update_history(const Position& pos, Move move, Depth depth,
Move movesSearched[], int moveCount) {
return s.str();
}
+
+ // pretty_pv() creates a human-readable string from a position and a PV.
+ // It is used to write search information to the log file (which is created
+ // when the UCI parameter "Use Search Log" is "true"). It uses the two helpers
+ // time_to_string() and score_to_string() to format time and score respectively.
+
string time_to_string(int millisecs) {
const int MSecMinute = 1000 * 60;
return s.str();
}
-
- // pretty_pv() creates a human-readable string from a position and a PV.
- // It is used to write search information to the log file (which is created
- // when the UCI parameter "Use Search Log" is "true").
-
string pretty_pv(Position& pos, int depth, Value value, int time, Move pv[]) {
const int64_t K = 1000;
// Rml list is already sorted by score in descending order
int s;
+ size_t size = std::min(MultiPV, Rml.size());
int max_s = -VALUE_INFINITE;
- int size = std::min(MultiPV, (int)Rml.size());
int max = Rml[0].score;
int var = std::min(max - Rml[size - 1].score, int(PawnValueMidgame));
int wk = 120 - 2 * SkillLevel;
// Choose best move. For each move's score we add two terms both dependent
// on wk, one deterministic and bigger for weaker moves, and one random,
// then we choose the move with the resulting highest score.
- for (int i = 0; i < size; i++)
+ for (size_t i = 0; i < size; i++)
{
s = Rml[i].score;
}
- /// RootMove and RootMoveList method's definitions
+ // RootMove and RootMoveList method's definitions
void RootMoveList::init(Position& pos, Move rootMoves[]) {
} // namespace
-// Thread::idle_loop() is where the thread is parked when it has no work to do.
-// The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint object
-// for which the thread is the master.
+/// Thread::idle_loop() is where the thread is parked when it has no work to do.
+/// The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint object
+/// for which the thread is the master.
void Thread::idle_loop(SplitPoint* sp) {
{
assert((!sp && threadID) || Threads.use_sleeping_threads());
- // Slave thread should exit as soon as do_terminate flag raises
if (do_terminate)
{
assert(!sp);
}
-// do_timer_event() is called by the timer thread when the timer triggers
+/// do_timer_event() is called by the timer thread when the timer triggers. It
+/// is used to print debug info and, more important, to detect when we are out of
+/// available time and so stop the search.
void do_timer_event() {
static int lastInfoTime;
int e = elapsed_time();
- // Print debug information every one second
- if (!lastInfoTime || get_system_time() - lastInfoTime >= 1000)
+ if (get_system_time() - lastInfoTime >= 1000 || !lastInfoTime)
{
lastInfoTime = get_system_time();
dbg_print_hit_rate();
}
- // Should we stop the search?
if (Limits.ponder)
return;