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][32]; // [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, int 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(int depth) const { return depth == 1 + level; }
115 /// Search::init() is called during startup to initialize various lookup tables
117 void Search::init() {
119 int d; // depth (ONE_PLY == 2)
120 int hd; // half depth (ONE_PLY == 1)
123 // Init reductions array
124 for (hd = 1; hd < 64; ++hd) for (mc = 1; mc < 64; ++mc)
126 double pvRed = 0.00 + log(double(hd)) * log(double(mc)) / 3.00;
127 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
129 Reductions[1][1][hd][mc] = int8_t( pvRed >= 1.0 ? pvRed + 0.5: 0);
130 Reductions[0][1][hd][mc] = int8_t(nonPVRed >= 1.0 ? nonPVRed + 0.5: 0);
132 Reductions[1][0][hd][mc] = Reductions[1][1][hd][mc];
133 Reductions[0][0][hd][mc] = Reductions[0][1][hd][mc];
135 if (Reductions[0][0][hd][mc] >= 2)
136 Reductions[0][0][hd][mc] += 1;
139 // Init futility move count array
140 for (d = 0; d < 32; ++d)
142 FutilityMoveCounts[0][d] = int(2.4 + 0.773 * pow(d + 0.00, 1.8));
143 FutilityMoveCounts[1][d] = int(2.9 + 1.045 * pow(d + 0.49, 1.8));
148 /// Search::perft() is our utility to verify move generation. All the leaf nodes
149 /// up to the given depth are generated and counted and the sum returned.
151 uint64_t Search::perft(Position& pos, Depth depth) {
154 uint64_t cnt, nodes = 0;
156 const bool leaf = (depth == 2 * ONE_PLY);
158 for (MoveList<LEGAL> it(pos); *it; ++it)
160 if (Root && depth <= ONE_PLY)
164 pos.do_move(*it, st, ci, pos.gives_check(*it, ci));
165 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - ONE_PLY);
170 sync_cout << UCI::format_move(*it, pos.is_chess960()) << ": " << cnt << sync_endl;
175 template uint64_t Search::perft<true>(Position& pos, Depth depth);
178 /// Search::think() is the external interface to Stockfish's search, and is
179 /// called by the main thread when the program receives the UCI 'go' command. It
180 /// searches from RootPos and at the end prints the "bestmove" to output.
182 void Search::think() {
184 TimeMgr.init(Limits, RootPos.game_ply(), RootPos.side_to_move());
186 int cf = Options["Contempt"] * PawnValueEg / 100; // From centipawns
187 DrawValue[ RootPos.side_to_move()] = VALUE_DRAW - Value(cf);
188 DrawValue[~RootPos.side_to_move()] = VALUE_DRAW + Value(cf);
190 if (RootMoves.empty())
192 RootMoves.push_back(MOVE_NONE);
193 sync_cout << "info depth 0 score "
194 << UCI::format_value(RootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
200 // Reset the threads, still sleeping: will wake up at split time
201 for (size_t i = 0; i < Threads.size(); ++i)
202 Threads[i]->maxPly = 0;
204 Threads.timer->run = true;
205 Threads.timer->notify_one(); // Wake up the recurring timer
207 id_loop(RootPos); // Let's start searching !
209 Threads.timer->run = false; // Stop the timer
213 // When search is stopped this info is not printed
214 sync_cout << "info nodes " << RootPos.nodes_searched()
215 << " time " << Time::now() - SearchTime + 1 << sync_endl;
217 // When we reach the maximum depth, we can arrive here without a raise of
218 // Signals.stop. However, if we are pondering or in an infinite search,
219 // the UCI protocol states that we shouldn't print the best move before the
220 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
221 // until the GUI sends one of those commands (which also raises Signals.stop).
222 if (!Signals.stop && (Limits.ponder || Limits.infinite))
224 Signals.stopOnPonderhit = true;
225 RootPos.this_thread()->wait_for(Signals.stop);
228 // Best move could be MOVE_NONE when searching on a stalemate position
229 sync_cout << "bestmove " << UCI::format_move(RootMoves[0].pv[0], RootPos.is_chess960())
230 << " ponder " << UCI::format_move(RootMoves[0].pv[1], RootPos.is_chess960())
237 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
238 // with increasing depth until the allocated thinking time has been consumed,
239 // user stops the search, or the maximum search depth is reached.
241 void id_loop(Position& pos) {
243 Stack stack[MAX_PLY+4], *ss = stack+2; // To allow referencing (ss-2) and (ss+2)
245 Value bestValue, alpha, beta, delta;
247 std::memset(ss-2, 0, 5 * sizeof(Stack));
251 bestValue = delta = alpha = -VALUE_INFINITE;
252 beta = VALUE_INFINITE;
257 Countermoves.clear();
258 Followupmoves.clear();
260 size_t multiPV = Options["MultiPV"];
261 Skill skill(Options["Skill Level"], RootMoves.size());
263 // Do we have to play with skill handicap? In this case enable MultiPV search
264 // that we will use behind the scenes to retrieve a set of possible moves.
265 multiPV = std::max(multiPV, skill.candidates_size());
267 // Iterative deepening loop until requested to stop or target depth reached
268 while (++depth < MAX_PLY && !Signals.stop && (!Limits.depth || depth <= Limits.depth))
270 // Age out PV variability metric
271 BestMoveChanges *= 0.5;
273 // Save the last iteration's scores before first PV line is searched and
274 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
275 for (size_t i = 0; i < RootMoves.size(); ++i)
276 RootMoves[i].prevScore = RootMoves[i].score;
278 // MultiPV loop. We perform a full root search for each PV line
279 for (PVIdx = 0; PVIdx < std::min(multiPV, RootMoves.size()) && !Signals.stop; ++PVIdx)
281 // Reset aspiration window starting size
285 alpha = std::max(RootMoves[PVIdx].prevScore - delta,-VALUE_INFINITE);
286 beta = std::min(RootMoves[PVIdx].prevScore + delta, VALUE_INFINITE);
289 // Start with a small aspiration window and, in the case of a fail
290 // high/low, re-search with a bigger window until we're not failing
294 bestValue = search<Root, false>(pos, ss, alpha, beta, depth * ONE_PLY, false);
296 // Bring the best move to the front. It is critical that sorting
297 // is done with a stable algorithm because all the values but the
298 // first and eventually the new best one are set to -VALUE_INFINITE
299 // and we want to keep the same order for all the moves except the
300 // new PV that goes to the front. Note that in case of MultiPV
301 // search the already searched PV lines are preserved.
302 std::stable_sort(RootMoves.begin() + PVIdx, RootMoves.end());
304 // Write PV back to transposition table in case the relevant
305 // entries have been overwritten during the search.
306 for (size_t i = 0; i <= PVIdx; ++i)
307 RootMoves[i].insert_pv_in_tt(pos);
309 // If search has been stopped break immediately. Sorting and
310 // writing PV back to TT is safe because RootMoves is still
311 // valid, although it refers to previous iteration.
315 // When failing high/low give some update (without cluttering
316 // the UI) before a re-search.
317 if ( (bestValue <= alpha || bestValue >= beta)
318 && Time::now() - SearchTime > 3000)
319 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
321 // In case of failing low/high increase aspiration window and
322 // re-search, otherwise exit the loop.
323 if (bestValue <= alpha)
325 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
327 Signals.failedLowAtRoot = true;
328 Signals.stopOnPonderhit = false;
330 else if (bestValue >= beta)
331 beta = std::min(bestValue + delta, VALUE_INFINITE);
336 delta += 3 * delta / 8;
338 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
341 // Sort the PV lines searched so far and update the GUI
342 std::stable_sort(RootMoves.begin(), RootMoves.begin() + PVIdx + 1);
345 && ( PVIdx + 1 == std::min(multiPV, RootMoves.size())
346 || Time::now() - SearchTime > 3000))
347 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
350 // If skill levels are enabled and time is up, pick a sub-optimal best move
351 if (skill.candidates_size() && skill.time_to_pick(depth))
354 // Have we found a "mate in x"?
356 && bestValue >= VALUE_MATE_IN_MAX_PLY
357 && VALUE_MATE - bestValue <= 2 * Limits.mate)
360 // Do we have time for the next iteration? Can we stop searching now?
361 if (Limits.use_time_management() && !Signals.stop && !Signals.stopOnPonderhit)
363 // Take some extra time if the best move has changed
364 if (depth > 4 && multiPV == 1)
365 TimeMgr.pv_instability(BestMoveChanges);
367 // Stop the search if only one legal move is available or all
368 // of the available time has been used.
369 if ( RootMoves.size() == 1
370 || Time::now() - SearchTime > TimeMgr.available_time())
372 // If we are allowed to ponder do not stop the search now but
373 // keep pondering until the GUI sends "ponderhit" or "stop".
375 Signals.stopOnPonderhit = true;
384 // search<>() is the main search function for both PV and non-PV nodes and for
385 // normal and SplitPoint nodes. When called just after a split point the search
386 // is simpler because we have already probed the hash table, done a null move
387 // search, and searched the first move before splitting, so we don't have to
388 // repeat all this work again. We also don't need to store anything to the hash
389 // table here: This is taken care of after we return from the split point.
391 template <NodeType NT, bool SpNode>
392 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
394 const bool RootNode = NT == Root;
395 const bool PvNode = NT == PV || NT == Root;
397 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
398 assert(PvNode || (alpha == beta - 1));
399 assert(depth > DEPTH_ZERO);
401 Move quietsSearched[64];
404 SplitPoint* splitPoint;
406 Move ttMove, move, excludedMove, bestMove;
407 Depth ext, newDepth, predictedDepth;
408 Value bestValue, value, ttValue, eval, nullValue, futilityValue;
409 bool inCheck, givesCheck, pvMove, singularExtensionNode, improving;
410 bool captureOrPromotion, dangerous, doFullDepthSearch;
411 int moveCount, quietCount;
413 // Step 1. Initialize node
414 Thread* thisThread = pos.this_thread();
415 inCheck = pos.checkers();
419 splitPoint = ss->splitPoint;
420 bestMove = splitPoint->bestMove;
421 bestValue = splitPoint->bestValue;
423 ttMove = excludedMove = MOVE_NONE;
424 ttValue = VALUE_NONE;
426 assert(splitPoint->bestValue > -VALUE_INFINITE && splitPoint->moveCount > 0);
431 moveCount = quietCount = 0;
432 bestValue = -VALUE_INFINITE;
433 ss->ply = (ss-1)->ply + 1;
435 // Used to send selDepth info to GUI
436 if (PvNode && thisThread->maxPly < ss->ply)
437 thisThread->maxPly = ss->ply;
441 // Step 2. Check for aborted search and immediate draw
442 if (Signals.stop || pos.is_draw() || ss->ply >= MAX_PLY)
443 return ss->ply >= MAX_PLY && !inCheck ? evaluate(pos) : DrawValue[pos.side_to_move()];
445 // Step 3. Mate distance pruning. Even if we mate at the next move our score
446 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
447 // a shorter mate was found upward in the tree then there is no need to search
448 // because we will never beat the current alpha. Same logic but with reversed
449 // signs applies also in the opposite condition of being mated instead of giving
450 // mate. In this case return a fail-high score.
451 alpha = std::max(mated_in(ss->ply), alpha);
452 beta = std::min(mate_in(ss->ply+1), beta);
457 assert(0 <= ss->ply && ss->ply < MAX_PLY);
459 ss->currentMove = ss->ttMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
460 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
461 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
463 // Step 4. Transposition table lookup
464 // We don't want the score of a partial search to overwrite a previous full search
465 // TT value, so we use a different position key in case of an excluded move.
466 excludedMove = ss->excludedMove;
467 posKey = excludedMove ? pos.exclusion_key() : pos.key();
468 tte = TT.probe(posKey);
469 ss->ttMove = ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
470 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
472 // At PV nodes we check for exact scores, whilst at non-PV nodes we check for
473 // a fail high/low. The biggest advantage to probing at PV nodes is to have a
474 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
475 // we should also update RootMoveList to avoid bogus output.
478 && tte->depth() >= depth
479 && ttValue != VALUE_NONE // Only in case of TT access race
480 && ( PvNode ? tte->bound() == BOUND_EXACT
481 : ttValue >= beta ? (tte->bound() & BOUND_LOWER)
482 : (tte->bound() & BOUND_UPPER)))
484 ss->currentMove = ttMove; // Can be MOVE_NONE
486 // If ttMove is quiet, update killers, history, counter move and followup move on TT hit
487 if (ttValue >= beta && ttMove && !pos.capture_or_promotion(ttMove) && !inCheck)
488 update_stats(pos, ss, ttMove, depth, NULL, 0);
493 // Step 5. Evaluate the position statically and update parent's gain statistics
496 ss->staticEval = eval = VALUE_NONE;
502 // Never assume anything on values stored in TT
503 if ((ss->staticEval = eval = tte->eval_value()) == VALUE_NONE)
504 eval = ss->staticEval = evaluate(pos);
506 // Can ttValue be used as a better position evaluation?
507 if (ttValue != VALUE_NONE)
508 if (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER))
513 eval = ss->staticEval =
514 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos) : -(ss-1)->staticEval + 2 * Eval::Tempo;
516 TT.store(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE, ss->staticEval);
519 if ( !pos.captured_piece_type()
520 && ss->staticEval != VALUE_NONE
521 && (ss-1)->staticEval != VALUE_NONE
522 && (move = (ss-1)->currentMove) != MOVE_NULL
524 && type_of(move) == NORMAL)
526 Square to = to_sq(move);
527 Gains.update(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
530 // Step 6. Razoring (skipped when in check)
532 && depth < 4 * ONE_PLY
533 && eval + razor_margin(depth) <= alpha
534 && ttMove == MOVE_NONE
535 && !pos.pawn_on_7th(pos.side_to_move()))
537 if ( depth <= ONE_PLY
538 && eval + razor_margin(3 * ONE_PLY) <= alpha)
539 return qsearch<NonPV, false>(pos, ss, alpha, beta, DEPTH_ZERO);
541 Value ralpha = alpha - razor_margin(depth);
542 Value v = qsearch<NonPV, false>(pos, ss, ralpha, ralpha+1, DEPTH_ZERO);
547 // Step 7. Futility pruning: child node (skipped when in check)
550 && depth < 7 * ONE_PLY
551 && eval - futility_margin(depth) >= beta
552 && eval < VALUE_KNOWN_WIN // Do not return unproven wins
553 && pos.non_pawn_material(pos.side_to_move()))
554 return eval - futility_margin(depth);
556 // Step 8. Null move search with verification search (is omitted in PV nodes)
559 && depth >= 2 * ONE_PLY
561 && pos.non_pawn_material(pos.side_to_move()))
563 ss->currentMove = MOVE_NULL;
565 assert(eval - beta >= 0);
567 // Null move dynamic reduction based on depth and value
568 Depth R = (3 + depth / 4 + std::min(int(eval - beta) / PawnValueMg, 3)) * ONE_PLY;
570 pos.do_null_move(st);
571 (ss+1)->skipNullMove = true;
572 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -beta+1, DEPTH_ZERO)
573 : - search<NonPV, false>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
574 (ss+1)->skipNullMove = false;
575 pos.undo_null_move();
577 if (nullValue >= beta)
579 // Do not return unproven mate scores
580 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
583 if (depth < 12 * ONE_PLY && abs(beta) < VALUE_KNOWN_WIN)
586 // Do verification search at high depths
587 ss->skipNullMove = true;
588 Value v = depth-R < ONE_PLY ? qsearch<NonPV, false>(pos, ss, beta-1, beta, DEPTH_ZERO)
589 : search<NonPV, false>(pos, ss, beta-1, beta, depth-R, false);
590 ss->skipNullMove = false;
597 // Step 9. ProbCut (skipped when in check)
598 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
599 // and a reduced search returns a value much above beta, we can (almost) safely
600 // prune the previous move.
602 && depth >= 5 * ONE_PLY
604 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
606 Value rbeta = std::min(beta + 200, VALUE_INFINITE);
607 Depth rdepth = depth - 4 * ONE_PLY;
609 assert(rdepth >= ONE_PLY);
610 assert((ss-1)->currentMove != MOVE_NONE);
611 assert((ss-1)->currentMove != MOVE_NULL);
613 MovePicker mp(pos, ttMove, History, pos.captured_piece_type());
616 while ((move = mp.next_move<false>()) != MOVE_NONE)
617 if (pos.legal(move, ci.pinned))
619 ss->currentMove = move;
620 pos.do_move(move, st, ci, pos.gives_check(move, ci));
621 value = -search<NonPV, false>(pos, ss+1, -rbeta, -rbeta+1, rdepth, !cutNode);
628 // Step 10. Internal iterative deepening (skipped when in check)
629 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
631 && (PvNode || ss->staticEval + 256 >= beta))
633 Depth d = 2 * (depth - 2 * ONE_PLY) - (PvNode ? DEPTH_ZERO : depth / 2);
634 ss->skipNullMove = true;
635 search<PvNode ? PV : NonPV, false>(pos, ss, alpha, beta, d / 2, true);
636 ss->skipNullMove = false;
638 tte = TT.probe(posKey);
639 ttMove = tte ? tte->move() : MOVE_NONE;
642 moves_loop: // When in check and at SpNode search starts from here
644 Square prevMoveSq = to_sq((ss-1)->currentMove);
645 Move countermoves[] = { Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].first,
646 Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].second };
648 Square prevOwnMoveSq = to_sq((ss-2)->currentMove);
649 Move followupmoves[] = { Followupmoves[pos.piece_on(prevOwnMoveSq)][prevOwnMoveSq].first,
650 Followupmoves[pos.piece_on(prevOwnMoveSq)][prevOwnMoveSq].second };
652 MovePicker mp(pos, ttMove, depth, History, countermoves, followupmoves, ss);
654 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
655 improving = ss->staticEval >= (ss-2)->staticEval
656 || ss->staticEval == VALUE_NONE
657 ||(ss-2)->staticEval == VALUE_NONE;
659 singularExtensionNode = !RootNode
661 && depth >= 8 * ONE_PLY
662 && ttMove != MOVE_NONE
663 /* && ttValue != VALUE_NONE Already implicit in the next condition */
664 && abs(ttValue) < VALUE_KNOWN_WIN
665 && !excludedMove // Recursive singular search is not allowed
666 && (tte->bound() & BOUND_LOWER)
667 && tte->depth() >= depth - 3 * ONE_PLY;
669 // Step 11. Loop through moves
670 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
671 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
675 if (move == excludedMove)
678 // At root obey the "searchmoves" option and skip moves not listed in Root
679 // Move List. As a consequence any illegal move is also skipped. In MultiPV
680 // mode we also skip PV moves which have been already searched.
681 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
686 // Shared counter cannot be decremented later if the move turns out to be illegal
687 if (!pos.legal(move, ci.pinned))
690 moveCount = ++splitPoint->moveCount;
691 splitPoint->mutex.unlock();
698 Signals.firstRootMove = (moveCount == 1);
700 if (thisThread == Threads.main() && Time::now() - SearchTime > 3000)
701 sync_cout << "info depth " << depth
702 << " currmove " << UCI::format_move(move, pos.is_chess960())
703 << " currmovenumber " << moveCount + PVIdx << sync_endl;
707 captureOrPromotion = pos.capture_or_promotion(move);
709 givesCheck = type_of(move) == NORMAL && !ci.dcCandidates
710 ? ci.checkSq[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
711 : pos.gives_check(move, ci);
713 dangerous = givesCheck
714 || type_of(move) != NORMAL
715 || pos.advanced_pawn_push(move);
717 // Step 12. Extend checks
718 if (givesCheck && pos.see_sign(move) >= VALUE_ZERO)
721 // Singular extension search. If all moves but one fail low on a search of
722 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
723 // is singular and should be extended. To verify this we do a reduced search
724 // on all the other moves but the ttMove and if the result is lower than
725 // ttValue minus a margin then we extend the ttMove.
726 if ( singularExtensionNode
729 && pos.legal(move, ci.pinned))
731 Value rBeta = ttValue - int(2 * depth);
732 ss->excludedMove = move;
733 ss->skipNullMove = true;
734 value = search<NonPV, false>(pos, ss, rBeta - 1, rBeta, depth / 2, cutNode);
735 ss->skipNullMove = false;
736 ss->excludedMove = MOVE_NONE;
742 // Update the current move (this must be done after singular extension search)
743 newDepth = depth - ONE_PLY + ext;
745 // Step 13. Pruning at shallow depth (exclude PV nodes)
747 && !captureOrPromotion
750 /* && move != ttMove Already implicit in the next condition */
751 && bestValue > VALUE_MATED_IN_MAX_PLY)
753 // Move count based pruning
754 if ( depth < 16 * ONE_PLY
755 && moveCount >= FutilityMoveCounts[improving][depth])
758 splitPoint->mutex.lock();
763 predictedDepth = newDepth - reduction<PvNode>(improving, depth, moveCount);
765 // Futility pruning: parent node
766 if (predictedDepth < 7 * ONE_PLY)
768 futilityValue = ss->staticEval + futility_margin(predictedDepth)
769 + 128 + Gains[pos.moved_piece(move)][to_sq(move)];
771 if (futilityValue <= alpha)
773 bestValue = std::max(bestValue, futilityValue);
777 splitPoint->mutex.lock();
778 if (bestValue > splitPoint->bestValue)
779 splitPoint->bestValue = bestValue;
785 // Prune moves with negative SEE at low depths
786 if (predictedDepth < 4 * ONE_PLY && pos.see_sign(move) < VALUE_ZERO)
789 splitPoint->mutex.lock();
795 // Speculative prefetch as early as possible
796 prefetch((char*)TT.first_entry(pos.key_after(move)));
798 // Check for legality just before making the move
799 if (!RootNode && !SpNode && !pos.legal(move, ci.pinned))
805 pvMove = PvNode && moveCount == 1;
806 ss->currentMove = move;
807 if (!SpNode && !captureOrPromotion && quietCount < 64)
808 quietsSearched[quietCount++] = move;
810 // Step 14. Make the move
811 pos.do_move(move, st, ci, givesCheck);
813 // Step 15. Reduced depth search (LMR). If the move fails high it will be
814 // re-searched at full depth.
815 if ( depth >= 3 * ONE_PLY
817 && !captureOrPromotion
819 && move != ss->killers[0]
820 && move != ss->killers[1])
822 ss->reduction = reduction<PvNode>(improving, depth, moveCount);
824 if ( (!PvNode && cutNode)
825 || History[pos.piece_on(to_sq(move))][to_sq(move)] < 0)
826 ss->reduction += ONE_PLY;
828 if (move == countermoves[0] || move == countermoves[1])
829 ss->reduction = std::max(DEPTH_ZERO, ss->reduction - ONE_PLY);
831 // Decrease reduction for moves that escape a capture
833 && type_of(move) == NORMAL
834 && type_of(pos.piece_on(to_sq(move))) != PAWN
835 && pos.see(make_move(to_sq(move), from_sq(move))) < 0)
836 ss->reduction = std::max(DEPTH_ZERO, ss->reduction - ONE_PLY);
838 Depth d = std::max(newDepth - ss->reduction, ONE_PLY);
840 alpha = splitPoint->alpha;
842 value = -search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, d, true);
844 // Re-search at intermediate depth if reduction is very high
845 if (value > alpha && ss->reduction >= 4 * ONE_PLY)
847 Depth d2 = std::max(newDepth - 2 * ONE_PLY, ONE_PLY);
848 value = -search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, d2, true);
851 doFullDepthSearch = (value > alpha && ss->reduction != DEPTH_ZERO);
852 ss->reduction = DEPTH_ZERO;
855 doFullDepthSearch = !pvMove;
857 // Step 16. Full depth search, when LMR is skipped or fails high
858 if (doFullDepthSearch)
861 alpha = splitPoint->alpha;
863 value = newDepth < ONE_PLY ?
864 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
865 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
866 : - search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
869 // For PV nodes only, do a full PV search on the first move or after a fail
870 // high (in the latter case search only if value < beta), otherwise let the
871 // parent node fail low with value <= alpha and to try another move.
872 if (PvNode && (pvMove || (value > alpha && (RootNode || value < beta))))
873 value = newDepth < ONE_PLY ?
874 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
875 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
876 : - search<PV, false>(pos, ss+1, -beta, -alpha, newDepth, false);
877 // Step 17. Undo move
880 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
882 // Step 18. Check for new best move
885 splitPoint->mutex.lock();
886 bestValue = splitPoint->bestValue;
887 alpha = splitPoint->alpha;
890 // Finished searching the move. If a stop or a cutoff occurred, the return
891 // value of the search cannot be trusted, and we return immediately without
892 // updating best move, PV and TT.
893 if (Signals.stop || thisThread->cutoff_occurred())
898 RootMove& rm = *std::find(RootMoves.begin(), RootMoves.end(), move);
900 // PV move or new best move ?
901 if (pvMove || value > alpha)
904 rm.extract_pv_from_tt(pos);
906 // We record how often the best move has been changed in each
907 // iteration. This information is used for time management: When
908 // the best move changes frequently, we allocate some more time.
913 // All other moves but the PV are set to the lowest value: this is
914 // not a problem when sorting because the sort is stable and the
915 // move position in the list is preserved - just the PV is pushed up.
916 rm.score = -VALUE_INFINITE;
919 if (value > bestValue)
921 bestValue = SpNode ? splitPoint->bestValue = value : value;
925 bestMove = SpNode ? splitPoint->bestMove = move : move;
927 if (PvNode && value < beta) // Update alpha! Always alpha < beta
928 alpha = SpNode ? splitPoint->alpha = value : value;
931 assert(value >= beta); // Fail high
934 splitPoint->cutoff = true;
941 // Step 19. Check for splitting the search
943 && Threads.size() >= 2
944 && depth >= Threads.minimumSplitDepth
945 && ( !thisThread->activeSplitPoint
946 || !thisThread->activeSplitPoint->allSlavesSearching)
947 && thisThread->splitPointsSize < MAX_SPLITPOINTS_PER_THREAD)
949 assert(bestValue > -VALUE_INFINITE && bestValue < beta);
951 thisThread->split(pos, ss, alpha, beta, &bestValue, &bestMove,
952 depth, moveCount, &mp, NT, cutNode);
954 if (Signals.stop || thisThread->cutoff_occurred())
957 if (bestValue >= beta)
965 // Following condition would detect a stop or a cutoff set only after move
966 // loop has been completed. But in this case bestValue is valid because we
967 // have fully searched our subtree, and we can anyhow save the result in TT.
969 if (Signals.stop || thisThread->cutoff_occurred())
973 // Step 20. Check for mate and stalemate
974 // All legal moves have been searched and if there are no legal moves, it
975 // must be mate or stalemate. If we are in a singular extension search then
976 // return a fail low score.
978 bestValue = excludedMove ? alpha
979 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
981 // Quiet best move: update killers, history, countermoves and followupmoves
982 else if (bestValue >= beta && !pos.capture_or_promotion(bestMove) && !inCheck)
983 update_stats(pos, ss, bestMove, depth, quietsSearched, quietCount - 1);
985 TT.store(posKey, value_to_tt(bestValue, ss->ply),
986 bestValue >= beta ? BOUND_LOWER :
987 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
988 depth, bestMove, ss->staticEval);
990 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
996 // qsearch() is the quiescence search function, which is called by the main
997 // search function when the remaining depth is zero (or, to be more precise,
998 // less than ONE_PLY).
1000 template <NodeType NT, bool InCheck>
1001 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1003 const bool PvNode = NT == PV;
1005 assert(NT == PV || NT == NonPV);
1006 assert(InCheck == !!pos.checkers());
1007 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1008 assert(PvNode || (alpha == beta - 1));
1009 assert(depth <= DEPTH_ZERO);
1014 Move ttMove, move, bestMove;
1015 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1016 bool givesCheck, evasionPrunable;
1019 // To flag BOUND_EXACT a node with eval above alpha and no available moves
1023 ss->currentMove = bestMove = MOVE_NONE;
1024 ss->ply = (ss-1)->ply + 1;
1026 // Check for an instant draw or if the maximum ply has been reached
1027 if (pos.is_draw() || ss->ply >= MAX_PLY)
1028 return ss->ply >= MAX_PLY && !InCheck ? evaluate(pos) : DrawValue[pos.side_to_move()];
1030 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1032 // Decide whether or not to include checks: this fixes also the type of
1033 // TT entry depth that we are going to use. Note that in qsearch we use
1034 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1035 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1036 : DEPTH_QS_NO_CHECKS;
1038 // Transposition table lookup
1040 tte = TT.probe(posKey);
1041 ttMove = tte ? tte->move() : MOVE_NONE;
1042 ttValue = tte ? value_from_tt(tte->value(),ss->ply) : VALUE_NONE;
1045 && tte->depth() >= ttDepth
1046 && ttValue != VALUE_NONE // Only in case of TT access race
1047 && ( PvNode ? tte->bound() == BOUND_EXACT
1048 : ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1049 : (tte->bound() & BOUND_UPPER)))
1051 ss->currentMove = ttMove; // Can be MOVE_NONE
1055 // Evaluate the position statically
1058 ss->staticEval = VALUE_NONE;
1059 bestValue = futilityBase = -VALUE_INFINITE;
1065 // Never assume anything on values stored in TT
1066 if ((ss->staticEval = bestValue = tte->eval_value()) == VALUE_NONE)
1067 ss->staticEval = bestValue = evaluate(pos);
1069 // Can ttValue be used as a better position evaluation?
1070 if (ttValue != VALUE_NONE)
1071 if (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER))
1072 bestValue = ttValue;
1075 ss->staticEval = bestValue =
1076 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos) : -(ss-1)->staticEval + 2 * Eval::Tempo;
1078 // Stand pat. Return immediately if static value is at least beta
1079 if (bestValue >= beta)
1082 TT.store(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1083 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1088 if (PvNode && bestValue > alpha)
1091 futilityBase = bestValue + 128;
1094 // Initialize a MovePicker object for the current position, and prepare
1095 // to search the moves. Because the depth is <= 0 here, only captures,
1096 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1098 MovePicker mp(pos, ttMove, depth, History, to_sq((ss-1)->currentMove));
1101 // Loop through the moves until no moves remain or a beta cutoff occurs
1102 while ((move = mp.next_move<false>()) != MOVE_NONE)
1104 assert(is_ok(move));
1106 givesCheck = type_of(move) == NORMAL && !ci.dcCandidates
1107 ? ci.checkSq[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
1108 : pos.gives_check(move, ci);
1115 && futilityBase > -VALUE_KNOWN_WIN
1116 && !pos.advanced_pawn_push(move))
1118 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1120 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1122 if (futilityValue < beta)
1124 bestValue = std::max(bestValue, futilityValue);
1128 if (futilityBase < beta && pos.see(move) <= VALUE_ZERO)
1130 bestValue = std::max(bestValue, futilityBase);
1135 // Detect non-capture evasions that are candidates to be pruned
1136 evasionPrunable = InCheck
1137 && bestValue > VALUE_MATED_IN_MAX_PLY
1138 && !pos.capture(move)
1139 && !pos.can_castle(pos.side_to_move());
1141 // Don't search moves with negative SEE values
1143 && (!InCheck || evasionPrunable)
1145 && type_of(move) != PROMOTION
1146 && pos.see_sign(move) < VALUE_ZERO)
1149 // Speculative prefetch as early as possible
1150 prefetch((char*)TT.first_entry(pos.key_after(move)));
1152 // Check for legality just before making the move
1153 if (!pos.legal(move, ci.pinned))
1156 ss->currentMove = move;
1158 // Make and search the move
1159 pos.do_move(move, st, ci, givesCheck);
1160 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1161 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1162 pos.undo_move(move);
1164 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1166 // Check for new best move
1167 if (value > bestValue)
1173 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1180 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1181 ttDepth, move, ss->staticEval);
1189 // All legal moves have been searched. A special case: If we're in check
1190 // and no legal moves were found, it is checkmate.
1191 if (InCheck && bestValue == -VALUE_INFINITE)
1192 return mated_in(ss->ply); // Plies to mate from the root
1194 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1195 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1196 ttDepth, bestMove, ss->staticEval);
1198 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1204 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1205 // "plies to mate from the current position". Non-mate scores are unchanged.
1206 // The function is called before storing a value in the transposition table.
1208 Value value_to_tt(Value v, int ply) {
1210 assert(v != VALUE_NONE);
1212 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1213 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1217 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1218 // from the transposition table (which refers to the plies to mate/be mated
1219 // from current position) to "plies to mate/be mated from the root".
1221 Value value_from_tt(Value v, int ply) {
1223 return v == VALUE_NONE ? VALUE_NONE
1224 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1225 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1229 // update_stats() updates killers, history, countermoves and followupmoves stats after a fail-high
1232 void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt) {
1234 if (ss->killers[0] != move)
1236 ss->killers[1] = ss->killers[0];
1237 ss->killers[0] = move;
1240 // Increase history value of the cut-off move and decrease all the other
1241 // played quiet moves.
1242 Value bonus = Value(4 * int(depth) * int(depth));
1243 History.update(pos.moved_piece(move), to_sq(move), bonus);
1244 for (int i = 0; i < quietsCnt; ++i)
1247 History.update(pos.moved_piece(m), to_sq(m), -bonus);
1250 if (is_ok((ss-1)->currentMove))
1252 Square prevMoveSq = to_sq((ss-1)->currentMove);
1253 Countermoves.update(pos.piece_on(prevMoveSq), prevMoveSq, move);
1256 if (is_ok((ss-2)->currentMove) && (ss-1)->currentMove == (ss-1)->ttMove)
1258 Square prevOwnMoveSq = to_sq((ss-2)->currentMove);
1259 Followupmoves.update(pos.piece_on(prevOwnMoveSq), prevOwnMoveSq, move);
1264 // When playing with a strength handicap, choose best move among the first 'candidates'
1265 // RootMoves using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1267 Move Skill::pick_move() {
1271 // PRNG sequence should be not deterministic
1272 for (int i = Time::now() % 50; i > 0; --i)
1273 rk.rand<unsigned>();
1275 // RootMoves are already sorted by score in descending order
1276 int variance = std::min(RootMoves[0].score - RootMoves[candidates - 1].score, PawnValueMg);
1277 int weakness = 120 - 2 * level;
1278 int max_s = -VALUE_INFINITE;
1281 // Choose best move. For each move score we add two terms both dependent on
1282 // weakness. One deterministic and bigger for weaker moves, and one random,
1283 // then we choose the move with the resulting highest score.
1284 for (size_t i = 0; i < candidates; ++i)
1286 int s = RootMoves[i].score;
1288 // Don't allow crazy blunders even at very low skills
1289 if (i > 0 && RootMoves[i - 1].score > s + 2 * PawnValueMg)
1292 // This is our magic formula
1293 s += ( weakness * int(RootMoves[0].score - s)
1294 + variance * (rk.rand<unsigned>() % weakness)) / 128;
1299 best = RootMoves[i].pv[0];
1306 // uci_pv() formats PV information according to the UCI protocol. UCI
1307 // requires that all (if any) unsearched PV lines are sent using a previous
1310 string uci_pv(const Position& pos, int depth, Value alpha, Value beta) {
1312 std::stringstream ss;
1313 Time::point elapsed = Time::now() - SearchTime + 1;
1314 size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
1317 for (size_t i = 0; i < Threads.size(); ++i)
1318 if (Threads[i]->maxPly > selDepth)
1319 selDepth = Threads[i]->maxPly;
1321 for (size_t i = 0; i < uciPVSize; ++i)
1323 bool updated = (i <= PVIdx);
1325 if (depth == 1 && !updated)
1328 int d = updated ? depth : depth - 1;
1329 Value v = updated ? RootMoves[i].score : RootMoves[i].prevScore;
1331 if (ss.rdbuf()->in_avail()) // Not at first line
1334 ss << "info depth " << d
1335 << " seldepth " << selDepth
1336 << " multipv " << i + 1
1337 << " score " << (i == PVIdx ? UCI::format_value(v, alpha, beta) : UCI::format_value(v))
1338 << " nodes " << pos.nodes_searched()
1339 << " nps " << pos.nodes_searched() * 1000 / elapsed
1340 << " time " << elapsed
1343 for (size_t j = 0; RootMoves[i].pv[j] != MOVE_NONE; ++j)
1344 ss << " " << UCI::format_move(RootMoves[i].pv[j], pos.is_chess960());
1353 /// RootMove::extract_pv_from_tt() builds a PV by adding moves from the TT table.
1354 /// We also consider both failing high nodes and BOUND_EXACT nodes here to
1355 /// ensure that we have a ponder move even when we fail high at root. This
1356 /// results in a long PV to print that is important for position analysis.
1358 void RootMove::extract_pv_from_tt(Position& pos) {
1360 StateInfo state[MAX_PLY], *st = state;
1362 int ply = 1; // At root ply is 1...
1363 Move m = pv[0]; // ...instead pv[] array starts from 0
1364 Value expectedScore = score;
1371 assert(MoveList<LEGAL>(pos).contains(pv[ply - 1]));
1373 pos.do_move(pv[ply++ - 1], *st++);
1374 tte = TT.probe(pos.key());
1375 expectedScore = -expectedScore;
1378 && expectedScore == value_from_tt(tte->value(), ply)
1379 && pos.pseudo_legal(m = tte->move()) // Local copy, TT could change
1380 && pos.legal(m, pos.pinned_pieces(pos.side_to_move()))
1382 && (!pos.is_draw() || ply <= 2));
1384 pv.push_back(MOVE_NONE); // Must be zero-terminating
1386 while (--ply) pos.undo_move(pv[ply - 1]);
1390 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1391 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1392 /// first, even if the old TT entries have been overwritten.
1394 void RootMove::insert_pv_in_tt(Position& pos) {
1396 StateInfo state[MAX_PLY], *st = state;
1398 int idx = 0; // Ply starts from 1, we need to start from 0
1401 tte = TT.probe(pos.key());
1403 if (!tte || tte->move() != pv[idx]) // Don't overwrite correct entries
1404 TT.store(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[idx], VALUE_NONE);
1406 assert(MoveList<LEGAL>(pos).contains(pv[idx]));
1408 pos.do_move(pv[idx++], *st++);
1410 } while (pv[idx] != MOVE_NONE);
1412 while (idx) pos.undo_move(pv[--idx]);
1416 /// Thread::idle_loop() is where the thread is parked when it has no work to do
1418 void Thread::idle_loop() {
1420 // Pointer 'this_sp' is not null only if we are called from split(), and not
1421 // at the thread creation. This means we are the split point's master.
1422 SplitPoint* this_sp = splitPointsSize ? activeSplitPoint : NULL;
1424 assert(!this_sp || (this_sp->masterThread == this && searching));
1428 // If this thread has been assigned work, launch a search
1431 Threads.mutex.lock();
1433 assert(activeSplitPoint);
1434 SplitPoint* sp = activeSplitPoint;
1436 Threads.mutex.unlock();
1438 Stack stack[MAX_PLY+4], *ss = stack+2; // To allow referencing (ss-2) and (ss+2)
1439 Position pos(*sp->pos, this);
1441 std::memcpy(ss-2, sp->ss-2, 5 * sizeof(Stack));
1442 ss->splitPoint = sp;
1446 assert(activePosition == NULL);
1448 activePosition = &pos;
1450 if (sp->nodeType == NonPV)
1451 search<NonPV, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1453 else if (sp->nodeType == PV)
1454 search<PV, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1456 else if (sp->nodeType == Root)
1457 search<Root, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1465 activePosition = NULL;
1466 sp->slavesMask.reset(idx);
1467 sp->allSlavesSearching = false;
1468 sp->nodes += pos.nodes_searched();
1470 // Wake up the master thread so to allow it to return from the idle
1471 // loop in case we are the last slave of the split point.
1472 if ( this != sp->masterThread
1473 && sp->slavesMask.none())
1475 assert(!sp->masterThread->searching);
1476 sp->masterThread->notify_one();
1479 // After releasing the lock we can't access any SplitPoint related data
1480 // in a safe way because it could have been released under our feet by
1484 // Try to late join to another split point if none of its slaves has
1485 // already finished.
1486 if (Threads.size() > 2)
1487 for (size_t i = 0; i < Threads.size(); ++i)
1489 const int size = Threads[i]->splitPointsSize; // Local copy
1490 sp = size ? &Threads[i]->splitPoints[size - 1] : NULL;
1493 && sp->allSlavesSearching
1494 && available_to(Threads[i]))
1496 // Recheck the conditions under lock protection
1497 Threads.mutex.lock();
1500 if ( sp->allSlavesSearching
1501 && available_to(Threads[i]))
1503 sp->slavesMask.set(idx);
1504 activeSplitPoint = sp;
1509 Threads.mutex.unlock();
1511 break; // Just a single attempt
1516 // Grab the lock to avoid races with Thread::notify_one()
1519 // If we are master and all slaves have finished then exit idle_loop
1520 if (this_sp && this_sp->slavesMask.none())
1527 // If we are not searching, wait for a condition to be signaled instead of
1528 // wasting CPU time polling for work.
1529 if (!searching && !exit)
1530 sleepCondition.wait(mutex);
1537 /// check_time() is called by the timer thread when the timer triggers. It is
1538 /// used to print debug info and, more importantly, to detect when we are out of
1539 /// available time and thus stop the search.
1543 static Time::point lastInfoTime = Time::now();
1544 int64_t nodes = 0; // Workaround silly 'uninitialized' gcc warning
1546 if (Time::now() - lastInfoTime >= 1000)
1548 lastInfoTime = Time::now();
1557 Threads.mutex.lock();
1559 nodes = RootPos.nodes_searched();
1561 // Loop across all split points and sum accumulated SplitPoint nodes plus
1562 // all the currently active positions nodes.
1563 for (size_t i = 0; i < Threads.size(); ++i)
1564 for (int j = 0; j < Threads[i]->splitPointsSize; ++j)
1566 SplitPoint& sp = Threads[i]->splitPoints[j];
1572 for (size_t idx = 0; idx < Threads.size(); ++idx)
1573 if (sp.slavesMask.test(idx) && Threads[idx]->activePosition)
1574 nodes += Threads[idx]->activePosition->nodes_searched();
1579 Threads.mutex.unlock();
1582 Time::point elapsed = Time::now() - SearchTime;
1583 bool stillAtFirstMove = Signals.firstRootMove
1584 && !Signals.failedLowAtRoot
1585 && elapsed > TimeMgr.available_time() * 75 / 100;
1587 bool noMoreTime = elapsed > TimeMgr.maximum_time() - 2 * TimerThread::Resolution
1588 || stillAtFirstMove;
1590 if ( (Limits.use_time_management() && noMoreTime)
1591 || (Limits.movetime && elapsed >= Limits.movetime)
1592 || (Limits.nodes && nodes >= Limits.nodes))
1593 Signals.stop = true;