2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
39 volatile SignalsType Signals;
41 std::vector<RootMove> RootMoves;
43 Time::point SearchTime;
44 StateStackPtr SetupStates;
49 using namespace Search;
53 // Different node types, used as template parameter
54 enum NodeType { Root, PV, NonPV };
56 // Dynamic razoring margin based on depth
57 inline Value razor_margin(Depth d) { return Value(512 + 32 * d); }
59 // Futility lookup tables (initialized at startup) and their access functions
60 int FutilityMoveCounts[2][16]; // [improving][depth]
62 inline Value futility_margin(Depth d) {
63 return Value(200 * d);
66 // Reduction lookup tables (initialized at startup) and their access function
67 int8_t Reductions[2][2][64][64]; // [pv][improving][depth][moveNumber]
69 template <bool PvNode> inline Depth reduction(bool i, Depth d, int mn) {
70 return (Depth) Reductions[PvNode][i][std::min(int(d), 63)][std::min(mn, 63)];
75 double BestMoveChanges;
76 Value DrawValue[COLOR_NB];
79 MovesStats Countermoves, Followupmoves;
81 template <NodeType NT, bool SpNode>
82 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
84 template <NodeType NT, bool InCheck>
85 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
87 void id_loop(Position& pos);
88 Value value_to_tt(Value v, int ply);
89 Value value_from_tt(Value v, int ply);
90 void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt);
91 string uci_pv(const Position& pos, Depth depth, Value alpha, Value beta);
94 Skill(int l, size_t rootSize) : level(l),
95 candidates(l < 20 ? std::min(4, (int)rootSize) : 0),
98 if (candidates) // Swap best PV line with the sub-optimal one
99 std::swap(RootMoves[0], *std::find(RootMoves.begin(),
100 RootMoves.end(), best ? best : pick_move()));
103 size_t candidates_size() const { return candidates; }
104 bool time_to_pick(Depth depth) const { return depth == 1 + level; }
115 /// Search::init() is called during startup to initialize various lookup tables
117 void Search::init() {
119 // Init reductions array
120 for (int d = 1; d < 64; ++d)
121 for (int mc = 1; mc < 64; ++mc)
123 double pvRed = 0.00 + log(double(d)) * log(double(mc)) / 3.00;
124 double nonPVRed = 0.33 + log(double(d)) * log(double(mc)) / 2.25;
126 Reductions[1][1][d][mc] = int8_t( pvRed >= 1.0 ? pvRed + 0.5: 0);
127 Reductions[0][1][d][mc] = int8_t(nonPVRed >= 1.0 ? nonPVRed + 0.5: 0);
129 Reductions[1][0][d][mc] = Reductions[1][1][d][mc];
130 Reductions[0][0][d][mc] = Reductions[0][1][d][mc];
132 // Increase reduction when eval is not improving
133 if (Reductions[0][0][d][mc] >= 2)
134 Reductions[0][0][d][mc] += 1;
137 // Init futility move count array
138 for (int d = 0; d < 16; ++d)
140 FutilityMoveCounts[0][d] = int(2.4 + 0.773 * pow(d + 0.00, 1.8));
141 FutilityMoveCounts[1][d] = int(2.9 + 1.045 * pow(d + 0.49, 1.8));
146 /// Search::perft() is our utility to verify move generation. All the leaf nodes
147 /// up to the given depth are generated and counted and the sum returned.
149 uint64_t Search::perft(Position& pos, Depth depth) {
152 uint64_t cnt, nodes = 0;
154 const bool leaf = (depth == 2 * ONE_PLY);
156 for (MoveList<LEGAL> it(pos); *it; ++it)
158 if (Root && depth <= ONE_PLY)
162 pos.do_move(*it, st, ci, pos.gives_check(*it, ci));
163 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - ONE_PLY);
168 sync_cout << UCI::format_move(*it, pos.is_chess960()) << ": " << cnt << sync_endl;
173 template uint64_t Search::perft<true>(Position& pos, Depth depth);
176 /// Search::think() is the external interface to Stockfish's search, and is
177 /// called by the main thread when the program receives the UCI 'go' command. It
178 /// searches from RootPos and at the end prints the "bestmove" to output.
180 void Search::think() {
182 TimeMgr.init(Limits, RootPos.game_ply(), RootPos.side_to_move());
184 int cf = Options["Contempt"] * PawnValueEg / 100; // From centipawns
185 DrawValue[ RootPos.side_to_move()] = VALUE_DRAW - Value(cf);
186 DrawValue[~RootPos.side_to_move()] = VALUE_DRAW + Value(cf);
188 if (RootMoves.empty())
190 RootMoves.push_back(MOVE_NONE);
191 sync_cout << "info depth 0 score "
192 << UCI::format_value(RootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
197 for (size_t i = 0; i < Threads.size(); ++i)
198 Threads[i]->maxPly = 0;
200 Threads.timer->run = true;
201 Threads.timer->notify_one(); // Wake up the recurring timer
203 id_loop(RootPos); // Let's start searching !
205 Threads.timer->run = false;
208 // When we reach the maximum depth, we can arrive here without a raise of
209 // Signals.stop. However, if we are pondering or in an infinite search,
210 // the UCI protocol states that we shouldn't print the best move before the
211 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
212 // until the GUI sends one of those commands (which also raises Signals.stop).
213 if (!Signals.stop && (Limits.ponder || Limits.infinite))
215 Signals.stopOnPonderhit = true;
216 RootPos.this_thread()->wait_for(Signals.stop);
219 sync_cout << "bestmove " << UCI::format_move(RootMoves[0].pv[0], RootPos.is_chess960())
220 << " ponder " << UCI::format_move(RootMoves[0].pv[1], RootPos.is_chess960())
227 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
228 // with increasing depth until the allocated thinking time has been consumed,
229 // user stops the search, or the maximum search depth is reached.
231 void id_loop(Position& pos) {
233 Stack stack[MAX_PLY+4], *ss = stack+2; // To allow referencing (ss-2) and (ss+2)
235 Value bestValue, alpha, beta, delta;
237 std::memset(ss-2, 0, 5 * sizeof(Stack));
241 bestValue = delta = alpha = -VALUE_INFINITE;
242 beta = VALUE_INFINITE;
247 Countermoves.clear();
248 Followupmoves.clear();
250 size_t multiPV = Options["MultiPV"];
251 Skill skill(Options["Skill Level"], RootMoves.size());
253 // Do we have to play with skill handicap? In this case enable MultiPV search
254 // that we will use behind the scenes to retrieve a set of possible moves.
255 multiPV = std::max(multiPV, skill.candidates_size());
257 // Iterative deepening loop until requested to stop or target depth reached
258 while (++depth < DEPTH_MAX && !Signals.stop && (!Limits.depth || depth <= Limits.depth))
260 // Age out PV variability metric
261 BestMoveChanges *= 0.5;
263 // Save the last iteration's scores before first PV line is searched and
264 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
265 for (size_t i = 0; i < RootMoves.size(); ++i)
266 RootMoves[i].prevScore = RootMoves[i].score;
268 // MultiPV loop. We perform a full root search for each PV line
269 for (PVIdx = 0; PVIdx < std::min(multiPV, RootMoves.size()) && !Signals.stop; ++PVIdx)
271 // Reset aspiration window starting size
272 if (depth >= 5 * ONE_PLY)
275 alpha = std::max(RootMoves[PVIdx].prevScore - delta,-VALUE_INFINITE);
276 beta = std::min(RootMoves[PVIdx].prevScore + delta, VALUE_INFINITE);
279 // Start with a small aspiration window and, in the case of a fail
280 // high/low, re-search with a bigger window until we're not failing
284 bestValue = search<Root, false>(pos, ss, alpha, beta, depth, false);
286 // Bring the best move to the front. It is critical that sorting
287 // is done with a stable algorithm because all the values but the
288 // first and eventually the new best one are set to -VALUE_INFINITE
289 // and we want to keep the same order for all the moves except the
290 // new PV that goes to the front. Note that in case of MultiPV
291 // search the already searched PV lines are preserved.
292 std::stable_sort(RootMoves.begin() + PVIdx, RootMoves.end());
294 // Write PV back to transposition table in case the relevant
295 // entries have been overwritten during the search.
296 for (size_t i = 0; i <= PVIdx; ++i)
297 RootMoves[i].insert_pv_in_tt(pos);
299 // If search has been stopped break immediately. Sorting and
300 // writing PV back to TT is safe because RootMoves is still
301 // valid, although it refers to previous iteration.
305 // When failing high/low give some update (without cluttering
306 // the UI) before a re-search.
307 if ( (bestValue <= alpha || bestValue >= beta)
308 && Time::now() - SearchTime > 3000)
309 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
311 // In case of failing low/high increase aspiration window and
312 // re-search, otherwise exit the loop.
313 if (bestValue <= alpha)
315 beta = (alpha + beta) / 2;
316 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
318 Signals.failedLowAtRoot = true;
319 Signals.stopOnPonderhit = false;
321 else if (bestValue >= beta)
323 alpha = (alpha + beta) / 2;
324 beta = std::min(bestValue + delta, VALUE_INFINITE);
331 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
334 // Sort the PV lines searched so far and update the GUI
335 std::stable_sort(RootMoves.begin(), RootMoves.begin() + PVIdx + 1);
338 sync_cout << "info nodes " << RootPos.nodes_searched()
339 << " time " << Time::now() - SearchTime << sync_endl;
341 else if ( PVIdx + 1 == std::min(multiPV, RootMoves.size())
342 || Time::now() - SearchTime > 3000)
343 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
346 // If skill levels are enabled and time is up, pick a sub-optimal best move
347 if (skill.candidates_size() && skill.time_to_pick(depth))
350 // Have we found a "mate in x"?
352 && bestValue >= VALUE_MATE_IN_MAX_PLY
353 && VALUE_MATE - bestValue <= 2 * Limits.mate)
356 // Do we have time for the next iteration? Can we stop searching now?
357 if (Limits.use_time_management() && !Signals.stop && !Signals.stopOnPonderhit)
359 // Take some extra time if the best move has changed
360 if (depth > 4 * ONE_PLY && multiPV == 1)
361 TimeMgr.pv_instability(BestMoveChanges);
363 // Stop the search if only one legal move is available or all
364 // of the available time has been used.
365 if ( RootMoves.size() == 1
366 || Time::now() - SearchTime > TimeMgr.available_time())
368 // If we are allowed to ponder do not stop the search now but
369 // keep pondering until the GUI sends "ponderhit" or "stop".
371 Signals.stopOnPonderhit = true;
380 // search<>() is the main search function for both PV and non-PV nodes and for
381 // normal and SplitPoint nodes. When called just after a split point the search
382 // is simpler because we have already probed the hash table, done a null move
383 // search, and searched the first move before splitting, so we don't have to
384 // repeat all this work again. We also don't need to store anything to the hash
385 // table here: This is taken care of after we return from the split point.
387 template <NodeType NT, bool SpNode>
388 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
390 const bool RootNode = NT == Root;
391 const bool PvNode = NT == PV || NT == Root;
393 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
394 assert(PvNode || (alpha == beta - 1));
395 assert(depth > DEPTH_ZERO);
398 Move quietsSearched[64];
401 SplitPoint* splitPoint;
403 Move ttMove, move, excludedMove, bestMove;
404 Depth ext, newDepth, predictedDepth;
405 Value bestValue, value, ttValue, eval, nullValue, futilityValue;
406 bool inCheck, givesCheck, singularExtensionNode, improving;
407 bool captureOrPromotion, dangerous, doFullDepthSearch;
408 int moveCount, quietCount;
410 // Step 1. Initialize node
411 Thread* thisThread = pos.this_thread();
412 inCheck = pos.checkers();
416 splitPoint = ss->splitPoint;
417 bestMove = splitPoint->bestMove;
418 bestValue = splitPoint->bestValue;
420 ttMove = excludedMove = MOVE_NONE;
421 ttValue = VALUE_NONE;
423 assert(splitPoint->bestValue > -VALUE_INFINITE && splitPoint->moveCount > 0);
428 moveCount = quietCount = 0;
429 bestValue = -VALUE_INFINITE;
430 ss->ply = (ss-1)->ply + 1;
432 // Used to send selDepth info to GUI
433 if (PvNode && thisThread->maxPly < ss->ply)
434 thisThread->maxPly = ss->ply;
438 // Step 2. Check for aborted search and immediate draw
439 if (Signals.stop || pos.is_draw() || ss->ply >= MAX_PLY)
440 return ss->ply >= MAX_PLY && !inCheck ? evaluate(pos) : DrawValue[pos.side_to_move()];
442 // Step 3. Mate distance pruning. Even if we mate at the next move our score
443 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
444 // a shorter mate was found upward in the tree then there is no need to search
445 // because we will never beat the current alpha. Same logic but with reversed
446 // signs applies also in the opposite condition of being mated instead of giving
447 // mate. In this case return a fail-high score.
448 alpha = std::max(mated_in(ss->ply), alpha);
449 beta = std::min(mate_in(ss->ply+1), beta);
454 assert(0 <= ss->ply && ss->ply < MAX_PLY);
456 ss->currentMove = ss->ttMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
457 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
458 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
460 // Step 4. Transposition table lookup
461 // We don't want the score of a partial search to overwrite a previous full search
462 // TT value, so we use a different position key in case of an excluded move.
463 excludedMove = ss->excludedMove;
464 posKey = excludedMove ? pos.exclusion_key() : pos.key();
465 tte = TT.probe(posKey);
466 ss->ttMove = ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
467 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
469 // At PV nodes we check for exact scores, whilst at non-PV nodes we check for
470 // a fail high/low. The biggest advantage to probing at PV nodes is to have a
471 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
472 // we should also update RootMoveList to avoid bogus output.
475 && tte->depth() >= depth
476 && ttValue != VALUE_NONE // Only in case of TT access race
477 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
478 : (tte->bound() & BOUND_UPPER)))
480 ss->currentMove = ttMove; // Can be MOVE_NONE
482 // If ttMove is quiet, update killers, history, counter move and followup move on TT hit
483 if (ttValue >= beta && ttMove && !pos.capture_or_promotion(ttMove) && !inCheck)
484 update_stats(pos, ss, ttMove, depth, NULL, 0);
489 // Step 5. Evaluate the position statically and update parent's gain statistics
492 ss->staticEval = eval = VALUE_NONE;
498 // Never assume anything on values stored in TT
499 if ((ss->staticEval = eval = tte->eval_value()) == VALUE_NONE)
500 eval = ss->staticEval = evaluate(pos);
502 // Can ttValue be used as a better position evaluation?
503 if (ttValue != VALUE_NONE)
504 if (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER))
509 eval = ss->staticEval =
510 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos) : -(ss-1)->staticEval + 2 * Eval::Tempo;
512 TT.store(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE, ss->staticEval);
515 if ( !pos.captured_piece_type()
516 && ss->staticEval != VALUE_NONE
517 && (ss-1)->staticEval != VALUE_NONE
518 && (move = (ss-1)->currentMove) != MOVE_NULL
520 && type_of(move) == NORMAL)
522 Square to = to_sq(move);
523 Gains.update(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
526 // Step 6. Razoring (skipped when in check)
528 && depth < 4 * ONE_PLY
529 && eval + razor_margin(depth) <= alpha
530 && ttMove == MOVE_NONE
531 && !pos.pawn_on_7th(pos.side_to_move()))
533 if ( depth <= ONE_PLY
534 && eval + razor_margin(3 * ONE_PLY) <= alpha)
535 return qsearch<NonPV, false>(pos, ss, alpha, beta, DEPTH_ZERO);
537 Value ralpha = alpha - razor_margin(depth);
538 Value v = qsearch<NonPV, false>(pos, ss, ralpha, ralpha+1, DEPTH_ZERO);
543 // Step 7. Futility pruning: child node (skipped when in check)
546 && depth < 7 * ONE_PLY
547 && eval - futility_margin(depth) >= beta
548 && eval < VALUE_KNOWN_WIN // Do not return unproven wins
549 && pos.non_pawn_material(pos.side_to_move()))
550 return eval - futility_margin(depth);
552 // Step 8. Null move search with verification search (is omitted in PV nodes)
555 && depth >= 2 * ONE_PLY
557 && pos.non_pawn_material(pos.side_to_move()))
559 ss->currentMove = MOVE_NULL;
561 assert(eval - beta >= 0);
563 // Null move dynamic reduction based on depth and value
564 Depth R = (3 + depth / 4 + std::min(int(eval - beta) / PawnValueMg, 3)) * ONE_PLY;
566 pos.do_null_move(st);
567 (ss+1)->skipNullMove = true;
568 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -beta+1, DEPTH_ZERO)
569 : - search<NonPV, false>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
570 (ss+1)->skipNullMove = false;
571 pos.undo_null_move();
573 if (nullValue >= beta)
575 // Do not return unproven mate scores
576 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
579 if (depth < 12 * ONE_PLY && abs(beta) < VALUE_KNOWN_WIN)
582 // Do verification search at high depths
583 ss->skipNullMove = true;
584 Value v = depth-R < ONE_PLY ? qsearch<NonPV, false>(pos, ss, beta-1, beta, DEPTH_ZERO)
585 : search<NonPV, false>(pos, ss, beta-1, beta, depth-R, false);
586 ss->skipNullMove = false;
593 // Step 9. ProbCut (skipped when in check)
594 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
595 // and a reduced search returns a value much above beta, we can (almost) safely
596 // prune the previous move.
598 && depth >= 5 * ONE_PLY
600 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
602 Value rbeta = std::min(beta + 200, VALUE_INFINITE);
603 Depth rdepth = depth - 4 * ONE_PLY;
605 assert(rdepth >= ONE_PLY);
606 assert((ss-1)->currentMove != MOVE_NONE);
607 assert((ss-1)->currentMove != MOVE_NULL);
609 MovePicker mp(pos, ttMove, History, pos.captured_piece_type());
612 while ((move = mp.next_move<false>()) != MOVE_NONE)
613 if (pos.legal(move, ci.pinned))
615 ss->currentMove = move;
616 pos.do_move(move, st, ci, pos.gives_check(move, ci));
617 value = -search<NonPV, false>(pos, ss+1, -rbeta, -rbeta+1, rdepth, !cutNode);
624 // Step 10. Internal iterative deepening (skipped when in check)
625 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
627 && (PvNode || ss->staticEval + 256 >= beta))
629 Depth d = 2 * (depth - 2 * ONE_PLY) - (PvNode ? DEPTH_ZERO : depth / 2);
630 ss->skipNullMove = true;
631 search<PvNode ? PV : NonPV, false>(pos, ss, alpha, beta, d / 2, true);
632 ss->skipNullMove = false;
634 tte = TT.probe(posKey);
635 ttMove = tte ? tte->move() : MOVE_NONE;
638 moves_loop: // When in check and at SpNode search starts from here
640 Square prevMoveSq = to_sq((ss-1)->currentMove);
641 Move countermoves[] = { Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].first,
642 Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].second };
644 Square prevOwnMoveSq = to_sq((ss-2)->currentMove);
645 Move followupmoves[] = { Followupmoves[pos.piece_on(prevOwnMoveSq)][prevOwnMoveSq].first,
646 Followupmoves[pos.piece_on(prevOwnMoveSq)][prevOwnMoveSq].second };
648 MovePicker mp(pos, ttMove, depth, History, countermoves, followupmoves, ss);
650 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
651 improving = ss->staticEval >= (ss-2)->staticEval
652 || ss->staticEval == VALUE_NONE
653 ||(ss-2)->staticEval == VALUE_NONE;
655 singularExtensionNode = !RootNode
657 && depth >= 8 * ONE_PLY
658 && ttMove != MOVE_NONE
659 /* && ttValue != VALUE_NONE Already implicit in the next condition */
660 && abs(ttValue) < VALUE_KNOWN_WIN
661 && !excludedMove // Recursive singular search is not allowed
662 && (tte->bound() & BOUND_LOWER)
663 && tte->depth() >= depth - 3 * ONE_PLY;
665 // Step 11. Loop through moves
666 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
667 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
671 if (move == excludedMove)
674 // At root obey the "searchmoves" option and skip moves not listed in Root
675 // Move List. As a consequence any illegal move is also skipped. In MultiPV
676 // mode we also skip PV moves which have been already searched.
677 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
682 // Shared counter cannot be decremented later if the move turns out to be illegal
683 if (!pos.legal(move, ci.pinned))
686 moveCount = ++splitPoint->moveCount;
687 splitPoint->mutex.unlock();
694 Signals.firstRootMove = (moveCount == 1);
696 if (thisThread == Threads.main() && Time::now() - SearchTime > 3000)
697 sync_cout << "info depth " << depth
698 << " currmove " << UCI::format_move(move, pos.is_chess960())
699 << " currmovenumber " << moveCount + PVIdx << sync_endl;
706 captureOrPromotion = pos.capture_or_promotion(move);
708 givesCheck = type_of(move) == NORMAL && !ci.dcCandidates
709 ? ci.checkSq[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
710 : pos.gives_check(move, ci);
712 dangerous = givesCheck
713 || type_of(move) != NORMAL
714 || pos.advanced_pawn_push(move);
716 // Step 12. Extend checks
717 if (givesCheck && pos.see_sign(move) >= VALUE_ZERO)
720 // Singular extension search. If all moves but one fail low on a search of
721 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
722 // is singular and should be extended. To verify this we do a reduced search
723 // on all the other moves but the ttMove and if the result is lower than
724 // ttValue minus a margin then we extend the ttMove.
725 if ( singularExtensionNode
728 && pos.legal(move, ci.pinned))
730 Value rBeta = ttValue - int(2 * depth);
731 ss->excludedMove = move;
732 ss->skipNullMove = true;
733 value = search<NonPV, false>(pos, ss, rBeta - 1, rBeta, depth / 2, cutNode);
734 ss->skipNullMove = false;
735 ss->excludedMove = MOVE_NONE;
741 // Update the current move (this must be done after singular extension search)
742 newDepth = depth - ONE_PLY + ext;
744 // Step 13. Pruning at shallow depth (exclude PV nodes)
746 && !captureOrPromotion
749 && bestValue > VALUE_MATED_IN_MAX_PLY)
751 // Move count based pruning
752 if ( depth < 16 * ONE_PLY
753 && moveCount >= FutilityMoveCounts[improving][depth])
756 splitPoint->mutex.lock();
761 predictedDepth = newDepth - reduction<PvNode>(improving, depth, moveCount);
763 // Futility pruning: parent node
764 if (predictedDepth < 7 * ONE_PLY)
766 futilityValue = ss->staticEval + futility_margin(predictedDepth)
767 + 128 + Gains[pos.moved_piece(move)][to_sq(move)];
769 if (futilityValue <= alpha)
771 bestValue = std::max(bestValue, futilityValue);
775 splitPoint->mutex.lock();
776 if (bestValue > splitPoint->bestValue)
777 splitPoint->bestValue = bestValue;
783 // Prune moves with negative SEE at low depths
784 if (predictedDepth < 4 * ONE_PLY && pos.see_sign(move) < VALUE_ZERO)
787 splitPoint->mutex.lock();
793 // Speculative prefetch as early as possible
794 prefetch((char*)TT.first_entry(pos.key_after(move)));
796 // Check for legality just before making the move
797 if (!RootNode && !SpNode && !pos.legal(move, ci.pinned))
803 ss->currentMove = move;
804 if (!SpNode && !captureOrPromotion && quietCount < 64)
805 quietsSearched[quietCount++] = move;
807 // Step 14. Make the move
808 pos.do_move(move, st, ci, givesCheck);
810 // Step 15. Reduced depth search (LMR). If the move fails high it will be
811 // re-searched at full depth.
812 if ( depth >= 3 * ONE_PLY
814 && !captureOrPromotion
815 && move != ss->killers[0]
816 && move != ss->killers[1])
818 ss->reduction = reduction<PvNode>(improving, depth, moveCount);
820 if ( (!PvNode && cutNode)
821 || History[pos.piece_on(to_sq(move))][to_sq(move)] < 0)
822 ss->reduction += ONE_PLY;
824 if (move == countermoves[0] || move == countermoves[1])
825 ss->reduction = std::max(DEPTH_ZERO, ss->reduction - ONE_PLY);
827 // Decrease reduction for moves that escape a capture
829 && type_of(move) == NORMAL
830 && type_of(pos.piece_on(to_sq(move))) != PAWN
831 && pos.see(make_move(to_sq(move), from_sq(move))) < 0)
832 ss->reduction = std::max(DEPTH_ZERO, ss->reduction - ONE_PLY);
834 Depth d = std::max(newDepth - ss->reduction, ONE_PLY);
836 alpha = splitPoint->alpha;
838 value = -search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, d, true);
840 // Re-search at intermediate depth if reduction is very high
841 if (value > alpha && ss->reduction >= 4 * ONE_PLY)
843 Depth d2 = std::max(newDepth - 2 * ONE_PLY, ONE_PLY);
844 value = -search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, d2, true);
847 doFullDepthSearch = (value > alpha && ss->reduction != DEPTH_ZERO);
848 ss->reduction = DEPTH_ZERO;
851 doFullDepthSearch = !PvNode || moveCount > 1;
853 // Step 16. Full depth search, when LMR is skipped or fails high
854 if (doFullDepthSearch)
857 alpha = splitPoint->alpha;
859 value = newDepth < ONE_PLY ?
860 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
861 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
862 : - search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
865 // For PV nodes only, do a full PV search on the first move or after a fail
866 // high (in the latter case search only if value < beta), otherwise let the
867 // parent node fail low with value <= alpha and to try another move.
868 if (PvNode && (moveCount == 1 || (value > alpha && (RootNode || value < beta)))) {
869 pv.pv[0] = MOVE_NONE;
871 value = newDepth < ONE_PLY ?
872 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
873 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
874 : - search<PV, false>(pos, ss+1, -beta, -alpha, newDepth, false);
876 // Step 17. Undo move
879 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
881 // Step 18. Check for new best move
884 splitPoint->mutex.lock();
885 bestValue = splitPoint->bestValue;
886 alpha = splitPoint->alpha;
889 // Finished searching the move. If a stop or a cutoff occurred, the return
890 // value of the search cannot be trusted, and we return immediately without
891 // updating best move, PV and TT.
892 if (Signals.stop || thisThread->cutoff_occurred())
897 RootMove& rm = *std::find(RootMoves.begin(), RootMoves.end(), move);
899 // PV move or new best move ?
900 if (moveCount == 1 || value > alpha)
904 for (int i = 0; (ss+1)->pv && i < MAX_PLY && (ss+1)->pv->pv[i] != MOVE_NONE; ++i)
905 rm.pv.push_back((ss+1)->pv->pv[i]);
907 // We record how often the best move has been changed in each
908 // iteration. This information is used for time management: When
909 // the best move changes frequently, we allocate some more time.
914 // All other moves but the PV are set to the lowest value: this is
915 // not a problem when sorting because the sort is stable and the
916 // move position in the list is preserved - just the PV is pushed up.
917 rm.score = -VALUE_INFINITE;
920 if (value > bestValue)
922 bestValue = SpNode ? splitPoint->bestValue = value : value;
926 bestMove = SpNode ? splitPoint->bestMove = move : move;
929 ss->pv->update(move, (ss+1)->pv);
931 splitPoint->ss->pv->update(move, (ss+1)->pv);
934 if (PvNode && value < beta) // Update alpha! Always alpha < beta
935 alpha = SpNode ? splitPoint->alpha = value : value;
938 assert(value >= beta); // Fail high
941 splitPoint->cutoff = true;
948 // Step 19. Check for splitting the search
950 && Threads.size() >= 2
951 && depth >= Threads.minimumSplitDepth
952 && ( !thisThread->activeSplitPoint
953 || !thisThread->activeSplitPoint->allSlavesSearching)
954 && thisThread->splitPointsSize < MAX_SPLITPOINTS_PER_THREAD)
956 assert(bestValue > -VALUE_INFINITE && bestValue < beta);
958 thisThread->split(pos, ss, alpha, beta, &bestValue, &bestMove,
959 depth, moveCount, &mp, NT, cutNode);
961 if (Signals.stop || thisThread->cutoff_occurred())
964 if (bestValue >= beta)
972 // Following condition would detect a stop or a cutoff set only after move
973 // loop has been completed. But in this case bestValue is valid because we
974 // have fully searched our subtree, and we can anyhow save the result in TT.
976 if (Signals.stop || thisThread->cutoff_occurred())
980 // Step 20. Check for mate and stalemate
981 // All legal moves have been searched and if there are no legal moves, it
982 // must be mate or stalemate. If we are in a singular extension search then
983 // return a fail low score.
985 bestValue = excludedMove ? alpha
986 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
988 // Quiet best move: update killers, history, countermoves and followupmoves
989 else if (bestValue >= beta && !pos.capture_or_promotion(bestMove) && !inCheck)
990 update_stats(pos, ss, bestMove, depth, quietsSearched, quietCount - 1);
992 TT.store(posKey, value_to_tt(bestValue, ss->ply),
993 bestValue >= beta ? BOUND_LOWER :
994 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
995 depth, bestMove, ss->staticEval);
997 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1003 // qsearch() is the quiescence search function, which is called by the main
1004 // search function when the remaining depth is zero (or, to be more precise,
1005 // less than ONE_PLY).
1007 template <NodeType NT, bool InCheck>
1008 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1010 const bool PvNode = NT == PV;
1012 assert(NT == PV || NT == NonPV);
1013 assert(InCheck == !!pos.checkers());
1014 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1015 assert(PvNode || (alpha == beta - 1));
1016 assert(depth <= DEPTH_ZERO);
1022 Move ttMove, move, bestMove;
1023 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1024 bool givesCheck, evasionPrunable;
1028 // To flag BOUND_EXACT a node with eval above alpha and no available moves
1032 ss->pv->pv[0] = MOVE_NONE;
1035 ss->currentMove = bestMove = MOVE_NONE;
1036 ss->ply = (ss-1)->ply + 1;
1038 // Check for an instant draw or if the maximum ply has been reached
1039 if (pos.is_draw() || ss->ply >= MAX_PLY)
1040 return ss->ply >= MAX_PLY && !InCheck ? evaluate(pos) : DrawValue[pos.side_to_move()];
1042 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1044 // Decide whether or not to include checks: this fixes also the type of
1045 // TT entry depth that we are going to use. Note that in qsearch we use
1046 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1047 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1048 : DEPTH_QS_NO_CHECKS;
1050 // Transposition table lookup
1052 tte = TT.probe(posKey);
1053 ttMove = tte ? tte->move() : MOVE_NONE;
1054 ttValue = tte ? value_from_tt(tte->value(),ss->ply) : VALUE_NONE;
1058 && tte->depth() >= ttDepth
1059 && ttValue != VALUE_NONE // Only in case of TT access race
1060 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1061 : (tte->bound() & BOUND_UPPER)))
1063 ss->currentMove = ttMove; // Can be MOVE_NONE
1067 // Evaluate the position statically
1070 ss->staticEval = VALUE_NONE;
1071 bestValue = futilityBase = -VALUE_INFINITE;
1077 // Never assume anything on values stored in TT
1078 if ((ss->staticEval = bestValue = tte->eval_value()) == VALUE_NONE)
1079 ss->staticEval = bestValue = evaluate(pos);
1081 // Can ttValue be used as a better position evaluation?
1082 if (ttValue != VALUE_NONE)
1083 if (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER))
1084 bestValue = ttValue;
1087 ss->staticEval = bestValue =
1088 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos) : -(ss-1)->staticEval + 2 * Eval::Tempo;
1090 // Stand pat. Return immediately if static value is at least beta
1091 if (bestValue >= beta)
1094 TT.store(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1095 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1100 if (PvNode && bestValue > alpha)
1103 futilityBase = bestValue + 128;
1106 // Initialize a MovePicker object for the current position, and prepare
1107 // to search the moves. Because the depth is <= 0 here, only captures,
1108 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1110 MovePicker mp(pos, ttMove, depth, History, to_sq((ss-1)->currentMove));
1113 // Loop through the moves until no moves remain or a beta cutoff occurs
1114 while ((move = mp.next_move<false>()) != MOVE_NONE)
1116 assert(is_ok(move));
1118 givesCheck = type_of(move) == NORMAL && !ci.dcCandidates
1119 ? ci.checkSq[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
1120 : pos.gives_check(move, ci);
1126 && futilityBase > -VALUE_KNOWN_WIN
1127 && !pos.advanced_pawn_push(move))
1129 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1131 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1133 if (futilityValue < beta)
1135 bestValue = std::max(bestValue, futilityValue);
1139 if (futilityBase < beta && pos.see(move) <= VALUE_ZERO)
1141 bestValue = std::max(bestValue, futilityBase);
1146 // Detect non-capture evasions that are candidates to be pruned
1147 evasionPrunable = InCheck
1148 && bestValue > VALUE_MATED_IN_MAX_PLY
1149 && !pos.capture(move)
1150 && !pos.can_castle(pos.side_to_move());
1152 // Don't search moves with negative SEE values
1154 && (!InCheck || evasionPrunable)
1155 && type_of(move) != PROMOTION
1156 && pos.see_sign(move) < VALUE_ZERO)
1159 // Speculative prefetch as early as possible
1160 prefetch((char*)TT.first_entry(pos.key_after(move)));
1162 // Check for legality just before making the move
1163 if (!pos.legal(move, ci.pinned))
1166 ss->currentMove = move;
1168 // Make and search the move
1169 pos.do_move(move, st, ci, givesCheck);
1170 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1171 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1172 pos.undo_move(move);
1174 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1176 // Check for new best move
1177 if (value > bestValue)
1184 ss->pv->update(move, &pv);
1186 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1193 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1194 ttDepth, move, ss->staticEval);
1202 // All legal moves have been searched. A special case: If we're in check
1203 // and no legal moves were found, it is checkmate.
1204 if (InCheck && bestValue == -VALUE_INFINITE)
1205 return mated_in(ss->ply); // Plies to mate from the root
1207 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1208 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1209 ttDepth, bestMove, ss->staticEval);
1211 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1217 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1218 // "plies to mate from the current position". Non-mate scores are unchanged.
1219 // The function is called before storing a value in the transposition table.
1221 Value value_to_tt(Value v, int ply) {
1223 assert(v != VALUE_NONE);
1225 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1226 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1230 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1231 // from the transposition table (which refers to the plies to mate/be mated
1232 // from current position) to "plies to mate/be mated from the root".
1234 Value value_from_tt(Value v, int ply) {
1236 return v == VALUE_NONE ? VALUE_NONE
1237 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1238 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1242 // update_stats() updates killers, history, countermoves and followupmoves stats after a fail-high
1245 void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt) {
1247 if (ss->killers[0] != move)
1249 ss->killers[1] = ss->killers[0];
1250 ss->killers[0] = move;
1253 // Increase history value of the cut-off move and decrease all the other
1254 // played quiet moves.
1255 Value bonus = Value(int(depth) * int(depth));
1256 History.update(pos.moved_piece(move), to_sq(move), bonus);
1257 for (int i = 0; i < quietsCnt; ++i)
1260 History.update(pos.moved_piece(m), to_sq(m), -bonus);
1263 if (is_ok((ss-1)->currentMove))
1265 Square prevMoveSq = to_sq((ss-1)->currentMove);
1266 Countermoves.update(pos.piece_on(prevMoveSq), prevMoveSq, move);
1269 if (is_ok((ss-2)->currentMove) && (ss-1)->currentMove == (ss-1)->ttMove)
1271 Square prevOwnMoveSq = to_sq((ss-2)->currentMove);
1272 Followupmoves.update(pos.piece_on(prevOwnMoveSq), prevOwnMoveSq, move);
1277 // When playing with a strength handicap, choose best move among the first 'candidates'
1278 // RootMoves using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1280 Move Skill::pick_move() {
1284 // PRNG sequence should be not deterministic
1285 for (int i = Time::now() % 50; i > 0; --i)
1286 rk.rand<unsigned>();
1288 // RootMoves are already sorted by score in descending order
1289 int variance = std::min(RootMoves[0].score - RootMoves[candidates - 1].score, PawnValueMg);
1290 int weakness = 120 - 2 * level;
1291 int max_s = -VALUE_INFINITE;
1294 // Choose best move. For each move score we add two terms both dependent on
1295 // weakness. One deterministic and bigger for weaker moves, and one random,
1296 // then we choose the move with the resulting highest score.
1297 for (size_t i = 0; i < candidates; ++i)
1299 int s = RootMoves[i].score;
1301 // Don't allow crazy blunders even at very low skills
1302 if (i > 0 && RootMoves[i - 1].score > s + 2 * PawnValueMg)
1305 // This is our magic formula
1306 s += ( weakness * int(RootMoves[0].score - s)
1307 + variance * (rk.rand<unsigned>() % weakness)) / 128;
1312 best = RootMoves[i].pv[0];
1319 // uci_pv() formats PV information according to the UCI protocol. UCI
1320 // requires that all (if any) unsearched PV lines are sent using a previous
1323 string uci_pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1325 std::stringstream ss;
1326 Time::point elapsed = Time::now() - SearchTime + 1;
1327 size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
1330 for (size_t i = 0; i < Threads.size(); ++i)
1331 if (Threads[i]->maxPly > selDepth)
1332 selDepth = Threads[i]->maxPly;
1334 for (size_t i = 0; i < uciPVSize; ++i)
1336 bool updated = (i <= PVIdx);
1338 if (depth == 1 && !updated)
1341 Depth d = updated ? depth : depth - ONE_PLY;
1342 Value v = updated ? RootMoves[i].score : RootMoves[i].prevScore;
1344 if (ss.rdbuf()->in_avail()) // Not at first line
1347 ss << "info depth " << d / ONE_PLY
1348 << " seldepth " << selDepth
1349 << " multipv " << i + 1
1350 << " score " << (i == PVIdx ? UCI::format_value(v, alpha, beta) : UCI::format_value(v))
1351 << " nodes " << pos.nodes_searched()
1352 << " nps " << pos.nodes_searched() * 1000 / elapsed
1353 << " time " << elapsed
1356 for (size_t j = 0; j < RootMoves[i].pv.size(); ++j)
1357 ss << " " << UCI::format_move(RootMoves[i].pv[j], pos.is_chess960());
1366 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1367 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1368 /// first, even if the old TT entries have been overwritten.
1370 void RootMove::insert_pv_in_tt(Position& pos) {
1372 StateInfo state[MAX_PLY], *st = state;
1376 for (; idx < int(pv.size()); ++idx) {
1377 tte = TT.probe(pos.key());
1379 if (!tte || tte->move() != pv[idx]) // Don't overwrite correct entries
1380 TT.store(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[idx], VALUE_NONE);
1382 assert(MoveList<LEGAL>(pos).contains(pv[idx]));
1383 pos.do_move(pv[idx], *st++);
1386 while (idx) pos.undo_move(pv[--idx]);
1390 /// Thread::idle_loop() is where the thread is parked when it has no work to do
1392 void Thread::idle_loop() {
1394 // Pointer 'this_sp' is not null only if we are called from split(), and not
1395 // at the thread creation. This means we are the split point's master.
1396 SplitPoint* this_sp = splitPointsSize ? activeSplitPoint : NULL;
1398 assert(!this_sp || (this_sp->masterThread == this && searching));
1402 // If this thread has been assigned work, launch a search
1405 Threads.mutex.lock();
1407 assert(activeSplitPoint);
1408 SplitPoint* sp = activeSplitPoint;
1410 Threads.mutex.unlock();
1412 Stack stack[MAX_PLY+4], *ss = stack+2; // To allow referencing (ss-2) and (ss+2)
1413 Position pos(*sp->pos, this);
1415 std::memcpy(ss-2, sp->ss-2, 5 * sizeof(Stack));
1416 ss->splitPoint = sp;
1420 assert(activePosition == NULL);
1422 activePosition = &pos;
1424 if (sp->nodeType == NonPV)
1425 search<NonPV, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1427 else if (sp->nodeType == PV)
1428 search<PV, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1430 else if (sp->nodeType == Root)
1431 search<Root, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1439 activePosition = NULL;
1440 sp->slavesMask.reset(idx);
1441 sp->allSlavesSearching = false;
1442 sp->nodes += pos.nodes_searched();
1444 // Wake up the master thread so to allow it to return from the idle
1445 // loop in case we are the last slave of the split point.
1446 if ( this != sp->masterThread
1447 && sp->slavesMask.none())
1449 assert(!sp->masterThread->searching);
1450 sp->masterThread->notify_one();
1453 // After releasing the lock we can't access any SplitPoint related data
1454 // in a safe way because it could have been released under our feet by
1458 // Try to late join to another split point if none of its slaves has
1459 // already finished.
1460 if (Threads.size() > 2)
1461 for (size_t i = 0; i < Threads.size(); ++i)
1463 const int size = Threads[i]->splitPointsSize; // Local copy
1464 sp = size ? &Threads[i]->splitPoints[size - 1] : NULL;
1467 && sp->allSlavesSearching
1468 && available_to(Threads[i]))
1470 // Recheck the conditions under lock protection
1471 Threads.mutex.lock();
1474 if ( sp->allSlavesSearching
1475 && available_to(Threads[i]))
1477 sp->slavesMask.set(idx);
1478 activeSplitPoint = sp;
1483 Threads.mutex.unlock();
1485 break; // Just a single attempt
1490 // Grab the lock to avoid races with Thread::notify_one()
1493 // If we are master and all slaves have finished then exit idle_loop
1494 if (this_sp && this_sp->slavesMask.none())
1501 // If we are not searching, wait for a condition to be signaled instead of
1502 // wasting CPU time polling for work.
1503 if (!searching && !exit)
1504 sleepCondition.wait(mutex);
1511 /// check_time() is called by the timer thread when the timer triggers. It is
1512 /// used to print debug info and, more importantly, to detect when we are out of
1513 /// available time and thus stop the search.
1517 static Time::point lastInfoTime = Time::now();
1518 Time::point elapsed = Time::now() - SearchTime;
1520 if (Time::now() - lastInfoTime >= 1000)
1522 lastInfoTime = Time::now();
1526 if (Limits.use_time_management() && !Limits.ponder)
1528 bool stillAtFirstMove = Signals.firstRootMove
1529 && !Signals.failedLowAtRoot
1530 && elapsed > TimeMgr.available_time() * 75 / 100;
1532 if ( stillAtFirstMove
1533 || elapsed > TimeMgr.maximum_time() - 2 * TimerThread::Resolution)
1534 Signals.stop = true;
1536 else if (Limits.movetime && elapsed >= Limits.movetime)
1537 Signals.stop = true;
1539 else if (Limits.nodes)
1541 Threads.mutex.lock();
1543 int64_t nodes = RootPos.nodes_searched();
1545 // Loop across all split points and sum accumulated SplitPoint nodes plus
1546 // all the currently active positions nodes.
1547 for (size_t i = 0; i < Threads.size(); ++i)
1548 for (int j = 0; j < Threads[i]->splitPointsSize; ++j)
1550 SplitPoint& sp = Threads[i]->splitPoints[j];
1556 for (size_t idx = 0; idx < Threads.size(); ++idx)
1557 if (sp.slavesMask.test(idx) && Threads[idx]->activePosition)
1558 nodes += Threads[idx]->activePosition->nodes_searched();
1563 Threads.mutex.unlock();
1565 if (nodes >= Limits.nodes)
1566 Signals.stop = true;