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/>.
37 #include "ucioption.h"
41 volatile SignalsType Signals;
43 std::vector<RootMove> RootMoves;
46 Time::point SearchTime;
47 StateStackPtr SetupStates;
52 using namespace Search;
56 // Set to true to force running with one thread. Used for debugging
57 const bool FakeSplit = false;
59 // Different node types, used as template parameter
60 enum NodeType { Root, PV, NonPV };
62 // Dynamic razoring margin based on depth
63 inline Value razor_margin(Depth d) { return Value(512 + 16 * d); }
65 // Futility lookup tables (initialized at startup) and their access functions
66 int FutilityMoveCounts[2][32]; // [improving][depth]
68 inline Value futility_margin(Depth d) {
69 return Value(100 * d);
72 // Reduction lookup tables (initialized at startup) and their access function
73 int8_t Reductions[2][2][64][64]; // [pv][improving][depth][moveNumber]
75 template <bool PvNode> inline Depth reduction(bool i, Depth d, int mn) {
77 return (Depth) Reductions[PvNode][i][std::min(int(d) / ONE_PLY, 63)][std::min(mn, 63)];
80 size_t MultiPV, PVIdx;
82 double BestMoveChanges;
83 Value DrawValue[COLOR_NB];
86 MovesStats Countermoves, Followupmoves;
88 template <NodeType NT, bool SpNode>
89 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
91 template <NodeType NT, bool InCheck>
92 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
94 void id_loop(Position& pos);
95 Value value_to_tt(Value v, int ply);
96 Value value_from_tt(Value v, int ply);
97 void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt);
98 string uci_pv(const Position& pos, int depth, Value alpha, Value beta);
101 Skill(int l) : level(l), best(MOVE_NONE) {}
103 if (enabled()) // Swap best PV line with the sub-optimal one
104 std::swap(RootMoves[0], *std::find(RootMoves.begin(),
105 RootMoves.end(), best ? best : pick_move()));
108 bool enabled() const { return level < 20; }
109 bool time_to_pick(int depth) const { return depth == 1 + level; }
119 /// Search::init() is called during startup to initialize various lookup tables
121 void Search::init() {
123 int d; // depth (ONE_PLY == 2)
124 int hd; // half depth (ONE_PLY == 1)
127 // Init reductions array
128 for (hd = 1; hd < 64; ++hd) for (mc = 1; mc < 64; ++mc)
130 double pvRed = 0.00 + log(double(hd)) * log(double(mc)) / 3.00;
131 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
132 Reductions[1][1][hd][mc] = int8_t( pvRed >= 1.0 ? pvRed * int(ONE_PLY) : 0);
133 Reductions[0][1][hd][mc] = int8_t(nonPVRed >= 1.0 ? nonPVRed * int(ONE_PLY) : 0);
135 Reductions[1][0][hd][mc] = Reductions[1][1][hd][mc];
136 Reductions[0][0][hd][mc] = Reductions[0][1][hd][mc];
138 if (Reductions[0][0][hd][mc] > 2 * ONE_PLY)
139 Reductions[0][0][hd][mc] += ONE_PLY;
141 else if (Reductions[0][0][hd][mc] > 1 * ONE_PLY)
142 Reductions[0][0][hd][mc] += ONE_PLY / 2;
145 // Init futility move count array
146 for (d = 0; d < 32; ++d)
148 FutilityMoveCounts[0][d] = int(2.4 + 0.222 * pow(d + 0.00, 1.8));
149 FutilityMoveCounts[1][d] = int(3.0 + 0.300 * pow(d + 0.98, 1.8));
154 /// Search::perft() is our utility to verify move generation. All the leaf nodes
155 /// up to the given depth are generated and counted and the sum returned.
157 static uint64_t perft(Position& pos, Depth depth) {
162 const bool leaf = depth == 2 * ONE_PLY;
164 for (MoveList<LEGAL> it(pos); *it; ++it)
166 pos.do_move(*it, st, ci, pos.gives_check(*it, ci));
167 cnt += leaf ? MoveList<LEGAL>(pos).size() : ::perft(pos, depth - ONE_PLY);
173 uint64_t Search::perft(Position& pos, Depth depth) {
174 return depth > ONE_PLY ? ::perft(pos, depth) : MoveList<LEGAL>(pos).size();
177 /// Search::think() is the external interface to Stockfish's search, and is
178 /// called by the main thread when the program receives the UCI 'go' command. It
179 /// searches from RootPos and at the end prints the "bestmove" to output.
181 void Search::think() {
183 static PolyglotBook book; // Defined static to initialize the PRNG only once
185 RootColor = RootPos.side_to_move();
186 TimeMgr.init(Limits, RootPos.game_ply(), RootColor);
188 int cf = Options["Contempt Factor"] * PawnValueEg / 100; // From centipawns
189 DrawValue[ RootColor] = VALUE_DRAW - Value(cf);
190 DrawValue[~RootColor] = VALUE_DRAW + Value(cf);
192 if (RootMoves.empty())
194 RootMoves.push_back(MOVE_NONE);
195 sync_cout << "info depth 0 score "
196 << score_to_uci(RootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
202 if (Options["OwnBook"] && !Limits.infinite && !Limits.mate)
204 Move bookMove = book.probe(RootPos, Options["Book File"], Options["Best Book Move"]);
206 if (bookMove && std::count(RootMoves.begin(), RootMoves.end(), bookMove))
208 std::swap(RootMoves[0], *std::find(RootMoves.begin(), RootMoves.end(), bookMove));
213 if (Options["Write Search Log"])
215 Log log(Options["Search Log Filename"]);
216 log << "\nSearching: " << RootPos.fen()
217 << "\ninfinite: " << Limits.infinite
218 << " ponder: " << Limits.ponder
219 << " time: " << Limits.time[RootColor]
220 << " increment: " << Limits.inc[RootColor]
221 << " moves to go: " << Limits.movestogo
222 << "\n" << std::endl;
225 // Reset the threads, still sleeping: will wake up at split time
226 for (size_t i = 0; i < Threads.size(); ++i)
227 Threads[i]->maxPly = 0;
229 Threads.sleepWhileIdle = Options["Idle Threads Sleep"];
230 Threads.timer->run = true;
231 Threads.timer->notify_one(); // Wake up the recurring timer
233 id_loop(RootPos); // Let's start searching !
235 Threads.timer->run = false; // Stop the timer
236 Threads.sleepWhileIdle = true; // Send idle threads to sleep
238 if (Options["Write Search Log"])
240 Time::point elapsed = Time::now() - SearchTime + 1;
242 Log log(Options["Search Log Filename"]);
243 log << "Nodes: " << RootPos.nodes_searched()
244 << "\nNodes/second: " << RootPos.nodes_searched() * 1000 / elapsed
245 << "\nBest move: " << move_to_san(RootPos, RootMoves[0].pv[0]);
248 RootPos.do_move(RootMoves[0].pv[0], st);
249 log << "\nPonder move: " << move_to_san(RootPos, RootMoves[0].pv[1]) << std::endl;
250 RootPos.undo_move(RootMoves[0].pv[0]);
255 // When search is stopped this info is not printed
256 sync_cout << "info nodes " << RootPos.nodes_searched()
257 << " time " << Time::now() - SearchTime + 1 << sync_endl;
259 // When we reach the maximum depth, we can arrive here without a raise of
260 // Signals.stop. However, if we are pondering or in an infinite search,
261 // the UCI protocol states that we shouldn't print the best move before the
262 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
263 // until the GUI sends one of those commands (which also raises Signals.stop).
264 if (!Signals.stop && (Limits.ponder || Limits.infinite))
266 Signals.stopOnPonderhit = true;
267 RootPos.this_thread()->wait_for(Signals.stop);
270 // Best move could be MOVE_NONE when searching on a stalemate position
271 sync_cout << "bestmove " << move_to_uci(RootMoves[0].pv[0], RootPos.is_chess960())
272 << " ponder " << move_to_uci(RootMoves[0].pv[1], RootPos.is_chess960())
279 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
280 // with increasing depth until the allocated thinking time has been consumed,
281 // user stops the search, or the maximum search depth is reached.
283 void id_loop(Position& pos) {
285 Stack stack[MAX_PLY_PLUS_6], *ss = stack+2; // To allow referencing (ss-2)
287 Value bestValue, alpha, beta, delta;
289 std::memset(ss-2, 0, 5 * sizeof(Stack));
290 (ss-1)->currentMove = MOVE_NULL; // Hack to skip update gains
294 bestValue = delta = alpha = -VALUE_INFINITE;
295 beta = VALUE_INFINITE;
300 Countermoves.clear();
301 Followupmoves.clear();
303 MultiPV = Options["MultiPV"];
304 Skill skill(Options["Skill Level"]);
306 // Do we have to play with skill handicap? In this case enable MultiPV search
307 // that we will use behind the scenes to retrieve a set of possible moves.
308 if (skill.enabled() && MultiPV < 4)
311 MultiPV = std::min(MultiPV, RootMoves.size());
313 // Iterative deepening loop until requested to stop or target depth reached
314 while (++depth <= MAX_PLY && !Signals.stop && (!Limits.depth || depth <= Limits.depth))
316 // Age out PV variability metric
317 BestMoveChanges *= 0.5;
319 // Save the last iteration's scores before first PV line is searched and
320 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
321 for (size_t i = 0; i < RootMoves.size(); ++i)
322 RootMoves[i].prevScore = RootMoves[i].score;
324 // MultiPV loop. We perform a full root search for each PV line
325 for (PVIdx = 0; PVIdx < MultiPV && !Signals.stop; ++PVIdx)
327 // Reset aspiration window starting size
331 alpha = std::max(RootMoves[PVIdx].prevScore - delta,-VALUE_INFINITE);
332 beta = std::min(RootMoves[PVIdx].prevScore + delta, VALUE_INFINITE);
335 // Start with a small aspiration window and, in the case of a fail
336 // high/low, re-search with a bigger window until we're not failing
340 bestValue = search<Root, false>(pos, ss, alpha, beta, depth * ONE_PLY, false);
342 // Bring the best move to the front. It is critical that sorting
343 // is done with a stable algorithm because all the values but the
344 // first and eventually the new best one are set to -VALUE_INFINITE
345 // and we want to keep the same order for all the moves except the
346 // new PV that goes to the front. Note that in case of MultiPV
347 // search the already searched PV lines are preserved.
348 std::stable_sort(RootMoves.begin() + PVIdx, RootMoves.end());
350 // Write PV back to transposition table in case the relevant
351 // entries have been overwritten during the search.
352 for (size_t i = 0; i <= PVIdx; ++i)
353 RootMoves[i].insert_pv_in_tt(pos);
355 // If search has been stopped break immediately. Sorting and
356 // writing PV back to TT is safe because RootMoves is still
357 // valid, although it refers to previous iteration.
361 // When failing high/low give some update (without cluttering
362 // the UI) before a re-search.
363 if ( (bestValue <= alpha || bestValue >= beta)
364 && Time::now() - SearchTime > 3000)
365 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
367 // In case of failing low/high increase aspiration window and
368 // re-search, otherwise exit the loop.
369 if (bestValue <= alpha)
371 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
373 Signals.failedLowAtRoot = true;
374 Signals.stopOnPonderhit = false;
376 else if (bestValue >= beta)
377 beta = std::min(bestValue + delta, VALUE_INFINITE);
384 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
387 // Sort the PV lines searched so far and update the GUI
388 std::stable_sort(RootMoves.begin(), RootMoves.begin() + PVIdx + 1);
390 if (PVIdx + 1 == MultiPV || Time::now() - SearchTime > 3000)
391 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
394 // If skill levels are enabled and time is up, pick a sub-optimal best move
395 if (skill.enabled() && skill.time_to_pick(depth))
398 if (Options["Write Search Log"])
400 RootMove& rm = RootMoves[0];
401 if (skill.best != MOVE_NONE)
402 rm = *std::find(RootMoves.begin(), RootMoves.end(), skill.best);
404 Log log(Options["Search Log Filename"]);
405 log << pretty_pv(pos, depth, rm.score, Time::now() - SearchTime, &rm.pv[0])
409 // Have we found a "mate in x"?
411 && bestValue >= VALUE_MATE_IN_MAX_PLY
412 && VALUE_MATE - bestValue <= 2 * Limits.mate)
415 // Do we have time for the next iteration? Can we stop searching now?
416 if (Limits.use_time_management() && !Signals.stop && !Signals.stopOnPonderhit)
418 // Take some extra time if the best move has changed
419 if (depth > 4 && depth < 50 && MultiPV == 1)
420 TimeMgr.pv_instability(BestMoveChanges);
422 // Stop the search if only one legal move is available or all
423 // of the available time has been used.
424 if ( RootMoves.size() == 1
425 || Time::now() - SearchTime > TimeMgr.available_time())
427 // If we are allowed to ponder do not stop the search now but
428 // keep pondering until the GUI sends "ponderhit" or "stop".
430 Signals.stopOnPonderhit = true;
439 // search<>() is the main search function for both PV and non-PV nodes and for
440 // normal and SplitPoint nodes. When called just after a split point the search
441 // is simpler because we have already probed the hash table, done a null move
442 // search, and searched the first move before splitting, so we don't have to
443 // repeat all this work again. We also don't need to store anything to the hash
444 // table here: This is taken care of after we return from the split point.
446 template <NodeType NT, bool SpNode>
447 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
449 const bool RootNode = NT == Root;
450 const bool PvNode = NT == PV || NT == Root;
452 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
453 assert(PvNode || (alpha == beta - 1));
454 assert(depth > DEPTH_ZERO);
456 Move quietsSearched[64];
459 SplitPoint* splitPoint;
461 Move ttMove, move, excludedMove, bestMove;
462 Depth ext, newDepth, predictedDepth;
463 Value bestValue, value, ttValue, eval, nullValue, futilityValue;
464 bool inCheck, givesCheck, pvMove, singularExtensionNode, improving;
465 bool captureOrPromotion, dangerous, doFullDepthSearch;
466 int moveCount, quietCount;
468 // Step 1. Initialize node
469 Thread* thisThread = pos.this_thread();
470 inCheck = pos.checkers();
474 splitPoint = ss->splitPoint;
475 bestMove = splitPoint->bestMove;
476 bestValue = splitPoint->bestValue;
478 ttMove = excludedMove = MOVE_NONE;
479 ttValue = VALUE_NONE;
481 assert(splitPoint->bestValue > -VALUE_INFINITE && splitPoint->moveCount > 0);
486 moveCount = quietCount = 0;
487 bestValue = -VALUE_INFINITE;
488 ss->currentMove = ss->ttMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
489 ss->ply = (ss-1)->ply + 1;
490 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
491 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
493 // Used to send selDepth info to GUI
494 if (PvNode && thisThread->maxPly < ss->ply)
495 thisThread->maxPly = ss->ply;
499 // Step 2. Check for aborted search and immediate draw
500 if (Signals.stop || pos.is_draw() || ss->ply > MAX_PLY)
501 return ss->ply > MAX_PLY && !inCheck ? evaluate(pos) : DrawValue[pos.side_to_move()];
503 // Step 3. Mate distance pruning. Even if we mate at the next move our score
504 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
505 // a shorter mate was found upward in the tree then there is no need to search
506 // because we will never beat the current alpha. Same logic but with reversed
507 // signs applies also in the opposite condition of being mated instead of giving
508 // mate. In this case return a fail-high score.
509 alpha = std::max(mated_in(ss->ply), alpha);
510 beta = std::min(mate_in(ss->ply+1), beta);
515 // Step 4. Transposition table lookup
516 // We don't want the score of a partial search to overwrite a previous full search
517 // TT value, so we use a different position key in case of an excluded move.
518 excludedMove = ss->excludedMove;
519 posKey = excludedMove ? pos.exclusion_key() : pos.key();
520 tte = TT.probe(posKey);
521 ss->ttMove = ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
522 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
524 // At PV nodes we check for exact scores, whilst at non-PV nodes we check for
525 // a fail high/low. The biggest advantage to probing at PV nodes is to have a
526 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
527 // we should also update RootMoveList to avoid bogus output.
530 && tte->depth() >= depth
531 && ttValue != VALUE_NONE // Only in case of TT access race
532 && ( PvNode ? tte->bound() == BOUND_EXACT
533 : ttValue >= beta ? (tte->bound() & BOUND_LOWER)
534 : (tte->bound() & BOUND_UPPER)))
536 ss->currentMove = ttMove; // Can be MOVE_NONE
538 // If ttMove is quiet, update killers, history, counter move and followup move on TT hit
539 if (ttValue >= beta && ttMove && !pos.capture_or_promotion(ttMove) && !inCheck)
540 update_stats(pos, ss, ttMove, depth, NULL, 0);
545 // Step 5. Evaluate the position statically and update parent's gain statistics
548 ss->staticEval = eval = VALUE_NONE;
554 // Never assume anything on values stored in TT
555 if ((ss->staticEval = eval = tte->eval_value()) == VALUE_NONE)
556 eval = ss->staticEval = evaluate(pos);
558 // Can ttValue be used as a better position evaluation?
559 if (ttValue != VALUE_NONE)
560 if (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER))
565 eval = ss->staticEval = evaluate(pos);
566 TT.store(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE, ss->staticEval);
569 if ( !pos.captured_piece_type()
570 && ss->staticEval != VALUE_NONE
571 && (ss-1)->staticEval != VALUE_NONE
572 && (move = (ss-1)->currentMove) != MOVE_NULL
573 && type_of(move) == NORMAL)
575 Square to = to_sq(move);
576 Gains.update(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
579 // Step 6. Razoring (skipped when in check)
581 && depth < 4 * ONE_PLY
582 && eval + razor_margin(depth) <= alpha
583 && ttMove == MOVE_NONE
584 && abs(beta) < VALUE_MATE_IN_MAX_PLY
585 && !pos.pawn_on_7th(pos.side_to_move()))
587 Value ralpha = alpha - razor_margin(depth);
588 Value v = qsearch<NonPV, false>(pos, ss, ralpha, ralpha+1, DEPTH_ZERO);
593 // Step 7. Futility pruning: child node (skipped when in check)
596 && depth < 7 * ONE_PLY
597 && eval - futility_margin(depth) >= beta
598 && abs(beta) < VALUE_MATE_IN_MAX_PLY
599 && abs(eval) < VALUE_KNOWN_WIN
600 && pos.non_pawn_material(pos.side_to_move()))
601 return eval - futility_margin(depth);
603 // Step 8. Null move search with verification search (is omitted in PV nodes)
606 && depth >= 2 * ONE_PLY
608 && abs(beta) < VALUE_MATE_IN_MAX_PLY
609 && pos.non_pawn_material(pos.side_to_move()))
611 ss->currentMove = MOVE_NULL;
613 assert(eval - beta >= 0);
615 // Null move dynamic reduction based on depth and value
616 Depth R = 3 * ONE_PLY
618 + int(eval - beta) / PawnValueMg * ONE_PLY;
620 pos.do_null_move(st);
621 (ss+1)->skipNullMove = true;
622 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -beta+1, DEPTH_ZERO)
623 : - search<NonPV, false>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
624 (ss+1)->skipNullMove = false;
625 pos.undo_null_move();
627 if (nullValue >= beta)
629 // Do not return unproven mate scores
630 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
633 if (depth < 12 * ONE_PLY)
636 // Do verification search at high depths
637 ss->skipNullMove = true;
638 Value v = depth-R < ONE_PLY ? qsearch<NonPV, false>(pos, ss, beta-1, beta, DEPTH_ZERO)
639 : search<NonPV, false>(pos, ss, beta-1, beta, depth-R, false);
640 ss->skipNullMove = false;
647 // Step 9. ProbCut (skipped when in check)
648 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
649 // and a reduced search returns a value much above beta, we can (almost) safely
650 // prune the previous move.
652 && depth >= 5 * ONE_PLY
654 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
656 Value rbeta = std::min(beta + 200, VALUE_INFINITE);
657 Depth rdepth = depth - 4 * ONE_PLY;
659 assert(rdepth >= ONE_PLY);
660 assert((ss-1)->currentMove != MOVE_NONE);
661 assert((ss-1)->currentMove != MOVE_NULL);
663 MovePicker mp(pos, ttMove, History, pos.captured_piece_type());
666 while ((move = mp.next_move<false>()) != MOVE_NONE)
667 if (pos.legal(move, ci.pinned))
669 ss->currentMove = move;
670 pos.do_move(move, st, ci, pos.gives_check(move, ci));
671 value = -search<NonPV, false>(pos, ss+1, -rbeta, -rbeta+1, rdepth, !cutNode);
678 // Step 10. Internal iterative deepening (skipped when in check)
679 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
681 && (PvNode || ss->staticEval + 256 >= beta))
683 Depth d = depth - 2 * ONE_PLY - (PvNode ? DEPTH_ZERO : depth / 4);
685 ss->skipNullMove = true;
686 search<PvNode ? PV : NonPV, false>(pos, ss, alpha, beta, d, true);
687 ss->skipNullMove = false;
689 tte = TT.probe(posKey);
690 ttMove = tte ? tte->move() : MOVE_NONE;
693 moves_loop: // When in check and at SpNode search starts from here
695 Square prevMoveSq = to_sq((ss-1)->currentMove);
696 Move countermoves[] = { Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].first,
697 Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].second };
699 Square prevOwnMoveSq = to_sq((ss-2)->currentMove);
700 Move followupmoves[] = { Followupmoves[pos.piece_on(prevOwnMoveSq)][prevOwnMoveSq].first,
701 Followupmoves[pos.piece_on(prevOwnMoveSq)][prevOwnMoveSq].second };
703 MovePicker mp(pos, ttMove, depth, History, countermoves, followupmoves, ss);
705 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
706 improving = ss->staticEval >= (ss-2)->staticEval
707 || ss->staticEval == VALUE_NONE
708 ||(ss-2)->staticEval == VALUE_NONE;
710 singularExtensionNode = !RootNode
712 && depth >= 8 * ONE_PLY
713 && ttMove != MOVE_NONE
714 && !excludedMove // Recursive singular search is not allowed
715 && (tte->bound() & BOUND_LOWER)
716 && tte->depth() >= depth - 3 * ONE_PLY;
718 // Step 11. Loop through moves
719 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
720 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
724 if (move == excludedMove)
727 // At root obey the "searchmoves" option and skip moves not listed in Root
728 // Move List. As a consequence any illegal move is also skipped. In MultiPV
729 // mode we also skip PV moves which have been already searched.
730 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
735 // Shared counter cannot be decremented later if the move turns out to be illegal
736 if (!pos.legal(move, ci.pinned))
739 moveCount = ++splitPoint->moveCount;
740 splitPoint->mutex.unlock();
747 Signals.firstRootMove = (moveCount == 1);
749 if (thisThread == Threads.main() && Time::now() - SearchTime > 3000)
750 sync_cout << "info depth " << depth / ONE_PLY
751 << " currmove " << move_to_uci(move, pos.is_chess960())
752 << " currmovenumber " << moveCount + PVIdx << sync_endl;
756 captureOrPromotion = pos.capture_or_promotion(move);
758 givesCheck = type_of(move) == NORMAL && !ci.dcCandidates
759 ? ci.checkSq[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
760 : pos.gives_check(move, ci);
762 dangerous = givesCheck
763 || type_of(move) != NORMAL
764 || pos.advanced_pawn_push(move);
766 // Step 12. Extend checks
767 if (givesCheck && pos.see_sign(move) >= VALUE_ZERO)
770 // Singular extension search. If all moves but one fail low on a search of
771 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
772 // is singular and should be extended. To verify this we do a reduced search
773 // on all the other moves but the ttMove and if the result is lower than
774 // ttValue minus a margin then we extend the ttMove.
775 if ( singularExtensionNode
778 && pos.legal(move, ci.pinned)
779 && abs(ttValue) < VALUE_KNOWN_WIN)
781 assert(ttValue != VALUE_NONE);
783 Value rBeta = ttValue - int(depth);
784 ss->excludedMove = move;
785 ss->skipNullMove = true;
786 value = search<NonPV, false>(pos, ss, rBeta - 1, rBeta, depth / 2, cutNode);
787 ss->skipNullMove = false;
788 ss->excludedMove = MOVE_NONE;
794 // Update the current move (this must be done after singular extension search)
795 newDepth = depth - ONE_PLY + ext;
797 // Step 13. Pruning at shallow depth (exclude PV nodes)
799 && !captureOrPromotion
802 /* && move != ttMove Already implicit in the next condition */
803 && bestValue > VALUE_MATED_IN_MAX_PLY)
805 // Move count based pruning
806 if ( depth < 16 * ONE_PLY
807 && moveCount >= FutilityMoveCounts[improving][depth] )
810 splitPoint->mutex.lock();
815 predictedDepth = newDepth - reduction<PvNode>(improving, depth, moveCount);
817 // Futility pruning: parent node
818 if (predictedDepth < 7 * ONE_PLY)
820 futilityValue = ss->staticEval + futility_margin(predictedDepth)
821 + 128 + Gains[pos.moved_piece(move)][to_sq(move)];
823 if (futilityValue <= alpha)
825 bestValue = std::max(bestValue, futilityValue);
829 splitPoint->mutex.lock();
830 if (bestValue > splitPoint->bestValue)
831 splitPoint->bestValue = bestValue;
837 // Prune moves with negative SEE at low depths
838 if (predictedDepth < 4 * ONE_PLY && pos.see_sign(move) < VALUE_ZERO)
841 splitPoint->mutex.lock();
847 // Check for legality just before making the move
848 if (!RootNode && !SpNode && !pos.legal(move, ci.pinned))
854 pvMove = PvNode && moveCount == 1;
855 ss->currentMove = move;
856 if (!SpNode && !captureOrPromotion && quietCount < 64)
857 quietsSearched[quietCount++] = move;
859 // Step 14. Make the move
860 pos.do_move(move, st, ci, givesCheck);
862 // Step 15. Reduced depth search (LMR). If the move fails high it will be
863 // re-searched at full depth.
864 if ( depth >= 3 * ONE_PLY
866 && !captureOrPromotion
868 && move != ss->killers[0]
869 && move != ss->killers[1])
871 ss->reduction = reduction<PvNode>(improving, depth, moveCount);
873 if (!PvNode && cutNode)
874 ss->reduction += ONE_PLY;
876 else if (History[pos.piece_on(to_sq(move))][to_sq(move)] < 0)
877 ss->reduction += ONE_PLY / 2;
879 if (move == countermoves[0] || move == countermoves[1])
880 ss->reduction = std::max(DEPTH_ZERO, ss->reduction - ONE_PLY);
882 Depth d = std::max(newDepth - ss->reduction, ONE_PLY);
884 alpha = splitPoint->alpha;
886 value = -search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, d, true);
888 // Re-search at intermediate depth if reduction is very high
889 if (value > alpha && ss->reduction >= 4 * ONE_PLY)
891 Depth d2 = std::max(newDepth - 2 * ONE_PLY, ONE_PLY);
892 value = -search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, d2, true);
895 doFullDepthSearch = (value > alpha && ss->reduction != DEPTH_ZERO);
896 ss->reduction = DEPTH_ZERO;
899 doFullDepthSearch = !pvMove;
901 // Step 16. Full depth search, when LMR is skipped or fails high
902 if (doFullDepthSearch)
905 alpha = splitPoint->alpha;
907 value = newDepth < ONE_PLY ?
908 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
909 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
910 : - search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
913 // For PV nodes only, do a full PV search on the first move or after a fail
914 // high (in the latter case search only if value < beta), otherwise let the
915 // parent node fail low with value <= alpha and to try another move.
916 if (PvNode && (pvMove || (value > alpha && (RootNode || value < beta))))
917 value = newDepth < ONE_PLY ?
918 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
919 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
920 : - search<PV, false>(pos, ss+1, -beta, -alpha, newDepth, false);
921 // Step 17. Undo move
924 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
926 // Step 18. Check for new best move
929 splitPoint->mutex.lock();
930 bestValue = splitPoint->bestValue;
931 alpha = splitPoint->alpha;
934 // Finished searching the move. If a stop or a cutoff occurred, the return
935 // value of the search cannot be trusted, and we return immediately without
936 // updating best move, PV and TT.
937 if (Signals.stop || thisThread->cutoff_occurred())
942 RootMove& rm = *std::find(RootMoves.begin(), RootMoves.end(), move);
944 // PV move or new best move ?
945 if (pvMove || value > alpha)
948 rm.extract_pv_from_tt(pos);
950 // We record how often the best move has been changed in each
951 // iteration. This information is used for time management: When
952 // the best move changes frequently, we allocate some more time.
957 // All other moves but the PV are set to the lowest value: this is
958 // not a problem when sorting because the sort is stable and the
959 // move position in the list is preserved - just the PV is pushed up.
960 rm.score = -VALUE_INFINITE;
963 if (value > bestValue)
965 bestValue = SpNode ? splitPoint->bestValue = value : value;
969 bestMove = SpNode ? splitPoint->bestMove = move : move;
971 if (PvNode && value < beta) // Update alpha! Always alpha < beta
972 alpha = SpNode ? splitPoint->alpha = value : value;
975 assert(value >= beta); // Fail high
978 splitPoint->cutoff = true;
985 // Step 19. Check for splitting the search
987 && Threads.size() >= 2
988 && depth >= Threads.minimumSplitDepth
989 && ( !thisThread->activeSplitPoint
990 || !thisThread->activeSplitPoint->allSlavesSearching)
991 && thisThread->splitPointsSize < MAX_SPLITPOINTS_PER_THREAD)
993 assert(bestValue > -VALUE_INFINITE && bestValue < beta);
995 thisThread->split<FakeSplit>(pos, ss, alpha, beta, &bestValue, &bestMove,
996 depth, moveCount, &mp, NT, cutNode);
998 if (Signals.stop || thisThread->cutoff_occurred())
1001 if (bestValue >= beta)
1009 // Following condition would detect a stop or a cutoff set only after move
1010 // loop has been completed. But in this case bestValue is valid because we
1011 // have fully searched our subtree, and we can anyhow save the result in TT.
1013 if (Signals.stop || thisThread->cutoff_occurred())
1017 // Step 20. Check for mate and stalemate
1018 // All legal moves have been searched and if there are no legal moves, it
1019 // must be mate or stalemate. If we are in a singular extension search then
1020 // return a fail low score.
1022 return excludedMove ? alpha
1023 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1025 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1026 bestValue >= beta ? BOUND_LOWER :
1027 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1028 depth, bestMove, ss->staticEval);
1030 // Quiet best move: update killers, history, countermoves and followupmoves
1031 if (bestValue >= beta && !pos.capture_or_promotion(bestMove) && !inCheck)
1032 update_stats(pos, ss, bestMove, depth, quietsSearched, quietCount - 1);
1034 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1040 // qsearch() is the quiescence search function, which is called by the main
1041 // search function when the remaining depth is zero (or, to be more precise,
1042 // less than ONE_PLY).
1044 template <NodeType NT, bool InCheck>
1045 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1047 const bool PvNode = NT == PV;
1049 assert(NT == PV || NT == NonPV);
1050 assert(InCheck == !!pos.checkers());
1051 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1052 assert(PvNode || (alpha == beta - 1));
1053 assert(depth <= DEPTH_ZERO);
1058 Move ttMove, move, bestMove;
1059 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1060 bool givesCheck, evasionPrunable;
1063 // To flag BOUND_EXACT a node with eval above alpha and no available moves
1067 ss->currentMove = bestMove = MOVE_NONE;
1068 ss->ply = (ss-1)->ply + 1;
1070 // Check for an instant draw or if the maximum ply has been reached
1071 if (pos.is_draw() || ss->ply > MAX_PLY)
1072 return ss->ply > MAX_PLY && !InCheck ? evaluate(pos) : DrawValue[pos.side_to_move()];
1074 // Decide whether or not to include checks: this fixes also the type of
1075 // TT entry depth that we are going to use. Note that in qsearch we use
1076 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1077 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1078 : DEPTH_QS_NO_CHECKS;
1080 // Transposition table lookup
1082 tte = TT.probe(posKey);
1083 ttMove = tte ? tte->move() : MOVE_NONE;
1084 ttValue = tte ? value_from_tt(tte->value(),ss->ply) : VALUE_NONE;
1087 && tte->depth() >= ttDepth
1088 && ttValue != VALUE_NONE // Only in case of TT access race
1089 && ( PvNode ? tte->bound() == BOUND_EXACT
1090 : ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1091 : (tte->bound() & BOUND_UPPER)))
1093 ss->currentMove = ttMove; // Can be MOVE_NONE
1097 // Evaluate the position statically
1100 ss->staticEval = VALUE_NONE;
1101 bestValue = futilityBase = -VALUE_INFINITE;
1107 // Never assume anything on values stored in TT
1108 if ((ss->staticEval = bestValue = tte->eval_value()) == VALUE_NONE)
1109 ss->staticEval = bestValue = evaluate(pos);
1111 // Can ttValue be used as a better position evaluation?
1112 if (ttValue != VALUE_NONE)
1113 if (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER))
1114 bestValue = ttValue;
1117 ss->staticEval = bestValue = evaluate(pos);
1119 // Stand pat. Return immediately if static value is at least beta
1120 if (bestValue >= beta)
1123 TT.store(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1124 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1129 if (PvNode && bestValue > alpha)
1132 futilityBase = bestValue + 128;
1135 // Initialize a MovePicker object for the current position, and prepare
1136 // to search the moves. Because the depth is <= 0 here, only captures,
1137 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1139 MovePicker mp(pos, ttMove, depth, History, to_sq((ss-1)->currentMove));
1142 // Loop through the moves until no moves remain or a beta cutoff occurs
1143 while ((move = mp.next_move<false>()) != MOVE_NONE)
1145 assert(is_ok(move));
1147 givesCheck = type_of(move) == NORMAL && !ci.dcCandidates
1148 ? ci.checkSq[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
1149 : pos.gives_check(move, ci);
1156 && futilityBase > -VALUE_KNOWN_WIN
1157 && !pos.advanced_pawn_push(move))
1159 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1161 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1163 if (futilityValue < beta)
1165 bestValue = std::max(bestValue, futilityValue);
1169 if (futilityBase < beta && pos.see(move) <= VALUE_ZERO)
1171 bestValue = std::max(bestValue, futilityBase);
1176 // Detect non-capture evasions that are candidates to be pruned
1177 evasionPrunable = InCheck
1178 && bestValue > VALUE_MATED_IN_MAX_PLY
1179 && !pos.capture(move)
1180 && !pos.can_castle(pos.side_to_move());
1182 // Don't search moves with negative SEE values
1184 && (!InCheck || evasionPrunable)
1186 && type_of(move) != PROMOTION
1187 && pos.see_sign(move) < VALUE_ZERO)
1190 // Check for legality just before making the move
1191 if (!pos.legal(move, ci.pinned))
1194 ss->currentMove = move;
1196 // Make and search the move
1197 pos.do_move(move, st, ci, givesCheck);
1198 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1199 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1200 pos.undo_move(move);
1202 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1204 // Check for new best move
1205 if (value > bestValue)
1211 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1218 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1219 ttDepth, move, ss->staticEval);
1227 // All legal moves have been searched. A special case: If we're in check
1228 // and no legal moves were found, it is checkmate.
1229 if (InCheck && bestValue == -VALUE_INFINITE)
1230 return mated_in(ss->ply); // Plies to mate from the root
1232 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1233 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1234 ttDepth, bestMove, ss->staticEval);
1236 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1242 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1243 // "plies to mate from the current position". Non-mate scores are unchanged.
1244 // The function is called before storing a value in the transposition table.
1246 Value value_to_tt(Value v, int ply) {
1248 assert(v != VALUE_NONE);
1250 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1251 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1255 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1256 // from the transposition table (which refers to the plies to mate/be mated
1257 // from current position) to "plies to mate/be mated from the root".
1259 Value value_from_tt(Value v, int ply) {
1261 return v == VALUE_NONE ? VALUE_NONE
1262 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1263 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1267 // update_stats() updates killers, history, countermoves and followupmoves stats after a fail-high
1270 void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt) {
1272 if (ss->killers[0] != move)
1274 ss->killers[1] = ss->killers[0];
1275 ss->killers[0] = move;
1278 // Increase history value of the cut-off move and decrease all the other
1279 // played quiet moves.
1280 Value bonus = Value(int(depth) * int(depth));
1281 History.update(pos.moved_piece(move), to_sq(move), bonus);
1282 for (int i = 0; i < quietsCnt; ++i)
1285 History.update(pos.moved_piece(m), to_sq(m), -bonus);
1288 if (is_ok((ss-1)->currentMove))
1290 Square prevMoveSq = to_sq((ss-1)->currentMove);
1291 Countermoves.update(pos.piece_on(prevMoveSq), prevMoveSq, move);
1294 if (is_ok((ss-2)->currentMove) && (ss-1)->currentMove == (ss-1)->ttMove)
1296 Square prevOwnMoveSq = to_sq((ss-2)->currentMove);
1297 Followupmoves.update(pos.piece_on(prevOwnMoveSq), prevOwnMoveSq, move);
1302 // When playing with a strength handicap, choose best move among the MultiPV
1303 // set using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1305 Move Skill::pick_move() {
1309 // PRNG sequence should be not deterministic
1310 for (int i = Time::now() % 50; i > 0; --i)
1311 rk.rand<unsigned>();
1313 // RootMoves are already sorted by score in descending order
1314 int variance = std::min(RootMoves[0].score - RootMoves[MultiPV - 1].score, PawnValueMg);
1315 int weakness = 120 - 2 * level;
1316 int max_s = -VALUE_INFINITE;
1319 // Choose best move. For each move score we add two terms both dependent on
1320 // weakness. One deterministic and bigger for weaker moves, and one random,
1321 // then we choose the move with the resulting highest score.
1322 for (size_t i = 0; i < MultiPV; ++i)
1324 int s = RootMoves[i].score;
1326 // Don't allow crazy blunders even at very low skills
1327 if (i > 0 && RootMoves[i-1].score > s + 2 * PawnValueMg)
1330 // This is our magic formula
1331 s += ( weakness * int(RootMoves[0].score - s)
1332 + variance * (rk.rand<unsigned>() % weakness)) / 128;
1337 best = RootMoves[i].pv[0];
1344 // uci_pv() formats PV information according to the UCI protocol. UCI
1345 // requires that all (if any) unsearched PV lines are sent using a previous
1348 string uci_pv(const Position& pos, int depth, Value alpha, Value beta) {
1350 std::stringstream ss;
1351 Time::point elapsed = Time::now() - SearchTime + 1;
1352 size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
1355 for (size_t i = 0; i < Threads.size(); ++i)
1356 if (Threads[i]->maxPly > selDepth)
1357 selDepth = Threads[i]->maxPly;
1359 for (size_t i = 0; i < uciPVSize; ++i)
1361 bool updated = (i <= PVIdx);
1363 if (depth == 1 && !updated)
1366 int d = updated ? depth : depth - 1;
1367 Value v = updated ? RootMoves[i].score : RootMoves[i].prevScore;
1369 if (ss.rdbuf()->in_avail()) // Not at first line
1372 ss << "info depth " << d
1373 << " seldepth " << selDepth
1374 << " score " << (i == PVIdx ? score_to_uci(v, alpha, beta) : score_to_uci(v))
1375 << " nodes " << pos.nodes_searched()
1376 << " nps " << pos.nodes_searched() * 1000 / elapsed
1377 << " time " << elapsed
1378 << " multipv " << i + 1
1381 for (size_t j = 0; RootMoves[i].pv[j] != MOVE_NONE; ++j)
1382 ss << " " << move_to_uci(RootMoves[i].pv[j], pos.is_chess960());
1391 /// RootMove::extract_pv_from_tt() builds a PV by adding moves from the TT table.
1392 /// We also consider both failing high nodes and BOUND_EXACT nodes here to
1393 /// ensure that we have a ponder move even when we fail high at root. This
1394 /// results in a long PV to print that is important for position analysis.
1396 void RootMove::extract_pv_from_tt(Position& pos) {
1398 StateInfo state[MAX_PLY_PLUS_6], *st = state;
1408 assert(MoveList<LEGAL>(pos).contains(pv[ply]));
1410 pos.do_move(pv[ply++], *st++);
1411 tte = TT.probe(pos.key());
1414 && pos.pseudo_legal(m = tte->move()) // Local copy, TT could change
1415 && pos.legal(m, pos.pinned_pieces(pos.side_to_move()))
1417 && (!pos.is_draw() || ply < 2));
1419 pv.push_back(MOVE_NONE); // Must be zero-terminating
1421 while (ply) pos.undo_move(pv[--ply]);
1425 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1426 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1427 /// first, even if the old TT entries have been overwritten.
1429 void RootMove::insert_pv_in_tt(Position& pos) {
1431 StateInfo state[MAX_PLY_PLUS_6], *st = state;
1436 tte = TT.probe(pos.key());
1438 if (!tte || tte->move() != pv[ply]) // Don't overwrite correct entries
1439 TT.store(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[ply], VALUE_NONE);
1441 assert(MoveList<LEGAL>(pos).contains(pv[ply]));
1443 pos.do_move(pv[ply++], *st++);
1445 } while (pv[ply] != MOVE_NONE);
1447 while (ply) pos.undo_move(pv[--ply]);
1451 /// Thread::idle_loop() is where the thread is parked when it has no work to do
1453 void Thread::idle_loop() {
1455 // Pointer 'this_sp' is not null only if we are called from split(), and not
1456 // at the thread creation. This means we are the split point's master.
1457 SplitPoint* this_sp = splitPointsSize ? activeSplitPoint : NULL;
1459 assert(!this_sp || (this_sp->masterThread == this && searching));
1463 // If we are not searching, wait for a condition to be signaled instead of
1464 // wasting CPU time polling for work.
1465 while ((!searching && Threads.sleepWhileIdle) || exit)
1473 // Grab the lock to avoid races with Thread::notify_one()
1476 // If we are master and all slaves have finished then exit idle_loop
1477 if (this_sp && this_sp->slavesMask.none())
1483 // Do sleep after retesting sleep conditions under lock protection. In
1484 // particular we need to avoid a deadlock in case a master thread has,
1485 // in the meanwhile, allocated us and sent the notify_one() call before
1486 // we had the chance to grab the lock.
1487 if (!searching && !exit)
1488 sleepCondition.wait(mutex);
1493 // If this thread has been assigned work, launch a search
1498 Threads.mutex.lock();
1501 assert(activeSplitPoint);
1502 SplitPoint* sp = activeSplitPoint;
1504 Threads.mutex.unlock();
1506 Stack stack[MAX_PLY_PLUS_6], *ss = stack+2; // To allow referencing (ss-2)
1507 Position pos(*sp->pos, this);
1509 std::memcpy(ss-2, sp->ss-2, 5 * sizeof(Stack));
1510 ss->splitPoint = sp;
1514 assert(activePosition == NULL);
1516 activePosition = &pos;
1518 if (sp->nodeType == NonPV)
1519 search<NonPV, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1521 else if (sp->nodeType == PV)
1522 search<PV, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1524 else if (sp->nodeType == Root)
1525 search<Root, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1533 activePosition = NULL;
1534 sp->slavesMask.reset(idx);
1535 sp->allSlavesSearching = false;
1536 sp->nodes += pos.nodes_searched();
1538 // Wake up the master thread so to allow it to return from the idle
1539 // loop in case we are the last slave of the split point.
1540 if ( Threads.sleepWhileIdle
1541 && this != sp->masterThread
1542 && sp->slavesMask.none())
1544 assert(!sp->masterThread->searching);
1545 sp->masterThread->notify_one();
1548 // After releasing the lock we can't access any SplitPoint related data
1549 // in a safe way because it could have been released under our feet by
1553 // Try to late join to another split point if none of its slaves has
1554 // already finished.
1555 if (Threads.size() > 2)
1556 for (size_t i = 0; i < Threads.size(); ++i)
1558 int size = Threads[i]->splitPointsSize; // Local copy
1559 sp = size ? &Threads[i]->splitPoints[size - 1] : NULL;
1562 && sp->allSlavesSearching
1563 && available_to(Threads[i]))
1565 // Recheck the conditions under lock protection
1566 Threads.mutex.lock();
1569 if ( sp->allSlavesSearching
1570 && available_to(Threads[i]))
1572 sp->slavesMask.set(idx);
1573 activeSplitPoint = sp;
1578 Threads.mutex.unlock();
1580 break; // Just a single attempt
1585 // If this thread is the master of a split point and all slaves have finished
1586 // their work at this split point, return from the idle loop.
1587 if (this_sp && this_sp->slavesMask.none())
1589 this_sp->mutex.lock();
1590 bool finished = this_sp->slavesMask.none(); // Retest under lock protection
1591 this_sp->mutex.unlock();
1599 /// check_time() is called by the timer thread when the timer triggers. It is
1600 /// used to print debug info and, more importantly, to detect when we are out of
1601 /// available time and thus stop the search.
1605 static Time::point lastInfoTime = Time::now();
1606 int64_t nodes = 0; // Workaround silly 'uninitialized' gcc warning
1608 if (Time::now() - lastInfoTime >= 1000)
1610 lastInfoTime = Time::now();
1619 Threads.mutex.lock();
1621 nodes = RootPos.nodes_searched();
1623 // Loop across all split points and sum accumulated SplitPoint nodes plus
1624 // all the currently active positions nodes.
1625 for (size_t i = 0; i < Threads.size(); ++i)
1626 for (int j = 0; j < Threads[i]->splitPointsSize; ++j)
1628 SplitPoint& sp = Threads[i]->splitPoints[j];
1634 for (size_t idx = 0; idx < Threads.size(); ++idx)
1635 if (sp.slavesMask.test(idx) && Threads[idx]->activePosition)
1636 nodes += Threads[idx]->activePosition->nodes_searched();
1641 Threads.mutex.unlock();
1644 Time::point elapsed = Time::now() - SearchTime;
1645 bool stillAtFirstMove = Signals.firstRootMove
1646 && !Signals.failedLowAtRoot
1647 && elapsed > TimeMgr.available_time() * 75 / 100;
1649 bool noMoreTime = elapsed > TimeMgr.maximum_time() - 2 * TimerThread::Resolution
1650 || stillAtFirstMove;
1652 if ( (Limits.use_time_management() && noMoreTime)
1653 || (Limits.movetime && elapsed >= Limits.movetime)
1654 || (Limits.nodes && nodes >= Limits.nodes))
1655 Signals.stop = true;