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 // Lookup table to check if a Piece is a slider and its access function
66 const bool Slidings[18] = { 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1 };
67 inline bool piece_is_slider(Piece p) { return Slidings[p]; }
69 // Dynamic razoring margin based on depth
70 inline Value razor_margin(Depth d) { return Value(512 + 16 * int(d)); }
72 // Futility lookup tables (initialized at startup) and their access functions
73 Value FutilityMargins[16][64]; // [depth][moveNumber]
74 int FutilityMoveCounts[32]; // [depth]
76 inline Value futility_margin(Depth d, int mn) {
78 return d < 7 * ONE_PLY ? FutilityMargins[std::max(int(d), 1)][std::min(mn, 63)]
82 // Reduction lookup tables (initialized at startup) and their access function
83 int8_t Reductions[2][64][64]; // [pv][depth][moveNumber]
85 template <bool PvNode> inline Depth reduction(Depth d, int mn) {
87 return (Depth) Reductions[PvNode][std::min(int(d) / ONE_PLY, 63)][std::min(mn, 63)];
93 Value DrawValue[COLOR_NB];
96 template <NodeType NT>
97 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
99 template <NodeType NT>
100 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
102 void id_loop(Position& pos);
103 bool check_is_dangerous(Position& pos, Move move, Value futilityBase, Value beta);
104 bool connected_moves(const Position& pos, Move m1, Move m2);
105 Value value_to_tt(Value v, int ply);
106 Value value_from_tt(Value v, int ply);
107 bool connected_threat(const Position& pos, Move m, Move threat);
108 string uci_pv(const Position& pos, int depth, Value alpha, Value beta);
111 Skill(int l) : level(l), best(MOVE_NONE) {}
113 if (enabled()) // Swap best PV line with the sub-optimal one
114 std::swap(RootMoves[0], *std::find(RootMoves.begin(),
115 RootMoves.end(), best ? best : pick_move()));
118 bool enabled() const { return level < 20; }
119 bool time_to_pick(int depth) const { return depth == 1 + level; }
129 /// Search::init() is called during startup to initialize various lookup tables
131 void Search::init() {
133 int d; // depth (ONE_PLY == 2)
134 int hd; // half depth (ONE_PLY == 1)
137 // Init reductions array
138 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
140 double pvRed = log(double(hd)) * log(double(mc)) / 3.0;
141 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
142 Reductions[1][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
143 Reductions[0][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
146 // Init futility margins array
147 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
148 FutilityMargins[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
150 // Init futility move count array
151 for (d = 0; d < 32; d++)
152 FutilityMoveCounts[d] = int(3.001 + 0.25 * pow(double(d), 2.0));
156 /// Search::perft() is our utility to verify move generation. All the leaf nodes
157 /// up to the given depth are generated and counted and the sum returned.
159 size_t Search::perft(Position& pos, Depth depth) {
161 // At the last ply just return the number of legal moves (leaf nodes)
162 if (depth == ONE_PLY)
163 return MoveList<LEGAL>(pos).size();
169 for (MoveList<LEGAL> ml(pos); !ml.end(); ++ml)
171 pos.do_move(ml.move(), st, ci, pos.move_gives_check(ml.move(), ci));
172 cnt += perft(pos, depth - ONE_PLY);
173 pos.undo_move(ml.move());
180 /// Search::think() is the external interface to Stockfish's search, and is
181 /// called by the main thread when the program receives the UCI 'go' command. It
182 /// searches from RootPos and at the end prints the "bestmove" to output.
184 void Search::think() {
186 static PolyglotBook book; // Defined static to initialize the PRNG only once
188 RootColor = RootPos.side_to_move();
189 TimeMgr.init(Limits, RootPos.startpos_ply_counter(), RootColor);
191 if (RootMoves.empty())
193 RootMoves.push_back(MOVE_NONE);
194 sync_cout << "info depth 0 score "
195 << score_to_uci(RootPos.in_check() ? -VALUE_MATE : VALUE_DRAW)
201 if (Options["OwnBook"] && !Limits.infinite)
203 Move bookMove = book.probe(RootPos, Options["Book File"], Options["Best Book Move"]);
205 if (bookMove && std::count(RootMoves.begin(), RootMoves.end(), bookMove))
207 std::swap(RootMoves[0], *std::find(RootMoves.begin(), RootMoves.end(), bookMove));
212 if (Options["Contempt Factor"] && !Options["UCI_AnalyseMode"])
214 int cf = Options["Contempt Factor"] * PawnValueMg / 100; // From centipawns
215 cf = cf * MaterialTable::game_phase(RootPos) / PHASE_MIDGAME; // Scale down with phase
216 DrawValue[ RootColor] = VALUE_DRAW - Value(cf);
217 DrawValue[~RootColor] = VALUE_DRAW + Value(cf);
220 DrawValue[WHITE] = DrawValue[BLACK] = VALUE_DRAW;
222 if (Options["Use Search Log"])
224 Log log(Options["Search Log Filename"]);
225 log << "\nSearching: " << RootPos.to_fen()
226 << "\ninfinite: " << Limits.infinite
227 << " ponder: " << Limits.ponder
228 << " time: " << Limits.time[RootColor]
229 << " increment: " << Limits.inc[RootColor]
230 << " moves to go: " << Limits.movestogo
236 // Set best timer interval to avoid lagging under time pressure. Timer is
237 // used to check for remaining available thinking time.
238 if (Limits.use_time_management())
239 Threads.set_timer(std::min(100, std::max(TimeMgr.available_time() / 16,
241 else if (Limits.nodes)
242 Threads.set_timer(2 * TimerResolution);
244 Threads.set_timer(100);
246 id_loop(RootPos); // Let's start searching !
248 Threads.set_timer(0); // Stop timer
251 if (Options["Use Search Log"])
253 Time::point elapsed = Time::now() - SearchTime + 1;
255 Log log(Options["Search Log Filename"]);
256 log << "Nodes: " << RootPos.nodes_searched()
257 << "\nNodes/second: " << RootPos.nodes_searched() * 1000 / elapsed
258 << "\nBest move: " << move_to_san(RootPos, RootMoves[0].pv[0]);
261 RootPos.do_move(RootMoves[0].pv[0], st);
262 log << "\nPonder move: " << move_to_san(RootPos, RootMoves[0].pv[1]) << std::endl;
263 RootPos.undo_move(RootMoves[0].pv[0]);
268 // When we reach max depth we arrive here even without Signals.stop is raised,
269 // but if we are pondering or in infinite search, we shouldn't print the best
270 // move before we are told to do so.
271 if (!Signals.stop && (Limits.ponder || Limits.infinite))
272 RootPos.this_thread()->wait_for_stop_or_ponderhit();
274 // Best move could be MOVE_NONE when searching on a stalemate position
275 sync_cout << "bestmove " << move_to_uci(RootMoves[0].pv[0], RootPos.is_chess960())
276 << " ponder " << move_to_uci(RootMoves[0].pv[1], RootPos.is_chess960())
283 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
284 // with increasing depth until the allocated thinking time has been consumed,
285 // user stops the search, or the maximum search depth is reached.
287 void id_loop(Position& pos) {
289 Stack ss[MAX_PLY_PLUS_2];
290 int depth, prevBestMoveChanges;
291 Value bestValue, alpha, beta, delta;
292 bool bestMoveNeverChanged = true;
294 memset(ss, 0, 4 * sizeof(Stack));
295 depth = BestMoveChanges = 0;
296 bestValue = delta = -VALUE_INFINITE;
297 ss->currentMove = MOVE_NULL; // Hack to skip update gains
301 PVSize = Options["MultiPV"];
302 Skill skill(Options["Skill Level"]);
304 // Do we have to play with skill handicap? In this case enable MultiPV search
305 // that we will use behind the scenes to retrieve a set of possible moves.
306 if (skill.enabled() && PVSize < 4)
309 PVSize = std::min(PVSize, RootMoves.size());
311 // Iterative deepening loop until requested to stop or target depth reached
312 while (++depth <= MAX_PLY && !Signals.stop && (!Limits.depth || depth <= Limits.depth))
314 // Save last iteration's scores before first PV line is searched and all
315 // the move scores but the (new) PV are set to -VALUE_INFINITE.
316 for (size_t i = 0; i < RootMoves.size(); i++)
317 RootMoves[i].prevScore = RootMoves[i].score;
319 prevBestMoveChanges = BestMoveChanges; // Only sensible when PVSize == 1
322 // MultiPV loop. We perform a full root search for each PV line
323 for (PVIdx = 0; PVIdx < PVSize; PVIdx++)
325 // Set aspiration window default width
326 if (depth >= 5 && abs(RootMoves[PVIdx].prevScore) < VALUE_KNOWN_WIN)
329 alpha = RootMoves[PVIdx].prevScore - delta;
330 beta = RootMoves[PVIdx].prevScore + delta;
334 alpha = -VALUE_INFINITE;
335 beta = VALUE_INFINITE;
338 // Start with a small aspiration window and, in case of fail high/low,
339 // research with bigger window until not failing high/low anymore.
342 // Search starts from ss+1 to allow referencing (ss-1). This is
343 // needed by update gains and ss copy when splitting at Root.
344 bestValue = search<Root>(pos, ss+1, alpha, beta, depth * ONE_PLY);
346 // Bring to front the best move. It is critical that sorting is
347 // done with a stable algorithm because all the values but the first
348 // and eventually the new best one are set to -VALUE_INFINITE and
349 // we want to keep the same order for all the moves but the new
350 // PV that goes to the front. Note that in case of MultiPV search
351 // the already searched PV lines are preserved.
352 sort<RootMove>(RootMoves.begin() + PVIdx, RootMoves.end());
354 // Write PV back to transposition table in case the relevant
355 // entries have been overwritten during the search.
356 for (size_t i = 0; i <= PVIdx; i++)
357 RootMoves[i].insert_pv_in_tt(pos);
359 // If search has been stopped return immediately. Sorting and
360 // writing PV back to TT is safe becuase RootMoves is still
361 // valid, although refers to previous iteration.
365 // In case of failing high/low increase aspiration window and
366 // research, otherwise exit the loop.
367 if (bestValue > alpha && bestValue < beta)
370 // Give some update (without cluttering the UI) before to research
371 if (Time::now() - SearchTime > 3000)
372 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
374 if (abs(bestValue) >= VALUE_KNOWN_WIN)
376 alpha = -VALUE_INFINITE;
377 beta = VALUE_INFINITE;
379 else if (bestValue >= beta)
386 Signals.failedLowAtRoot = true;
387 Signals.stopOnPonderhit = false;
393 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
396 // Sort the PV lines searched so far and update the GUI
397 sort<RootMove>(RootMoves.begin(), RootMoves.begin() + PVIdx);
398 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
401 // Do we need to pick now the sub-optimal best move ?
402 if (skill.enabled() && skill.time_to_pick(depth))
405 if (Options["Use Search Log"])
407 Log log(Options["Search Log Filename"]);
408 log << pretty_pv(pos, depth, bestValue, Time::now() - SearchTime, &RootMoves[0].pv[0])
412 // Filter out startup noise when monitoring best move stability
413 if (depth > 2 && BestMoveChanges)
414 bestMoveNeverChanged = false;
416 // Do we have time for the next iteration? Can we stop searching now?
417 if (Limits.use_time_management() && !Signals.stopOnPonderhit)
419 bool stop = false; // Local variable, not the volatile Signals.stop
421 // Take in account some extra time if the best move has changed
422 if (depth > 4 && depth < 50 && PVSize == 1)
423 TimeMgr.pv_instability(BestMoveChanges, prevBestMoveChanges);
425 // Stop search if most of available time is already consumed. We
426 // probably don't have enough time to search the first move at the
427 // next iteration anyway.
428 if (Time::now() - SearchTime > (TimeMgr.available_time() * 62) / 100)
431 // Stop search early if one move seems to be much better than others
435 && ( (bestMoveNeverChanged && pos.captured_piece_type())
436 || Time::now() - SearchTime > (TimeMgr.available_time() * 40) / 100))
438 Value rBeta = bestValue - 2 * PawnValueMg;
439 (ss+1)->excludedMove = RootMoves[0].pv[0];
440 (ss+1)->skipNullMove = true;
441 Value v = search<NonPV>(pos, ss+1, rBeta - 1, rBeta, (depth - 3) * ONE_PLY);
442 (ss+1)->skipNullMove = false;
443 (ss+1)->excludedMove = MOVE_NONE;
451 // If we are allowed to ponder do not stop the search now but
452 // keep pondering until GUI sends "ponderhit" or "stop".
454 Signals.stopOnPonderhit = true;
463 // search<>() is the main search function for both PV and non-PV nodes and for
464 // normal and SplitPoint nodes. When called just after a split point the search
465 // is simpler because we have already probed the hash table, done a null move
466 // search, and searched the first move before splitting, we don't have to repeat
467 // all this work again. We also don't need to store anything to the hash table
468 // here: This is taken care of after we return from the split point.
470 template <NodeType NT>
471 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
473 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV || NT == SplitPointRoot);
474 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV || NT == SplitPointRoot);
475 const bool RootNode = (NT == Root || NT == SplitPointRoot);
477 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
478 assert(PvNode || (alpha == beta - 1));
479 assert(depth > DEPTH_ZERO);
481 Move movesSearched[64];
486 Move ttMove, move, excludedMove, bestMove, threatMove;
488 Value bestValue, value, ttValue;
489 Value eval, nullValue, futilityValue;
490 bool inCheck, givesCheck, pvMove, singularExtensionNode;
491 bool captureOrPromotion, dangerous, doFullDepthSearch;
492 int moveCount, playedMoveCount;
494 // Step 1. Initialize node
495 Thread* thisThread = pos.this_thread();
496 moveCount = playedMoveCount = 0;
497 inCheck = pos.in_check();
502 bestMove = sp->bestMove;
503 threatMove = sp->threatMove;
504 bestValue = sp->bestValue;
506 ttMove = excludedMove = MOVE_NONE;
507 ttValue = VALUE_NONE;
509 assert(sp->bestValue > -VALUE_INFINITE && sp->moveCount > 0);
511 goto split_point_start;
514 bestValue = -VALUE_INFINITE;
515 ss->currentMove = threatMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
516 ss->ply = (ss-1)->ply + 1;
517 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
518 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
520 // Used to send selDepth info to GUI
521 if (PvNode && thisThread->maxPly < ss->ply)
522 thisThread->maxPly = ss->ply;
526 // Step 2. Check for aborted search and immediate draw
527 if (Signals.stop || pos.is_draw<true, PvNode>() || ss->ply > MAX_PLY)
528 return DrawValue[pos.side_to_move()];
530 // Step 3. Mate distance pruning. Even if we mate at the next move our score
531 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
532 // a shorter mate was found upward in the tree then there is no need to search
533 // further, we will never beat current alpha. Same logic but with reversed signs
534 // applies also in the opposite condition of being mated instead of giving mate,
535 // in this case return a fail-high score.
536 alpha = std::max(mated_in(ss->ply), alpha);
537 beta = std::min(mate_in(ss->ply+1), beta);
542 // Step 4. Transposition table lookup
543 // We don't want the score of a partial search to overwrite a previous full search
544 // TT value, so we use a different position key in case of an excluded move.
545 excludedMove = ss->excludedMove;
546 posKey = excludedMove ? pos.exclusion_key() : pos.key();
547 tte = TT.probe(posKey);
548 ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
549 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
551 // At PV nodes we check for exact scores, while at non-PV nodes we check for
552 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
553 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
554 // we should also update RootMoveList to avoid bogus output.
557 && tte->depth() >= depth
558 && ttValue != VALUE_NONE // Only in case of TT access race
559 && ( PvNode ? tte->type() == BOUND_EXACT
560 : ttValue >= beta ? (tte->type() & BOUND_LOWER)
561 : (tte->type() & BOUND_UPPER)))
564 ss->currentMove = ttMove; // Can be MOVE_NONE
568 && !pos.is_capture_or_promotion(ttMove)
569 && ttMove != ss->killers[0])
571 ss->killers[1] = ss->killers[0];
572 ss->killers[0] = ttMove;
577 // Step 5. Evaluate the position statically and update parent's gain statistics
579 ss->staticEval = ss->evalMargin = eval = VALUE_NONE;
583 // Following asserts are valid only in single thread condition because
584 // TT access is always racy and its contents cannot be trusted.
585 assert(tte->static_value() != VALUE_NONE || Threads.size() > 1);
586 assert(ttValue != VALUE_NONE || tte->type() == BOUND_NONE || Threads.size() > 1);
588 ss->staticEval = eval = tte->static_value();
589 ss->evalMargin = tte->static_value_margin();
591 if (eval == VALUE_NONE || ss->evalMargin == VALUE_NONE) // Due to a race
592 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
594 // Can ttValue be used as a better position evaluation?
595 if (ttValue != VALUE_NONE)
596 if ( ((tte->type() & BOUND_LOWER) && ttValue > eval)
597 || ((tte->type() & BOUND_UPPER) && ttValue < eval))
602 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
603 TT.store(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE,
604 ss->staticEval, ss->evalMargin);
607 // Update gain for the parent non-capture move given the static position
608 // evaluation before and after the move.
609 if ( (move = (ss-1)->currentMove) != MOVE_NULL
610 && (ss-1)->staticEval != VALUE_NONE
611 && ss->staticEval != VALUE_NONE
612 && !pos.captured_piece_type()
613 && type_of(move) == NORMAL)
615 Square to = to_sq(move);
616 H.update_gain(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
619 // Step 6. Razoring (is omitted in PV nodes)
621 && depth < 4 * ONE_PLY
623 && eval + razor_margin(depth) < beta
624 && ttMove == MOVE_NONE
625 && abs(beta) < VALUE_MATE_IN_MAX_PLY
626 && !pos.pawn_on_7th(pos.side_to_move()))
628 Value rbeta = beta - razor_margin(depth);
629 Value v = qsearch<NonPV>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
631 // Logically we should return (v + razor_margin(depth)), but
632 // surprisingly this did slightly weaker in tests.
636 // Step 7. Static null move pruning (is omitted in PV nodes)
637 // We're betting that the opponent doesn't have a move that will reduce
638 // the score by more than futility_margin(depth) if we do a null move.
641 && depth < 4 * ONE_PLY
643 && eval - FutilityMargins[depth][0] >= beta
644 && abs(beta) < VALUE_MATE_IN_MAX_PLY
645 && pos.non_pawn_material(pos.side_to_move()))
646 return eval - FutilityMargins[depth][0];
648 // Step 8. Null move search with verification search (is omitted in PV nodes)
654 && abs(beta) < VALUE_MATE_IN_MAX_PLY
655 && pos.non_pawn_material(pos.side_to_move()))
657 ss->currentMove = MOVE_NULL;
659 // Null move dynamic reduction based on depth
660 Depth R = 3 * ONE_PLY + depth / 4;
662 // Null move dynamic reduction based on value
663 if (eval - PawnValueMg > beta)
666 pos.do_null_move<true>(st);
667 (ss+1)->skipNullMove = true;
668 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
669 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R);
670 (ss+1)->skipNullMove = false;
671 pos.do_null_move<false>(st);
673 if (nullValue >= beta)
675 // Do not return unproven mate scores
676 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
679 if (depth < 6 * ONE_PLY)
682 // Do verification search at high depths
683 ss->skipNullMove = true;
684 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R);
685 ss->skipNullMove = false;
692 // The null move failed low, which means that we may be faced with
693 // some kind of threat. If the previous move was reduced, check if
694 // the move that refuted the null move was somehow connected to the
695 // move which was reduced. If a connection is found, return a fail
696 // low score (which will cause the reduced move to fail high in the
697 // parent node, which will trigger a re-search with full depth).
698 threatMove = (ss+1)->currentMove;
700 if ( depth < 5 * ONE_PLY
702 && threatMove != MOVE_NONE
703 && connected_moves(pos, (ss-1)->currentMove, threatMove))
708 // Step 9. ProbCut (is omitted in PV nodes)
709 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
710 // and a reduced search returns a value much above beta, we can (almost) safely
711 // prune the previous move.
713 && depth >= 5 * ONE_PLY
716 && excludedMove == MOVE_NONE
717 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
719 Value rbeta = beta + 200;
720 Depth rdepth = depth - ONE_PLY - 3 * ONE_PLY;
722 assert(rdepth >= ONE_PLY);
723 assert((ss-1)->currentMove != MOVE_NONE);
724 assert((ss-1)->currentMove != MOVE_NULL);
726 MovePicker mp(pos, ttMove, H, pos.captured_piece_type());
729 while ((move = mp.next_move<false>()) != MOVE_NONE)
730 if (pos.pl_move_is_legal(move, ci.pinned))
732 ss->currentMove = move;
733 pos.do_move(move, st, ci, pos.move_gives_check(move, ci));
734 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth);
741 // Step 10. Internal iterative deepening
742 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
743 && ttMove == MOVE_NONE
744 && (PvNode || (!inCheck && ss->staticEval + Value(256) >= beta)))
746 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
748 ss->skipNullMove = true;
749 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d);
750 ss->skipNullMove = false;
752 tte = TT.probe(posKey);
753 ttMove = tte ? tte->move() : MOVE_NONE;
756 split_point_start: // At split points actual search starts from here
758 MovePicker mp(pos, ttMove, depth, H, ss, PvNode ? -VALUE_INFINITE : beta);
760 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
761 singularExtensionNode = !RootNode
763 && depth >= (PvNode ? 6 * ONE_PLY : 8 * ONE_PLY)
764 && ttMove != MOVE_NONE
765 && !excludedMove // Recursive singular search is not allowed
766 && (tte->type() & BOUND_LOWER)
767 && tte->depth() >= depth - 3 * ONE_PLY;
769 // Step 11. Loop through moves
770 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
771 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
775 if (move == excludedMove)
778 // At root obey the "searchmoves" option and skip moves not listed in Root
779 // Move List, as a consequence any illegal move is also skipped. In MultiPV
780 // mode we also skip PV moves which have been already searched.
781 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
786 // Shared counter cannot be decremented later if move turns out to be illegal
787 if (!pos.pl_move_is_legal(move, ci.pinned))
790 moveCount = ++sp->moveCount;
798 Signals.firstRootMove = (moveCount == 1);
800 if (thisThread == Threads.main_thread() && Time::now() - SearchTime > 2000)
801 sync_cout << "info depth " << depth / ONE_PLY
802 << " currmove " << move_to_uci(move, pos.is_chess960())
803 << " currmovenumber " << moveCount + PVIdx << sync_endl;
807 captureOrPromotion = pos.is_capture_or_promotion(move);
808 givesCheck = pos.move_gives_check(move, ci);
809 dangerous = givesCheck
810 || pos.is_passed_pawn_push(move)
811 || type_of(move) == CASTLE
812 || ( captureOrPromotion // Entering a pawn endgame?
813 && type_of(pos.piece_on(to_sq(move))) != PAWN
814 && type_of(move) == NORMAL
815 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
816 - PieceValue[MG][pos.piece_on(to_sq(move))] == VALUE_ZERO));
818 // Step 12. Extend checks and, in PV nodes, also dangerous moves
819 if (PvNode && dangerous)
822 else if (givesCheck && pos.see_sign(move) >= 0)
825 // Singular extension search. If all moves but one fail low on a search of
826 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
827 // is singular and should be extended. To verify this we do a reduced search
828 // on all the other moves but the ttMove, if result is lower than ttValue minus
829 // a margin then we extend ttMove.
830 if ( singularExtensionNode
833 && pos.pl_move_is_legal(move, ci.pinned)
834 && abs(ttValue) < VALUE_KNOWN_WIN)
836 assert(ttValue != VALUE_NONE);
838 Value rBeta = ttValue - int(depth);
839 ss->excludedMove = move;
840 ss->skipNullMove = true;
841 value = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2);
842 ss->skipNullMove = false;
843 ss->excludedMove = MOVE_NONE;
846 ext = rBeta >= beta ? ONE_PLY + ONE_PLY / 2 : ONE_PLY;
849 // Update current move (this must be done after singular extension search)
850 newDepth = depth - ONE_PLY + ext;
852 // Step 13. Futility pruning (is omitted in PV nodes)
854 && !captureOrPromotion
858 && (bestValue > VALUE_MATED_IN_MAX_PLY || ( bestValue == -VALUE_INFINITE
859 && alpha > VALUE_MATED_IN_MAX_PLY)))
861 // Move count based pruning
862 if ( depth < 16 * ONE_PLY
863 && moveCount >= FutilityMoveCounts[depth]
864 && (!threatMove || !connected_threat(pos, move, threatMove)))
872 // Value based pruning
873 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
874 // but fixing this made program slightly weaker.
875 Depth predictedDepth = newDepth - reduction<PvNode>(depth, moveCount);
876 futilityValue = ss->staticEval + ss->evalMargin + futility_margin(predictedDepth, moveCount)
877 + H.gain(pos.piece_moved(move), to_sq(move));
879 if (futilityValue < beta)
887 // Prune moves with negative SEE at low depths
888 if ( predictedDepth < 2 * ONE_PLY
889 && pos.see_sign(move) < 0)
898 // Check for legality only before to do the move
899 if (!pos.pl_move_is_legal(move, ci.pinned))
905 pvMove = PvNode ? moveCount == 1 : false;
906 ss->currentMove = move;
907 if (!SpNode && !captureOrPromotion && playedMoveCount < 64)
908 movesSearched[playedMoveCount++] = move;
910 // Step 14. Make the move
911 pos.do_move(move, st, ci, givesCheck);
913 // Step 15. Reduced depth search (LMR). If the move fails high will be
914 // re-searched at full depth.
915 if ( depth > 3 * ONE_PLY
917 && !captureOrPromotion
919 && ss->killers[0] != move
920 && ss->killers[1] != move)
922 ss->reduction = reduction<PvNode>(depth, moveCount);
923 Depth d = std::max(newDepth - ss->reduction, ONE_PLY);
924 alpha = SpNode ? sp->alpha : alpha;
926 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d);
928 doFullDepthSearch = (value > alpha && ss->reduction != DEPTH_ZERO);
929 ss->reduction = DEPTH_ZERO;
932 doFullDepthSearch = !pvMove;
934 // Step 16. Full depth search, when LMR is skipped or fails high
935 if (doFullDepthSearch)
937 alpha = SpNode ? sp->alpha : alpha;
938 value = newDepth < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
939 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth);
942 // Only for PV nodes do a full PV search on the first move or after a fail
943 // high, in the latter case search only if value < beta, otherwise let the
944 // parent node to fail low with value <= alpha and to try another move.
945 if (PvNode && (pvMove || (value > alpha && (RootNode || value < beta))))
946 value = newDepth < ONE_PLY ? -qsearch<PV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
947 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
949 // Step 17. Undo move
952 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
954 // Step 18. Check for new best move
958 bestValue = sp->bestValue;
962 // Finished searching the move. If Signals.stop is true, the search
963 // was aborted because the user interrupted the search or because we
964 // ran out of time. In this case, the return value of the search cannot
965 // be trusted, and we don't update the best move and/or PV.
966 if (Signals.stop || thisThread->cutoff_occurred())
967 return value; // To avoid returning VALUE_INFINITE
971 RootMove& rm = *std::find(RootMoves.begin(), RootMoves.end(), move);
973 // PV move or new best move ?
974 if (pvMove || value > alpha)
977 rm.extract_pv_from_tt(pos);
979 // We record how often the best move has been changed in each
980 // iteration. This information is used for time management: When
981 // the best move changes frequently, we allocate some more time.
986 // All other moves but the PV are set to the lowest value, this
987 // is not a problem when sorting becuase sort is stable and move
988 // position in the list is preserved, just the PV is pushed up.
989 rm.score = -VALUE_INFINITE;
992 if (value > bestValue)
995 if (SpNode) sp->bestValue = value;
1000 if (SpNode) sp->bestMove = move;
1002 if (PvNode && value < beta)
1004 alpha = value; // Update alpha here! Always alpha < beta
1005 if (SpNode) sp->alpha = value;
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);
1030 // Step 20. Check for mate and stalemate
1031 // All legal moves have been searched and if there are no legal moves, it
1032 // must be mate or stalemate. Note that we can have a false positive in
1033 // case of Signals.stop or thread.cutoff_occurred() are set, but this is
1034 // harmless because return value is discarded anyhow in the parent nodes.
1035 // If we are in a singular extension search then return a fail low score.
1036 // A split node has at least one move, the one tried before to be splitted.
1038 return excludedMove ? alpha
1039 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1041 // If we have pruned all the moves without searching return a fail-low score
1042 if (bestValue == -VALUE_INFINITE)
1044 assert(!playedMoveCount);
1049 if (bestValue >= beta) // Failed high
1051 TT.store(posKey, value_to_tt(bestValue, ss->ply), BOUND_LOWER, depth,
1052 bestMove, ss->staticEval, ss->evalMargin);
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,
1077 depth, bestMove, ss->staticEval, ss->evalMargin);
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>
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(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1096 assert(PvNode || (alpha == beta - 1));
1097 assert(depth <= DEPTH_ZERO);
1102 Move ttMove, move, bestMove;
1103 Value bestValue, value, ttValue, futilityValue, futilityBase;
1104 bool inCheck, givesCheck, enoughMaterial, evasionPrunable;
1107 inCheck = pos.in_check();
1108 ss->currentMove = bestMove = MOVE_NONE;
1109 ss->ply = (ss-1)->ply + 1;
1111 // Check for an instant draw or maximum ply reached
1112 if (pos.is_draw<false, false>() || ss->ply > MAX_PLY)
1113 return DrawValue[pos.side_to_move()];
1115 // Transposition table lookup. At PV nodes, we don't use the TT for
1116 // pruning, but only for move ordering.
1118 tte = TT.probe(posKey);
1119 ttMove = tte ? tte->move() : MOVE_NONE;
1120 ttValue = tte ? value_from_tt(tte->value(),ss->ply) : VALUE_NONE;
1122 // Decide whether or not to include checks, this fixes also the type of
1123 // TT entry depth that we are going to use. Note that in qsearch we use
1124 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1125 ttDepth = inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1126 : DEPTH_QS_NO_CHECKS;
1128 && tte->depth() >= ttDepth
1129 && ttValue != VALUE_NONE // Only in case of TT access race
1130 && ( PvNode ? tte->type() == BOUND_EXACT
1131 : ttValue >= beta ? (tte->type() & BOUND_LOWER)
1132 : (tte->type() & BOUND_UPPER)))
1134 ss->currentMove = ttMove; // Can be MOVE_NONE
1138 // Evaluate the position statically
1141 ss->staticEval = ss->evalMargin = VALUE_NONE;
1142 bestValue = futilityBase = -VALUE_INFINITE;
1143 enoughMaterial = false;
1149 assert(tte->static_value() != VALUE_NONE || Threads.size() > 1);
1151 ss->staticEval = bestValue = tte->static_value();
1152 ss->evalMargin = tte->static_value_margin();
1154 if (ss->staticEval == VALUE_NONE || ss->evalMargin == VALUE_NONE) // Due to a race
1155 ss->staticEval = bestValue = evaluate(pos, ss->evalMargin);
1158 ss->staticEval = bestValue = evaluate(pos, ss->evalMargin);
1160 // Stand pat. Return immediately if static value is at least beta
1161 if (bestValue >= beta)
1164 TT.store(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1165 DEPTH_NONE, MOVE_NONE, ss->staticEval, ss->evalMargin);
1170 if (PvNode && bestValue > alpha)
1173 futilityBase = ss->staticEval + ss->evalMargin + Value(128);
1174 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMg;
1177 // Initialize a MovePicker object for the current position, and prepare
1178 // to search the moves. Because the depth is <= 0 here, only captures,
1179 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1181 MovePicker mp(pos, ttMove, depth, H, to_sq((ss-1)->currentMove));
1184 // Loop through the moves until no moves remain or a beta cutoff occurs
1185 while ((move = mp.next_move<false>()) != MOVE_NONE)
1187 assert(is_ok(move));
1189 givesCheck = pos.move_gives_check(move, ci);
1197 && type_of(move) != PROMOTION
1198 && !pos.is_passed_pawn_push(move))
1200 futilityValue = futilityBase
1201 + PieceValue[EG][pos.piece_on(to_sq(move))]
1202 + (type_of(move) == ENPASSANT ? PawnValueEg : VALUE_ZERO);
1204 if (futilityValue < beta)
1206 if (futilityValue > bestValue)
1207 bestValue = futilityValue;
1212 // Prune moves with negative or equal SEE
1213 if ( futilityBase < beta
1214 && depth < DEPTH_ZERO
1215 && pos.see(move) <= 0)
1219 // Detect non-capture evasions that are candidate to be pruned
1220 evasionPrunable = !PvNode
1222 && bestValue > VALUE_MATED_IN_MAX_PLY
1223 && !pos.is_capture(move)
1224 && !pos.can_castle(pos.side_to_move());
1226 // Don't search moves with negative SEE values
1228 && (!inCheck || evasionPrunable)
1230 && type_of(move) != PROMOTION
1231 && pos.see_sign(move) < 0)
1234 // Don't search useless checks
1239 && !pos.is_capture_or_promotion(move)
1240 && ss->staticEval + PawnValueMg / 4 < beta
1241 && !check_is_dangerous(pos, move, futilityBase, beta))
1244 // Check for legality only before to do the move
1245 if (!pos.pl_move_is_legal(move, ci.pinned))
1248 ss->currentMove = move;
1250 // Make and search the move
1251 pos.do_move(move, st, ci, givesCheck);
1252 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1253 pos.undo_move(move);
1255 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1257 // Check for new best move
1258 if (value > bestValue)
1264 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1271 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1272 ttDepth, move, ss->staticEval, ss->evalMargin);
1280 // All legal moves have been searched. A special case: If we're in check
1281 // and no legal moves were found, it is checkmate.
1282 if (inCheck && bestValue == -VALUE_INFINITE)
1283 return mated_in(ss->ply); // Plies to mate from the root
1285 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1286 PvNode && bestMove != MOVE_NONE ? BOUND_EXACT : BOUND_UPPER,
1287 ttDepth, bestMove, ss->staticEval, ss->evalMargin);
1289 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1295 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1296 // "plies to mate from the current position". Non-mate scores are unchanged.
1297 // The function is called before storing a value to the transposition table.
1299 Value value_to_tt(Value v, int ply) {
1301 assert(v != VALUE_NONE);
1303 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1304 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1308 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1309 // from the transposition table (where refers to the plies to mate/be mated
1310 // from current position) to "plies to mate/be mated from the root".
1312 Value value_from_tt(Value v, int ply) {
1314 return v == VALUE_NONE ? VALUE_NONE
1315 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1316 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1320 // check_is_dangerous() tests if a checking move can be pruned in qsearch()
1322 bool check_is_dangerous(Position& pos, Move move, Value futilityBase, Value beta)
1324 Piece pc = pos.piece_moved(move);
1325 Square from = from_sq(move);
1326 Square to = to_sq(move);
1327 Color them = ~pos.side_to_move();
1328 Square ksq = pos.king_square(them);
1329 Bitboard enemies = pos.pieces(them);
1330 Bitboard kingAtt = pos.attacks_from<KING>(ksq);
1331 Bitboard occ = pos.pieces() ^ from ^ ksq;
1332 Bitboard oldAtt = pos.attacks_from(pc, from, occ);
1333 Bitboard newAtt = pos.attacks_from(pc, to, occ);
1335 // Checks which give opponent's king at most one escape square are dangerous
1336 if (!more_than_one(kingAtt & ~(enemies | newAtt | to)))
1339 // Queen contact check is very dangerous
1340 if (type_of(pc) == QUEEN && (kingAtt & to))
1343 // Creating new double threats with checks is dangerous
1344 Bitboard b = (enemies ^ ksq) & newAtt & ~oldAtt;
1347 // Note that here we generate illegal "double move"!
1348 if (futilityBase + PieceValue[EG][pos.piece_on(pop_lsb(&b))] >= beta)
1356 // connected_moves() tests whether two moves are 'connected' in the sense
1357 // that the first move somehow made the second move possible (for instance
1358 // if the moving piece is the same in both moves). The first move is assumed
1359 // to be the move that was made to reach the current position, while the
1360 // second move is assumed to be a move from the current position.
1362 bool connected_moves(const Position& pos, Move m1, Move m2) {
1364 Square f1, t1, f2, t2;
1371 // Case 1: The moving piece is the same in both moves
1377 // Case 2: The destination square for m2 was vacated by m1
1383 // Case 3: Moving through the vacated square
1384 p2 = pos.piece_on(f2);
1385 if (piece_is_slider(p2) && (between_bb(f2, t2) & f1))
1388 // Case 4: The destination square for m2 is defended by the moving piece in m1
1389 p1 = pos.piece_on(t1);
1390 if (pos.attacks_from(p1, t1) & t2)
1393 // Case 5: Discovered check, checking piece is the piece moved in m1
1394 ksq = pos.king_square(pos.side_to_move());
1395 if ( piece_is_slider(p1)
1396 && (between_bb(t1, ksq) & f2)
1397 && (pos.attacks_from(p1, t1, pos.pieces() ^ f2) & ksq))
1404 // connected_threat() tests whether it is safe to forward prune a move or if
1405 // is somehow connected to the threat move returned by null search.
1407 bool connected_threat(const Position& pos, Move m, Move threat) {
1410 assert(is_ok(threat));
1411 assert(!pos.is_capture_or_promotion(m));
1412 assert(!pos.is_passed_pawn_push(m));
1414 Square mfrom = from_sq(m);
1415 Square mto = to_sq(m);
1416 Square tfrom = from_sq(threat);
1417 Square tto = to_sq(threat);
1419 // Case 1: Don't prune moves which move the threatened piece
1423 // Case 2: If the threatened piece has value less than or equal to the
1424 // value of the threatening piece, don't prune moves which defend it.
1425 if ( pos.is_capture(threat)
1426 && ( PieceValue[MG][pos.piece_on(tfrom)] >= PieceValue[MG][pos.piece_on(tto)]
1427 || type_of(pos.piece_on(tfrom)) == KING))
1429 // Update occupancy as if the piece and the threat are moving
1430 Bitboard occ = pos.pieces() ^ mfrom ^ mto ^ tfrom;
1431 Piece piece = pos.piece_on(mfrom);
1433 // The moved piece attacks the square 'tto' ?
1434 if (pos.attacks_from(piece, mto, occ) & tto)
1437 // Scan for possible X-ray attackers behind the moved piece
1438 Bitboard xray = (attacks_bb< ROOK>(tto, occ) & pos.pieces(color_of(piece), QUEEN, ROOK))
1439 | (attacks_bb<BISHOP>(tto, occ) & pos.pieces(color_of(piece), QUEEN, BISHOP));
1441 // Verify attackers are triggered by our move and not already existing
1442 if (xray && (xray ^ (xray & pos.attacks_from<QUEEN>(tto))))
1446 // Case 3: If the moving piece in the threatened move is a slider, don't
1447 // prune safe moves which block its ray.
1448 if ( piece_is_slider(pos.piece_on(tfrom))
1449 && (between_bb(tfrom, tto) & mto)
1450 && pos.see_sign(m) >= 0)
1457 // When playing with strength handicap choose best move among the MultiPV set
1458 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1460 Move Skill::pick_move() {
1464 // PRNG sequence should be not deterministic
1465 for (int i = Time::now() % 50; i > 0; i--)
1466 rk.rand<unsigned>();
1468 // RootMoves are already sorted by score in descending order
1469 int variance = std::min(RootMoves[0].score - RootMoves[PVSize - 1].score, PawnValueMg);
1470 int weakness = 120 - 2 * level;
1471 int max_s = -VALUE_INFINITE;
1474 // Choose best move. For each move score we add two terms both dependent on
1475 // weakness, one deterministic and bigger for weaker moves, and one random,
1476 // then we choose the move with the resulting highest score.
1477 for (size_t i = 0; i < PVSize; i++)
1479 int s = RootMoves[i].score;
1481 // Don't allow crazy blunders even at very low skills
1482 if (i > 0 && RootMoves[i-1].score > s + 2 * PawnValueMg)
1485 // This is our magic formula
1486 s += ( weakness * int(RootMoves[0].score - s)
1487 + variance * (rk.rand<unsigned>() % weakness)) / 128;
1492 best = RootMoves[i].pv[0];
1499 // uci_pv() formats PV information according to UCI protocol. UCI requires
1500 // to send all the PV lines also if are still to be searched and so refer to
1501 // the previous search score.
1503 string uci_pv(const Position& pos, int depth, Value alpha, Value beta) {
1505 std::stringstream s;
1506 Time::point elaspsed = Time::now() - SearchTime + 1;
1507 size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
1510 for (size_t i = 0; i < Threads.size(); i++)
1511 if (Threads[i].maxPly > selDepth)
1512 selDepth = Threads[i].maxPly;
1514 for (size_t i = 0; i < uciPVSize; i++)
1516 bool updated = (i <= PVIdx);
1518 if (depth == 1 && !updated)
1521 int d = updated ? depth : depth - 1;
1522 Value v = updated ? RootMoves[i].score : RootMoves[i].prevScore;
1524 if (s.rdbuf()->in_avail()) // Not at first line
1527 s << "info depth " << d
1528 << " seldepth " << selDepth
1529 << " score " << (i == PVIdx ? score_to_uci(v, alpha, beta) : score_to_uci(v))
1530 << " nodes " << pos.nodes_searched()
1531 << " nps " << pos.nodes_searched() * 1000 / elaspsed
1532 << " time " << elaspsed
1533 << " multipv " << i + 1
1536 for (size_t j = 0; RootMoves[i].pv[j] != MOVE_NONE; j++)
1537 s << " " << move_to_uci(RootMoves[i].pv[j], pos.is_chess960());
1546 /// RootMove::extract_pv_from_tt() builds a PV by adding moves from the TT table.
1547 /// We consider also failing high nodes and not only BOUND_EXACT nodes so to
1548 /// allow to always have a ponder move even when we fail high at root, and a
1549 /// long PV to print that is important for position analysis.
1551 void RootMove::extract_pv_from_tt(Position& pos) {
1553 StateInfo state[MAX_PLY_PLUS_2], *st = state;
1563 assert(pos.move_is_legal(pv[ply]));
1564 pos.do_move(pv[ply++], *st++);
1565 tte = TT.probe(pos.key());
1568 && pos.is_pseudo_legal(m = tte->move()) // Local copy, TT could change
1569 && pos.pl_move_is_legal(m, pos.pinned_pieces())
1571 && (!pos.is_draw<true, true>() || ply < 2));
1573 pv.push_back(MOVE_NONE); // Must be zero-terminating
1575 while (ply) pos.undo_move(pv[--ply]);
1579 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1580 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1581 /// first, even if the old TT entries have been overwritten.
1583 void RootMove::insert_pv_in_tt(Position& pos) {
1585 StateInfo state[MAX_PLY_PLUS_2], *st = state;
1591 tte = TT.probe(pos.key());
1593 if (!tte || tte->move() != pv[ply]) // Don't overwrite correct entries
1598 v = evaluate(pos, m);
1600 TT.store(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[ply], v, m);
1603 assert(pos.move_is_legal(pv[ply]));
1604 pos.do_move(pv[ply++], *st++);
1606 } while (pv[ply] != MOVE_NONE);
1608 while (ply) pos.undo_move(pv[--ply]);
1612 /// Thread::idle_loop() is where the thread is parked when it has no work to do
1614 void Thread::idle_loop() {
1616 // Pointer 'sp_master', if non-NULL, points to the active SplitPoint
1617 // object for which the thread is the master.
1618 const SplitPoint* sp_master = splitPointsCnt ? curSplitPoint : NULL;
1620 assert(!sp_master || (sp_master->master == this && is_searching));
1622 // If this thread is the master of a split point and all slaves have
1623 // finished their work at this split point, return from the idle loop.
1624 while (!sp_master || sp_master->slavesMask)
1626 // If we are not searching, wait for a condition to be signaled
1627 // instead of wasting CPU time polling for work.
1630 || (!is_searching && Threads.use_sleeping_threads()))
1638 // Grab the lock to avoid races with Thread::wake_up()
1641 // If we are master and all slaves have finished don't go to sleep
1642 if (sp_master && !sp_master->slavesMask)
1648 // Do sleep after retesting sleep conditions under lock protection, in
1649 // particular we need to avoid a deadlock in case a master thread has,
1650 // in the meanwhile, allocated us and sent the wake_up() call before we
1651 // had the chance to grab the lock.
1652 if (do_sleep || !is_searching)
1653 sleepCondition.wait(mutex);
1658 // If this thread has been assigned work, launch a search
1661 assert(!do_sleep && !do_exit);
1663 Threads.mutex.lock();
1665 assert(is_searching);
1666 SplitPoint* sp = curSplitPoint;
1668 Threads.mutex.unlock();
1670 Stack ss[MAX_PLY_PLUS_2];
1671 Position pos(*sp->pos, this);
1673 memcpy(ss, sp->ss - 1, 4 * sizeof(Stack));
1678 assert(sp->activePositions[idx] == NULL);
1680 sp->activePositions[idx] = &pos;
1682 if (sp->nodeType == Root)
1683 search<SplitPointRoot>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1684 else if (sp->nodeType == PV)
1685 search<SplitPointPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1686 else if (sp->nodeType == NonPV)
1687 search<SplitPointNonPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1691 assert(is_searching);
1693 is_searching = false;
1694 sp->activePositions[idx] = NULL;
1695 sp->slavesMask &= ~(1ULL << idx);
1696 sp->nodes += pos.nodes_searched();
1698 // Wake up master thread so to allow it to return from the idle loop in
1699 // case we are the last slave of the split point.
1700 if ( Threads.use_sleeping_threads()
1701 && this != sp->master
1704 assert(!sp->master->is_searching);
1705 sp->master->wake_up();
1708 // After releasing the lock we cannot access anymore any SplitPoint
1709 // related data in a safe way becuase it could have been released under
1710 // our feet by the sp master. Also accessing other Thread objects is
1711 // unsafe because if we are exiting there is a chance are already freed.
1718 /// check_time() is called by the timer thread when the timer triggers. It is
1719 /// used to print debug info and, more important, to detect when we are out of
1720 /// available time and so stop the search.
1724 static Time::point lastInfoTime = Time::now();
1725 int64_t nodes = 0; // Workaround silly 'uninitialized' gcc warning
1727 if (Time::now() - lastInfoTime >= 1000)
1729 lastInfoTime = Time::now();
1738 Threads.mutex.lock();
1740 nodes = RootPos.nodes_searched();
1742 // Loop across all split points and sum accumulated SplitPoint nodes plus
1743 // all the currently active slaves positions.
1744 for (size_t i = 0; i < Threads.size(); i++)
1745 for (int j = 0; j < Threads[i].splitPointsCnt; j++)
1747 SplitPoint& sp = Threads[i].splitPoints[j];
1752 Bitboard sm = sp.slavesMask;
1755 Position* pos = sp.activePositions[pop_lsb(&sm)];
1756 nodes += pos ? pos->nodes_searched() : 0;
1762 Threads.mutex.unlock();
1765 Time::point elapsed = Time::now() - SearchTime;
1766 bool stillAtFirstMove = Signals.firstRootMove
1767 && !Signals.failedLowAtRoot
1768 && elapsed > TimeMgr.available_time();
1770 bool noMoreTime = elapsed > TimeMgr.maximum_time() - 2 * TimerResolution
1771 || stillAtFirstMove;
1773 if ( (Limits.use_time_management() && noMoreTime)
1774 || (Limits.movetime && elapsed >= Limits.movetime)
1775 || (Limits.nodes && nodes >= Limits.nodes))
1776 Signals.stop = true;