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-2012 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 // This is the minimum interval in msec between two check_time() calls
60 const int TimerResolution = 5;
62 // Different node types, used as template parameter
63 enum NodeType { Root, PV, NonPV, SplitPointRoot, SplitPointPV, SplitPointNonPV };
65 // Dynamic razoring margin based on depth
66 inline Value razor_margin(Depth d) { return Value(512 + 16 * int(d)); }
68 // Futility lookup tables (initialized at startup) and their access functions
69 Value FutilityMargins[16][64]; // [depth][moveNumber]
70 int FutilityMoveCounts[32]; // [depth]
72 inline Value futility_margin(Depth d, int mn) {
74 return d < 7 * ONE_PLY ? FutilityMargins[std::max(int(d), 1)][std::min(mn, 63)]
78 // Reduction lookup tables (initialized at startup) and their access function
79 int8_t Reductions[2][64][64]; // [pv][depth][moveNumber]
81 template <bool PvNode> inline Depth reduction(Depth d, int mn) {
83 return (Depth) Reductions[PvNode][std::min(int(d) / ONE_PLY, 63)][std::min(mn, 63)];
89 Value DrawValue[COLOR_NB];
92 template <NodeType NT>
93 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
95 template <NodeType NT, bool InCheck>
96 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
98 void id_loop(Position& pos);
99 Value value_to_tt(Value v, int ply);
100 Value value_from_tt(Value v, int ply);
101 bool check_is_dangerous(Position& pos, Move move, Value futilityBase, Value beta);
102 bool yields_to_threat(const Position& pos, Move move, Move threat);
103 bool prevents_threat(const Position& pos, Move move, Move threat);
104 string uci_pv(const Position& pos, int depth, Value alpha, Value beta);
107 Skill(int l) : level(l), best(MOVE_NONE) {}
109 if (enabled()) // Swap best PV line with the sub-optimal one
110 std::swap(RootMoves[0], *std::find(RootMoves.begin(),
111 RootMoves.end(), best ? best : pick_move()));
114 bool enabled() const { return level < 20; }
115 bool time_to_pick(int depth) const { return depth == 1 + level; }
125 /// Search::init() is called during startup to initialize various lookup tables
127 void Search::init() {
129 int d; // depth (ONE_PLY == 2)
130 int hd; // half depth (ONE_PLY == 1)
133 // Init reductions array
134 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
136 double pvRed = log(double(hd)) * log(double(mc)) / 3.0;
137 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
138 Reductions[1][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
139 Reductions[0][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
142 // Init futility margins array
143 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
144 FutilityMargins[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
146 // Init futility move count array
147 for (d = 0; d < 32; d++)
148 FutilityMoveCounts[d] = int(3.001 + 0.25 * pow(double(d), 2.0));
152 /// Search::perft() is our utility to verify move generation. All the leaf nodes
153 /// up to the given depth are generated and counted and the sum returned.
155 size_t Search::perft(Position& pos, Depth depth) {
157 // At the last ply just return the number of legal moves (leaf nodes)
158 if (depth == ONE_PLY)
159 return MoveList<LEGAL>(pos).size();
165 for (MoveList<LEGAL> ml(pos); !ml.end(); ++ml)
167 pos.do_move(ml.move(), st, ci, pos.move_gives_check(ml.move(), ci));
168 cnt += perft(pos, depth - ONE_PLY);
169 pos.undo_move(ml.move());
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 static PolyglotBook book; // Defined static to initialize the PRNG only once
184 RootColor = RootPos.side_to_move();
185 TimeMgr.init(Limits, RootPos.startpos_ply_counter(), RootColor);
187 if (RootMoves.empty())
189 RootMoves.push_back(MOVE_NONE);
190 sync_cout << "info depth 0 score "
191 << score_to_uci(RootPos.in_check() ? -VALUE_MATE : VALUE_DRAW)
197 if (Options["OwnBook"] && !Limits.infinite)
199 Move bookMove = book.probe(RootPos, Options["Book File"], Options["Best Book Move"]);
201 if (bookMove && std::count(RootMoves.begin(), RootMoves.end(), bookMove))
203 std::swap(RootMoves[0], *std::find(RootMoves.begin(), RootMoves.end(), bookMove));
208 if (Options["Contempt Factor"] && !Options["UCI_AnalyseMode"])
210 int cf = Options["Contempt Factor"] * PawnValueMg / 100; // From centipawns
211 cf = cf * MaterialTable::game_phase(RootPos) / PHASE_MIDGAME; // Scale down with phase
212 DrawValue[ RootColor] = VALUE_DRAW - Value(cf);
213 DrawValue[~RootColor] = VALUE_DRAW + Value(cf);
216 DrawValue[WHITE] = DrawValue[BLACK] = VALUE_DRAW;
218 if (Options["Use Search Log"])
220 Log log(Options["Search Log Filename"]);
221 log << "\nSearching: " << RootPos.fen()
222 << "\ninfinite: " << Limits.infinite
223 << " ponder: " << Limits.ponder
224 << " time: " << Limits.time[RootColor]
225 << " increment: " << Limits.inc[RootColor]
226 << " moves to go: " << Limits.movestogo
232 // Set best timer interval to avoid lagging under time pressure. Timer is
233 // used to check for remaining available thinking time.
234 if (Limits.use_time_management())
235 Threads.set_timer(std::min(100, std::max(TimeMgr.available_time() / 16,
237 else if (Limits.nodes)
238 Threads.set_timer(2 * TimerResolution);
240 Threads.set_timer(100);
242 id_loop(RootPos); // Let's start searching !
244 Threads.set_timer(0); // Stop timer
247 if (Options["Use Search Log"])
249 Time::point elapsed = Time::now() - SearchTime + 1;
251 Log log(Options["Search Log Filename"]);
252 log << "Nodes: " << RootPos.nodes_searched()
253 << "\nNodes/second: " << RootPos.nodes_searched() * 1000 / elapsed
254 << "\nBest move: " << move_to_san(RootPos, RootMoves[0].pv[0]);
257 RootPos.do_move(RootMoves[0].pv[0], st);
258 log << "\nPonder move: " << move_to_san(RootPos, RootMoves[0].pv[1]) << std::endl;
259 RootPos.undo_move(RootMoves[0].pv[0]);
264 // When we reach max depth we arrive here even without Signals.stop is raised,
265 // but if we are pondering or in infinite search, we shouldn't print the best
266 // move before we are told to do so.
267 if (!Signals.stop && (Limits.ponder || Limits.infinite))
268 RootPos.this_thread()->wait_for_stop_or_ponderhit();
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 ss[MAX_PLY_PLUS_2];
286 int depth, prevBestMoveChanges;
287 Value bestValue, alpha, beta, delta;
288 bool bestMoveNeverChanged = true;
290 memset(ss, 0, 4 * sizeof(Stack));
291 depth = BestMoveChanges = 0;
292 bestValue = delta = -VALUE_INFINITE;
293 ss->currentMove = MOVE_NULL; // Hack to skip update gains
297 PVSize = Options["MultiPV"];
298 Skill skill(Options["Skill Level"]);
300 // Do we have to play with skill handicap? In this case enable MultiPV search
301 // that we will use behind the scenes to retrieve a set of possible moves.
302 if (skill.enabled() && PVSize < 4)
305 PVSize = std::min(PVSize, RootMoves.size());
307 // Iterative deepening loop until requested to stop or target depth reached
308 while (++depth <= MAX_PLY && !Signals.stop && (!Limits.depth || depth <= Limits.depth))
310 // Save last iteration's scores before first PV line is searched and all
311 // the move scores but the (new) PV are set to -VALUE_INFINITE.
312 for (size_t i = 0; i < RootMoves.size(); i++)
313 RootMoves[i].prevScore = RootMoves[i].score;
315 prevBestMoveChanges = BestMoveChanges; // Only sensible when PVSize == 1
318 // MultiPV loop. We perform a full root search for each PV line
319 for (PVIdx = 0; PVIdx < PVSize; PVIdx++)
321 // Set aspiration window default width
322 if (depth >= 5 && abs(RootMoves[PVIdx].prevScore) < VALUE_KNOWN_WIN)
325 alpha = RootMoves[PVIdx].prevScore - delta;
326 beta = RootMoves[PVIdx].prevScore + delta;
330 alpha = -VALUE_INFINITE;
331 beta = VALUE_INFINITE;
334 // Start with a small aspiration window and, in case of fail high/low,
335 // research with bigger window until not failing high/low anymore.
338 // Search starts from ss+1 to allow referencing (ss-1). This is
339 // needed by update gains and ss copy when splitting at Root.
340 bestValue = search<Root>(pos, ss+1, alpha, beta, depth * ONE_PLY);
342 // Bring to front the best move. It is critical that sorting is
343 // done with a stable algorithm because all the values but the first
344 // and eventually the new best one are set to -VALUE_INFINITE and
345 // we want to keep the same order for all the moves but the new
346 // PV that goes to the front. Note that in case of MultiPV search
347 // the already searched PV lines are preserved.
348 sort<RootMove>(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 return immediately. Sorting and
356 // writing PV back to TT is safe becuase RootMoves is still
357 // valid, although refers to previous iteration.
361 // In case of failing high/low increase aspiration window and
362 // research, otherwise exit the loop.
363 if (bestValue > alpha && bestValue < beta)
366 // Give some update (without cluttering the UI) before to research
367 if (Time::now() - SearchTime > 3000)
368 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
370 if (abs(bestValue) >= VALUE_KNOWN_WIN)
372 alpha = -VALUE_INFINITE;
373 beta = VALUE_INFINITE;
375 else if (bestValue >= beta)
382 Signals.failedLowAtRoot = true;
383 Signals.stopOnPonderhit = false;
389 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
392 // Sort the PV lines searched so far and update the GUI
393 sort<RootMove>(RootMoves.begin(), RootMoves.begin() + PVIdx + 1);
394 if (PVIdx + 1 == PVSize || Time::now() - SearchTime > 3000)
395 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
398 // Do we need to pick now the sub-optimal best move ?
399 if (skill.enabled() && skill.time_to_pick(depth))
402 if (Options["Use Search Log"])
404 Log log(Options["Search Log Filename"]);
405 log << pretty_pv(pos, depth, bestValue, Time::now() - SearchTime, &RootMoves[0].pv[0])
409 // Filter out startup noise when monitoring best move stability
410 if (depth > 2 && BestMoveChanges)
411 bestMoveNeverChanged = false;
413 // Do we have time for the next iteration? Can we stop searching now?
414 if (Limits.use_time_management() && !Signals.stopOnPonderhit)
416 bool stop = false; // Local variable, not the volatile Signals.stop
418 // Take in account some extra time if the best move has changed
419 if (depth > 4 && depth < 50 && PVSize == 1)
420 TimeMgr.pv_instability(BestMoveChanges, prevBestMoveChanges);
422 // Stop search if most of available time is already consumed. We
423 // probably don't have enough time to search the first move at the
424 // next iteration anyway.
425 if (Time::now() - SearchTime > (TimeMgr.available_time() * 62) / 100)
428 // Stop search early if one move seems to be much better than others
432 && ( (bestMoveNeverChanged && pos.captured_piece_type())
433 || Time::now() - SearchTime > (TimeMgr.available_time() * 40) / 100))
435 Value rBeta = bestValue - 2 * PawnValueMg;
436 (ss+1)->excludedMove = RootMoves[0].pv[0];
437 (ss+1)->skipNullMove = true;
438 Value v = search<NonPV>(pos, ss+1, rBeta - 1, rBeta, (depth - 3) * ONE_PLY);
439 (ss+1)->skipNullMove = false;
440 (ss+1)->excludedMove = MOVE_NONE;
448 // If we are allowed to ponder do not stop the search now but
449 // keep pondering until GUI sends "ponderhit" or "stop".
451 Signals.stopOnPonderhit = true;
460 // search<>() is the main search function for both PV and non-PV nodes and for
461 // normal and SplitPoint nodes. When called just after a split point the search
462 // is simpler because we have already probed the hash table, done a null move
463 // search, and searched the first move before splitting, we don't have to repeat
464 // all this work again. We also don't need to store anything to the hash table
465 // here: This is taken care of after we return from the split point.
467 template <NodeType NT>
468 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
470 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV || NT == SplitPointRoot);
471 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV || NT == SplitPointRoot);
472 const bool RootNode = (NT == Root || NT == SplitPointRoot);
474 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
475 assert(PvNode || (alpha == beta - 1));
476 assert(depth > DEPTH_ZERO);
478 Move movesSearched[64];
483 Move ttMove, move, excludedMove, bestMove, threatMove;
485 Value bestValue, value, ttValue, ttValueUpper;
486 Value eval, nullValue, futilityValue;
487 bool inCheck, givesCheck, pvMove, singularExtensionNode;
488 bool captureOrPromotion, dangerous, doFullDepthSearch;
489 int moveCount, playedMoveCount;
491 // Step 1. Initialize node
492 Thread* thisThread = pos.this_thread();
493 moveCount = playedMoveCount = 0;
494 inCheck = pos.in_check();
499 bestMove = sp->bestMove;
500 threatMove = sp->threatMove;
501 bestValue = sp->bestValue;
503 ttMove = excludedMove = MOVE_NONE;
504 ttValue = VALUE_NONE;
506 assert(sp->bestValue > -VALUE_INFINITE && sp->moveCount > 0);
508 goto split_point_start;
511 bestValue = -VALUE_INFINITE;
512 ss->currentMove = threatMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
513 ss->ply = (ss-1)->ply + 1;
514 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
515 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
517 // Used to send selDepth info to GUI
518 if (PvNode && thisThread->maxPly < ss->ply)
519 thisThread->maxPly = ss->ply;
523 // Step 2. Check for aborted search and immediate draw
524 if (Signals.stop || pos.is_draw<true, PvNode>() || ss->ply > MAX_PLY)
525 return DrawValue[pos.side_to_move()];
527 // Step 3. Mate distance pruning. Even if we mate at the next move our score
528 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
529 // a shorter mate was found upward in the tree then there is no need to search
530 // further, we will never beat current alpha. Same logic but with reversed signs
531 // applies also in the opposite condition of being mated instead of giving mate,
532 // in this case return a fail-high score.
533 alpha = std::max(mated_in(ss->ply), alpha);
534 beta = std::min(mate_in(ss->ply+1), beta);
539 // Step 4. Transposition table lookup
540 // We don't want the score of a partial search to overwrite a previous full search
541 // TT value, so we use a different position key in case of an excluded move.
542 excludedMove = ss->excludedMove;
543 posKey = excludedMove ? pos.exclusion_key() : pos.key();
544 tte = TT.probe(posKey);
545 ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
546 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
547 ttValueUpper = tte ? value_from_tt(tte->value_upper(), ss->ply) : VALUE_NONE;
549 // At PV nodes we check for exact scores, while at non-PV nodes we check for
550 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
551 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
552 // we should also update RootMoveList to avoid bogus output.
553 if (!RootNode && tte)
556 if ( (tte->type() & BOUND_LOWER)
558 && tte->depth() >= depth
559 && ttValue != VALUE_NONE) // Only in case of TT access race
561 // Update killers, we assume ttMove caused a cut-off
563 && !pos.is_capture_or_promotion(ttMove)
564 && ttMove != ss->killers[0])
566 ss->killers[1] = ss->killers[0];
567 ss->killers[0] = ttMove;
570 ss->currentMove = ttMove; // Can be MOVE_NONE
575 if ( (tte->type() & BOUND_UPPER)
576 && ttValueUpper < beta
577 && tte->depth_upper() >= depth
578 && ttValueUpper != VALUE_NONE) // Only in case of TT access race
581 ss->currentMove = ttMove; // Can be MOVE_NONE
586 // Step 5. Evaluate the position statically and update parent's gain statistics
588 ss->staticEval = ss->evalMargin = eval = VALUE_NONE;
591 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
593 // Can ttValue be used as a better position evaluation?
594 if (tte && ttValue != VALUE_NONE)
596 if ( ((tte->type() & BOUND_LOWER) && ttValue > eval)
597 || ((tte->type() & BOUND_UPPER) && ttValue < eval))
602 // Update gain for the parent non-capture move given the static position
603 // evaluation before and after the move.
604 if ( (move = (ss-1)->currentMove) != MOVE_NULL
605 && (ss-1)->staticEval != VALUE_NONE
606 && ss->staticEval != VALUE_NONE
607 && !pos.captured_piece_type()
608 && type_of(move) == NORMAL)
610 Square to = to_sq(move);
611 H.update_gain(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
614 // Step 6. Razoring (is omitted in PV nodes)
616 && depth < 4 * ONE_PLY
618 && eval + razor_margin(depth) < beta
619 && ttMove == MOVE_NONE
620 && abs(beta) < VALUE_MATE_IN_MAX_PLY
621 && !pos.pawn_on_7th(pos.side_to_move()))
623 Value rbeta = beta - razor_margin(depth);
624 Value v = qsearch<NonPV, false>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
626 // Logically we should return (v + razor_margin(depth)), but
627 // surprisingly this did slightly weaker in tests.
631 // Step 7. Static null move pruning (is omitted in PV nodes)
632 // We're betting that the opponent doesn't have a move that will reduce
633 // the score by more than futility_margin(depth) if we do a null move.
636 && depth < 4 * ONE_PLY
638 && eval - FutilityMargins[depth][0] >= beta
639 && abs(beta) < VALUE_MATE_IN_MAX_PLY
640 && pos.non_pawn_material(pos.side_to_move()))
641 return eval - FutilityMargins[depth][0];
643 // Step 8. Null move search with verification search (is omitted in PV nodes)
649 && abs(beta) < VALUE_MATE_IN_MAX_PLY
650 && pos.non_pawn_material(pos.side_to_move()))
652 ss->currentMove = MOVE_NULL;
654 // Null move dynamic reduction based on depth
655 Depth R = 3 * ONE_PLY + depth / 4;
657 // Null move dynamic reduction based on value
658 if (eval - PawnValueMg > beta)
661 pos.do_null_move<true>(st);
662 (ss+1)->skipNullMove = true;
663 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
664 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R);
665 (ss+1)->skipNullMove = false;
666 pos.do_null_move<false>(st);
668 if (nullValue >= beta)
670 // Do not return unproven mate scores
671 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
674 if (depth < 6 * ONE_PLY)
677 // Do verification search at high depths
678 ss->skipNullMove = true;
679 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R);
680 ss->skipNullMove = false;
687 // The null move failed low, which means that we may be faced with
688 // some kind of threat. If the previous move was reduced, check if
689 // the move that refuted the null move was somehow connected to the
690 // move which was reduced. If a connection is found, return a fail
691 // low score (which will cause the reduced move to fail high in the
692 // parent node, which will trigger a re-search with full depth).
693 threatMove = (ss+1)->currentMove;
695 if ( depth < 5 * ONE_PLY
697 && threatMove != MOVE_NONE
698 && yields_to_threat(pos, (ss-1)->currentMove, threatMove))
703 // Step 9. ProbCut (is omitted in PV nodes)
704 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
705 // and a reduced search returns a value much above beta, we can (almost) safely
706 // prune the previous move.
708 && depth >= 5 * ONE_PLY
711 && excludedMove == MOVE_NONE
712 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
714 Value rbeta = beta + 200;
715 Depth rdepth = depth - ONE_PLY - 3 * ONE_PLY;
717 assert(rdepth >= ONE_PLY);
718 assert((ss-1)->currentMove != MOVE_NONE);
719 assert((ss-1)->currentMove != MOVE_NULL);
721 MovePicker mp(pos, ttMove, H, pos.captured_piece_type());
724 while ((move = mp.next_move<false>()) != MOVE_NONE)
725 if (pos.pl_move_is_legal(move, ci.pinned))
727 ss->currentMove = move;
728 pos.do_move(move, st, ci, pos.move_gives_check(move, ci));
729 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth);
736 // Step 10. Internal iterative deepening
737 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
738 && ttMove == MOVE_NONE
739 && (PvNode || (!inCheck && ss->staticEval + Value(256) >= beta)))
741 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
743 ss->skipNullMove = true;
744 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d);
745 ss->skipNullMove = false;
747 tte = TT.probe(posKey);
748 ttMove = tte ? tte->move() : MOVE_NONE;
751 split_point_start: // At split points actual search starts from here
753 MovePicker mp(pos, ttMove, depth, H, ss, PvNode ? -VALUE_INFINITE : beta);
755 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
756 singularExtensionNode = !RootNode
758 && depth >= (PvNode ? 6 * ONE_PLY : 8 * ONE_PLY)
759 && ttMove != MOVE_NONE
760 && !excludedMove // Recursive singular search is not allowed
761 && (tte->type() & BOUND_LOWER)
762 && tte->depth() >= depth - 3 * ONE_PLY;
764 // Step 11. Loop through moves
765 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
766 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
770 if (move == excludedMove)
773 // At root obey the "searchmoves" option and skip moves not listed in Root
774 // Move List, as a consequence any illegal move is also skipped. In MultiPV
775 // mode we also skip PV moves which have been already searched.
776 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
781 // Shared counter cannot be decremented later if move turns out to be illegal
782 if (!pos.pl_move_is_legal(move, ci.pinned))
785 moveCount = ++sp->moveCount;
793 Signals.firstRootMove = (moveCount == 1);
795 if (thisThread == Threads.main_thread() && Time::now() - SearchTime > 3000)
796 sync_cout << "info depth " << depth / ONE_PLY
797 << " currmove " << move_to_uci(move, pos.is_chess960())
798 << " currmovenumber " << moveCount + PVIdx << sync_endl;
802 captureOrPromotion = pos.is_capture_or_promotion(move);
803 givesCheck = pos.move_gives_check(move, ci);
804 dangerous = givesCheck
805 || pos.is_passed_pawn_push(move)
806 || type_of(move) == CASTLE
807 || ( captureOrPromotion // Entering a pawn endgame?
808 && type_of(pos.piece_on(to_sq(move))) != PAWN
809 && type_of(move) == NORMAL
810 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
811 - PieceValue[MG][pos.piece_on(to_sq(move))] == VALUE_ZERO));
813 // Step 12. Extend checks and, in PV nodes, also dangerous moves
814 if (PvNode && dangerous)
817 else if (givesCheck && pos.see_sign(move) >= 0)
820 // Singular extension search. If all moves but one fail low on a search of
821 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
822 // is singular and should be extended. To verify this we do a reduced search
823 // on all the other moves but the ttMove, if result is lower than ttValue minus
824 // a margin then we extend ttMove.
825 if ( singularExtensionNode
828 && pos.pl_move_is_legal(move, ci.pinned)
829 && abs(ttValue) < VALUE_KNOWN_WIN)
831 assert(ttValue != VALUE_NONE);
833 Value rBeta = ttValue - int(depth);
834 ss->excludedMove = move;
835 ss->skipNullMove = true;
836 value = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2);
837 ss->skipNullMove = false;
838 ss->excludedMove = MOVE_NONE;
841 ext = rBeta >= beta ? ONE_PLY + ONE_PLY / 2 : ONE_PLY;
844 // Update current move (this must be done after singular extension search)
845 newDepth = depth - ONE_PLY + ext;
847 // Step 13. Futility pruning (is omitted in PV nodes)
849 && !captureOrPromotion
853 && (bestValue > VALUE_MATED_IN_MAX_PLY || ( bestValue == -VALUE_INFINITE
854 && alpha > VALUE_MATED_IN_MAX_PLY)))
856 // Move count based pruning
857 if ( depth < 16 * ONE_PLY
858 && moveCount >= FutilityMoveCounts[depth]
859 && (!threatMove || !prevents_threat(pos, move, threatMove)))
867 // Value based pruning
868 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
869 // but fixing this made program slightly weaker.
870 Depth predictedDepth = newDepth - reduction<PvNode>(depth, moveCount);
871 futilityValue = ss->staticEval + ss->evalMargin + futility_margin(predictedDepth, moveCount)
872 + H.gain(pos.piece_moved(move), to_sq(move));
874 if (futilityValue < beta)
882 // Prune moves with negative SEE at low depths
883 if ( predictedDepth < 2 * ONE_PLY
884 && pos.see_sign(move) < 0)
893 // Check for legality only before to do the move
894 if (!RootNode && !SpNode && !pos.pl_move_is_legal(move, ci.pinned))
900 pvMove = PvNode ? moveCount == 1 : false;
901 ss->currentMove = move;
902 if (!SpNode && !captureOrPromotion && playedMoveCount < 64)
903 movesSearched[playedMoveCount++] = move;
905 // Step 14. Make the move
906 pos.do_move(move, st, ci, givesCheck);
908 // Step 15. Reduced depth search (LMR). If the move fails high will be
909 // re-searched at full depth.
910 if ( depth > 3 * ONE_PLY
912 && !captureOrPromotion
914 && ss->killers[0] != move
915 && ss->killers[1] != move)
917 ss->reduction = reduction<PvNode>(depth, moveCount);
918 Depth d = std::max(newDepth - ss->reduction, ONE_PLY);
919 alpha = SpNode ? sp->alpha : alpha;
921 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d);
923 doFullDepthSearch = (value > alpha && ss->reduction != DEPTH_ZERO);
924 ss->reduction = DEPTH_ZERO;
927 doFullDepthSearch = !pvMove;
929 // Step 16. Full depth search, when LMR is skipped or fails high
930 if (doFullDepthSearch)
932 alpha = SpNode ? sp->alpha : alpha;
933 value = newDepth < ONE_PLY ?
934 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
935 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
936 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth);
939 // Only for PV nodes do a full PV search on the first move or after a fail
940 // high, in the latter case search only if value < beta, otherwise let the
941 // parent node to fail low with value <= alpha and to try another move.
942 if (PvNode && (pvMove || (value > alpha && (RootNode || value < beta))))
943 value = newDepth < ONE_PLY ?
944 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
945 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
946 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
947 // Step 17. Undo move
950 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
952 // Step 18. Check for new best move
956 bestValue = sp->bestValue;
960 // Finished searching the move. If Signals.stop is true, the search
961 // was aborted because the user interrupted the search or because we
962 // ran out of time. In this case, the return value of the search cannot
963 // be trusted, and we don't update the best move and/or PV.
964 if (Signals.stop || thisThread->cutoff_occurred())
965 return value; // To avoid returning VALUE_INFINITE
969 RootMove& rm = *std::find(RootMoves.begin(), RootMoves.end(), move);
971 // PV move or new best move ?
972 if (pvMove || value > alpha)
975 rm.extract_pv_from_tt(pos);
977 // We record how often the best move has been changed in each
978 // iteration. This information is used for time management: When
979 // the best move changes frequently, we allocate some more time.
984 // All other moves but the PV are set to the lowest value, this
985 // is not a problem when sorting becuase sort is stable and move
986 // position in the list is preserved, just the PV is pushed up.
987 rm.score = -VALUE_INFINITE;
990 if (value > bestValue)
993 if (SpNode) sp->bestValue = value;
998 if (SpNode) sp->bestMove = move;
1000 if (PvNode && value < beta)
1002 alpha = value; // Update alpha here! Always alpha < beta
1003 if (SpNode) sp->alpha = value;
1007 assert(value >= beta); // Fail high
1009 if (SpNode) sp->cutoff = true;
1015 // Step 19. Check for splitting the search
1017 && depth >= Threads.min_split_depth()
1019 && Threads.available_slave_exists(thisThread))
1021 bestValue = Threads.split<FakeSplit>(pos, ss, alpha, beta, bestValue, &bestMove,
1022 depth, threatMove, moveCount, mp, NT);
1023 if (bestValue >= beta)
1031 // Step 20. Check for mate and stalemate
1032 // All legal moves have been searched and if there are no legal moves, it
1033 // must be mate or stalemate. Note that we can have a false positive in
1034 // case of Signals.stop or thread.cutoff_occurred() are set, but this is
1035 // harmless because return value is discarded anyhow in the parent nodes.
1036 // If we are in a singular extension search then return a fail low score.
1037 // A split node has at least one move, the one tried before to be splitted.
1039 return excludedMove ? alpha
1040 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1042 // If we have pruned all the moves without searching return a fail-low score
1043 if (bestValue == -VALUE_INFINITE)
1045 assert(!playedMoveCount);
1050 if (bestValue >= beta) // Failed high
1052 TT.store(posKey, value_to_tt(bestValue, ss->ply), BOUND_LOWER, depth, bestMove);
1054 if (!pos.is_capture_or_promotion(bestMove) && !inCheck)
1056 if (bestMove != ss->killers[0])
1058 ss->killers[1] = ss->killers[0];
1059 ss->killers[0] = bestMove;
1062 // Increase history value of the cut-off move
1063 Value bonus = Value(int(depth) * int(depth));
1064 H.add(pos.piece_moved(bestMove), to_sq(bestMove), bonus);
1066 // Decrease history of all the other played non-capture moves
1067 for (int i = 0; i < playedMoveCount - 1; i++)
1069 Move m = movesSearched[i];
1070 H.add(pos.piece_moved(m), to_sq(m), -bonus);
1074 else // Failed low or PV search
1075 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1076 PvNode && bestMove != MOVE_NONE ? BOUND_EXACT : BOUND_UPPER,
1079 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1085 // qsearch() is the quiescence search function, which is called by the main
1086 // search function when the remaining depth is zero (or, to be more precise,
1087 // less than ONE_PLY).
1089 template <NodeType NT, bool InCheck>
1090 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1092 const bool PvNode = (NT == PV);
1094 assert(NT == PV || NT == NonPV);
1095 assert(InCheck == pos.in_check());
1096 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1097 assert(PvNode || (alpha == beta - 1));
1098 assert(depth <= DEPTH_ZERO);
1103 Move ttMove, move, bestMove;
1104 Value bestValue, value, ttValue, ttValueUpper, futilityValue, futilityBase, oldAlpha;
1105 bool givesCheck, enoughMaterial, evasionPrunable, fromNull;
1108 // To flag BOUND_EXACT a node with eval above alpha and no available moves
1112 ss->currentMove = bestMove = MOVE_NONE;
1113 ss->ply = (ss-1)->ply + 1;
1114 fromNull = (ss-1)->currentMove == MOVE_NULL;
1116 // Check for an instant draw or maximum ply reached
1117 if (pos.is_draw<false, false>() || ss->ply > MAX_PLY)
1118 return DrawValue[pos.side_to_move()];
1120 // Transposition table lookup. At PV nodes, we don't use the TT for
1121 // pruning, but only for move ordering.
1123 tte = TT.probe(posKey);
1124 ttMove = tte ? tte->move() : MOVE_NONE;
1125 ttValue = tte ? value_from_tt(tte->value(),ss->ply) : VALUE_NONE;
1126 ttValueUpper = tte ? value_from_tt(tte->value_upper(),ss->ply) : VALUE_NONE;
1128 // Decide whether or not to include checks, this fixes also the type of
1129 // TT entry depth that we are going to use. Note that in qsearch we use
1130 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1131 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1132 : DEPTH_QS_NO_CHECKS;
1136 if ( (tte->type() & BOUND_LOWER)
1138 && tte->depth() >= ttDepth
1139 && ttValue != VALUE_NONE) // Only in case of TT access race
1141 ss->currentMove = ttMove; // Can be MOVE_NONE
1146 if ( (tte->type() & BOUND_UPPER)
1147 && ttValueUpper < beta
1148 && tte->depth_upper() >= ttDepth
1149 && ttValueUpper != VALUE_NONE) // Only in case of TT access race
1151 ss->currentMove = ttMove; // Can be MOVE_NONE
1152 return ttValueUpper;
1156 // Evaluate the position statically
1159 ss->staticEval = ss->evalMargin = VALUE_NONE;
1160 bestValue = futilityBase = -VALUE_INFINITE;
1161 enoughMaterial = false;
1167 // Approximated score. Real one is slightly higher due to tempo
1168 ss->staticEval = bestValue = -(ss-1)->staticEval;
1169 ss->evalMargin = VALUE_ZERO;
1172 ss->staticEval = bestValue = evaluate(pos, ss->evalMargin);
1174 // Stand pat. Return immediately if static value is at least beta
1175 if (bestValue >= beta)
1178 TT.store(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER, DEPTH_NONE, MOVE_NONE);
1183 if (PvNode && bestValue > alpha)
1186 futilityBase = ss->staticEval + ss->evalMargin + Value(128);
1187 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMg;
1190 // Initialize a MovePicker object for the current position, and prepare
1191 // to search the moves. Because the depth is <= 0 here, only captures,
1192 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1194 MovePicker mp(pos, ttMove, depth, H, to_sq((ss-1)->currentMove));
1197 // Loop through the moves until no moves remain or a beta cutoff occurs
1198 while ((move = mp.next_move<false>()) != MOVE_NONE)
1200 assert(is_ok(move));
1202 givesCheck = pos.move_gives_check(move, ci);
1211 && type_of(move) != PROMOTION
1212 && !pos.is_passed_pawn_push(move))
1214 futilityValue = futilityBase
1215 + PieceValue[EG][pos.piece_on(to_sq(move))]
1216 + (type_of(move) == ENPASSANT ? PawnValueEg : VALUE_ZERO);
1218 if (futilityValue < beta)
1220 bestValue = std::max(bestValue, futilityValue);
1224 // Prune moves with negative or equal SEE
1225 if ( futilityBase < beta
1226 && depth < DEPTH_ZERO
1227 && pos.see(move) <= 0)
1229 bestValue = std::max(bestValue, futilityBase);
1234 // Detect non-capture evasions that are candidate to be pruned
1235 evasionPrunable = !PvNode
1237 && bestValue > VALUE_MATED_IN_MAX_PLY
1238 && !pos.is_capture(move)
1239 && !pos.can_castle(pos.side_to_move());
1241 // Don't search moves with negative SEE values
1243 && (!InCheck || evasionPrunable)
1245 && type_of(move) != PROMOTION
1246 && pos.see_sign(move) < 0)
1249 // Don't search useless checks
1254 && !pos.is_capture_or_promotion(move)
1255 && ss->staticEval + PawnValueMg / 4 < beta
1256 && !check_is_dangerous(pos, move, futilityBase, beta))
1259 // Check for legality only before to do the move
1260 if (!pos.pl_move_is_legal(move, ci.pinned))
1263 ss->currentMove = move;
1265 // Make and search the move
1266 pos.do_move(move, st, ci, givesCheck);
1267 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1268 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1269 pos.undo_move(move);
1271 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1273 // Check for new best move
1274 if (value > bestValue)
1280 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1287 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER, ttDepth, move);
1294 // All legal moves have been searched. A special case: If we're in check
1295 // and no legal moves were found, it is checkmate.
1296 if (InCheck && bestValue == -VALUE_INFINITE)
1297 return mated_in(ss->ply); // Plies to mate from the root
1299 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1300 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1303 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1309 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1310 // "plies to mate from the current position". Non-mate scores are unchanged.
1311 // The function is called before storing a value to the transposition table.
1313 Value value_to_tt(Value v, int ply) {
1315 assert(v != VALUE_NONE);
1317 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1318 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1322 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1323 // from the transposition table (where refers to the plies to mate/be mated
1324 // from current position) to "plies to mate/be mated from the root".
1326 Value value_from_tt(Value v, int ply) {
1328 return v == VALUE_NONE ? VALUE_NONE
1329 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1330 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1334 // check_is_dangerous() tests if a checking move can be pruned in qsearch()
1336 bool check_is_dangerous(Position& pos, Move move, Value futilityBase, Value beta)
1338 Piece pc = pos.piece_moved(move);
1339 Square from = from_sq(move);
1340 Square to = to_sq(move);
1341 Color them = ~pos.side_to_move();
1342 Square ksq = pos.king_square(them);
1343 Bitboard enemies = pos.pieces(them);
1344 Bitboard kingAtt = pos.attacks_from<KING>(ksq);
1345 Bitboard occ = pos.pieces() ^ from ^ ksq;
1346 Bitboard oldAtt = pos.attacks_from(pc, from, occ);
1347 Bitboard newAtt = pos.attacks_from(pc, to, occ);
1349 // Checks which give opponent's king at most one escape square are dangerous
1350 if (!more_than_one(kingAtt & ~(enemies | newAtt | to)))
1353 // Queen contact check is very dangerous
1354 if (type_of(pc) == QUEEN && (kingAtt & to))
1357 // Creating new double threats with checks is dangerous
1358 Bitboard b = (enemies ^ ksq) & newAtt & ~oldAtt;
1361 // Note that here we generate illegal "double move"!
1362 if (futilityBase + PieceValue[EG][pos.piece_on(pop_lsb(&b))] >= beta)
1370 // yields_to_threat() tests whether the move at previous ply yields to the so
1371 // called threat move (the best move returned from a null search that fails
1372 // low). Here 'yields to' means that the move somehow made the threat possible
1373 // for instance if the moving piece is the same in both moves.
1375 bool yields_to_threat(const Position& pos, Move move, Move threat) {
1377 assert(is_ok(move));
1378 assert(is_ok(threat));
1379 assert(color_of(pos.piece_on(from_sq(threat))) == ~pos.side_to_move());
1381 Square mfrom = from_sq(move);
1382 Square mto = to_sq(move);
1383 Square tfrom = from_sq(threat);
1384 Square tto = to_sq(threat);
1386 // The piece is the same or threat's destination was vacated by the move
1387 if (mto == tfrom || tto == mfrom)
1390 // Threat moves through the vacated square
1391 if (between_bb(tfrom, tto) & mfrom)
1394 // Threat's destination is defended by the move's piece
1395 Bitboard matt = pos.attacks_from(pos.piece_on(mto), mto, pos.pieces() ^ tfrom);
1399 // Threat gives a discovered check through the move's checking piece
1400 if (matt & pos.king_square(pos.side_to_move()))
1402 assert(between_bb(mto, pos.king_square(pos.side_to_move())) & tfrom);
1410 // prevents_threat() tests whether a move is able to defend against the so
1411 // called threat move (the best move returned from a null search that fails
1412 // low). In this case will not be pruned.
1414 bool prevents_threat(const Position& pos, Move move, Move threat) {
1416 assert(is_ok(move));
1417 assert(is_ok(threat));
1418 assert(!pos.is_capture_or_promotion(move));
1419 assert(!pos.is_passed_pawn_push(move));
1421 Square mfrom = from_sq(move);
1422 Square mto = to_sq(move);
1423 Square tfrom = from_sq(threat);
1424 Square tto = to_sq(threat);
1426 // Don't prune moves of the threatened piece
1430 // If the threatened piece has value less than or equal to the value of the
1431 // threat piece, don't prune moves which defend it.
1432 if ( pos.is_capture(threat)
1433 && ( PieceValue[MG][pos.piece_on(tfrom)] >= PieceValue[MG][pos.piece_on(tto)]
1434 || type_of(pos.piece_on(tfrom)) == KING))
1436 // Update occupancy as if the piece and the threat are moving
1437 Bitboard occ = pos.pieces() ^ mfrom ^ mto ^ tfrom;
1438 Piece piece = pos.piece_on(mfrom);
1440 // The moved piece attacks the square 'tto' ?
1441 if (pos.attacks_from(piece, mto, occ) & tto)
1444 // Scan for possible X-ray attackers behind the moved piece
1445 Bitboard xray = (attacks_bb< ROOK>(tto, occ) & pos.pieces(color_of(piece), QUEEN, ROOK))
1446 | (attacks_bb<BISHOP>(tto, occ) & pos.pieces(color_of(piece), QUEEN, BISHOP));
1448 // Verify attackers are triggered by our move and not already existing
1449 if (xray && (xray ^ (xray & pos.attacks_from<QUEEN>(tto))))
1453 // Don't prune safe moves which block the threat path
1454 if ((between_bb(tfrom, tto) & mto) && pos.see_sign(move) >= 0)
1461 // When playing with strength handicap choose best move among the MultiPV set
1462 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1464 Move Skill::pick_move() {
1468 // PRNG sequence should be not deterministic
1469 for (int i = Time::now() % 50; i > 0; i--)
1470 rk.rand<unsigned>();
1472 // RootMoves are already sorted by score in descending order
1473 int variance = std::min(RootMoves[0].score - RootMoves[PVSize - 1].score, PawnValueMg);
1474 int weakness = 120 - 2 * level;
1475 int max_s = -VALUE_INFINITE;
1478 // Choose best move. For each move score we add two terms both dependent on
1479 // weakness, one deterministic and bigger for weaker moves, and one random,
1480 // then we choose the move with the resulting highest score.
1481 for (size_t i = 0; i < PVSize; i++)
1483 int s = RootMoves[i].score;
1485 // Don't allow crazy blunders even at very low skills
1486 if (i > 0 && RootMoves[i-1].score > s + 2 * PawnValueMg)
1489 // This is our magic formula
1490 s += ( weakness * int(RootMoves[0].score - s)
1491 + variance * (rk.rand<unsigned>() % weakness)) / 128;
1496 best = RootMoves[i].pv[0];
1503 // uci_pv() formats PV information according to UCI protocol. UCI requires
1504 // to send all the PV lines also if are still to be searched and so refer to
1505 // the previous search score.
1507 string uci_pv(const Position& pos, int depth, Value alpha, Value beta) {
1509 std::stringstream s;
1510 Time::point elaspsed = Time::now() - SearchTime + 1;
1511 size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
1514 for (size_t i = 0; i < Threads.size(); i++)
1515 if (Threads[i].maxPly > selDepth)
1516 selDepth = Threads[i].maxPly;
1518 for (size_t i = 0; i < uciPVSize; i++)
1520 bool updated = (i <= PVIdx);
1522 if (depth == 1 && !updated)
1525 int d = updated ? depth : depth - 1;
1526 Value v = updated ? RootMoves[i].score : RootMoves[i].prevScore;
1528 if (s.rdbuf()->in_avail()) // Not at first line
1531 s << "info depth " << d
1532 << " seldepth " << selDepth
1533 << " score " << (i == PVIdx ? score_to_uci(v, alpha, beta) : score_to_uci(v))
1534 << " nodes " << pos.nodes_searched()
1535 << " nps " << pos.nodes_searched() * 1000 / elaspsed
1536 << " time " << elaspsed
1537 << " multipv " << i + 1
1540 for (size_t j = 0; RootMoves[i].pv[j] != MOVE_NONE; j++)
1541 s << " " << move_to_uci(RootMoves[i].pv[j], pos.is_chess960());
1550 /// RootMove::extract_pv_from_tt() builds a PV by adding moves from the TT table.
1551 /// We consider also failing high nodes and not only BOUND_EXACT nodes so to
1552 /// allow to always have a ponder move even when we fail high at root, and a
1553 /// long PV to print that is important for position analysis.
1555 void RootMove::extract_pv_from_tt(Position& pos) {
1557 StateInfo state[MAX_PLY_PLUS_2], *st = state;
1567 assert(pos.move_is_legal(pv[ply]));
1568 pos.do_move(pv[ply++], *st++);
1569 tte = TT.probe(pos.key());
1572 && pos.is_pseudo_legal(m = tte->move()) // Local copy, TT could change
1573 && pos.pl_move_is_legal(m, pos.pinned_pieces())
1575 && (!pos.is_draw<true, true>() || ply < 2));
1577 pv.push_back(MOVE_NONE); // Must be zero-terminating
1579 while (ply) pos.undo_move(pv[--ply]);
1583 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1584 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1585 /// first, even if the old TT entries have been overwritten.
1587 void RootMove::insert_pv_in_tt(Position& pos) {
1589 StateInfo state[MAX_PLY_PLUS_2], *st = state;
1594 tte = TT.probe(pos.key());
1596 if (!tte || tte->move() != pv[ply]) // Don't overwrite correct entries
1597 TT.store(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[ply]);
1599 assert(pos.move_is_legal(pv[ply]));
1600 pos.do_move(pv[ply++], *st++);
1602 } while (pv[ply] != MOVE_NONE);
1604 while (ply) pos.undo_move(pv[--ply]);
1608 /// Thread::idle_loop() is where the thread is parked when it has no work to do
1610 void Thread::idle_loop() {
1612 // Pointer 'sp_master', if non-NULL, points to the active SplitPoint
1613 // object for which the thread is the master.
1614 const SplitPoint* sp_master = splitPointsCnt ? curSplitPoint : NULL;
1616 assert(!sp_master || (sp_master->master == this && is_searching));
1618 // If this thread is the master of a split point and all slaves have
1619 // finished their work at this split point, return from the idle loop.
1620 while (!sp_master || sp_master->slavesMask)
1622 // If we are not searching, wait for a condition to be signaled
1623 // instead of wasting CPU time polling for work.
1626 || (!is_searching && Threads.use_sleeping_threads()))
1634 // Grab the lock to avoid races with Thread::wake_up()
1637 // If we are master and all slaves have finished don't go to sleep
1638 if (sp_master && !sp_master->slavesMask)
1644 // Do sleep after retesting sleep conditions under lock protection, in
1645 // particular we need to avoid a deadlock in case a master thread has,
1646 // in the meanwhile, allocated us and sent the wake_up() call before we
1647 // had the chance to grab the lock.
1648 if (do_sleep || !is_searching)
1649 sleepCondition.wait(mutex);
1654 // If this thread has been assigned work, launch a search
1657 assert(!do_sleep && !do_exit);
1659 Threads.mutex.lock();
1661 assert(is_searching);
1662 SplitPoint* sp = curSplitPoint;
1664 Threads.mutex.unlock();
1666 Stack ss[MAX_PLY_PLUS_2];
1667 Position pos(*sp->pos, this);
1669 memcpy(ss, sp->ss - 1, 4 * sizeof(Stack));
1674 assert(sp->activePositions[idx] == NULL);
1676 sp->activePositions[idx] = &pos;
1678 if (sp->nodeType == Root)
1679 search<SplitPointRoot>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1680 else if (sp->nodeType == PV)
1681 search<SplitPointPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1682 else if (sp->nodeType == NonPV)
1683 search<SplitPointNonPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1687 assert(is_searching);
1689 is_searching = false;
1690 sp->activePositions[idx] = NULL;
1691 sp->slavesMask &= ~(1ULL << idx);
1692 sp->nodes += pos.nodes_searched();
1694 // Wake up master thread so to allow it to return from the idle loop in
1695 // case we are the last slave of the split point.
1696 if ( Threads.use_sleeping_threads()
1697 && this != sp->master
1700 assert(!sp->master->is_searching);
1701 sp->master->wake_up();
1704 // After releasing the lock we cannot access anymore any SplitPoint
1705 // related data in a safe way becuase it could have been released under
1706 // our feet by the sp master. Also accessing other Thread objects is
1707 // unsafe because if we are exiting there is a chance are already freed.
1714 /// check_time() is called by the timer thread when the timer triggers. It is
1715 /// used to print debug info and, more important, to detect when we are out of
1716 /// available time and so stop the search.
1720 static Time::point lastInfoTime = Time::now();
1721 int64_t nodes = 0; // Workaround silly 'uninitialized' gcc warning
1723 if (Time::now() - lastInfoTime >= 1000)
1725 lastInfoTime = Time::now();
1734 Threads.mutex.lock();
1736 nodes = RootPos.nodes_searched();
1738 // Loop across all split points and sum accumulated SplitPoint nodes plus
1739 // all the currently active slaves positions.
1740 for (size_t i = 0; i < Threads.size(); i++)
1741 for (int j = 0; j < Threads[i].splitPointsCnt; j++)
1743 SplitPoint& sp = Threads[i].splitPoints[j];
1748 Bitboard sm = sp.slavesMask;
1751 Position* pos = sp.activePositions[pop_lsb(&sm)];
1752 nodes += pos ? pos->nodes_searched() : 0;
1758 Threads.mutex.unlock();
1761 Time::point elapsed = Time::now() - SearchTime;
1762 bool stillAtFirstMove = Signals.firstRootMove
1763 && !Signals.failedLowAtRoot
1764 && elapsed > TimeMgr.available_time();
1766 bool noMoreTime = elapsed > TimeMgr.maximum_time() - 2 * TimerResolution
1767 || stillAtFirstMove;
1769 if ( (Limits.use_time_management() && noMoreTime)
1770 || (Limits.movetime && elapsed >= Limits.movetime)
1771 || (Limits.nodes && nodes >= Limits.nodes))
1772 Signals.stop = true;