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.push_back(RootMove(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 if (!Threads.stop && (Limits.ponder || Limits.infinite))
282 Threads.stopOnPonderhit = true;
286 // Stop the threads if not already stopped
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;
344 completedDepth = DEPTH_ZERO;
348 easyMove = EasyMove.get(rootPos.key());
350 mainThread->easyMovePlayed = mainThread->failedLow = false;
351 mainThread->bestMoveChanges = 0;
354 size_t multiPV = Options["MultiPV"];
355 Skill skill(Options["Skill Level"]);
357 // When playing with strength handicap enable MultiPV search that we will
358 // use behind the scenes to retrieve a set of possible moves.
360 multiPV = std::max(multiPV, (size_t)4);
362 multiPV = std::min(multiPV, rootMoves.size());
364 // Iterative deepening loop until requested to stop or the target depth is reached
365 while ( (rootDepth += ONE_PLY) < DEPTH_MAX
367 && !(Limits.depth && mainThread && rootDepth / ONE_PLY > Limits.depth))
369 // Distribute search depths across the threads
372 int i = (idx - 1) % 20;
373 if (((rootDepth / ONE_PLY + rootPos.game_ply() + skipPhase[i]) / skipSize[i]) % 2)
377 // Age out PV variability metric
379 mainThread->bestMoveChanges *= 0.505, mainThread->failedLow = false;
381 // Save the last iteration's scores before first PV line is searched and
382 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
383 for (RootMove& rm : rootMoves)
384 rm.previousScore = rm.score;
386 // MultiPV loop. We perform a full root search for each PV line
387 for (PVIdx = 0; PVIdx < multiPV && !Threads.stop; ++PVIdx)
389 // Reset UCI info selDepth for each depth and each PV line
392 // Reset aspiration window starting size
393 if (rootDepth >= 5 * ONE_PLY)
396 alpha = std::max(rootMoves[PVIdx].previousScore - delta,-VALUE_INFINITE);
397 beta = std::min(rootMoves[PVIdx].previousScore + delta, VALUE_INFINITE);
400 // Start with a small aspiration window and, in the case of a fail
401 // high/low, re-search with a bigger window until we're not failing
405 bestValue = ::search<PV>(rootPos, ss, alpha, beta, rootDepth, false, false);
407 // Bring the best move to the front. It is critical that sorting
408 // is done with a stable algorithm because all the values but the
409 // first and eventually the new best one are set to -VALUE_INFINITE
410 // and we want to keep the same order for all the moves except the
411 // new PV that goes to the front. Note that in case of MultiPV
412 // search the already searched PV lines are preserved.
413 std::stable_sort(rootMoves.begin() + PVIdx, rootMoves.end());
415 // If search has been stopped, we break immediately. Sorting and
416 // writing PV back to TT is safe because RootMoves is still
417 // valid, although it refers to the previous iteration.
421 // When failing high/low give some update (without cluttering
422 // the UI) before a re-search.
425 && (bestValue <= alpha || bestValue >= beta)
426 && Time.elapsed() > 3000)
427 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
429 // In case of failing low/high increase aspiration window and
430 // re-search, otherwise exit the loop.
431 if (bestValue <= alpha)
433 beta = (alpha + beta) / 2;
434 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
438 mainThread->failedLow = true;
439 Threads.stopOnPonderhit = false;
442 else if (bestValue >= beta)
443 beta = std::min(bestValue + delta, VALUE_INFINITE);
447 delta += delta / 4 + 5;
449 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
452 // Sort the PV lines searched so far and update the GUI
453 std::stable_sort(rootMoves.begin(), rootMoves.begin() + PVIdx + 1);
458 if (Threads.stop || PVIdx + 1 == multiPV || Time.elapsed() > 3000)
459 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
463 completedDepth = rootDepth;
468 // If skill level is enabled and time is up, pick a sub-optimal best move
469 if (skill.enabled() && skill.time_to_pick(rootDepth))
470 skill.pick_best(multiPV);
472 // Have we found a "mate in x"?
474 && bestValue >= VALUE_MATE_IN_MAX_PLY
475 && VALUE_MATE - bestValue <= 2 * Limits.mate)
478 // Do we have time for the next iteration? Can we stop searching now?
479 if (Limits.use_time_management())
481 if (!Threads.stop && !Threads.stopOnPonderhit)
483 // Stop the search if only one legal move is available, or if all
484 // of the available time has been used, or if we matched an easyMove
485 // from the previous search and just did a fast verification.
486 const int F[] = { mainThread->failedLow,
487 bestValue - mainThread->previousScore };
489 int improvingFactor = std::max(229, std::min(715, 357 + 119 * F[0] - 6 * F[1]));
490 double unstablePvFactor = 1 + mainThread->bestMoveChanges;
492 bool doEasyMove = rootMoves[0].pv[0] == easyMove
493 && mainThread->bestMoveChanges < 0.03
494 && Time.elapsed() > Time.optimum() * 5 / 44;
496 if ( rootMoves.size() == 1
497 || Time.elapsed() > Time.optimum() * unstablePvFactor * improvingFactor / 628
498 || (mainThread->easyMovePlayed = doEasyMove, doEasyMove))
500 // If we are allowed to ponder do not stop the search now but
501 // keep pondering until the GUI sends "ponderhit" or "stop".
503 Threads.stopOnPonderhit = true;
509 if (rootMoves[0].pv.size() >= 3)
510 EasyMove.update(rootPos, rootMoves[0].pv);
519 // Clear any candidate easy move that wasn't stable for the last search
520 // iterations; the second condition prevents consecutive fast moves.
521 if (EasyMove.stableCnt < 6 || mainThread->easyMovePlayed)
524 // If skill level is enabled, swap best PV line with the sub-optimal one
526 std::swap(rootMoves[0], *std::find(rootMoves.begin(),
527 rootMoves.end(), skill.best_move(multiPV)));
533 // search<>() is the main search function for both PV and non-PV nodes
535 template <NodeType NT>
536 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode, bool skipEarlyPruning) {
538 const bool PvNode = NT == PV;
539 const bool rootNode = PvNode && (ss-1)->ply == 0;
541 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
542 assert(PvNode || (alpha == beta - 1));
543 assert(DEPTH_ZERO < depth && depth < DEPTH_MAX);
544 assert(!(PvNode && cutNode));
545 assert(depth / ONE_PLY * ONE_PLY == depth);
547 Move pv[MAX_PLY+1], quietsSearched[64];
551 Move ttMove, move, excludedMove, bestMove;
552 Depth extension, newDepth;
553 Value bestValue, value, ttValue, eval;
554 bool ttHit, inCheck, givesCheck, singularExtensionNode, improving;
555 bool captureOrPromotion, doFullDepthSearch, moveCountPruning, skipQuiets, ttCapture;
557 int moveCount, quietCount;
559 // Step 1. Initialize node
560 Thread* thisThread = pos.this_thread();
561 inCheck = pos.checkers();
562 moveCount = quietCount = ss->moveCount = 0;
564 bestValue = -VALUE_INFINITE;
565 ss->ply = (ss-1)->ply + 1;
567 // Check for the available remaining time
568 if (thisThread == Threads.main())
569 static_cast<MainThread*>(thisThread)->check_time();
571 // Used to send selDepth info to GUI
572 if (PvNode && thisThread->selDepth < ss->ply)
573 thisThread->selDepth = ss->ply;
577 // Step 2. Check for aborted search and immediate draw
578 if (Threads.stop.load(std::memory_order_relaxed) || pos.is_draw(ss->ply) || ss->ply >= MAX_PLY)
579 return ss->ply >= MAX_PLY && !inCheck ? evaluate(pos)
580 : DrawValue[pos.side_to_move()];
582 // Step 3. Mate distance pruning. Even if we mate at the next move our score
583 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
584 // a shorter mate was found upward in the tree then there is no need to search
585 // because we will never beat the current alpha. Same logic but with reversed
586 // signs applies also in the opposite condition of being mated instead of giving
587 // mate. In this case return a fail-high score.
588 alpha = std::max(mated_in(ss->ply), alpha);
589 beta = std::min(mate_in(ss->ply+1), beta);
594 assert(0 <= ss->ply && ss->ply < MAX_PLY);
596 ss->currentMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
597 ss->contHistory = &thisThread->contHistory[NO_PIECE][0];
598 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
599 Square prevSq = to_sq((ss-1)->currentMove);
601 // Step 4. Transposition table lookup. We don't want the score of a partial
602 // search to overwrite a previous full search TT value, so we use a different
603 // position key in case of an excluded move.
604 excludedMove = ss->excludedMove;
605 posKey = pos.key() ^ Key(excludedMove);
606 tte = TT.probe(posKey, ttHit);
607 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
608 ttMove = rootNode ? thisThread->rootMoves[thisThread->PVIdx].pv[0]
609 : ttHit ? tte->move() : MOVE_NONE;
611 // At non-PV nodes we check for an early TT cutoff
614 && tte->depth() >= depth
615 && ttValue != VALUE_NONE // Possible in case of TT access race
616 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
617 : (tte->bound() & BOUND_UPPER)))
619 // If ttMove is quiet, update move sorting heuristics on TT hit
624 if (!pos.capture_or_promotion(ttMove))
625 update_stats(pos, ss, ttMove, nullptr, 0, stat_bonus(depth));
627 // Extra penalty for a quiet TT move in previous ply when it gets refuted
628 if ((ss-1)->moveCount == 1 && !pos.captured_piece())
629 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + ONE_PLY));
631 // Penalty for a quiet ttMove that fails low
632 else if (!pos.capture_or_promotion(ttMove))
634 int penalty = -stat_bonus(depth);
635 thisThread->mainHistory.update(pos.side_to_move(), ttMove, penalty);
636 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
642 // Step 4a. Tablebase probe
643 if (!rootNode && TB::Cardinality)
645 int piecesCount = pos.count<ALL_PIECES>();
647 if ( piecesCount <= TB::Cardinality
648 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
649 && pos.rule50_count() == 0
650 && !pos.can_castle(ANY_CASTLING))
653 TB::WDLScore v = Tablebases::probe_wdl(pos, &err);
655 if (err != TB::ProbeState::FAIL)
657 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
659 int drawScore = TB::UseRule50 ? 1 : 0;
661 value = v < -drawScore ? -VALUE_MATE + MAX_PLY + ss->ply
662 : v > drawScore ? VALUE_MATE - MAX_PLY - ss->ply
663 : VALUE_DRAW + 2 * v * drawScore;
665 tte->save(posKey, value_to_tt(value, ss->ply), BOUND_EXACT,
666 std::min(DEPTH_MAX - ONE_PLY, depth + 6 * ONE_PLY),
667 MOVE_NONE, VALUE_NONE, TT.generation());
674 // Step 5. Evaluate the position statically
677 ss->staticEval = eval = VALUE_NONE;
683 // Never assume anything on values stored in TT
684 if ((ss->staticEval = eval = tte->eval()) == VALUE_NONE)
685 eval = ss->staticEval = evaluate(pos);
687 // Can ttValue be used as a better position evaluation?
688 if ( ttValue != VALUE_NONE
689 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
694 eval = ss->staticEval =
695 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
696 : -(ss-1)->staticEval + 2 * Eval::Tempo;
698 tte->save(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE,
699 ss->staticEval, TT.generation());
702 if (skipEarlyPruning)
705 // Step 6. Razoring (skipped when in check)
707 && depth < 4 * ONE_PLY
708 && eval + razor_margin[depth / ONE_PLY] <= alpha)
710 if (depth <= ONE_PLY)
711 return qsearch<NonPV, false>(pos, ss, alpha, alpha+1);
713 Value ralpha = alpha - razor_margin[depth / ONE_PLY];
714 Value v = qsearch<NonPV, false>(pos, ss, ralpha, ralpha+1);
719 // Step 7. Futility pruning: child node (skipped when in check)
721 && depth < 7 * ONE_PLY
722 && eval - futility_margin(depth) >= beta
723 && eval < VALUE_KNOWN_WIN // Do not return unproven wins
724 && pos.non_pawn_material(pos.side_to_move()))
727 // Step 8. Null move search with verification search (is omitted in PV nodes)
730 && (ss->staticEval >= beta - 35 * (depth / ONE_PLY - 6) || depth >= 13 * ONE_PLY)
731 && pos.non_pawn_material(pos.side_to_move()))
734 assert(eval - beta >= 0);
736 // Null move dynamic reduction based on depth and value
737 Depth R = ((823 + 67 * depth / ONE_PLY) / 256 + std::min((eval - beta) / PawnValueMg, 3)) * ONE_PLY;
739 ss->currentMove = MOVE_NULL;
740 ss->contHistory = &thisThread->contHistory[NO_PIECE][0];
742 pos.do_null_move(st);
743 Value nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -beta+1)
744 : - search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode, true);
745 pos.undo_null_move();
747 if (nullValue >= beta)
749 // Do not return unproven mate scores
750 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
753 if (depth < 12 * ONE_PLY && abs(beta) < VALUE_KNOWN_WIN)
756 // Do verification search at high depths
757 Value v = depth-R < ONE_PLY ? qsearch<NonPV, false>(pos, ss, beta-1, beta)
758 : search<NonPV>(pos, ss, beta-1, beta, depth-R, false, true);
765 // Step 9. ProbCut (skipped when in check)
766 // If we have a good enough capture and a reduced search returns a value
767 // much above beta, we can (almost) safely prune the previous move.
769 && depth >= 5 * ONE_PLY
770 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
772 Value rbeta = std::min(beta + 200, VALUE_INFINITE);
774 assert(is_ok((ss-1)->currentMove));
776 MovePicker mp(pos, ttMove, rbeta - ss->staticEval);
778 while ((move = mp.next_move()) != MOVE_NONE)
781 ss->currentMove = move;
782 ss->contHistory = &thisThread->contHistory[pos.moved_piece(move)][to_sq(move)];
784 assert(depth >= 5 * ONE_PLY);
785 pos.do_move(move, st);
786 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, depth - 4 * ONE_PLY, !cutNode, false);
793 // Step 10. Internal iterative deepening (skipped when in check)
794 if ( depth >= 6 * ONE_PLY
796 && (PvNode || ss->staticEval + 256 >= beta))
798 Depth d = (3 * depth / (4 * ONE_PLY) - 2) * ONE_PLY;
799 search<NT>(pos, ss, alpha, beta, d, cutNode, true);
801 tte = TT.probe(posKey, ttHit);
802 ttMove = ttHit ? tte->move() : MOVE_NONE;
805 moves_loop: // When in check search starts from here
807 const PieceToHistory* contHist[] = { (ss-1)->contHistory, (ss-2)->contHistory, nullptr, (ss-4)->contHistory };
808 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
810 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory, contHist, countermove, ss->killers);
811 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
812 improving = ss->staticEval >= (ss-2)->staticEval
813 /* || ss->staticEval == VALUE_NONE Already implicit in the previous condition */
814 ||(ss-2)->staticEval == VALUE_NONE;
816 singularExtensionNode = !rootNode
817 && depth >= 8 * ONE_PLY
818 && ttMove != MOVE_NONE
819 && ttValue != VALUE_NONE
820 && !excludedMove // Recursive singular search is not allowed
821 && (tte->bound() & BOUND_LOWER)
822 && tte->depth() >= depth - 3 * ONE_PLY;
826 // Step 11. Loop through moves
827 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
828 while ((move = mp.next_move(skipQuiets)) != MOVE_NONE)
832 if (move == excludedMove)
835 // At root obey the "searchmoves" option and skip moves not listed in Root
836 // Move List. As a consequence any illegal move is also skipped. In MultiPV
837 // mode we also skip PV moves which have been already searched.
838 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->PVIdx,
839 thisThread->rootMoves.end(), move))
842 ss->moveCount = ++moveCount;
844 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
845 sync_cout << "info depth " << depth / ONE_PLY
846 << " currmove " << UCI::move(move, pos.is_chess960())
847 << " currmovenumber " << moveCount + thisThread->PVIdx << sync_endl;
850 (ss+1)->pv = nullptr;
852 extension = DEPTH_ZERO;
853 captureOrPromotion = pos.capture_or_promotion(move);
854 movedPiece = pos.moved_piece(move);
856 givesCheck = type_of(move) == NORMAL && !pos.discovered_check_candidates()
857 ? pos.check_squares(type_of(pos.piece_on(from_sq(move)))) & to_sq(move)
858 : pos.gives_check(move);
860 moveCountPruning = depth < 16 * ONE_PLY
861 && moveCount >= FutilityMoveCounts[improving][depth / ONE_PLY];
863 // Step 12. Singular and Gives Check Extensions
865 // Singular extension search. If all moves but one fail low on a search of
866 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
867 // is singular and should be extended. To verify this we do a reduced search
868 // on all the other moves but the ttMove and if the result is lower than
869 // ttValue minus a margin then we will extend the ttMove.
870 if ( singularExtensionNode
874 Value rBeta = std::max(ttValue - 2 * depth / ONE_PLY, -VALUE_MATE);
875 Depth d = (depth / (2 * ONE_PLY)) * ONE_PLY;
876 ss->excludedMove = move;
877 value = search<NonPV>(pos, ss, rBeta - 1, rBeta, d, cutNode, true);
878 ss->excludedMove = MOVE_NONE;
888 // Calculate new depth for this move
889 newDepth = depth - ONE_PLY + extension;
891 // Step 13. Pruning at shallow depth
893 && pos.non_pawn_material(pos.side_to_move())
894 && bestValue > VALUE_MATED_IN_MAX_PLY)
896 if ( !captureOrPromotion
898 && (!pos.advanced_pawn_push(move) || pos.non_pawn_material() >= Value(5000)))
900 // Move count based pruning
901 if (moveCountPruning)
907 // Reduced depth of the next LMR search
908 int lmrDepth = std::max(newDepth - reduction<PvNode>(improving, depth, moveCount), DEPTH_ZERO) / ONE_PLY;
910 // Countermoves based pruning
912 && (*contHist[0])[movedPiece][to_sq(move)] < CounterMovePruneThreshold
913 && (*contHist[1])[movedPiece][to_sq(move)] < CounterMovePruneThreshold)
916 // Futility pruning: parent node
919 && ss->staticEval + 256 + 200 * lmrDepth <= alpha)
922 // Prune moves with negative SEE
924 && !pos.see_ge(move, Value(-35 * lmrDepth * lmrDepth)))
927 else if ( depth < 7 * ONE_PLY
929 && !pos.see_ge(move, -PawnValueEg * (depth / ONE_PLY)))
933 // Speculative prefetch as early as possible
934 prefetch(TT.first_entry(pos.key_after(move)));
936 // Check for legality just before making the move
937 if (!rootNode && !pos.legal(move))
939 ss->moveCount = --moveCount;
943 if (move == ttMove && captureOrPromotion)
946 // Update the current move (this must be done after singular extension search)
947 ss->currentMove = move;
948 ss->contHistory = &thisThread->contHistory[movedPiece][to_sq(move)];
950 // Step 14. Make the move
951 pos.do_move(move, st, givesCheck);
953 // Step 15. Reduced depth search (LMR). If the move fails high it will be
954 // re-searched at full depth.
955 if ( depth >= 3 * ONE_PLY
957 && (!captureOrPromotion || moveCountPruning))
959 Depth r = reduction<PvNode>(improving, depth, moveCount);
961 if (captureOrPromotion)
962 r -= r ? ONE_PLY : DEPTH_ZERO;
965 // Increase reduction if ttMove is a capture
969 // Increase reduction for cut nodes
973 // Decrease reduction for moves that escape a capture. Filter out
974 // castling moves, because they are coded as "king captures rook" and
975 // hence break make_move().
976 else if ( type_of(move) == NORMAL
977 && !pos.see_ge(make_move(to_sq(move), from_sq(move))))
980 ss->statScore = thisThread->mainHistory[~pos.side_to_move()][from_to(move)]
981 + (*contHist[0])[movedPiece][to_sq(move)]
982 + (*contHist[1])[movedPiece][to_sq(move)]
983 + (*contHist[3])[movedPiece][to_sq(move)]
986 // Decrease/increase reduction by comparing opponent's stat score
987 if (ss->statScore > 0 && (ss-1)->statScore < 0)
990 else if (ss->statScore < 0 && (ss-1)->statScore > 0)
993 // Decrease/increase reduction for moves with a good/bad history
994 r = std::max(DEPTH_ZERO, (r / ONE_PLY - ss->statScore / 20000) * ONE_PLY);
997 Depth d = std::max(newDepth - r, ONE_PLY);
999 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true, false);
1001 doFullDepthSearch = (value > alpha && d != newDepth);
1004 doFullDepthSearch = !PvNode || moveCount > 1;
1006 // Step 16. Full depth search when LMR is skipped or fails high
1007 if (doFullDepthSearch)
1008 value = newDepth < ONE_PLY ?
1009 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha)
1010 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha)
1011 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode, false);
1013 // For PV nodes only, do a full PV search on the first move or after a fail
1014 // high (in the latter case search only if value < beta), otherwise let the
1015 // parent node fail low with value <= alpha and try another move.
1016 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1019 (ss+1)->pv[0] = MOVE_NONE;
1021 value = newDepth < ONE_PLY ?
1022 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha)
1023 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha)
1024 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth, false, false);
1027 // Step 17. Undo move
1028 pos.undo_move(move);
1030 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1032 // Step 18. Check for a new best move
1033 // Finished searching the move. If a stop occurred, the return value of
1034 // the search cannot be trusted, and we return immediately without
1035 // updating best move, PV and TT.
1036 if (Threads.stop.load(std::memory_order_relaxed))
1041 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1042 thisThread->rootMoves.end(), move);
1044 // PV move or new best move ?
1045 if (moveCount == 1 || value > alpha)
1048 rm.selDepth = thisThread->selDepth;
1053 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1054 rm.pv.push_back(*m);
1056 // We record how often the best move has been changed in each
1057 // iteration. This information is used for time management: When
1058 // the best move changes frequently, we allocate some more time.
1059 if (moveCount > 1 && thisThread == Threads.main())
1060 ++static_cast<MainThread*>(thisThread)->bestMoveChanges;
1063 // All other moves but the PV are set to the lowest value: this
1064 // is not a problem when sorting because the sort is stable and the
1065 // move position in the list is preserved - just the PV is pushed up.
1066 rm.score = -VALUE_INFINITE;
1069 if (value > bestValue)
1077 if (PvNode && !rootNode) // Update pv even in fail-high case
1078 update_pv(ss->pv, move, (ss+1)->pv);
1080 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1084 assert(value >= beta); // Fail high
1090 if (!captureOrPromotion && move != bestMove && quietCount < 64)
1091 quietsSearched[quietCount++] = move;
1094 // The following condition would detect a stop only after move loop has been
1095 // completed. But in this case bestValue is valid because we have fully
1096 // searched our subtree, and we can anyhow save the result in TT.
1102 // Step 20. Check for mate and stalemate
1103 // All legal moves have been searched and if there are no legal moves, it
1104 // must be a mate or a stalemate. If we are in a singular extension search then
1105 // return a fail low score.
1107 assert(moveCount || !inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1110 bestValue = excludedMove ? alpha
1111 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1114 // Quiet best move: update move sorting heuristics
1115 if (!pos.capture_or_promotion(bestMove))
1116 update_stats(pos, ss, bestMove, quietsSearched, quietCount, stat_bonus(depth));
1118 // Extra penalty for a quiet TT move in previous ply when it gets refuted
1119 if ((ss-1)->moveCount == 1 && !pos.captured_piece())
1120 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + ONE_PLY));
1122 // Bonus for prior countermove that caused the fail low
1123 else if ( depth >= 3 * ONE_PLY
1124 && !pos.captured_piece()
1125 && is_ok((ss-1)->currentMove))
1126 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth));
1129 tte->save(posKey, value_to_tt(bestValue, ss->ply),
1130 bestValue >= beta ? BOUND_LOWER :
1131 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1132 depth, bestMove, ss->staticEval, TT.generation());
1134 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1140 // qsearch() is the quiescence search function, which is called by the main
1141 // search function with depth zero, or recursively with depth less than ONE_PLY.
1143 template <NodeType NT, bool InCheck>
1144 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1146 const bool PvNode = NT == PV;
1148 assert(InCheck == !!pos.checkers());
1149 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1150 assert(PvNode || (alpha == beta - 1));
1151 assert(depth <= DEPTH_ZERO);
1152 assert(depth / ONE_PLY * ONE_PLY == depth);
1158 Move ttMove, move, bestMove;
1159 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1160 bool ttHit, givesCheck, evasionPrunable;
1166 oldAlpha = alpha; // To flag BOUND_EXACT when eval above alpha and no available moves
1168 ss->pv[0] = MOVE_NONE;
1171 ss->currentMove = bestMove = MOVE_NONE;
1172 ss->ply = (ss-1)->ply + 1;
1175 // Check for an instant draw or if the maximum ply has been reached
1176 if (pos.is_draw(ss->ply) || ss->ply >= MAX_PLY)
1177 return ss->ply >= MAX_PLY && !InCheck ? evaluate(pos)
1178 : DrawValue[pos.side_to_move()];
1180 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1182 // Decide whether or not to include checks: this fixes also the type of
1183 // TT entry depth that we are going to use. Note that in qsearch we use
1184 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1185 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1186 : DEPTH_QS_NO_CHECKS;
1188 // Transposition table lookup
1190 tte = TT.probe(posKey, ttHit);
1191 ttMove = ttHit ? tte->move() : MOVE_NONE;
1192 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
1196 && tte->depth() >= ttDepth
1197 && ttValue != VALUE_NONE // Only in case of TT access race
1198 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1199 : (tte->bound() & BOUND_UPPER)))
1202 // Evaluate the position statically
1205 ss->staticEval = VALUE_NONE;
1206 bestValue = futilityBase = -VALUE_INFINITE;
1212 // Never assume anything on values stored in TT
1213 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1214 ss->staticEval = bestValue = evaluate(pos);
1216 // Can ttValue be used as a better position evaluation?
1217 if ( ttValue != VALUE_NONE
1218 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1219 bestValue = ttValue;
1222 ss->staticEval = bestValue =
1223 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1224 : -(ss-1)->staticEval + 2 * Eval::Tempo;
1226 // Stand pat. Return immediately if static value is at least beta
1227 if (bestValue >= beta)
1230 tte->save(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1231 DEPTH_NONE, MOVE_NONE, ss->staticEval, TT.generation());
1236 if (PvNode && bestValue > alpha)
1239 futilityBase = bestValue + 128;
1242 // Initialize a MovePicker object for the current position, and prepare
1243 // to search the moves. Because the depth is <= 0 here, only captures,
1244 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1246 const PieceToHistory* contHist[4] = {};
1247 MovePicker mp(pos, ttMove, depth, &pos.this_thread()->mainHistory, contHist, to_sq((ss-1)->currentMove));
1249 // Loop through the moves until no moves remain or a beta cutoff occurs
1250 while ((move = mp.next_move()) != MOVE_NONE)
1252 assert(is_ok(move));
1254 givesCheck = type_of(move) == NORMAL && !pos.discovered_check_candidates()
1255 ? pos.check_squares(type_of(pos.piece_on(from_sq(move)))) & to_sq(move)
1256 : pos.gives_check(move);
1263 && futilityBase > -VALUE_KNOWN_WIN
1264 && !pos.advanced_pawn_push(move))
1266 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1268 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1270 if (futilityValue <= alpha)
1272 bestValue = std::max(bestValue, futilityValue);
1276 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1278 bestValue = std::max(bestValue, futilityBase);
1283 // Detect non-capture evasions that are candidates to be pruned
1284 evasionPrunable = InCheck
1285 && (depth != DEPTH_ZERO || moveCount > 2)
1286 && bestValue > VALUE_MATED_IN_MAX_PLY
1287 && !pos.capture(move);
1289 // Don't search moves with negative SEE values
1290 if ( (!InCheck || evasionPrunable)
1291 && type_of(move) != PROMOTION
1292 && !pos.see_ge(move))
1295 // Speculative prefetch as early as possible
1296 prefetch(TT.first_entry(pos.key_after(move)));
1298 // Check for legality just before making the move
1299 if (!pos.legal(move))
1305 ss->currentMove = move;
1307 // Make and search the move
1308 pos.do_move(move, st, givesCheck);
1309 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1310 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1311 pos.undo_move(move);
1313 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1315 // Check for a new best move
1316 if (value > bestValue)
1322 if (PvNode) // Update pv even in fail-high case
1323 update_pv(ss->pv, move, (ss+1)->pv);
1325 if (PvNode && value < beta) // Update alpha here!
1332 tte->save(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1333 ttDepth, move, ss->staticEval, TT.generation());
1341 // All legal moves have been searched. A special case: If we're in check
1342 // and no legal moves were found, it is checkmate.
1343 if (InCheck && bestValue == -VALUE_INFINITE)
1344 return mated_in(ss->ply); // Plies to mate from the root
1346 tte->save(posKey, value_to_tt(bestValue, ss->ply),
1347 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1348 ttDepth, bestMove, ss->staticEval, TT.generation());
1350 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1356 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1357 // "plies to mate from the current position". Non-mate scores are unchanged.
1358 // The function is called before storing a value in the transposition table.
1360 Value value_to_tt(Value v, int ply) {
1362 assert(v != VALUE_NONE);
1364 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1365 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1369 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1370 // from the transposition table (which refers to the plies to mate/be mated
1371 // from current position) to "plies to mate/be mated from the root".
1373 Value value_from_tt(Value v, int ply) {
1375 return v == VALUE_NONE ? VALUE_NONE
1376 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1377 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1381 // update_pv() adds current move and appends child pv[]
1383 void update_pv(Move* pv, Move move, Move* childPv) {
1385 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1391 // update_continuation_histories() updates histories of the move pairs formed
1392 // by moves at ply -1, -2, and -4 with current move.
1394 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1396 for (int i : {1, 2, 4})
1397 if (is_ok((ss-i)->currentMove))
1398 (ss-i)->contHistory->update(pc, to, bonus);
1402 // update_stats() updates move sorting heuristics when a new quiet best move is found
1404 void update_stats(const Position& pos, Stack* ss, Move move,
1405 Move* quiets, int quietsCnt, int bonus) {
1407 if (ss->killers[0] != move)
1409 ss->killers[1] = ss->killers[0];
1410 ss->killers[0] = move;
1413 Color c = pos.side_to_move();
1414 Thread* thisThread = pos.this_thread();
1415 thisThread->mainHistory.update(c, move, bonus);
1416 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1418 if (is_ok((ss-1)->currentMove))
1420 Square prevSq = to_sq((ss-1)->currentMove);
1421 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1424 // Decrease all the other played quiet moves
1425 for (int i = 0; i < quietsCnt; ++i)
1427 thisThread->mainHistory.update(c, quiets[i], -bonus);
1428 update_continuation_histories(ss, pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
1433 // When playing with strength handicap, choose best move among a set of RootMoves
1434 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1436 Move Skill::pick_best(size_t multiPV) {
1438 const RootMoves& rootMoves = Threads.main()->rootMoves;
1439 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1441 // RootMoves are already sorted by score in descending order
1442 Value topScore = rootMoves[0].score;
1443 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1444 int weakness = 120 - 2 * level;
1445 int maxScore = -VALUE_INFINITE;
1447 // Choose best move. For each move score we add two terms, both dependent on
1448 // weakness. One is deterministic and bigger for weaker levels, and one is
1449 // random. Then we choose the move with the resulting highest score.
1450 for (size_t i = 0; i < multiPV; ++i)
1452 // This is our magic formula
1453 int push = ( weakness * int(topScore - rootMoves[i].score)
1454 + delta * (rng.rand<unsigned>() % weakness)) / 128;
1456 if (rootMoves[i].score + push > maxScore)
1458 maxScore = rootMoves[i].score + push;
1459 best = rootMoves[i].pv[0];
1468 // check_time() is used to print debug info and, more importantly, to detect
1469 // when we are out of available time and thus stop the search.
1471 void MainThread::check_time() {
1476 // At low node count increase the checking rate to about 0.1% of nodes
1477 // otherwise use a default value.
1478 callsCnt = Limits.nodes ? std::min(4096, int(Limits.nodes / 1024)) : 4096;
1480 static TimePoint lastInfoTime = now();
1482 int elapsed = Time.elapsed();
1483 TimePoint tick = Limits.startTime + elapsed;
1485 if (tick - lastInfoTime >= 1000)
1487 lastInfoTime = tick;
1491 // An engine may not stop pondering until told so by the GUI
1495 if ( (Limits.use_time_management() && elapsed > Time.maximum() - 10)
1496 || (Limits.movetime && elapsed >= Limits.movetime)
1497 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1498 Threads.stop = true;
1502 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1503 /// that all (if any) unsearched PV lines are sent using a previous search score.
1505 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1507 std::stringstream ss;
1508 int elapsed = Time.elapsed() + 1;
1509 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1510 size_t PVIdx = pos.this_thread()->PVIdx;
1511 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1512 uint64_t nodesSearched = Threads.nodes_searched();
1513 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1515 for (size_t i = 0; i < multiPV; ++i)
1517 bool updated = (i <= PVIdx && rootMoves[i].score != -VALUE_INFINITE);
1519 if (depth == ONE_PLY && !updated)
1522 Depth d = updated ? depth : depth - ONE_PLY;
1523 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1525 bool tb = TB::RootInTB && abs(v) < VALUE_MATE - MAX_PLY;
1526 v = tb ? TB::Score : v;
1528 if (ss.rdbuf()->in_avail()) // Not at first line
1532 << " depth " << d / ONE_PLY
1533 << " seldepth " << rootMoves[i].selDepth
1534 << " multipv " << i + 1
1535 << " score " << UCI::value(v);
1537 if (!tb && i == PVIdx)
1538 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1540 ss << " nodes " << nodesSearched
1541 << " nps " << nodesSearched * 1000 / elapsed;
1543 if (elapsed > 1000) // Earlier makes little sense
1544 ss << " hashfull " << TT.hashfull();
1546 ss << " tbhits " << tbHits
1547 << " time " << elapsed
1550 for (Move m : rootMoves[i].pv)
1551 ss << " " << UCI::move(m, pos.is_chess960());
1558 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1559 /// before exiting the search, for instance, in case we stop the search during a
1560 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1561 /// otherwise in case of 'ponder on' we have nothing to think on.
1563 bool RootMove::extract_ponder_from_tt(Position& pos) {
1568 assert(pv.size() == 1);
1573 pos.do_move(pv[0], st);
1574 TTEntry* tte = TT.probe(pos.key(), ttHit);
1578 Move m = tte->move(); // Local copy to be SMP safe
1579 if (MoveList<LEGAL>(pos).contains(m))
1583 pos.undo_move(pv[0]);
1584 return pv.size() > 1;
1587 void Tablebases::filter_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1590 UseRule50 = Options["Syzygy50MoveRule"];
1591 ProbeDepth = Options["SyzygyProbeDepth"] * ONE_PLY;
1592 Cardinality = Options["SyzygyProbeLimit"];
1594 // Skip TB probing when no TB found: !TBLargest -> !TB::Cardinality
1595 if (Cardinality > MaxCardinality)
1597 Cardinality = MaxCardinality;
1598 ProbeDepth = DEPTH_ZERO;
1601 if (Cardinality < popcount(pos.pieces()) || pos.can_castle(ANY_CASTLING))
1604 // If the current root position is in the tablebases, then RootMoves
1605 // contains only moves that preserve the draw or the win.
1606 RootInTB = root_probe(pos, rootMoves, TB::Score);
1609 Cardinality = 0; // Do not probe tablebases during the search
1611 else // If DTZ tables are missing, use WDL tables as a fallback
1613 // Filter out moves that do not preserve the draw or the win.
1614 RootInTB = root_probe_wdl(pos, rootMoves, TB::Score);
1616 // Only probe during search if winning
1617 if (RootInTB && TB::Score <= VALUE_DRAW)
1621 if (RootInTB && !UseRule50)
1622 TB::Score = TB::Score > VALUE_DRAW ? VALUE_MATE - MAX_PLY - 1
1623 : TB::Score < VALUE_DRAW ? -VALUE_MATE + MAX_PLY + 1