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 // 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 < 32; ++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)
198 // Reset the threads, still sleeping: will wake up at split time
199 for (size_t i = 0; i < Threads.size(); ++i)
200 Threads[i]->maxPly = 0;
202 Threads.timer->run = true;
203 Threads.timer->notify_one(); // Wake up the recurring timer
205 id_loop(RootPos); // Let's start searching !
207 Threads.timer->run = false; // Stop the timer
211 // When search is stopped this info is not printed
212 sync_cout << "info nodes " << RootPos.nodes_searched()
213 << " time " << Time::now() - SearchTime + 1 << sync_endl;
215 // When we reach the maximum depth, we can arrive here without a raise of
216 // Signals.stop. However, if we are pondering or in an infinite search,
217 // the UCI protocol states that we shouldn't print the best move before the
218 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
219 // until the GUI sends one of those commands (which also raises Signals.stop).
220 if (!Signals.stop && (Limits.ponder || Limits.infinite))
222 Signals.stopOnPonderhit = true;
223 RootPos.this_thread()->wait_for(Signals.stop);
226 // Best move could be MOVE_NONE when searching on a stalemate position
227 sync_cout << "bestmove " << UCI::format_move(RootMoves[0].pv[0], RootPos.is_chess960())
228 << " ponder " << UCI::format_move(RootMoves[0].pv[1], RootPos.is_chess960())
235 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
236 // with increasing depth until the allocated thinking time has been consumed,
237 // user stops the search, or the maximum search depth is reached.
239 void id_loop(Position& pos) {
241 Stack stack[MAX_PLY+4], *ss = stack+2; // To allow referencing (ss-2) and (ss+2)
243 Value bestValue, alpha, beta, delta;
245 std::memset(ss-2, 0, 5 * sizeof(Stack));
249 bestValue = delta = alpha = -VALUE_INFINITE;
250 beta = VALUE_INFINITE;
255 Countermoves.clear();
256 Followupmoves.clear();
258 size_t multiPV = Options["MultiPV"];
259 Skill skill(Options["Skill Level"], RootMoves.size());
261 // Do we have to play with skill handicap? In this case enable MultiPV search
262 // that we will use behind the scenes to retrieve a set of possible moves.
263 multiPV = std::max(multiPV, skill.candidates_size());
265 // Iterative deepening loop until requested to stop or target depth reached
266 while (++depth < MAX_PLY && !Signals.stop && (!Limits.depth || depth <= Limits.depth))
268 // Age out PV variability metric
269 BestMoveChanges *= 0.5;
271 // Save the last iteration's scores before first PV line is searched and
272 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
273 for (size_t i = 0; i < RootMoves.size(); ++i)
274 RootMoves[i].prevScore = RootMoves[i].score;
276 // MultiPV loop. We perform a full root search for each PV line
277 for (PVIdx = 0; PVIdx < std::min(multiPV, RootMoves.size()) && !Signals.stop; ++PVIdx)
279 // Reset aspiration window starting size
283 alpha = std::max(RootMoves[PVIdx].prevScore - delta,-VALUE_INFINITE);
284 beta = std::min(RootMoves[PVIdx].prevScore + delta, VALUE_INFINITE);
287 // Start with a small aspiration window and, in the case of a fail
288 // high/low, re-search with a bigger window until we're not failing
292 bestValue = search<Root, false>(pos, ss, alpha, beta, depth * ONE_PLY, false);
294 // Bring the best move to the front. It is critical that sorting
295 // is done with a stable algorithm because all the values but the
296 // first and eventually the new best one are set to -VALUE_INFINITE
297 // and we want to keep the same order for all the moves except the
298 // new PV that goes to the front. Note that in case of MultiPV
299 // search the already searched PV lines are preserved.
300 std::stable_sort(RootMoves.begin() + PVIdx, RootMoves.end());
302 // Write PV back to transposition table in case the relevant
303 // entries have been overwritten during the search.
304 for (size_t i = 0; i <= PVIdx; ++i)
305 RootMoves[i].insert_pv_in_tt(pos);
307 // If search has been stopped break immediately. Sorting and
308 // writing PV back to TT is safe because RootMoves is still
309 // valid, although it refers to previous iteration.
313 // When failing high/low give some update (without cluttering
314 // the UI) before a re-search.
315 if ( (bestValue <= alpha || bestValue >= beta)
316 && Time::now() - SearchTime > 3000)
317 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
319 // In case of failing low/high increase aspiration window and
320 // re-search, otherwise exit the loop.
321 if (bestValue <= alpha)
323 beta = (alpha + beta) / 2;
324 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
326 Signals.failedLowAtRoot = true;
327 Signals.stopOnPonderhit = false;
329 else if (bestValue >= beta)
331 alpha = (alpha + beta) / 2;
332 beta = std::min(bestValue + delta, VALUE_INFINITE);
340 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
343 // Sort the PV lines searched so far and update the GUI
344 std::stable_sort(RootMoves.begin(), RootMoves.begin() + PVIdx + 1);
347 && ( PVIdx + 1 == std::min(multiPV, RootMoves.size())
348 || Time::now() - SearchTime > 3000))
349 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
352 // If skill levels are enabled and time is up, pick a sub-optimal best move
353 if (skill.candidates_size() && skill.time_to_pick(depth))
356 // Have we found a "mate in x"?
358 && bestValue >= VALUE_MATE_IN_MAX_PLY
359 && VALUE_MATE - bestValue <= 2 * Limits.mate)
362 // Do we have time for the next iteration? Can we stop searching now?
363 if (Limits.use_time_management() && !Signals.stop && !Signals.stopOnPonderhit)
365 // Take some extra time if the best move has changed
366 if (depth > 4 && multiPV == 1)
367 TimeMgr.pv_instability(BestMoveChanges);
369 // Stop the search if only one legal move is available or all
370 // of the available time has been used.
371 if ( RootMoves.size() == 1
372 || Time::now() - SearchTime > TimeMgr.available_time())
374 // If we are allowed to ponder do not stop the search now but
375 // keep pondering until the GUI sends "ponderhit" or "stop".
377 Signals.stopOnPonderhit = true;
386 // search<>() is the main search function for both PV and non-PV nodes and for
387 // normal and SplitPoint nodes. When called just after a split point the search
388 // is simpler because we have already probed the hash table, done a null move
389 // search, and searched the first move before splitting, so we don't have to
390 // repeat all this work again. We also don't need to store anything to the hash
391 // table here: This is taken care of after we return from the split point.
393 template <NodeType NT, bool SpNode>
394 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
396 const bool RootNode = NT == Root;
397 const bool PvNode = NT == PV || NT == Root;
399 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
400 assert(PvNode || (alpha == beta - 1));
401 assert(depth > DEPTH_ZERO);
403 Move quietsSearched[64];
406 SplitPoint* splitPoint;
408 Move ttMove, move, excludedMove, bestMove;
409 Depth ext, newDepth, predictedDepth;
410 Value bestValue, value, ttValue, eval, nullValue, futilityValue;
411 bool inCheck, givesCheck, pvMove, singularExtensionNode, improving;
412 bool captureOrPromotion, dangerous, doFullDepthSearch;
413 int moveCount, quietCount;
415 // Step 1. Initialize node
416 Thread* thisThread = pos.this_thread();
417 inCheck = pos.checkers();
421 splitPoint = ss->splitPoint;
422 bestMove = splitPoint->bestMove;
423 bestValue = splitPoint->bestValue;
425 ttMove = excludedMove = MOVE_NONE;
426 ttValue = VALUE_NONE;
428 assert(splitPoint->bestValue > -VALUE_INFINITE && splitPoint->moveCount > 0);
433 moveCount = quietCount = 0;
434 bestValue = -VALUE_INFINITE;
435 ss->ply = (ss-1)->ply + 1;
437 // Used to send selDepth info to GUI
438 if (PvNode && thisThread->maxPly < ss->ply)
439 thisThread->maxPly = ss->ply;
443 // Step 2. Check for aborted search and immediate draw
444 if (Signals.stop || pos.is_draw() || ss->ply >= MAX_PLY)
445 return ss->ply >= MAX_PLY && !inCheck ? evaluate(pos) : DrawValue[pos.side_to_move()];
447 // Step 3. Mate distance pruning. Even if we mate at the next move our score
448 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
449 // a shorter mate was found upward in the tree then there is no need to search
450 // because we will never beat the current alpha. Same logic but with reversed
451 // signs applies also in the opposite condition of being mated instead of giving
452 // mate. In this case return a fail-high score.
453 alpha = std::max(mated_in(ss->ply), alpha);
454 beta = std::min(mate_in(ss->ply+1), beta);
459 assert(0 <= ss->ply && ss->ply < MAX_PLY);
461 ss->currentMove = ss->ttMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
462 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
463 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
465 // Step 4. Transposition table lookup
466 // We don't want the score of a partial search to overwrite a previous full search
467 // TT value, so we use a different position key in case of an excluded move.
468 excludedMove = ss->excludedMove;
469 posKey = excludedMove ? pos.exclusion_key() : pos.key();
470 tte = TT.probe(posKey);
471 ss->ttMove = ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
472 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
474 // At PV nodes we check for exact scores, whilst at non-PV nodes we check for
475 // a fail high/low. The biggest advantage to probing at PV nodes is to have a
476 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
477 // we should also update RootMoveList to avoid bogus output.
480 && tte->depth() >= depth
481 && ttValue != VALUE_NONE // Only in case of TT access race
482 && ( PvNode ? tte->bound() == BOUND_EXACT
483 : ttValue >= beta ? (tte->bound() & BOUND_LOWER)
484 : (tte->bound() & BOUND_UPPER)))
486 ss->currentMove = ttMove; // Can be MOVE_NONE
488 // If ttMove is quiet, update killers, history, counter move and followup move on TT hit
489 if (ttValue >= beta && ttMove && !pos.capture_or_promotion(ttMove) && !inCheck)
490 update_stats(pos, ss, ttMove, depth, NULL, 0);
495 // Step 5. Evaluate the position statically and update parent's gain statistics
498 ss->staticEval = eval = VALUE_NONE;
504 // Never assume anything on values stored in TT
505 if ((ss->staticEval = eval = tte->eval_value()) == VALUE_NONE)
506 eval = ss->staticEval = evaluate(pos);
508 // Can ttValue be used as a better position evaluation?
509 if (ttValue != VALUE_NONE)
510 if (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER))
515 eval = ss->staticEval =
516 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos) : -(ss-1)->staticEval + 2 * Eval::Tempo;
518 TT.store(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE, ss->staticEval);
521 if ( !pos.captured_piece_type()
522 && ss->staticEval != VALUE_NONE
523 && (ss-1)->staticEval != VALUE_NONE
524 && (move = (ss-1)->currentMove) != MOVE_NULL
526 && type_of(move) == NORMAL)
528 Square to = to_sq(move);
529 Gains.update(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
532 // Step 6. Razoring (skipped when in check)
534 && depth < 4 * ONE_PLY
535 && eval + razor_margin(depth) <= alpha
536 && ttMove == MOVE_NONE
537 && !pos.pawn_on_7th(pos.side_to_move()))
539 if ( depth <= ONE_PLY
540 && eval + razor_margin(3 * ONE_PLY) <= alpha)
541 return qsearch<NonPV, false>(pos, ss, alpha, beta, DEPTH_ZERO);
543 Value ralpha = alpha - razor_margin(depth);
544 Value v = qsearch<NonPV, false>(pos, ss, ralpha, ralpha+1, DEPTH_ZERO);
549 // Step 7. Futility pruning: child node (skipped when in check)
552 && depth < 7 * ONE_PLY
553 && eval - futility_margin(depth) >= beta
554 && eval < VALUE_KNOWN_WIN // Do not return unproven wins
555 && pos.non_pawn_material(pos.side_to_move()))
556 return eval - futility_margin(depth);
558 // Step 8. Null move search with verification search (is omitted in PV nodes)
561 && depth >= 2 * ONE_PLY
563 && pos.non_pawn_material(pos.side_to_move()))
565 ss->currentMove = MOVE_NULL;
567 assert(eval - beta >= 0);
569 // Null move dynamic reduction based on depth and value
570 Depth R = (3 + depth / 4 + std::min(int(eval - beta) / PawnValueMg, 3)) * ONE_PLY;
572 pos.do_null_move(st);
573 (ss+1)->skipNullMove = true;
574 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -beta+1, DEPTH_ZERO)
575 : - search<NonPV, false>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
576 (ss+1)->skipNullMove = false;
577 pos.undo_null_move();
579 if (nullValue >= beta)
581 // Do not return unproven mate scores
582 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
585 if (depth < 12 * ONE_PLY && abs(beta) < VALUE_KNOWN_WIN)
588 // Do verification search at high depths
589 ss->skipNullMove = true;
590 Value v = depth-R < ONE_PLY ? qsearch<NonPV, false>(pos, ss, beta-1, beta, DEPTH_ZERO)
591 : search<NonPV, false>(pos, ss, beta-1, beta, depth-R, false);
592 ss->skipNullMove = false;
599 // Step 9. ProbCut (skipped when in check)
600 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
601 // and a reduced search returns a value much above beta, we can (almost) safely
602 // prune the previous move.
604 && depth >= 5 * ONE_PLY
606 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
608 Value rbeta = std::min(beta + 200, VALUE_INFINITE);
609 Depth rdepth = depth - 4 * ONE_PLY;
611 assert(rdepth >= ONE_PLY);
612 assert((ss-1)->currentMove != MOVE_NONE);
613 assert((ss-1)->currentMove != MOVE_NULL);
615 MovePicker mp(pos, ttMove, History, pos.captured_piece_type());
618 while ((move = mp.next_move<false>()) != MOVE_NONE)
619 if (pos.legal(move, ci.pinned))
621 ss->currentMove = move;
622 pos.do_move(move, st, ci, pos.gives_check(move, ci));
623 value = -search<NonPV, false>(pos, ss+1, -rbeta, -rbeta+1, rdepth, !cutNode);
630 // Step 10. Internal iterative deepening (skipped when in check)
631 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
633 && (PvNode || ss->staticEval + 256 >= beta))
635 Depth d = 2 * (depth - 2 * ONE_PLY) - (PvNode ? DEPTH_ZERO : depth / 2);
636 ss->skipNullMove = true;
637 search<PvNode ? PV : NonPV, false>(pos, ss, alpha, beta, d / 2, true);
638 ss->skipNullMove = false;
640 tte = TT.probe(posKey);
641 ttMove = tte ? tte->move() : MOVE_NONE;
644 moves_loop: // When in check and at SpNode search starts from here
646 Square prevMoveSq = to_sq((ss-1)->currentMove);
647 Move countermoves[] = { Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].first,
648 Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].second };
650 Square prevOwnMoveSq = to_sq((ss-2)->currentMove);
651 Move followupmoves[] = { Followupmoves[pos.piece_on(prevOwnMoveSq)][prevOwnMoveSq].first,
652 Followupmoves[pos.piece_on(prevOwnMoveSq)][prevOwnMoveSq].second };
654 MovePicker mp(pos, ttMove, depth, History, countermoves, followupmoves, ss);
656 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
657 improving = ss->staticEval >= (ss-2)->staticEval
658 || ss->staticEval == VALUE_NONE
659 ||(ss-2)->staticEval == VALUE_NONE;
661 singularExtensionNode = !RootNode
663 && depth >= 8 * ONE_PLY
664 && ttMove != MOVE_NONE
665 /* && ttValue != VALUE_NONE Already implicit in the next condition */
666 && abs(ttValue) < VALUE_KNOWN_WIN
667 && !excludedMove // Recursive singular search is not allowed
668 && (tte->bound() & BOUND_LOWER)
669 && tte->depth() >= depth - 3 * ONE_PLY;
671 // Step 11. Loop through moves
672 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
673 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
677 if (move == excludedMove)
680 // At root obey the "searchmoves" option and skip moves not listed in Root
681 // Move List. As a consequence any illegal move is also skipped. In MultiPV
682 // mode we also skip PV moves which have been already searched.
683 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
688 // Shared counter cannot be decremented later if the move turns out to be illegal
689 if (!pos.legal(move, ci.pinned))
692 moveCount = ++splitPoint->moveCount;
693 splitPoint->mutex.unlock();
700 Signals.firstRootMove = (moveCount == 1);
702 if (thisThread == Threads.main() && Time::now() - SearchTime > 3000)
703 sync_cout << "info depth " << depth
704 << " currmove " << UCI::format_move(move, pos.is_chess960())
705 << " currmovenumber " << moveCount + PVIdx << sync_endl;
709 captureOrPromotion = pos.capture_or_promotion(move);
711 givesCheck = type_of(move) == NORMAL && !ci.dcCandidates
712 ? ci.checkSq[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
713 : pos.gives_check(move, ci);
715 dangerous = givesCheck
716 || type_of(move) != NORMAL
717 || pos.advanced_pawn_push(move);
719 // Step 12. Extend checks
720 if (givesCheck && pos.see_sign(move) >= VALUE_ZERO)
723 // Singular extension search. If all moves but one fail low on a search of
724 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
725 // is singular and should be extended. To verify this we do a reduced search
726 // on all the other moves but the ttMove and if the result is lower than
727 // ttValue minus a margin then we extend the ttMove.
728 if ( singularExtensionNode
731 && pos.legal(move, ci.pinned))
733 Value rBeta = ttValue - int(2 * depth);
734 ss->excludedMove = move;
735 ss->skipNullMove = true;
736 value = search<NonPV, false>(pos, ss, rBeta - 1, rBeta, depth / 2, cutNode);
737 ss->skipNullMove = false;
738 ss->excludedMove = MOVE_NONE;
744 // Update the current move (this must be done after singular extension search)
745 newDepth = depth - ONE_PLY + ext;
747 // Step 13. Pruning at shallow depth (exclude PV nodes)
749 && !captureOrPromotion
752 && bestValue > VALUE_MATED_IN_MAX_PLY)
754 // Move count based pruning
755 if ( depth < 16 * ONE_PLY
756 && moveCount >= FutilityMoveCounts[improving][depth])
759 splitPoint->mutex.lock();
764 predictedDepth = newDepth - reduction<PvNode>(improving, depth, moveCount);
766 // Futility pruning: parent node
767 if (predictedDepth < 7 * ONE_PLY)
769 futilityValue = ss->staticEval + futility_margin(predictedDepth)
770 + 128 + Gains[pos.moved_piece(move)][to_sq(move)];
772 if (futilityValue <= alpha)
774 bestValue = std::max(bestValue, futilityValue);
778 splitPoint->mutex.lock();
779 if (bestValue > splitPoint->bestValue)
780 splitPoint->bestValue = bestValue;
786 // Prune moves with negative SEE at low depths
787 if (predictedDepth < 4 * ONE_PLY && pos.see_sign(move) < VALUE_ZERO)
790 splitPoint->mutex.lock();
796 // Speculative prefetch as early as possible
797 prefetch((char*)TT.first_entry(pos.key_after(move)));
799 // Check for legality just before making the move
800 if (!RootNode && !SpNode && !pos.legal(move, ci.pinned))
806 pvMove = PvNode && moveCount == 1;
807 ss->currentMove = move;
808 if (!SpNode && !captureOrPromotion && quietCount < 64)
809 quietsSearched[quietCount++] = move;
811 // Step 14. Make the move
812 pos.do_move(move, st, ci, givesCheck);
814 // Step 15. Reduced depth search (LMR). If the move fails high it will be
815 // re-searched at full depth.
816 if ( depth >= 3 * ONE_PLY
818 && !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);
1114 && futilityBase > -VALUE_KNOWN_WIN
1115 && !pos.advanced_pawn_push(move))
1117 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1119 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1121 if (futilityValue < beta)
1123 bestValue = std::max(bestValue, futilityValue);
1127 if (futilityBase < beta && pos.see(move) <= VALUE_ZERO)
1129 bestValue = std::max(bestValue, futilityBase);
1134 // Detect non-capture evasions that are candidates to be pruned
1135 evasionPrunable = InCheck
1136 && bestValue > VALUE_MATED_IN_MAX_PLY
1137 && !pos.capture(move)
1138 && !pos.can_castle(pos.side_to_move());
1140 // Don't search moves with negative SEE values
1142 && (!InCheck || evasionPrunable)
1143 && type_of(move) != PROMOTION
1144 && pos.see_sign(move) < VALUE_ZERO)
1147 // Speculative prefetch as early as possible
1148 prefetch((char*)TT.first_entry(pos.key_after(move)));
1150 // Check for legality just before making the move
1151 if (!pos.legal(move, ci.pinned))
1154 ss->currentMove = move;
1156 // Make and search the move
1157 pos.do_move(move, st, ci, givesCheck);
1158 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1159 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1160 pos.undo_move(move);
1162 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1164 // Check for new best move
1165 if (value > bestValue)
1171 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1178 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1179 ttDepth, move, ss->staticEval);
1187 // All legal moves have been searched. A special case: If we're in check
1188 // and no legal moves were found, it is checkmate.
1189 if (InCheck && bestValue == -VALUE_INFINITE)
1190 return mated_in(ss->ply); // Plies to mate from the root
1192 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1193 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1194 ttDepth, bestMove, ss->staticEval);
1196 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1202 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1203 // "plies to mate from the current position". Non-mate scores are unchanged.
1204 // The function is called before storing a value in the transposition table.
1206 Value value_to_tt(Value v, int ply) {
1208 assert(v != VALUE_NONE);
1210 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1211 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1215 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1216 // from the transposition table (which refers to the plies to mate/be mated
1217 // from current position) to "plies to mate/be mated from the root".
1219 Value value_from_tt(Value v, int ply) {
1221 return v == VALUE_NONE ? VALUE_NONE
1222 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1223 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1227 // update_stats() updates killers, history, countermoves and followupmoves stats after a fail-high
1230 void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt) {
1232 if (ss->killers[0] != move)
1234 ss->killers[1] = ss->killers[0];
1235 ss->killers[0] = move;
1238 // Increase history value of the cut-off move and decrease all the other
1239 // played quiet moves.
1240 Value bonus = Value(4 * int(depth) * int(depth));
1241 History.update(pos.moved_piece(move), to_sq(move), bonus);
1242 for (int i = 0; i < quietsCnt; ++i)
1245 History.update(pos.moved_piece(m), to_sq(m), -bonus);
1248 if (is_ok((ss-1)->currentMove))
1250 Square prevMoveSq = to_sq((ss-1)->currentMove);
1251 Countermoves.update(pos.piece_on(prevMoveSq), prevMoveSq, move);
1254 if (is_ok((ss-2)->currentMove) && (ss-1)->currentMove == (ss-1)->ttMove)
1256 Square prevOwnMoveSq = to_sq((ss-2)->currentMove);
1257 Followupmoves.update(pos.piece_on(prevOwnMoveSq), prevOwnMoveSq, move);
1262 // When playing with a strength handicap, choose best move among the first 'candidates'
1263 // RootMoves using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1265 Move Skill::pick_move() {
1269 // PRNG sequence should be not deterministic
1270 for (int i = Time::now() % 50; i > 0; --i)
1271 rk.rand<unsigned>();
1273 // RootMoves are already sorted by score in descending order
1274 int variance = std::min(RootMoves[0].score - RootMoves[candidates - 1].score, PawnValueMg);
1275 int weakness = 120 - 2 * level;
1276 int max_s = -VALUE_INFINITE;
1279 // Choose best move. For each move score we add two terms both dependent on
1280 // weakness. One deterministic and bigger for weaker moves, and one random,
1281 // then we choose the move with the resulting highest score.
1282 for (size_t i = 0; i < candidates; ++i)
1284 int s = RootMoves[i].score;
1286 // Don't allow crazy blunders even at very low skills
1287 if (i > 0 && RootMoves[i - 1].score > s + 2 * PawnValueMg)
1290 // This is our magic formula
1291 s += ( weakness * int(RootMoves[0].score - s)
1292 + variance * (rk.rand<unsigned>() % weakness)) / 128;
1297 best = RootMoves[i].pv[0];
1304 // uci_pv() formats PV information according to the UCI protocol. UCI
1305 // requires that all (if any) unsearched PV lines are sent using a previous
1308 string uci_pv(const Position& pos, int depth, Value alpha, Value beta) {
1310 std::stringstream ss;
1311 Time::point elapsed = Time::now() - SearchTime + 1;
1312 size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
1315 for (size_t i = 0; i < Threads.size(); ++i)
1316 if (Threads[i]->maxPly > selDepth)
1317 selDepth = Threads[i]->maxPly;
1319 for (size_t i = 0; i < uciPVSize; ++i)
1321 bool updated = (i <= PVIdx);
1323 if (depth == 1 && !updated)
1326 int d = updated ? depth : depth - 1;
1327 Value v = updated ? RootMoves[i].score : RootMoves[i].prevScore;
1329 if (ss.rdbuf()->in_avail()) // Not at first line
1332 ss << "info depth " << d
1333 << " seldepth " << selDepth
1334 << " multipv " << i + 1
1335 << " score " << (i == PVIdx ? UCI::format_value(v, alpha, beta) : UCI::format_value(v))
1336 << " nodes " << pos.nodes_searched()
1337 << " nps " << pos.nodes_searched() * 1000 / elapsed
1338 << " time " << elapsed
1341 for (size_t j = 0; RootMoves[i].pv[j] != MOVE_NONE; ++j)
1342 ss << " " << UCI::format_move(RootMoves[i].pv[j], pos.is_chess960());
1351 /// RootMove::extract_pv_from_tt() builds a PV by adding moves from the TT table.
1352 /// We also consider both failing high nodes and BOUND_EXACT nodes here to
1353 /// ensure that we have a ponder move even when we fail high at root. This
1354 /// results in a long PV to print that is important for position analysis.
1356 void RootMove::extract_pv_from_tt(Position& pos) {
1358 StateInfo state[MAX_PLY], *st = state;
1360 int ply = 1; // At root ply is 1...
1361 Move m = pv[0]; // ...instead pv[] array starts from 0
1362 Value expectedScore = score;
1369 assert(MoveList<LEGAL>(pos).contains(pv[ply - 1]));
1371 pos.do_move(pv[ply++ - 1], *st++);
1372 tte = TT.probe(pos.key());
1373 expectedScore = -expectedScore;
1376 && expectedScore == value_from_tt(tte->value(), ply)
1377 && pos.pseudo_legal(m = tte->move()) // Local copy, TT could change
1378 && pos.legal(m, pos.pinned_pieces(pos.side_to_move()))
1380 && (!pos.is_draw() || ply <= 2));
1382 pv.push_back(MOVE_NONE); // Must be zero-terminating
1384 while (--ply) pos.undo_move(pv[ply - 1]);
1388 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1389 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1390 /// first, even if the old TT entries have been overwritten.
1392 void RootMove::insert_pv_in_tt(Position& pos) {
1394 StateInfo state[MAX_PLY], *st = state;
1396 int idx = 0; // Ply starts from 1, we need to start from 0
1399 tte = TT.probe(pos.key());
1401 if (!tte || tte->move() != pv[idx]) // Don't overwrite correct entries
1402 TT.store(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[idx], VALUE_NONE);
1404 assert(MoveList<LEGAL>(pos).contains(pv[idx]));
1406 pos.do_move(pv[idx++], *st++);
1408 } while (pv[idx] != MOVE_NONE);
1410 while (idx) pos.undo_move(pv[--idx]);
1414 /// Thread::idle_loop() is where the thread is parked when it has no work to do
1416 void Thread::idle_loop() {
1418 // Pointer 'this_sp' is not null only if we are called from split(), and not
1419 // at the thread creation. This means we are the split point's master.
1420 SplitPoint* this_sp = splitPointsSize ? activeSplitPoint : NULL;
1422 assert(!this_sp || (this_sp->masterThread == this && searching));
1426 // If this thread has been assigned work, launch a search
1429 Threads.mutex.lock();
1431 assert(activeSplitPoint);
1432 SplitPoint* sp = activeSplitPoint;
1434 Threads.mutex.unlock();
1436 Stack stack[MAX_PLY+4], *ss = stack+2; // To allow referencing (ss-2) and (ss+2)
1437 Position pos(*sp->pos, this);
1439 std::memcpy(ss-2, sp->ss-2, 5 * sizeof(Stack));
1440 ss->splitPoint = sp;
1444 assert(activePosition == NULL);
1446 activePosition = &pos;
1448 if (sp->nodeType == NonPV)
1449 search<NonPV, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1451 else if (sp->nodeType == PV)
1452 search<PV, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1454 else if (sp->nodeType == Root)
1455 search<Root, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1463 activePosition = NULL;
1464 sp->slavesMask.reset(idx);
1465 sp->allSlavesSearching = false;
1466 sp->nodes += pos.nodes_searched();
1468 // Wake up the master thread so to allow it to return from the idle
1469 // loop in case we are the last slave of the split point.
1470 if ( this != sp->masterThread
1471 && sp->slavesMask.none())
1473 assert(!sp->masterThread->searching);
1474 sp->masterThread->notify_one();
1477 // After releasing the lock we can't access any SplitPoint related data
1478 // in a safe way because it could have been released under our feet by
1482 // Try to late join to another split point if none of its slaves has
1483 // already finished.
1484 if (Threads.size() > 2)
1485 for (size_t i = 0; i < Threads.size(); ++i)
1487 const int size = Threads[i]->splitPointsSize; // Local copy
1488 sp = size ? &Threads[i]->splitPoints[size - 1] : NULL;
1491 && sp->allSlavesSearching
1492 && available_to(Threads[i]))
1494 // Recheck the conditions under lock protection
1495 Threads.mutex.lock();
1498 if ( sp->allSlavesSearching
1499 && available_to(Threads[i]))
1501 sp->slavesMask.set(idx);
1502 activeSplitPoint = sp;
1507 Threads.mutex.unlock();
1509 break; // Just a single attempt
1514 // Grab the lock to avoid races with Thread::notify_one()
1517 // If we are master and all slaves have finished then exit idle_loop
1518 if (this_sp && this_sp->slavesMask.none())
1525 // If we are not searching, wait for a condition to be signaled instead of
1526 // wasting CPU time polling for work.
1527 if (!searching && !exit)
1528 sleepCondition.wait(mutex);
1535 /// check_time() is called by the timer thread when the timer triggers. It is
1536 /// used to print debug info and, more importantly, to detect when we are out of
1537 /// available time and thus stop the search.
1541 static Time::point lastInfoTime = Time::now();
1542 Time::point elapsed = Time::now() - SearchTime;
1544 if (Time::now() - lastInfoTime >= 1000)
1546 lastInfoTime = Time::now();
1550 if (Limits.use_time_management() && !Limits.ponder)
1552 bool stillAtFirstMove = Signals.firstRootMove
1553 && !Signals.failedLowAtRoot
1554 && elapsed > TimeMgr.available_time() * 75 / 100;
1556 if ( stillAtFirstMove
1557 || elapsed > TimeMgr.maximum_time() - 2 * TimerThread::Resolution)
1558 Signals.stop = true;
1560 else if (Limits.movetime && elapsed >= Limits.movetime)
1561 Signals.stop = true;
1563 else if (Limits.nodes)
1565 Threads.mutex.lock();
1567 int64_t nodes = RootPos.nodes_searched();
1569 // Loop across all split points and sum accumulated SplitPoint nodes plus
1570 // all the currently active positions nodes.
1571 for (size_t i = 0; i < Threads.size(); ++i)
1572 for (int j = 0; j < Threads[i]->splitPointsSize; ++j)
1574 SplitPoint& sp = Threads[i]->splitPoints[j];
1580 for (size_t idx = 0; idx < Threads.size(); ++idx)
1581 if (sp.slavesMask.test(idx) && Threads[idx]->activePosition)
1582 nodes += Threads[idx]->activePosition->nodes_searched();
1587 Threads.mutex.unlock();
1589 if (nodes >= Limits.nodes)
1590 Signals.stop = true;