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-2015 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/>.
23 #include <cstring> // For std::memset
36 #include "syzygy/tbprobe.h"
42 StateStackPtr SetupStates;
45 namespace Tablebases {
55 namespace TB = Tablebases;
59 using namespace Search;
63 // Different node types, used as template parameter
64 enum NodeType { Root, PV, NonPV };
66 // Razoring and futility margin based on depth
67 const int razor_margin[4] = { 483, 570, 603, 554 };
68 Value futility_margin(Depth d) { return Value(200 * d); }
70 // Futility and reductions lookup tables, initialized at startup
71 int FutilityMoveCounts[2][16]; // [improving][depth]
72 Depth Reductions[2][2][64][64]; // [pv][improving][depth][moveNumber]
74 template <bool PvNode> Depth reduction(bool i, Depth d, int mn) {
75 return Reductions[PvNode][i][std::min(d, 63 * ONE_PLY)][std::min(mn, 63)];
78 // Skill struct is used to implement strength limiting
80 Skill(int l) : level(l) {}
81 bool enabled() const { return level < 20; }
82 bool time_to_pick(Depth depth) const { return depth / ONE_PLY == 1 + level; }
83 Move best_move(size_t multiPV) { return best ? best : pick_best(multiPV); }
84 Move pick_best(size_t multiPV);
87 Move best = MOVE_NONE;
90 // EasyMoveManager struct is used to detect a so called 'easy move'; when PV is
91 // stable across multiple search iterations we can fast return the best move.
92 struct EasyMoveManager {
97 pv[0] = pv[1] = pv[2] = MOVE_NONE;
100 Move get(Key key) const {
101 return expectedPosKey == key ? pv[2] : MOVE_NONE;
104 void update(Position& pos, const std::vector<Move>& newPv) {
106 assert(newPv.size() >= 3);
108 // Keep track of how many times in a row 3rd ply remains stable
109 stableCnt = (newPv[2] == pv[2]) ? stableCnt + 1 : 0;
111 if (!std::equal(newPv.begin(), newPv.begin() + 3, pv))
113 std::copy(newPv.begin(), newPv.begin() + 3, pv);
116 pos.do_move(newPv[0], st[0], pos.gives_check(newPv[0], CheckInfo(pos)));
117 pos.do_move(newPv[1], st[1], pos.gives_check(newPv[1], CheckInfo(pos)));
118 expectedPosKey = pos.key();
119 pos.undo_move(newPv[1]);
120 pos.undo_move(newPv[0]);
129 EasyMoveManager EasyMove;
130 double BestMoveChanges;
131 Value DrawValue[COLOR_NB];
132 CounterMovesHistoryStats CounterMovesHistory;
134 template <NodeType NT>
135 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
137 template <NodeType NT, bool InCheck>
138 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
140 Value value_to_tt(Value v, int ply);
141 Value value_from_tt(Value v, int ply);
142 void update_pv(Move* pv, Move move, Move* childPv);
143 void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt);
148 /// Search::init() is called during startup to initialize various lookup tables
150 void Search::init() {
152 const double K[][2] = {{ 0.799, 2.281 }, { 0.484, 3.023 }};
154 for (int pv = 0; pv <= 1; ++pv)
155 for (int imp = 0; imp <= 1; ++imp)
156 for (int d = 1; d < 64; ++d)
157 for (int mc = 1; mc < 64; ++mc)
159 double r = K[pv][0] + log(d) * log(mc) / K[pv][1];
162 Reductions[pv][imp][d][mc] = int(r) * ONE_PLY;
164 // Increase reduction when eval is not improving
165 if (!pv && !imp && Reductions[pv][imp][d][mc] >= 2 * ONE_PLY)
166 Reductions[pv][imp][d][mc] += ONE_PLY;
169 for (int d = 0; d < 16; ++d)
171 FutilityMoveCounts[0][d] = int(2.4 + 0.773 * pow(d + 0.00, 1.8));
172 FutilityMoveCounts[1][d] = int(2.9 + 1.045 * pow(d + 0.49, 1.8));
177 /// Search::reset() clears all search memory, to obtain reproducible search results
179 void Search::reset () {
182 CounterMovesHistory.clear();
184 for (Thread* th : Threads)
187 th->counterMoves.clear();
192 /// Search::perft() is our utility to verify move generation. All the leaf nodes
193 /// up to the given depth are generated and counted and the sum returned.
195 uint64_t Search::perft(Position& pos, Depth depth) {
198 uint64_t cnt, nodes = 0;
200 const bool leaf = (depth == 2 * ONE_PLY);
202 for (const auto& m : MoveList<LEGAL>(pos))
204 if (Root && depth <= ONE_PLY)
208 pos.do_move(m, st, pos.gives_check(m, ci));
209 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - ONE_PLY);
214 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
219 template uint64_t Search::perft<true>(Position& pos, Depth depth);
222 /// MainThread::think() is called by the main thread when the program receives
223 /// the UCI 'go' command. It searches from root position and at the end prints
224 /// the "bestmove" to output.
226 void MainThread::think() {
228 Color us = rootPos.side_to_move();
229 Time.init(Limits, us, rootPos.game_ply());
231 int contempt = Options["Contempt"] * PawnValueEg / 100; // From centipawns
232 DrawValue[ us] = VALUE_DRAW - Value(contempt);
233 DrawValue[~us] = VALUE_DRAW + Value(contempt);
236 TB::RootInTB = false;
237 TB::UseRule50 = Options["Syzygy50MoveRule"];
238 TB::ProbeDepth = Options["SyzygyProbeDepth"] * ONE_PLY;
239 TB::Cardinality = Options["SyzygyProbeLimit"];
241 // Skip TB probing when no TB found: !TBLargest -> !TB::Cardinality
242 if (TB::Cardinality > TB::MaxCardinality)
244 TB::Cardinality = TB::MaxCardinality;
245 TB::ProbeDepth = DEPTH_ZERO;
248 if (rootMoves.empty())
250 rootMoves.push_back(RootMove(MOVE_NONE));
251 sync_cout << "info depth 0 score "
252 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
257 if (TB::Cardinality >= rootPos.count<ALL_PIECES>(WHITE)
258 + rootPos.count<ALL_PIECES>(BLACK))
260 // If the current root position is in the tablebases then RootMoves
261 // contains only moves that preserve the draw or win.
262 TB::RootInTB = Tablebases::root_probe(rootPos, rootMoves, TB::Score);
265 TB::Cardinality = 0; // Do not probe tablebases during the search
267 else // If DTZ tables are missing, use WDL tables as a fallback
269 // Filter out moves that do not preserve a draw or win
270 TB::RootInTB = Tablebases::root_probe_wdl(rootPos, rootMoves, TB::Score);
272 // Only probe during search if winning
273 if (TB::Score <= VALUE_DRAW)
279 TB::Hits = rootMoves.size();
282 TB::Score = TB::Score > VALUE_DRAW ? VALUE_MATE - MAX_PLY - 1
283 : TB::Score < VALUE_DRAW ? -VALUE_MATE + MAX_PLY + 1
288 for (Thread* th : Threads)
291 th->rootDepth = DEPTH_ZERO;
292 th->searching = true;
295 th->rootPos = Position(rootPos, th);
296 th->rootMoves = rootMoves;
297 th->notify_one(); // Wake up the thread and start searching
301 Threads.timer->run = true;
302 Threads.timer->notify_one(); // Start the recurring timer
304 search(true); // Let's start searching!
306 // Stop the threads and the timer
308 Threads.timer->run = false;
310 // Wait until all threads have finished
311 for (Thread* th : Threads)
313 th->wait_while(th->searching);
316 // When playing in 'nodes as time' mode, subtract the searched nodes from
317 // the available ones before to exit.
319 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
321 // When we reach the maximum depth, we can arrive here without a raise of
322 // Signals.stop. However, if we are pondering or in an infinite search,
323 // the UCI protocol states that we shouldn't print the best move before the
324 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
325 // until the GUI sends one of those commands (which also raises Signals.stop).
326 if (!Signals.stop && (Limits.ponder || Limits.infinite))
328 Signals.stopOnPonderhit = true;
332 sync_cout << "bestmove " << UCI::move(rootMoves[0].pv[0], rootPos.is_chess960());
334 if (rootMoves[0].pv.size() > 1 || rootMoves[0].extract_ponder_from_tt(rootPos))
335 std::cout << " ponder " << UCI::move(rootMoves[0].pv[1], rootPos.is_chess960());
337 std::cout << sync_endl;
341 // Thread::search() is the main iterative deepening loop. It calls search()
342 // repeatedly with increasing depth until the allocated thinking time has been
343 // consumed, user stops the search, or the maximum search depth is reached.
345 void Thread::search(bool isMainThread) {
347 Stack* ss = stack + 2; // To allow referencing (ss-2) and (ss+2)
348 Value bestValue, alpha, beta, delta;
349 Move easyMove = MOVE_NONE;
351 std::memset(ss-2, 0, 5 * sizeof(Stack));
353 bestValue = delta = alpha = -VALUE_INFINITE;
354 beta = VALUE_INFINITE;
358 easyMove = EasyMove.get(rootPos.key());
364 size_t multiPV = Options["MultiPV"];
365 Skill skill(Options["Skill Level"]);
367 // When playing with strength handicap enable MultiPV search that we will
368 // use behind the scenes to retrieve a set of possible moves.
370 multiPV = std::max(multiPV, (size_t)4);
372 multiPV = std::min(multiPV, rootMoves.size());
374 // Iterative deepening loop until requested to stop or target depth reached
375 while (++rootDepth < DEPTH_MAX && !Signals.stop && (!Limits.depth || rootDepth <= Limits.depth))
377 // Set up the new depth for the helper threads
379 rootDepth = Threads.main()->rootDepth + Depth(int(3 * log(1 + this->idx)));
381 // Age out PV variability metric
383 BestMoveChanges *= 0.5;
385 // Save the last iteration's scores before first PV line is searched and
386 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
387 for (RootMove& rm : rootMoves)
388 rm.previousScore = rm.score;
390 // MultiPV loop. We perform a full root search for each PV line
391 for (PVIdx = 0; PVIdx < multiPV && !Signals.stop; ++PVIdx)
393 // Reset aspiration window starting size
394 if (rootDepth >= 5 * ONE_PLY)
397 alpha = std::max(rootMoves[PVIdx].previousScore - delta,-VALUE_INFINITE);
398 beta = std::min(rootMoves[PVIdx].previousScore + delta, VALUE_INFINITE);
401 // Start with a small aspiration window and, in the case of a fail
402 // high/low, re-search with a bigger window until we're not failing
406 bestValue = ::search<Root>(rootPos, ss, alpha, beta, rootDepth, false);
408 // Bring the best move to the front. It is critical that sorting
409 // is done with a stable algorithm because all the values but the
410 // first and eventually the new best one are set to -VALUE_INFINITE
411 // and we want to keep the same order for all the moves except the
412 // new PV that goes to the front. Note that in case of MultiPV
413 // search the already searched PV lines are preserved.
414 std::stable_sort(rootMoves.begin() + PVIdx, rootMoves.end());
416 // Write PV back to transposition table in case the relevant
417 // entries have been overwritten during the search.
418 for (size_t i = 0; i <= PVIdx; ++i)
419 rootMoves[i].insert_pv_in_tt(rootPos);
421 // If search has been stopped break immediately. Sorting and
422 // writing PV back to TT is safe because RootMoves is still
423 // valid, although it refers to previous iteration.
427 // When failing high/low give some update (without cluttering
428 // the UI) before a re-search.
431 && (bestValue <= alpha || bestValue >= beta)
432 && Time.elapsed() > 3000)
433 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
435 // In case of failing low/high increase aspiration window and
436 // re-search, otherwise exit the loop.
437 if (bestValue <= alpha)
439 beta = (alpha + beta) / 2;
440 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
444 Signals.failedLowAtRoot = true;
445 Signals.stopOnPonderhit = false;
448 else if (bestValue >= beta)
450 alpha = (alpha + beta) / 2;
451 beta = std::min(bestValue + delta, VALUE_INFINITE);
456 delta += delta / 4 + 5;
458 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
461 // Sort the PV lines searched so far and update the GUI
462 std::stable_sort(rootMoves.begin(), rootMoves.begin() + PVIdx + 1);
468 sync_cout << "info nodes " << Threads.nodes_searched()
469 << " time " << Time.elapsed() << sync_endl;
471 else if (PVIdx + 1 == multiPV || Time.elapsed() > 3000)
472 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
478 // If skill level is enabled and time is up, pick a sub-optimal best move
479 if (skill.enabled() && skill.time_to_pick(rootDepth))
480 skill.pick_best(multiPV);
482 // Have we found a "mate in x"?
484 && bestValue >= VALUE_MATE_IN_MAX_PLY
485 && VALUE_MATE - bestValue <= 2 * Limits.mate)
488 // Do we have time for the next iteration? Can we stop searching now?
489 if (Limits.use_time_management())
491 if (!Signals.stop && !Signals.stopOnPonderhit)
493 // Take some extra time if the best move has changed
494 if (rootDepth > 4 * ONE_PLY && multiPV == 1)
495 Time.pv_instability(BestMoveChanges);
497 // Stop the search if only one legal move is available or all
498 // of the available time has been used or we matched an easyMove
499 // from the previous search and just did a fast verification.
500 if ( rootMoves.size() == 1
501 || Time.elapsed() > Time.available()
502 || ( rootMoves[0].pv[0] == easyMove
503 && BestMoveChanges < 0.03
504 && Time.elapsed() > Time.available() / 10))
506 // If we are allowed to ponder do not stop the search now but
507 // keep pondering until the GUI sends "ponderhit" or "stop".
509 Signals.stopOnPonderhit = true;
515 if (rootMoves[0].pv.size() >= 3)
516 EasyMove.update(rootPos, rootMoves[0].pv);
523 notify_one(); // Wake up main thread if is sleeping waiting for us
528 // Clear any candidate easy move that wasn't stable for the last search
529 // iterations; the second condition prevents consecutive fast moves.
530 if (EasyMove.stableCnt < 6 || Time.elapsed() < Time.available())
533 // If skill level is enabled, swap best PV line with the sub-optimal one
535 std::swap(rootMoves[0], *std::find(rootMoves.begin(),
536 rootMoves.end(), skill.best_move(multiPV)));
542 // search<>() is the main search function for both PV and non-PV nodes and for
543 // normal and SplitPoint nodes. When called just after a split point the search
544 // is simpler because we have already probed the hash table, done a null move
545 // search, and searched the first move before splitting, so we don't have to
546 // repeat all this work again. We also don't need to store anything to the hash
547 // table here: This is taken care of after we return from the split point.
549 template <NodeType NT>
550 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
552 const bool RootNode = NT == Root;
553 const bool PvNode = NT == PV || NT == Root;
555 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
556 assert(PvNode || (alpha == beta - 1));
557 assert(depth > DEPTH_ZERO);
559 Move pv[MAX_PLY+1], quietsSearched[64];
563 Move ttMove, move, excludedMove, bestMove;
564 Depth extension, newDepth, predictedDepth;
565 Value bestValue, value, ttValue, eval, nullValue, futilityValue;
566 bool ttHit, inCheck, givesCheck, singularExtensionNode, improving;
567 bool captureOrPromotion, doFullDepthSearch;
568 int moveCount, quietCount;
570 // Step 1. Initialize node
571 Thread* thisThread = pos.this_thread();
572 inCheck = pos.checkers();
573 moveCount = quietCount = ss->moveCount = 0;
574 bestValue = -VALUE_INFINITE;
575 ss->ply = (ss-1)->ply + 1;
577 // Used to send selDepth info to GUI
578 if (PvNode && thisThread->maxPly < ss->ply)
579 thisThread->maxPly = ss->ply;
583 // Step 2. Check for aborted search and immediate draw
584 if (Signals.stop.load(std::memory_order_relaxed) || pos.is_draw() || ss->ply >= MAX_PLY)
585 return ss->ply >= MAX_PLY && !inCheck ? evaluate(pos)
586 : DrawValue[pos.side_to_move()];
588 // Step 3. Mate distance pruning. Even if we mate at the next move our score
589 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
590 // a shorter mate was found upward in the tree then there is no need to search
591 // because we will never beat the current alpha. Same logic but with reversed
592 // signs applies also in the opposite condition of being mated instead of giving
593 // mate. In this case return a fail-high score.
594 alpha = std::max(mated_in(ss->ply), alpha);
595 beta = std::min(mate_in(ss->ply+1), beta);
600 assert(0 <= ss->ply && ss->ply < MAX_PLY);
602 ss->currentMove = ss->ttMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
603 (ss+1)->skipEarlyPruning = false; (ss+1)->reduction = DEPTH_ZERO;
604 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
606 // Step 4. Transposition table lookup. We don't want the score of a partial
607 // search to overwrite a previous full search TT value, so we use a different
608 // position key in case of an excluded move.
609 excludedMove = ss->excludedMove;
610 posKey = excludedMove ? pos.exclusion_key() : pos.key();
611 tte = TT.probe(posKey, ttHit);
612 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
613 ss->ttMove = ttMove = RootNode ? thisThread->rootMoves[thisThread->PVIdx].pv[0]
614 : ttHit ? tte->move() : MOVE_NONE;
616 // At non-PV nodes we check for an early TT cutoff
619 && tte->depth() >= depth
620 && ttValue != VALUE_NONE // Possible in case of TT access race
621 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
622 : (tte->bound() & BOUND_UPPER)))
624 ss->currentMove = ttMove; // Can be MOVE_NONE
626 // If ttMove is quiet, update killers, history, counter move on TT hit
627 if (ttValue >= beta && ttMove && !pos.capture_or_promotion(ttMove))
628 update_stats(pos, ss, ttMove, depth, nullptr, 0);
633 // Step 4a. Tablebase probe
634 if (!RootNode && TB::Cardinality)
636 int piecesCnt = pos.count<ALL_PIECES>(WHITE) + pos.count<ALL_PIECES>(BLACK);
638 if ( piecesCnt <= TB::Cardinality
639 && (piecesCnt < TB::Cardinality || depth >= TB::ProbeDepth)
640 && pos.rule50_count() == 0)
642 int found, v = Tablebases::probe_wdl(pos, &found);
648 int drawScore = TB::UseRule50 ? 1 : 0;
650 value = v < -drawScore ? -VALUE_MATE + MAX_PLY + ss->ply
651 : v > drawScore ? VALUE_MATE - MAX_PLY - ss->ply
652 : VALUE_DRAW + 2 * v * drawScore;
654 tte->save(posKey, value_to_tt(value, ss->ply), BOUND_EXACT,
655 std::min(DEPTH_MAX - ONE_PLY, depth + 6 * ONE_PLY),
656 MOVE_NONE, VALUE_NONE, TT.generation());
663 // Step 5. Evaluate the position statically
666 ss->staticEval = eval = VALUE_NONE;
672 // Never assume anything on values stored in TT
673 if ((ss->staticEval = eval = tte->eval()) == VALUE_NONE)
674 eval = ss->staticEval = evaluate(pos);
676 // Can ttValue be used as a better position evaluation?
677 if (ttValue != VALUE_NONE)
678 if (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER))
683 eval = ss->staticEval =
684 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
685 : -(ss-1)->staticEval + 2 * Eval::Tempo;
687 tte->save(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE,
688 ss->staticEval, TT.generation());
691 if (ss->skipEarlyPruning)
694 // Step 6. Razoring (skipped when in check)
696 && depth < 4 * ONE_PLY
697 && eval + razor_margin[depth] <= alpha
698 && ttMove == MOVE_NONE)
700 if ( depth <= ONE_PLY
701 && eval + razor_margin[3 * ONE_PLY] <= alpha)
702 return qsearch<NonPV, false>(pos, ss, alpha, beta, DEPTH_ZERO);
704 Value ralpha = alpha - razor_margin[depth];
705 Value v = qsearch<NonPV, false>(pos, ss, ralpha, ralpha+1, DEPTH_ZERO);
710 // Step 7. Futility pruning: child node (skipped when in check)
712 && depth < 7 * ONE_PLY
713 && eval - futility_margin(depth) >= beta
714 && eval < VALUE_KNOWN_WIN // Do not return unproven wins
715 && pos.non_pawn_material(pos.side_to_move()))
716 return eval - futility_margin(depth);
718 // Step 8. Null move search with verification search (is omitted in PV nodes)
720 && depth >= 2 * ONE_PLY
722 && pos.non_pawn_material(pos.side_to_move()))
724 ss->currentMove = MOVE_NULL;
726 assert(eval - beta >= 0);
728 // Null move dynamic reduction based on depth and value
729 Depth R = ((823 + 67 * depth) / 256 + std::min((eval - beta) / PawnValueMg, 3)) * ONE_PLY;
731 pos.do_null_move(st);
732 (ss+1)->skipEarlyPruning = true;
733 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -beta+1, DEPTH_ZERO)
734 : - search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
735 (ss+1)->skipEarlyPruning = false;
736 pos.undo_null_move();
738 if (nullValue >= beta)
740 // Do not return unproven mate scores
741 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
744 if (depth < 12 * ONE_PLY && abs(beta) < VALUE_KNOWN_WIN)
747 // Do verification search at high depths
748 ss->skipEarlyPruning = true;
749 Value v = depth-R < ONE_PLY ? qsearch<NonPV, false>(pos, ss, beta-1, beta, DEPTH_ZERO)
750 : search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
751 ss->skipEarlyPruning = false;
758 // Step 9. ProbCut (skipped when in check)
759 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
760 // and a reduced search returns a value much above beta, we can (almost)
761 // safely prune the previous move.
763 && depth >= 5 * ONE_PLY
764 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
766 Value rbeta = std::min(beta + 200, VALUE_INFINITE);
767 Depth rdepth = depth - 4 * ONE_PLY;
769 assert(rdepth >= ONE_PLY);
770 assert((ss-1)->currentMove != MOVE_NONE);
771 assert((ss-1)->currentMove != MOVE_NULL);
773 MovePicker mp(pos, ttMove, thisThread->history, PieceValue[MG][pos.captured_piece_type()]);
776 while ((move = mp.next_move()) != MOVE_NONE)
777 if (pos.legal(move, ci.pinned))
779 ss->currentMove = move;
780 pos.do_move(move, st, pos.gives_check(move, ci));
781 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth, !cutNode);
788 // Step 10. Internal iterative deepening (skipped when in check)
789 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
791 && (PvNode || ss->staticEval + 256 >= beta))
793 Depth d = depth - 2 * ONE_PLY - (PvNode ? DEPTH_ZERO : depth / 4);
794 ss->skipEarlyPruning = true;
795 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d, true);
796 ss->skipEarlyPruning = false;
798 tte = TT.probe(posKey, ttHit);
799 ttMove = ttHit ? tte->move() : MOVE_NONE;
802 moves_loop: // When in check search starts from here
804 Square prevSq = to_sq((ss-1)->currentMove);
805 Move cm = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
806 const CounterMovesStats& cmh = CounterMovesHistory[pos.piece_on(prevSq)][prevSq];
808 MovePicker mp(pos, ttMove, depth, thisThread->history, cmh, cm, ss);
810 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
811 improving = ss->staticEval >= (ss-2)->staticEval
812 || ss->staticEval == VALUE_NONE
813 ||(ss-2)->staticEval == VALUE_NONE;
815 singularExtensionNode = !RootNode
816 && depth >= 8 * ONE_PLY
817 && ttMove != MOVE_NONE
818 /* && ttValue != VALUE_NONE Already implicit in the next condition */
819 && abs(ttValue) < VALUE_KNOWN_WIN
820 && !excludedMove // Recursive singular search is not allowed
821 && (tte->bound() & BOUND_LOWER)
822 && tte->depth() >= depth - 3 * ONE_PLY;
824 // Step 11. Loop through moves
825 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
826 while ((move = mp.next_move()) != MOVE_NONE)
830 if (move == excludedMove)
833 // At root obey the "searchmoves" option and skip moves not listed in Root
834 // Move List. As a consequence any illegal move is also skipped. In MultiPV
835 // mode we also skip PV moves which have been already searched.
836 if (RootNode && !std::count(thisThread->rootMoves.begin() + thisThread->PVIdx,
837 thisThread->rootMoves.end(), move))
840 ss->moveCount = ++moveCount;
842 if (RootNode && thisThread == Threads.main())
844 Signals.firstRootMove = moveCount == 1;
846 if (Time.elapsed() > 3000)
847 sync_cout << "info depth " << depth / ONE_PLY
848 << " currmove " << UCI::move(move, pos.is_chess960())
849 << " currmovenumber " << moveCount + thisThread->PVIdx << sync_endl;
853 (ss+1)->pv = nullptr;
855 extension = DEPTH_ZERO;
856 captureOrPromotion = pos.capture_or_promotion(move);
858 givesCheck = type_of(move) == NORMAL && !ci.dcCandidates
859 ? ci.checkSquares[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
860 : pos.gives_check(move, ci);
862 // Step 12. Extend checks
863 if (givesCheck && pos.see_sign(move) >= VALUE_ZERO)
866 // Singular extension search. If all moves but one fail low on a search of
867 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
868 // is singular and should be extended. To verify this we do a reduced search
869 // on all the other moves but the ttMove and if the result is lower than
870 // ttValue minus a margin then we extend the ttMove.
871 if ( singularExtensionNode
874 && pos.legal(move, ci.pinned))
876 Value rBeta = ttValue - 2 * depth / ONE_PLY;
877 ss->excludedMove = move;
878 ss->skipEarlyPruning = true;
879 value = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2, cutNode);
880 ss->skipEarlyPruning = false;
881 ss->excludedMove = MOVE_NONE;
887 // Update the current move (this must be done after singular extension search)
888 newDepth = depth - ONE_PLY + extension;
890 // Step 13. Pruning at shallow depth
892 && !captureOrPromotion
895 && !pos.advanced_pawn_push(move)
896 && bestValue > VALUE_MATED_IN_MAX_PLY)
898 // Move count based pruning
899 if ( depth < 16 * ONE_PLY
900 && moveCount >= FutilityMoveCounts[improving][depth])
903 // History based pruning
904 if ( depth <= 3 * ONE_PLY
905 && thisThread->history[pos.moved_piece(move)][to_sq(move)] < VALUE_ZERO
906 && cmh[pos.moved_piece(move)][to_sq(move)] < VALUE_ZERO)
909 predictedDepth = newDepth - reduction<PvNode>(improving, depth, moveCount);
911 // Futility pruning: parent node
912 if (predictedDepth < 7 * ONE_PLY)
914 futilityValue = ss->staticEval + futility_margin(predictedDepth) + 256;
916 if (futilityValue <= alpha)
918 bestValue = std::max(bestValue, futilityValue);
923 // Prune moves with negative SEE at low depths
924 if (predictedDepth < 4 * ONE_PLY && pos.see_sign(move) < VALUE_ZERO)
928 // Speculative prefetch as early as possible
929 prefetch(TT.first_entry(pos.key_after(move)));
931 // Check for legality just before making the move
932 if (!RootNode && !pos.legal(move, ci.pinned))
934 ss->moveCount = --moveCount;
938 ss->currentMove = move;
940 // Step 14. Make the move
941 pos.do_move(move, st, givesCheck);
943 // Step 15. Reduced depth search (LMR). If the move fails high it will be
944 // re-searched at full depth.
945 if ( depth >= 3 * ONE_PLY
947 && !captureOrPromotion
948 && move != ss->killers[0]
949 && move != ss->killers[1])
951 ss->reduction = reduction<PvNode>(improving, depth, moveCount);
953 // Increase reduction for cut nodes and moves with a bad history
954 if ( (!PvNode && cutNode)
955 || ( thisThread->history[pos.piece_on(to_sq(move))][to_sq(move)] < VALUE_ZERO
956 && cmh[pos.piece_on(to_sq(move))][to_sq(move)] <= VALUE_ZERO))
957 ss->reduction += ONE_PLY;
959 // Decrease reduction for moves with a good history
960 if ( thisThread->history[pos.piece_on(to_sq(move))][to_sq(move)] > VALUE_ZERO
961 && cmh[pos.piece_on(to_sq(move))][to_sq(move)] > VALUE_ZERO)
962 ss->reduction = std::max(DEPTH_ZERO, ss->reduction - ONE_PLY);
964 // Decrease reduction for moves that escape a capture
966 && type_of(move) == NORMAL
967 && type_of(pos.piece_on(to_sq(move))) != PAWN
968 && pos.see(make_move(to_sq(move), from_sq(move))) < VALUE_ZERO)
969 ss->reduction = std::max(DEPTH_ZERO, ss->reduction - ONE_PLY);
971 Depth d = std::max(newDepth - ss->reduction, ONE_PLY);
973 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
975 doFullDepthSearch = (value > alpha && ss->reduction != DEPTH_ZERO);
976 ss->reduction = DEPTH_ZERO;
979 doFullDepthSearch = !PvNode || moveCount > 1;
981 // Step 16. Full depth search, when LMR is skipped or fails high
982 if (doFullDepthSearch)
983 value = newDepth < ONE_PLY ?
984 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
985 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
986 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
988 // For PV nodes only, do a full PV search on the first move or after a fail
989 // high (in the latter case search only if value < beta), otherwise let the
990 // parent node fail low with value <= alpha and to try another move.
991 if (PvNode && (moveCount == 1 || (value > alpha && (RootNode || value < beta))))
994 (ss+1)->pv[0] = MOVE_NONE;
996 value = newDepth < ONE_PLY ?
997 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
998 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
999 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth, false);
1002 // Step 17. Undo move
1003 pos.undo_move(move);
1005 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1007 // Step 18. Check for new best move
1008 // Finished searching the move. If a stop occurred, the return value of
1009 // the search cannot be trusted, and we return immediately without
1010 // updating best move, PV and TT.
1011 if (Signals.stop.load(std::memory_order_relaxed))
1016 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1017 thisThread->rootMoves.end(), move);
1019 // PV move or new best move ?
1020 if (moveCount == 1 || value > alpha)
1027 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1028 rm.pv.push_back(*m);
1030 // We record how often the best move has been changed in each
1031 // iteration. This information is used for time management: When
1032 // the best move changes frequently, we allocate some more time.
1033 if (moveCount > 1 && thisThread == Threads.main())
1037 // All other moves but the PV are set to the lowest value: this is
1038 // not a problem when sorting because the sort is stable and the
1039 // move position in the list is preserved - just the PV is pushed up.
1040 rm.score = -VALUE_INFINITE;
1043 if (value > bestValue)
1049 // If there is an easy move for this position, clear it if unstable
1051 && thisThread == Threads.main()
1052 && EasyMove.get(pos.key())
1053 && (move != EasyMove.get(pos.key()) || moveCount > 1))
1058 if (PvNode && !RootNode) // Update pv even in fail-high case
1059 update_pv(ss->pv, move, (ss+1)->pv);
1061 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1065 assert(value >= beta); // Fail high
1071 if (!captureOrPromotion && move != bestMove && quietCount < 64)
1072 quietsSearched[quietCount++] = move;
1075 // Following condition would detect a stop only after move loop has been
1076 // completed. But in this case bestValue is valid because we have fully
1077 // searched our subtree, and we can anyhow save the result in TT.
1083 // Step 20. Check for mate and stalemate
1084 // All legal moves have been searched and if there are no legal moves, it
1085 // must be mate or stalemate. If we are in a singular extension search then
1086 // return a fail low score.
1088 bestValue = excludedMove ? alpha
1089 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1091 // Quiet best move: update killers, history and countermoves
1092 else if (bestMove && !pos.capture_or_promotion(bestMove))
1093 update_stats(pos, ss, bestMove, depth, quietsSearched, quietCount);
1095 // Bonus for prior countermove that caused the fail low
1096 else if ( depth >= 3 * ONE_PLY
1099 && !pos.captured_piece_type()
1100 && is_ok((ss - 1)->currentMove)
1101 && is_ok((ss - 2)->currentMove))
1103 Value bonus = Value((depth / ONE_PLY) * (depth / ONE_PLY));
1104 Square prevPrevSq = to_sq((ss - 2)->currentMove);
1105 CounterMovesStats& prevCmh = CounterMovesHistory[pos.piece_on(prevPrevSq)][prevPrevSq];
1106 prevCmh.update(pos.piece_on(prevSq), prevSq, bonus);
1109 tte->save(posKey, value_to_tt(bestValue, ss->ply),
1110 bestValue >= beta ? BOUND_LOWER :
1111 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1112 depth, bestMove, ss->staticEval, TT.generation());
1114 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1120 // qsearch() is the quiescence search function, which is called by the main
1121 // search function when the remaining depth is zero (or, to be more precise,
1122 // less than ONE_PLY).
1124 template <NodeType NT, bool InCheck>
1125 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1127 const bool PvNode = NT == PV;
1129 assert(NT == PV || NT == NonPV);
1130 assert(InCheck == !!pos.checkers());
1131 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1132 assert(PvNode || (alpha == beta - 1));
1133 assert(depth <= DEPTH_ZERO);
1139 Move ttMove, move, bestMove;
1140 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1141 bool ttHit, givesCheck, evasionPrunable;
1146 oldAlpha = alpha; // To flag BOUND_EXACT when eval above alpha and no available moves
1148 ss->pv[0] = MOVE_NONE;
1151 ss->currentMove = bestMove = MOVE_NONE;
1152 ss->ply = (ss-1)->ply + 1;
1154 // Check for an instant draw or if the maximum ply has been reached
1155 if (pos.is_draw() || ss->ply >= MAX_PLY)
1156 return ss->ply >= MAX_PLY && !InCheck ? evaluate(pos)
1157 : DrawValue[pos.side_to_move()];
1159 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1161 // Decide whether or not to include checks: this fixes also the type of
1162 // TT entry depth that we are going to use. Note that in qsearch we use
1163 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1164 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1165 : DEPTH_QS_NO_CHECKS;
1167 // Transposition table lookup
1169 tte = TT.probe(posKey, ttHit);
1170 ttMove = ttHit ? tte->move() : MOVE_NONE;
1171 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
1175 && tte->depth() >= ttDepth
1176 && ttValue != VALUE_NONE // Only in case of TT access race
1177 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1178 : (tte->bound() & BOUND_UPPER)))
1180 ss->currentMove = ttMove; // Can be MOVE_NONE
1184 // Evaluate the position statically
1187 ss->staticEval = VALUE_NONE;
1188 bestValue = futilityBase = -VALUE_INFINITE;
1194 // Never assume anything on values stored in TT
1195 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1196 ss->staticEval = bestValue = evaluate(pos);
1198 // Can ttValue be used as a better position evaluation?
1199 if (ttValue != VALUE_NONE)
1200 if (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER))
1201 bestValue = ttValue;
1204 ss->staticEval = bestValue =
1205 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1206 : -(ss-1)->staticEval + 2 * Eval::Tempo;
1208 // Stand pat. Return immediately if static value is at least beta
1209 if (bestValue >= beta)
1212 tte->save(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1213 DEPTH_NONE, MOVE_NONE, ss->staticEval, TT.generation());
1218 if (PvNode && bestValue > alpha)
1221 futilityBase = bestValue + 128;
1224 // Initialize a MovePicker object for the current position, and prepare
1225 // to search the moves. Because the depth is <= 0 here, only captures,
1226 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1228 MovePicker mp(pos, ttMove, depth, pos.this_thread()->history, to_sq((ss-1)->currentMove));
1231 // Loop through the moves until no moves remain or a beta cutoff occurs
1232 while ((move = mp.next_move()) != MOVE_NONE)
1234 assert(is_ok(move));
1236 givesCheck = type_of(move) == NORMAL && !ci.dcCandidates
1237 ? ci.checkSquares[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
1238 : pos.gives_check(move, ci);
1243 && futilityBase > -VALUE_KNOWN_WIN
1244 && !pos.advanced_pawn_push(move))
1246 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1248 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1250 if (futilityValue <= alpha)
1252 bestValue = std::max(bestValue, futilityValue);
1256 if (futilityBase <= alpha && pos.see(move) <= VALUE_ZERO)
1258 bestValue = std::max(bestValue, futilityBase);
1263 // Detect non-capture evasions that are candidates to be pruned
1264 evasionPrunable = InCheck
1265 && bestValue > VALUE_MATED_IN_MAX_PLY
1266 && !pos.capture(move);
1268 // Don't search moves with negative SEE values
1269 if ( (!InCheck || evasionPrunable)
1270 && type_of(move) != PROMOTION
1271 && pos.see_sign(move) < VALUE_ZERO)
1274 // Speculative prefetch as early as possible
1275 prefetch(TT.first_entry(pos.key_after(move)));
1277 // Check for legality just before making the move
1278 if (!pos.legal(move, ci.pinned))
1281 ss->currentMove = move;
1283 // Make and search the move
1284 pos.do_move(move, st, givesCheck);
1285 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1286 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1287 pos.undo_move(move);
1289 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1291 // Check for new best move
1292 if (value > bestValue)
1298 if (PvNode) // Update pv even in fail-high case
1299 update_pv(ss->pv, move, (ss+1)->pv);
1301 if (PvNode && value < beta) // Update alpha here!
1308 tte->save(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1309 ttDepth, move, ss->staticEval, TT.generation());
1317 // All legal moves have been searched. A special case: If we're in check
1318 // and no legal moves were found, it is checkmate.
1319 if (InCheck && bestValue == -VALUE_INFINITE)
1320 return mated_in(ss->ply); // Plies to mate from the root
1322 tte->save(posKey, value_to_tt(bestValue, ss->ply),
1323 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1324 ttDepth, bestMove, ss->staticEval, TT.generation());
1326 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1332 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1333 // "plies to mate from the current position". Non-mate scores are unchanged.
1334 // The function is called before storing a value in the transposition table.
1336 Value value_to_tt(Value v, int ply) {
1338 assert(v != VALUE_NONE);
1340 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1341 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1345 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1346 // from the transposition table (which refers to the plies to mate/be mated
1347 // from current position) to "plies to mate/be mated from the root".
1349 Value value_from_tt(Value v, int ply) {
1351 return v == VALUE_NONE ? VALUE_NONE
1352 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1353 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1357 // update_pv() adds current move and appends child pv[]
1359 void update_pv(Move* pv, Move move, Move* childPv) {
1361 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1367 // update_stats() updates killers, history, countermove history and
1368 // countermoves stats for a quiet best move.
1370 void update_stats(const Position& pos, Stack* ss, Move move,
1371 Depth depth, Move* quiets, int quietsCnt) {
1373 if (ss->killers[0] != move)
1375 ss->killers[1] = ss->killers[0];
1376 ss->killers[0] = move;
1379 Value bonus = Value((depth / ONE_PLY) * (depth / ONE_PLY));
1381 Square prevSq = to_sq((ss-1)->currentMove);
1382 CounterMovesStats& cmh = CounterMovesHistory[pos.piece_on(prevSq)][prevSq];
1383 Thread* thisThread = pos.this_thread();
1385 thisThread->history.update(pos.moved_piece(move), to_sq(move), bonus);
1387 if (is_ok((ss-1)->currentMove))
1389 thisThread->counterMoves.update(pos.piece_on(prevSq), prevSq, move);
1390 cmh.update(pos.moved_piece(move), to_sq(move), bonus);
1393 // Decrease all the other played quiet moves
1394 for (int i = 0; i < quietsCnt; ++i)
1396 thisThread->history.update(pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
1398 if (is_ok((ss-1)->currentMove))
1399 cmh.update(pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
1402 // Extra penalty for TT move in previous ply when it gets refuted
1403 if ( (ss-1)->moveCount == 1
1404 && !pos.captured_piece_type()
1405 && is_ok((ss-2)->currentMove))
1407 Square prevPrevSq = to_sq((ss-2)->currentMove);
1408 CounterMovesStats& prevCmh = CounterMovesHistory[pos.piece_on(prevPrevSq)][prevPrevSq];
1409 prevCmh.update(pos.piece_on(prevSq), prevSq, -bonus - 2 * depth / ONE_PLY - 1);
1414 // When playing with strength handicap, choose best move among a set of RootMoves
1415 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1417 Move Skill::pick_best(size_t multiPV) {
1419 // PRNG sequence should be non-deterministic, so we seed it with the time at init
1420 const Search::RootMoveVector& rootMoves = Threads.main()->rootMoves;
1421 static PRNG rng(now());
1423 // RootMoves are already sorted by score in descending order
1424 int variance = std::min(rootMoves[0].score - rootMoves[multiPV - 1].score, PawnValueMg);
1425 int weakness = 120 - 2 * level;
1426 int maxScore = -VALUE_INFINITE;
1428 // Choose best move. For each move score we add two terms both dependent on
1429 // weakness. One deterministic and bigger for weaker levels, and one random,
1430 // then we choose the move with the resulting highest score.
1431 for (size_t i = 0; i < multiPV; ++i)
1433 // This is our magic formula
1434 int push = ( weakness * int(rootMoves[0].score - rootMoves[i].score)
1435 + variance * (rng.rand<unsigned>() % weakness)) / 128;
1437 if (rootMoves[i].score + push > maxScore)
1439 maxScore = rootMoves[i].score + push;
1440 best = rootMoves[i].pv[0];
1449 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1450 /// that all (if any) unsearched PV lines are sent using a previous search score.
1452 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1454 std::stringstream ss;
1455 int elapsed = Time.elapsed() + 1;
1456 const Search::RootMoveVector& rootMoves = pos.this_thread()->rootMoves;
1457 size_t PVIdx = pos.this_thread()->PVIdx;
1458 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1459 uint64_t nodes_searched = Threads.nodes_searched();
1461 for (size_t i = 0; i < multiPV; ++i)
1463 bool updated = (i <= PVIdx);
1465 if (depth == ONE_PLY && !updated)
1468 Depth d = updated ? depth : depth - ONE_PLY;
1469 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1471 bool tb = TB::RootInTB && abs(v) < VALUE_MATE - MAX_PLY;
1472 v = tb ? TB::Score : v;
1474 if (ss.rdbuf()->in_avail()) // Not at first line
1478 << " depth " << d / ONE_PLY
1479 << " seldepth " << pos.this_thread()->maxPly
1480 << " multipv " << i + 1
1481 << " score " << UCI::value(v);
1483 if (!tb && i == PVIdx)
1484 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1486 ss << " nodes " << nodes_searched
1487 << " nps " << nodes_searched * 1000 / elapsed;
1489 if (elapsed > 1000) // Earlier makes little sense
1490 ss << " hashfull " << TT.hashfull();
1492 ss << " tbhits " << TB::Hits
1493 << " time " << elapsed
1496 for (Move m : rootMoves[i].pv)
1497 ss << " " << UCI::move(m, pos.is_chess960());
1504 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1505 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1506 /// first, even if the old TT entries have been overwritten.
1508 void RootMove::insert_pv_in_tt(Position& pos) {
1510 StateInfo state[MAX_PLY], *st = state;
1515 assert(MoveList<LEGAL>(pos).contains(m));
1517 TTEntry* tte = TT.probe(pos.key(), ttHit);
1519 if (!ttHit || tte->move() != m) // Don't overwrite correct entries
1520 tte->save(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, m, VALUE_NONE, TT.generation());
1522 pos.do_move(m, *st++, pos.gives_check(m, CheckInfo(pos)));
1525 for (size_t i = pv.size(); i > 0; )
1526 pos.undo_move(pv[--i]);
1530 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move before
1531 /// exiting the search, for instance in case we stop the search during a fail high at
1532 /// root. We try hard to have a ponder move to return to the GUI, otherwise in case of
1533 /// 'ponder on' we have nothing to think on.
1535 bool RootMove::extract_ponder_from_tt(Position& pos)
1540 assert(pv.size() == 1);
1542 pos.do_move(pv[0], st, pos.gives_check(pv[0], CheckInfo(pos)));
1543 TTEntry* tte = TT.probe(pos.key(), ttHit);
1544 pos.undo_move(pv[0]);
1548 Move m = tte->move(); // Local copy to be SMP safe
1549 if (MoveList<LEGAL>(pos).contains(m))
1550 return pv.push_back(m), true;
1557 /// check_time() is called by the timer thread when the timer triggers. It is
1558 /// used to print debug info and, more importantly, to detect when we are out of
1559 /// available time and thus stop the search.
1563 static TimePoint lastInfoTime = now();
1564 int elapsed = Time.elapsed();
1566 if (now() - lastInfoTime >= 1000)
1568 lastInfoTime = now();
1572 // An engine may not stop pondering until told so by the GUI
1576 if (Limits.use_time_management())
1578 bool stillAtFirstMove = Signals.firstRootMove
1579 && !Signals.failedLowAtRoot
1580 && elapsed > Time.available() * 3 / 4;
1582 if ( stillAtFirstMove
1583 || elapsed > Time.maximum() - 2 * TimerThread::Resolution)
1584 Signals.stop = true;
1586 else if (Limits.movetime && elapsed >= Limits.movetime)
1587 Signals.stop = true;
1589 else if (Limits.nodes && Threads.nodes_searched() >= Limits.nodes)
1590 Signals.stop = true;