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
5 Copyright (C) 2015-2017 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
7 Stockfish is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
12 Stockfish is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>.
24 #include <cstring> // For std::memset
38 #include "syzygy/tbprobe.h"
45 namespace Tablebases {
54 namespace TB = Tablebases;
58 using namespace Search;
62 // Different node types, used as a template parameter
63 enum NodeType { NonPV, PV };
65 // Sizes and phases of the skip-blocks, used for distributing search depths across the threads
66 const int skipSize[] = { 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4 };
67 const int skipPhase[] = { 0, 1, 0, 1, 2, 3, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 6, 7 };
69 // Razoring and futility margin based on depth
70 // razor_margin[0] is unused as long as depth >= ONE_PLY in search
71 const int razor_margin[] = { 0, 570, 603, 554 };
72 Value futility_margin(Depth d) { return Value(150 * d / ONE_PLY); }
74 // Futility and reductions lookup tables, initialized at startup
75 int FutilityMoveCounts[2][16]; // [improving][depth]
76 int Reductions[2][2][64][64]; // [pv][improving][depth][moveNumber]
78 // Threshold used for countermoves based pruning
79 const int CounterMovePruneThreshold = 0;
81 template <bool PvNode> Depth reduction(bool i, Depth d, int mn) {
82 return Reductions[PvNode][i][std::min(d / ONE_PLY, 63)][std::min(mn, 63)] * ONE_PLY;
85 // History and stats update bonus, based on depth
86 int stat_bonus(Depth depth) {
87 int d = depth / ONE_PLY;
88 return d > 17 ? 0 : d * d + 2 * d - 2;
91 // Skill structure is used to implement strength limit
93 Skill(int l) : level(l) {}
94 bool enabled() const { return level < 20; }
95 bool time_to_pick(Depth depth) const { return depth / ONE_PLY == 1 + level; }
96 Move best_move(size_t multiPV) { return best ? best : pick_best(multiPV); }
97 Move pick_best(size_t multiPV);
100 Move best = MOVE_NONE;
103 // EasyMoveManager structure is used to detect an 'easy move'. When the PV is stable
104 // across multiple search iterations, we can quickly return the best move.
105 struct EasyMoveManager {
110 pv[0] = pv[1] = pv[2] = MOVE_NONE;
113 Move get(Key key) const {
114 return expectedPosKey == key ? pv[2] : MOVE_NONE;
117 void update(Position& pos, const std::vector<Move>& newPv) {
119 assert(newPv.size() >= 3);
121 // Keep track of how many times in a row the 3rd ply remains stable
122 stableCnt = (newPv[2] == pv[2]) ? stableCnt + 1 : 0;
124 if (!std::equal(newPv.begin(), newPv.begin() + 3, pv))
126 std::copy(newPv.begin(), newPv.begin() + 3, pv);
129 pos.do_move(newPv[0], st[0]);
130 pos.do_move(newPv[1], st[1]);
131 expectedPosKey = pos.key();
132 pos.undo_move(newPv[1]);
133 pos.undo_move(newPv[0]);
142 EasyMoveManager EasyMove;
143 Value DrawValue[COLOR_NB];
145 template <NodeType NT>
146 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode, bool skipEarlyPruning);
148 template <NodeType NT, bool InCheck>
149 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = DEPTH_ZERO);
151 Value value_to_tt(Value v, int ply);
152 Value value_from_tt(Value v, int ply);
153 void update_pv(Move* pv, Move move, Move* childPv);
154 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
155 void update_stats(const Position& pos, Stack* ss, Move move, Move* quiets, int quietsCnt, int bonus);
160 /// Search::init() is called during startup to initialize various lookup tables
162 void Search::init() {
164 for (int imp = 0; imp <= 1; ++imp)
165 for (int d = 1; d < 64; ++d)
166 for (int mc = 1; mc < 64; ++mc)
168 double r = log(d) * log(mc) / 1.95;
170 Reductions[NonPV][imp][d][mc] = int(std::round(r));
171 Reductions[PV][imp][d][mc] = std::max(Reductions[NonPV][imp][d][mc] - 1, 0);
173 // Increase reduction for non-PV nodes when eval is not improving
174 if (!imp && Reductions[NonPV][imp][d][mc] >= 2)
175 Reductions[NonPV][imp][d][mc]++;
178 for (int d = 0; d < 16; ++d)
180 FutilityMoveCounts[0][d] = int(2.4 + 0.74 * pow(d, 1.78));
181 FutilityMoveCounts[1][d] = int(5.0 + 1.00 * pow(d, 2.00));
186 /// Search::clear() resets search state to its initial value
188 void Search::clear() {
190 Threads.main()->wait_for_search_finished();
192 Time.availableNodes = 0;
195 for (Thread* th : Threads)
197 th->counterMoves.fill(MOVE_NONE);
198 th->mainHistory.fill(0);
200 for (auto& to : th->contHistory)
204 th->contHistory[NO_PIECE][0].fill(CounterMovePruneThreshold - 1);
207 Threads.main()->callsCnt = 0;
208 Threads.main()->previousScore = VALUE_INFINITE;
212 /// Search::perft() is our utility to verify move generation. All the leaf nodes
213 /// up to the given depth are generated and counted, and the sum is returned.
215 uint64_t Search::perft(Position& pos, Depth depth) {
218 uint64_t cnt, nodes = 0;
219 const bool leaf = (depth == 2 * ONE_PLY);
221 for (const auto& m : MoveList<LEGAL>(pos))
223 if (Root && depth <= ONE_PLY)
228 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - ONE_PLY);
233 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
238 template uint64_t Search::perft<true>(Position&, Depth);
241 /// MainThread::search() is called by the main thread when the program receives
242 /// the UCI 'go' command. It searches from the root position and outputs the "bestmove".
244 void MainThread::search() {
246 Color us = rootPos.side_to_move();
247 Time.init(Limits, us, rootPos.game_ply());
250 int contempt = Options["Contempt"] * PawnValueEg / 100; // From centipawns
251 DrawValue[ us] = VALUE_DRAW - Value(contempt);
252 DrawValue[~us] = VALUE_DRAW + Value(contempt);
254 if (rootMoves.empty())
256 rootMoves.emplace_back(MOVE_NONE);
257 sync_cout << "info depth 0 score "
258 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
263 for (Thread* th : Threads)
265 th->start_searching();
267 Thread::search(); // Let's start searching!
270 // When playing in 'nodes as time' mode, subtract the searched nodes from
271 // the available ones before exiting.
273 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
275 // When we reach the maximum depth, we can arrive here without a raise of
276 // Threads.stop. However, if we are pondering or in an infinite search,
277 // the UCI protocol states that we shouldn't print the best move before the
278 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
279 // until the GUI sends one of those commands (which also raises Threads.stop).
280 Threads.stopOnPonderhit = true;
282 while (!Threads.stop && (Threads.ponder || Limits.infinite))
283 {} // Busy wait for a stop or a ponder reset
285 // Stop the threads if not already stopped (also raise the stop if
286 // "ponderhit" just reset Threads.ponder).
289 // Wait until all threads have finished
290 for (Thread* th : Threads)
292 th->wait_for_search_finished();
294 // Check if there are threads with a better score than main thread
295 Thread* bestThread = this;
296 if ( !this->easyMovePlayed
297 && Options["MultiPV"] == 1
299 && !Skill(Options["Skill Level"]).enabled()
300 && rootMoves[0].pv[0] != MOVE_NONE)
302 for (Thread* th : Threads)
304 Depth depthDiff = th->completedDepth - bestThread->completedDepth;
305 Value scoreDiff = th->rootMoves[0].score - bestThread->rootMoves[0].score;
307 if (scoreDiff > 0 && depthDiff >= 0)
312 previousScore = bestThread->rootMoves[0].score;
314 // Send new PV when needed
315 if (bestThread != this)
316 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth, -VALUE_INFINITE, VALUE_INFINITE) << sync_endl;
318 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
320 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
321 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
323 std::cout << sync_endl;
327 /// Thread::search() is the main iterative deepening loop. It calls search()
328 /// repeatedly with increasing depth until the allocated thinking time has been
329 /// consumed, the user stops the search, or the maximum search depth is reached.
331 void Thread::search() {
333 Stack stack[MAX_PLY+7], *ss = stack+4; // To allow referencing (ss-4) and (ss+2)
334 Value bestValue, alpha, beta, delta;
335 Move easyMove = MOVE_NONE;
336 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
338 std::memset(ss-4, 0, 7 * sizeof(Stack));
339 for (int i = 4; i > 0; i--)
340 (ss-i)->contHistory = &this->contHistory[NO_PIECE][0]; // Use as sentinel
342 bestValue = delta = alpha = -VALUE_INFINITE;
343 beta = VALUE_INFINITE;
347 easyMove = EasyMove.get(rootPos.key());
349 mainThread->easyMovePlayed = mainThread->failedLow = false;
350 mainThread->bestMoveChanges = 0;
353 size_t multiPV = Options["MultiPV"];
354 Skill skill(Options["Skill Level"]);
356 // When playing with strength handicap enable MultiPV search that we will
357 // use behind the scenes to retrieve a set of possible moves.
359 multiPV = std::max(multiPV, (size_t)4);
361 multiPV = std::min(multiPV, rootMoves.size());
363 // Iterative deepening loop until requested to stop or the target depth is reached
364 while ( (rootDepth += ONE_PLY) < DEPTH_MAX
366 && !(Limits.depth && mainThread && rootDepth / ONE_PLY > Limits.depth))
368 // Distribute search depths across the threads
371 int i = (idx - 1) % 20;
372 if (((rootDepth / ONE_PLY + rootPos.game_ply() + skipPhase[i]) / skipSize[i]) % 2)
376 // Age out PV variability metric
378 mainThread->bestMoveChanges *= 0.505, mainThread->failedLow = false;
380 // Save the last iteration's scores before first PV line is searched and
381 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
382 for (RootMove& rm : rootMoves)
383 rm.previousScore = rm.score;
385 // MultiPV loop. We perform a full root search for each PV line
386 for (PVIdx = 0; PVIdx < multiPV && !Threads.stop; ++PVIdx)
388 // Reset UCI info selDepth for each depth and each PV line
391 // Reset aspiration window starting size
392 if (rootDepth >= 5 * ONE_PLY)
395 alpha = std::max(rootMoves[PVIdx].previousScore - delta,-VALUE_INFINITE);
396 beta = std::min(rootMoves[PVIdx].previousScore + delta, VALUE_INFINITE);
399 // Start with a small aspiration window and, in the case of a fail
400 // high/low, re-search with a bigger window until we're not failing
404 bestValue = ::search<PV>(rootPos, ss, alpha, beta, rootDepth, false, false);
406 // Bring the best move to the front. It is critical that sorting
407 // is done with a stable algorithm because all the values but the
408 // first and eventually the new best one are set to -VALUE_INFINITE
409 // and we want to keep the same order for all the moves except the
410 // new PV that goes to the front. Note that in case of MultiPV
411 // search the already searched PV lines are preserved.
412 std::stable_sort(rootMoves.begin() + PVIdx, rootMoves.end());
414 // If search has been stopped, we break immediately. Sorting and
415 // writing PV back to TT is safe because RootMoves is still
416 // valid, although it refers to the previous iteration.
420 // When failing high/low give some update (without cluttering
421 // the UI) before a re-search.
424 && (bestValue <= alpha || bestValue >= beta)
425 && Time.elapsed() > 3000)
426 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
428 // In case of failing low/high increase aspiration window and
429 // re-search, otherwise exit the loop.
430 if (bestValue <= alpha)
432 beta = (alpha + beta) / 2;
433 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
437 mainThread->failedLow = true;
438 Threads.stopOnPonderhit = false;
441 else if (bestValue >= beta)
442 beta = std::min(bestValue + delta, VALUE_INFINITE);
446 delta += delta / 4 + 5;
448 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
451 // Sort the PV lines searched so far and update the GUI
452 std::stable_sort(rootMoves.begin(), rootMoves.begin() + PVIdx + 1);
457 if (Threads.stop || PVIdx + 1 == multiPV || Time.elapsed() > 3000)
458 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
462 completedDepth = rootDepth;
467 // If skill level is enabled and time is up, pick a sub-optimal best move
468 if (skill.enabled() && skill.time_to_pick(rootDepth))
469 skill.pick_best(multiPV);
471 // Have we found a "mate in x"?
473 && bestValue >= VALUE_MATE_IN_MAX_PLY
474 && VALUE_MATE - bestValue <= 2 * Limits.mate)
477 // Do we have time for the next iteration? Can we stop searching now?
478 if (Limits.use_time_management())
480 if (!Threads.stop && !Threads.stopOnPonderhit)
482 // Stop the search if only one legal move is available, or if all
483 // of the available time has been used, or if we matched an easyMove
484 // from the previous search and just did a fast verification.
485 const int F[] = { mainThread->failedLow,
486 bestValue - mainThread->previousScore };
488 int improvingFactor = std::max(229, std::min(715, 357 + 119 * F[0] - 6 * F[1]));
489 double unstablePvFactor = 1 + mainThread->bestMoveChanges;
491 bool doEasyMove = rootMoves[0].pv[0] == easyMove
492 && mainThread->bestMoveChanges < 0.03
493 && Time.elapsed() > Time.optimum() * 5 / 44;
495 if ( rootMoves.size() == 1
496 || Time.elapsed() > Time.optimum() * unstablePvFactor * improvingFactor / 628
497 || (mainThread->easyMovePlayed = doEasyMove, doEasyMove))
499 // If we are allowed to ponder do not stop the search now but
500 // keep pondering until the GUI sends "ponderhit" or "stop".
502 Threads.stopOnPonderhit = true;
508 if (rootMoves[0].pv.size() >= 3)
509 EasyMove.update(rootPos, rootMoves[0].pv);
518 // Clear any candidate easy move that wasn't stable for the last search
519 // iterations; the second condition prevents consecutive fast moves.
520 if (EasyMove.stableCnt < 6 || mainThread->easyMovePlayed)
523 // If skill level is enabled, swap best PV line with the sub-optimal one
525 std::swap(rootMoves[0], *std::find(rootMoves.begin(),
526 rootMoves.end(), skill.best_move(multiPV)));
532 // search<>() is the main search function for both PV and non-PV nodes
534 template <NodeType NT>
535 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode, bool skipEarlyPruning) {
537 const bool PvNode = NT == PV;
538 const bool rootNode = PvNode && (ss-1)->ply == 0;
540 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
541 assert(PvNode || (alpha == beta - 1));
542 assert(DEPTH_ZERO < depth && depth < DEPTH_MAX);
543 assert(!(PvNode && cutNode));
544 assert(depth / ONE_PLY * ONE_PLY == depth);
546 Move pv[MAX_PLY+1], quietsSearched[64];
550 Move ttMove, move, excludedMove, bestMove;
551 Depth extension, newDepth;
552 Value bestValue, value, ttValue, eval;
553 bool ttHit, inCheck, givesCheck, singularExtensionNode, improving;
554 bool captureOrPromotion, doFullDepthSearch, moveCountPruning, skipQuiets, ttCapture;
556 int moveCount, quietCount;
558 // Step 1. Initialize node
559 Thread* thisThread = pos.this_thread();
560 inCheck = pos.checkers();
561 moveCount = quietCount = ss->moveCount = 0;
563 bestValue = -VALUE_INFINITE;
564 ss->ply = (ss-1)->ply + 1;
566 // Check for the available remaining time
567 if (thisThread == Threads.main())
568 static_cast<MainThread*>(thisThread)->check_time();
570 // Used to send selDepth info to GUI
571 if (PvNode && thisThread->selDepth < ss->ply)
572 thisThread->selDepth = ss->ply;
576 // Step 2. Check for aborted search and immediate draw
577 if (Threads.stop.load(std::memory_order_relaxed) || pos.is_draw(ss->ply) || ss->ply >= MAX_PLY)
578 return ss->ply >= MAX_PLY && !inCheck ? evaluate(pos)
579 : DrawValue[pos.side_to_move()];
581 // Step 3. Mate distance pruning. Even if we mate at the next move our score
582 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
583 // a shorter mate was found upward in the tree then there is no need to search
584 // because we will never beat the current alpha. Same logic but with reversed
585 // signs applies also in the opposite condition of being mated instead of giving
586 // mate. In this case return a fail-high score.
587 alpha = std::max(mated_in(ss->ply), alpha);
588 beta = std::min(mate_in(ss->ply+1), beta);
593 assert(0 <= ss->ply && ss->ply < MAX_PLY);
595 ss->currentMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
596 ss->contHistory = &thisThread->contHistory[NO_PIECE][0];
597 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
598 Square prevSq = to_sq((ss-1)->currentMove);
600 // Step 4. Transposition table lookup. We don't want the score of a partial
601 // search to overwrite a previous full search TT value, so we use a different
602 // position key in case of an excluded move.
603 excludedMove = ss->excludedMove;
604 posKey = pos.key() ^ Key(excludedMove);
605 tte = TT.probe(posKey, ttHit);
606 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
607 ttMove = rootNode ? thisThread->rootMoves[thisThread->PVIdx].pv[0]
608 : ttHit ? tte->move() : MOVE_NONE;
610 // At non-PV nodes we check for an early TT cutoff
613 && tte->depth() >= depth
614 && ttValue != VALUE_NONE // Possible in case of TT access race
615 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
616 : (tte->bound() & BOUND_UPPER)))
618 // If ttMove is quiet, update move sorting heuristics on TT hit
623 if (!pos.capture_or_promotion(ttMove))
624 update_stats(pos, ss, ttMove, nullptr, 0, stat_bonus(depth));
626 // Extra penalty for a quiet TT move in previous ply when it gets refuted
627 if ((ss-1)->moveCount == 1 && !pos.captured_piece())
628 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + ONE_PLY));
630 // Penalty for a quiet ttMove that fails low
631 else if (!pos.capture_or_promotion(ttMove))
633 int penalty = -stat_bonus(depth);
634 thisThread->mainHistory.update(pos.side_to_move(), ttMove, penalty);
635 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
641 // Step 4a. Tablebase probe
642 if (!rootNode && TB::Cardinality)
644 int piecesCount = pos.count<ALL_PIECES>();
646 if ( piecesCount <= TB::Cardinality
647 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
648 && pos.rule50_count() == 0
649 && !pos.can_castle(ANY_CASTLING))
652 TB::WDLScore v = Tablebases::probe_wdl(pos, &err);
654 if (err != TB::ProbeState::FAIL)
656 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
658 int drawScore = TB::UseRule50 ? 1 : 0;
660 value = v < -drawScore ? -VALUE_MATE + MAX_PLY + ss->ply
661 : v > drawScore ? VALUE_MATE - MAX_PLY - ss->ply
662 : VALUE_DRAW + 2 * v * drawScore;
664 tte->save(posKey, value_to_tt(value, ss->ply), BOUND_EXACT,
665 std::min(DEPTH_MAX - ONE_PLY, depth + 6 * ONE_PLY),
666 MOVE_NONE, VALUE_NONE, TT.generation());
673 // Step 5. Evaluate the position statically
676 ss->staticEval = eval = VALUE_NONE;
682 // Never assume anything on values stored in TT
683 if ((ss->staticEval = eval = tte->eval()) == VALUE_NONE)
684 eval = ss->staticEval = evaluate(pos);
686 // Can ttValue be used as a better position evaluation?
687 if ( ttValue != VALUE_NONE
688 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
693 eval = ss->staticEval =
694 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
695 : -(ss-1)->staticEval + 2 * Eval::Tempo;
697 tte->save(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE,
698 ss->staticEval, TT.generation());
701 if (skipEarlyPruning)
704 // Step 6. Razoring (skipped when in check)
706 && depth < 4 * ONE_PLY
707 && eval + razor_margin[depth / ONE_PLY] <= alpha)
709 if (depth <= ONE_PLY)
710 return qsearch<NonPV, false>(pos, ss, alpha, alpha+1);
712 Value ralpha = alpha - razor_margin[depth / ONE_PLY];
713 Value v = qsearch<NonPV, false>(pos, ss, ralpha, ralpha+1);
718 // Step 7. Futility pruning: child node (skipped when in check)
720 && depth < 7 * ONE_PLY
721 && eval - futility_margin(depth) >= beta
722 && eval < VALUE_KNOWN_WIN // Do not return unproven wins
723 && pos.non_pawn_material(pos.side_to_move()))
726 // Step 8. Null move search with verification search (is omitted in PV nodes)
729 && (ss->staticEval >= beta - 35 * (depth / ONE_PLY - 6) || depth >= 13 * ONE_PLY)
730 && pos.non_pawn_material(pos.side_to_move()))
733 assert(eval - beta >= 0);
735 // Null move dynamic reduction based on depth and value
736 Depth R = ((823 + 67 * depth / ONE_PLY) / 256 + std::min((eval - beta) / PawnValueMg, 3)) * ONE_PLY;
738 ss->currentMove = MOVE_NULL;
739 ss->contHistory = &thisThread->contHistory[NO_PIECE][0];
741 pos.do_null_move(st);
742 Value nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -beta+1)
743 : - search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode, true);
744 pos.undo_null_move();
746 if (nullValue >= beta)
748 // Do not return unproven mate scores
749 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
752 if (depth < 12 * ONE_PLY && abs(beta) < VALUE_KNOWN_WIN)
755 // Do verification search at high depths
756 Value v = depth-R < ONE_PLY ? qsearch<NonPV, false>(pos, ss, beta-1, beta)
757 : search<NonPV>(pos, ss, beta-1, beta, depth-R, false, true);
764 // Step 9. ProbCut (skipped when in check)
765 // If we have a good enough capture and a reduced search returns a value
766 // much above beta, we can (almost) safely prune the previous move.
768 && depth >= 5 * ONE_PLY
769 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
771 Value rbeta = std::min(beta + 200, VALUE_INFINITE);
773 assert(is_ok((ss-1)->currentMove));
775 MovePicker mp(pos, ttMove, rbeta - ss->staticEval);
777 while ((move = mp.next_move()) != MOVE_NONE)
780 ss->currentMove = move;
781 ss->contHistory = &thisThread->contHistory[pos.moved_piece(move)][to_sq(move)];
783 assert(depth >= 5 * ONE_PLY);
784 pos.do_move(move, st);
785 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, depth - 4 * ONE_PLY, !cutNode, false);
792 // Step 10. Internal iterative deepening (skipped when in check)
793 if ( depth >= 6 * ONE_PLY
795 && (PvNode || ss->staticEval + 256 >= beta))
797 Depth d = (3 * depth / (4 * ONE_PLY) - 2) * ONE_PLY;
798 search<NT>(pos, ss, alpha, beta, d, cutNode, true);
800 tte = TT.probe(posKey, ttHit);
801 ttMove = ttHit ? tte->move() : MOVE_NONE;
804 moves_loop: // When in check search starts from here
806 const PieceToHistory* contHist[] = { (ss-1)->contHistory, (ss-2)->contHistory, nullptr, (ss-4)->contHistory };
807 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
809 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory, contHist, countermove, ss->killers);
810 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
811 improving = ss->staticEval >= (ss-2)->staticEval
812 /* || ss->staticEval == VALUE_NONE Already implicit in the previous condition */
813 ||(ss-2)->staticEval == VALUE_NONE;
815 singularExtensionNode = !rootNode
816 && depth >= 8 * ONE_PLY
817 && ttMove != MOVE_NONE
818 && ttValue != VALUE_NONE
819 && !excludedMove // Recursive singular search is not allowed
820 && (tte->bound() & BOUND_LOWER)
821 && tte->depth() >= depth - 3 * ONE_PLY;
825 // Step 11. Loop through moves
826 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
827 while ((move = mp.next_move(skipQuiets)) != MOVE_NONE)
831 if (move == excludedMove)
834 // At root obey the "searchmoves" option and skip moves not listed in Root
835 // Move List. As a consequence any illegal move is also skipped. In MultiPV
836 // mode we also skip PV moves which have been already searched.
837 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->PVIdx,
838 thisThread->rootMoves.end(), move))
841 ss->moveCount = ++moveCount;
843 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
844 sync_cout << "info depth " << depth / ONE_PLY
845 << " currmove " << UCI::move(move, pos.is_chess960())
846 << " currmovenumber " << moveCount + thisThread->PVIdx << sync_endl;
849 (ss+1)->pv = nullptr;
851 extension = DEPTH_ZERO;
852 captureOrPromotion = pos.capture_or_promotion(move);
853 movedPiece = pos.moved_piece(move);
855 givesCheck = type_of(move) == NORMAL && !pos.discovered_check_candidates()
856 ? pos.check_squares(type_of(pos.piece_on(from_sq(move)))) & to_sq(move)
857 : pos.gives_check(move);
859 moveCountPruning = depth < 16 * ONE_PLY
860 && moveCount >= FutilityMoveCounts[improving][depth / ONE_PLY];
862 // Step 12. Singular and Gives Check Extensions
864 // Singular extension search. If all moves but one fail low on a search of
865 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
866 // is singular and should be extended. To verify this we do a reduced search
867 // on all the other moves but the ttMove and if the result is lower than
868 // ttValue minus a margin then we will extend the ttMove.
869 if ( singularExtensionNode
873 Value rBeta = std::max(ttValue - 2 * depth / ONE_PLY, -VALUE_MATE);
874 Depth d = (depth / (2 * ONE_PLY)) * ONE_PLY;
875 ss->excludedMove = move;
876 value = search<NonPV>(pos, ss, rBeta - 1, rBeta, d, cutNode, true);
877 ss->excludedMove = MOVE_NONE;
887 // Calculate new depth for this move
888 newDepth = depth - ONE_PLY + extension;
890 // Step 13. Pruning at shallow depth
892 && pos.non_pawn_material(pos.side_to_move())
893 && bestValue > VALUE_MATED_IN_MAX_PLY)
895 if ( !captureOrPromotion
897 && (!pos.advanced_pawn_push(move) || pos.non_pawn_material() >= Value(5000)))
899 // Move count based pruning
900 if (moveCountPruning)
906 // Reduced depth of the next LMR search
907 int lmrDepth = std::max(newDepth - reduction<PvNode>(improving, depth, moveCount), DEPTH_ZERO) / ONE_PLY;
909 // Countermoves based pruning
911 && (*contHist[0])[movedPiece][to_sq(move)] < CounterMovePruneThreshold
912 && (*contHist[1])[movedPiece][to_sq(move)] < CounterMovePruneThreshold)
915 // Futility pruning: parent node
918 && ss->staticEval + 256 + 200 * lmrDepth <= alpha)
921 // Prune moves with negative SEE
923 && !pos.see_ge(move, Value(-35 * lmrDepth * lmrDepth)))
926 else if ( depth < 7 * ONE_PLY
928 && !pos.see_ge(move, -PawnValueEg * (depth / ONE_PLY)))
932 // Speculative prefetch as early as possible
933 prefetch(TT.first_entry(pos.key_after(move)));
935 // Check for legality just before making the move
936 if (!rootNode && !pos.legal(move))
938 ss->moveCount = --moveCount;
942 if (move == ttMove && captureOrPromotion)
945 // Update the current move (this must be done after singular extension search)
946 ss->currentMove = move;
947 ss->contHistory = &thisThread->contHistory[movedPiece][to_sq(move)];
949 // Step 14. Make the move
950 pos.do_move(move, st, givesCheck);
952 // Step 15. Reduced depth search (LMR). If the move fails high it will be
953 // re-searched at full depth.
954 if ( depth >= 3 * ONE_PLY
956 && (!captureOrPromotion || moveCountPruning))
958 Depth r = reduction<PvNode>(improving, depth, moveCount);
960 if (captureOrPromotion)
961 r -= r ? ONE_PLY : DEPTH_ZERO;
964 // Increase reduction if ttMove is a capture
968 // Increase reduction for cut nodes
972 // Decrease reduction for moves that escape a capture. Filter out
973 // castling moves, because they are coded as "king captures rook" and
974 // hence break make_move().
975 else if ( type_of(move) == NORMAL
976 && !pos.see_ge(make_move(to_sq(move), from_sq(move))))
979 ss->statScore = thisThread->mainHistory[~pos.side_to_move()][from_to(move)]
980 + (*contHist[0])[movedPiece][to_sq(move)]
981 + (*contHist[1])[movedPiece][to_sq(move)]
982 + (*contHist[3])[movedPiece][to_sq(move)]
985 // Decrease/increase reduction by comparing opponent's stat score
986 if (ss->statScore > 0 && (ss-1)->statScore < 0)
989 else if (ss->statScore < 0 && (ss-1)->statScore > 0)
992 // Decrease/increase reduction for moves with a good/bad history
993 r = std::max(DEPTH_ZERO, (r / ONE_PLY - ss->statScore / 20000) * ONE_PLY);
996 Depth d = std::max(newDepth - r, ONE_PLY);
998 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true, false);
1000 doFullDepthSearch = (value > alpha && d != newDepth);
1003 doFullDepthSearch = !PvNode || moveCount > 1;
1005 // Step 16. Full depth search when LMR is skipped or fails high
1006 if (doFullDepthSearch)
1007 value = newDepth < ONE_PLY ?
1008 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha)
1009 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha)
1010 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode, false);
1012 // For PV nodes only, do a full PV search on the first move or after a fail
1013 // high (in the latter case search only if value < beta), otherwise let the
1014 // parent node fail low with value <= alpha and try another move.
1015 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1018 (ss+1)->pv[0] = MOVE_NONE;
1020 value = newDepth < ONE_PLY ?
1021 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha)
1022 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha)
1023 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth, false, false);
1026 // Step 17. Undo move
1027 pos.undo_move(move);
1029 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1031 // Step 18. Check for a new best move
1032 // Finished searching the move. If a stop occurred, the return value of
1033 // the search cannot be trusted, and we return immediately without
1034 // updating best move, PV and TT.
1035 if (Threads.stop.load(std::memory_order_relaxed))
1040 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1041 thisThread->rootMoves.end(), move);
1043 // PV move or new best move ?
1044 if (moveCount == 1 || value > alpha)
1047 rm.selDepth = thisThread->selDepth;
1052 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1053 rm.pv.push_back(*m);
1055 // We record how often the best move has been changed in each
1056 // iteration. This information is used for time management: When
1057 // the best move changes frequently, we allocate some more time.
1058 if (moveCount > 1 && thisThread == Threads.main())
1059 ++static_cast<MainThread*>(thisThread)->bestMoveChanges;
1062 // All other moves but the PV are set to the lowest value: this
1063 // is not a problem when sorting because the sort is stable and the
1064 // move position in the list is preserved - just the PV is pushed up.
1065 rm.score = -VALUE_INFINITE;
1068 if (value > bestValue)
1076 if (PvNode && !rootNode) // Update pv even in fail-high case
1077 update_pv(ss->pv, move, (ss+1)->pv);
1079 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1083 assert(value >= beta); // Fail high
1089 if (!captureOrPromotion && move != bestMove && quietCount < 64)
1090 quietsSearched[quietCount++] = move;
1093 // The following condition would detect a stop only after move loop has been
1094 // completed. But in this case bestValue is valid because we have fully
1095 // searched our subtree, and we can anyhow save the result in TT.
1101 // Step 20. Check for mate and stalemate
1102 // All legal moves have been searched and if there are no legal moves, it
1103 // must be a mate or a stalemate. If we are in a singular extension search then
1104 // return a fail low score.
1106 assert(moveCount || !inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1109 bestValue = excludedMove ? alpha
1110 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1113 // Quiet best move: update move sorting heuristics
1114 if (!pos.capture_or_promotion(bestMove))
1115 update_stats(pos, ss, bestMove, quietsSearched, quietCount, stat_bonus(depth));
1117 // Extra penalty for a quiet TT move in previous ply when it gets refuted
1118 if ((ss-1)->moveCount == 1 && !pos.captured_piece())
1119 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + ONE_PLY));
1121 // Bonus for prior countermove that caused the fail low
1122 else if ( depth >= 3 * ONE_PLY
1123 && !pos.captured_piece()
1124 && is_ok((ss-1)->currentMove))
1125 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth));
1128 tte->save(posKey, value_to_tt(bestValue, ss->ply),
1129 bestValue >= beta ? BOUND_LOWER :
1130 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1131 depth, bestMove, ss->staticEval, TT.generation());
1133 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1139 // qsearch() is the quiescence search function, which is called by the main
1140 // search function with depth zero, or recursively with depth less than ONE_PLY.
1142 template <NodeType NT, bool InCheck>
1143 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1145 const bool PvNode = NT == PV;
1147 assert(InCheck == !!pos.checkers());
1148 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1149 assert(PvNode || (alpha == beta - 1));
1150 assert(depth <= DEPTH_ZERO);
1151 assert(depth / ONE_PLY * ONE_PLY == depth);
1157 Move ttMove, move, bestMove;
1158 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1159 bool ttHit, givesCheck, evasionPrunable;
1165 oldAlpha = alpha; // To flag BOUND_EXACT when eval above alpha and no available moves
1167 ss->pv[0] = MOVE_NONE;
1170 ss->currentMove = bestMove = MOVE_NONE;
1171 ss->ply = (ss-1)->ply + 1;
1174 // Check for an instant draw or if the maximum ply has been reached
1175 if (pos.is_draw(ss->ply) || ss->ply >= MAX_PLY)
1176 return ss->ply >= MAX_PLY && !InCheck ? evaluate(pos)
1177 : DrawValue[pos.side_to_move()];
1179 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1181 // Decide whether or not to include checks: this fixes also the type of
1182 // TT entry depth that we are going to use. Note that in qsearch we use
1183 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1184 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1185 : DEPTH_QS_NO_CHECKS;
1187 // Transposition table lookup
1189 tte = TT.probe(posKey, ttHit);
1190 ttMove = ttHit ? tte->move() : MOVE_NONE;
1191 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
1195 && tte->depth() >= ttDepth
1196 && ttValue != VALUE_NONE // Only in case of TT access race
1197 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1198 : (tte->bound() & BOUND_UPPER)))
1201 // Evaluate the position statically
1204 ss->staticEval = VALUE_NONE;
1205 bestValue = futilityBase = -VALUE_INFINITE;
1211 // Never assume anything on values stored in TT
1212 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1213 ss->staticEval = bestValue = evaluate(pos);
1215 // Can ttValue be used as a better position evaluation?
1216 if ( ttValue != VALUE_NONE
1217 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1218 bestValue = ttValue;
1221 ss->staticEval = bestValue =
1222 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1223 : -(ss-1)->staticEval + 2 * Eval::Tempo;
1225 // Stand pat. Return immediately if static value is at least beta
1226 if (bestValue >= beta)
1229 tte->save(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1230 DEPTH_NONE, MOVE_NONE, ss->staticEval, TT.generation());
1235 if (PvNode && bestValue > alpha)
1238 futilityBase = bestValue + 128;
1241 // Initialize a MovePicker object for the current position, and prepare
1242 // to search the moves. Because the depth is <= 0 here, only captures,
1243 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1245 const PieceToHistory* contHist[4] = {};
1246 MovePicker mp(pos, ttMove, depth, &pos.this_thread()->mainHistory, contHist, to_sq((ss-1)->currentMove));
1248 // Loop through the moves until no moves remain or a beta cutoff occurs
1249 while ((move = mp.next_move()) != MOVE_NONE)
1251 assert(is_ok(move));
1253 givesCheck = type_of(move) == NORMAL && !pos.discovered_check_candidates()
1254 ? pos.check_squares(type_of(pos.piece_on(from_sq(move)))) & to_sq(move)
1255 : pos.gives_check(move);
1262 && futilityBase > -VALUE_KNOWN_WIN
1263 && !pos.advanced_pawn_push(move))
1265 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1267 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1269 if (futilityValue <= alpha)
1271 bestValue = std::max(bestValue, futilityValue);
1275 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1277 bestValue = std::max(bestValue, futilityBase);
1282 // Detect non-capture evasions that are candidates to be pruned
1283 evasionPrunable = InCheck
1284 && (depth != DEPTH_ZERO || moveCount > 2)
1285 && bestValue > VALUE_MATED_IN_MAX_PLY
1286 && !pos.capture(move);
1288 // Don't search moves with negative SEE values
1289 if ( (!InCheck || evasionPrunable)
1290 && type_of(move) != PROMOTION
1291 && !pos.see_ge(move))
1294 // Speculative prefetch as early as possible
1295 prefetch(TT.first_entry(pos.key_after(move)));
1297 // Check for legality just before making the move
1298 if (!pos.legal(move))
1304 ss->currentMove = move;
1306 // Make and search the move
1307 pos.do_move(move, st, givesCheck);
1308 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1309 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1310 pos.undo_move(move);
1312 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1314 // Check for a new best move
1315 if (value > bestValue)
1321 if (PvNode) // Update pv even in fail-high case
1322 update_pv(ss->pv, move, (ss+1)->pv);
1324 if (PvNode && value < beta) // Update alpha here!
1331 tte->save(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1332 ttDepth, move, ss->staticEval, TT.generation());
1340 // All legal moves have been searched. A special case: If we're in check
1341 // and no legal moves were found, it is checkmate.
1342 if (InCheck && bestValue == -VALUE_INFINITE)
1343 return mated_in(ss->ply); // Plies to mate from the root
1345 tte->save(posKey, value_to_tt(bestValue, ss->ply),
1346 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1347 ttDepth, bestMove, ss->staticEval, TT.generation());
1349 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1355 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1356 // "plies to mate from the current position". Non-mate scores are unchanged.
1357 // The function is called before storing a value in the transposition table.
1359 Value value_to_tt(Value v, int ply) {
1361 assert(v != VALUE_NONE);
1363 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1364 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1368 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1369 // from the transposition table (which refers to the plies to mate/be mated
1370 // from current position) to "plies to mate/be mated from the root".
1372 Value value_from_tt(Value v, int ply) {
1374 return v == VALUE_NONE ? VALUE_NONE
1375 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1376 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1380 // update_pv() adds current move and appends child pv[]
1382 void update_pv(Move* pv, Move move, Move* childPv) {
1384 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1390 // update_continuation_histories() updates histories of the move pairs formed
1391 // by moves at ply -1, -2, and -4 with current move.
1393 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1395 for (int i : {1, 2, 4})
1396 if (is_ok((ss-i)->currentMove))
1397 (ss-i)->contHistory->update(pc, to, bonus);
1401 // update_stats() updates move sorting heuristics when a new quiet best move is found
1403 void update_stats(const Position& pos, Stack* ss, Move move,
1404 Move* quiets, int quietsCnt, int bonus) {
1406 if (ss->killers[0] != move)
1408 ss->killers[1] = ss->killers[0];
1409 ss->killers[0] = move;
1412 Color c = pos.side_to_move();
1413 Thread* thisThread = pos.this_thread();
1414 thisThread->mainHistory.update(c, move, bonus);
1415 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1417 if (is_ok((ss-1)->currentMove))
1419 Square prevSq = to_sq((ss-1)->currentMove);
1420 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1423 // Decrease all the other played quiet moves
1424 for (int i = 0; i < quietsCnt; ++i)
1426 thisThread->mainHistory.update(c, quiets[i], -bonus);
1427 update_continuation_histories(ss, pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
1432 // When playing with strength handicap, choose best move among a set of RootMoves
1433 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1435 Move Skill::pick_best(size_t multiPV) {
1437 const RootMoves& rootMoves = Threads.main()->rootMoves;
1438 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1440 // RootMoves are already sorted by score in descending order
1441 Value topScore = rootMoves[0].score;
1442 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1443 int weakness = 120 - 2 * level;
1444 int maxScore = -VALUE_INFINITE;
1446 // Choose best move. For each move score we add two terms, both dependent on
1447 // weakness. One is deterministic and bigger for weaker levels, and one is
1448 // random. Then we choose the move with the resulting highest score.
1449 for (size_t i = 0; i < multiPV; ++i)
1451 // This is our magic formula
1452 int push = ( weakness * int(topScore - rootMoves[i].score)
1453 + delta * (rng.rand<unsigned>() % weakness)) / 128;
1455 if (rootMoves[i].score + push > maxScore)
1457 maxScore = rootMoves[i].score + push;
1458 best = rootMoves[i].pv[0];
1467 // check_time() is used to print debug info and, more importantly, to detect
1468 // when we are out of available time and thus stop the search.
1470 void MainThread::check_time() {
1475 // At low node count increase the checking rate to about 0.1% of nodes
1476 // otherwise use a default value.
1477 callsCnt = Limits.nodes ? std::min(4096, int(Limits.nodes / 1024)) : 4096;
1479 static TimePoint lastInfoTime = now();
1481 int elapsed = Time.elapsed();
1482 TimePoint tick = Limits.startTime + elapsed;
1484 if (tick - lastInfoTime >= 1000)
1486 lastInfoTime = tick;
1490 // An engine may not stop pondering until told so by the GUI
1494 if ( (Limits.use_time_management() && elapsed > Time.maximum() - 10)
1495 || (Limits.movetime && elapsed >= Limits.movetime)
1496 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1497 Threads.stop = true;
1501 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1502 /// that all (if any) unsearched PV lines are sent using a previous search score.
1504 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1506 std::stringstream ss;
1507 int elapsed = Time.elapsed() + 1;
1508 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1509 size_t PVIdx = pos.this_thread()->PVIdx;
1510 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1511 uint64_t nodesSearched = Threads.nodes_searched();
1512 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1514 for (size_t i = 0; i < multiPV; ++i)
1516 bool updated = (i <= PVIdx && rootMoves[i].score != -VALUE_INFINITE);
1518 if (depth == ONE_PLY && !updated)
1521 Depth d = updated ? depth : depth - ONE_PLY;
1522 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1524 bool tb = TB::RootInTB && abs(v) < VALUE_MATE - MAX_PLY;
1525 v = tb ? TB::Score : v;
1527 if (ss.rdbuf()->in_avail()) // Not at first line
1531 << " depth " << d / ONE_PLY
1532 << " seldepth " << rootMoves[i].selDepth
1533 << " multipv " << i + 1
1534 << " score " << UCI::value(v);
1536 if (!tb && i == PVIdx)
1537 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1539 ss << " nodes " << nodesSearched
1540 << " nps " << nodesSearched * 1000 / elapsed;
1542 if (elapsed > 1000) // Earlier makes little sense
1543 ss << " hashfull " << TT.hashfull();
1545 ss << " tbhits " << tbHits
1546 << " time " << elapsed
1549 for (Move m : rootMoves[i].pv)
1550 ss << " " << UCI::move(m, pos.is_chess960());
1557 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1558 /// before exiting the search, for instance, in case we stop the search during a
1559 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1560 /// otherwise in case of 'ponder on' we have nothing to think on.
1562 bool RootMove::extract_ponder_from_tt(Position& pos) {
1567 assert(pv.size() == 1);
1572 pos.do_move(pv[0], st);
1573 TTEntry* tte = TT.probe(pos.key(), ttHit);
1577 Move m = tte->move(); // Local copy to be SMP safe
1578 if (MoveList<LEGAL>(pos).contains(m))
1582 pos.undo_move(pv[0]);
1583 return pv.size() > 1;
1586 void Tablebases::filter_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1589 UseRule50 = Options["Syzygy50MoveRule"];
1590 ProbeDepth = Options["SyzygyProbeDepth"] * ONE_PLY;
1591 Cardinality = Options["SyzygyProbeLimit"];
1593 // Skip TB probing when no TB found: !TBLargest -> !TB::Cardinality
1594 if (Cardinality > MaxCardinality)
1596 Cardinality = MaxCardinality;
1597 ProbeDepth = DEPTH_ZERO;
1600 if (Cardinality < popcount(pos.pieces()) || pos.can_castle(ANY_CASTLING))
1603 // If the current root position is in the tablebases, then RootMoves
1604 // contains only moves that preserve the draw or the win.
1605 RootInTB = root_probe(pos, rootMoves, TB::Score);
1608 Cardinality = 0; // Do not probe tablebases during the search
1610 else // If DTZ tables are missing, use WDL tables as a fallback
1612 // Filter out moves that do not preserve the draw or the win.
1613 RootInTB = root_probe_wdl(pos, rootMoves, TB::Score);
1615 // Only probe during search if winning
1616 if (RootInTB && TB::Score <= VALUE_DRAW)
1620 if (RootInTB && !UseRule50)
1621 TB::Score = TB::Score > VALUE_DRAW ? VALUE_MATE - MAX_PLY - 1
1622 : TB::Score < VALUE_DRAW ? -VALUE_MATE + MAX_PLY + 1