2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2023 The Stockfish developers (see AUTHORS file)
5 Stockfish is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
10 Stockfish is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
22 #include <cstring> // For std::memset
36 #include "syzygy/tbprobe.h"
37 #include "nnue/evaluate_nnue.h"
46 namespace Tablebases {
54 namespace TB = Tablebases;
58 using namespace Search;
62 // Different node types, used as a template parameter
63 enum NodeType { NonPV, PV, Root };
66 Value futility_margin(Depth d, bool improving) {
67 return Value(154 * (d - improving));
70 // Reductions lookup table, initialized at startup
71 int Reductions[MAX_MOVES]; // [depth or moveNumber]
73 Depth reduction(bool i, Depth d, int mn, Value delta, Value rootDelta) {
74 int r = Reductions[d] * Reductions[mn];
75 return (r + 1449 - int(delta) * 937 / int(rootDelta)) / 1024 + (!i && r > 941);
78 constexpr int futility_move_count(bool improving, Depth depth) {
79 return improving ? (3 + depth * depth)
80 : (3 + depth * depth) / 2;
83 // History and stats update bonus, based on depth
84 int stat_bonus(Depth d) {
85 return std::min(341 * d - 470, 1710);
88 // Add a small random component to draw evaluations to avoid 3-fold blindness
89 Value value_draw(const Thread* thisThread) {
90 return VALUE_DRAW - 1 + Value(thisThread->nodes & 0x2);
93 // Skill structure is used to implement strength limit. If we have an uci_elo then
94 // we convert it to a suitable fractional skill level using anchoring to CCRL Elo
95 // (goldfish 1.13 = 2000) and a fit through Ordo derived Elo for match (TC 60+0.6)
96 // results spanning a wide range of k values.
98 Skill(int skill_level, int uci_elo) {
101 double e = double(uci_elo - 1320) / (3190 - 1320);
102 level = std::clamp((((37.2473 * e - 40.8525) * e + 22.2943) * e - 0.311438), 0.0, 19.0);
105 level = double(skill_level);
107 bool enabled() const { return level < 20.0; }
108 bool time_to_pick(Depth depth) const { return depth == 1 + int(level); }
109 Move pick_best(size_t multiPV);
112 Move best = MOVE_NONE;
115 template <NodeType nodeType>
116 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
118 template <NodeType nodeType>
119 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = 0);
121 Value value_to_tt(Value v, int ply);
122 Value value_from_tt(Value v, int ply, int r50c);
123 void update_pv(Move* pv, Move move, const Move* childPv);
124 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
125 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus);
126 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
127 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth);
129 // perft() is our utility to verify move generation. All the leaf nodes up
130 // to the given depth are generated and counted, and the sum is returned.
132 uint64_t perft(Position& pos, Depth depth) {
135 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
137 uint64_t cnt, nodes = 0;
138 const bool leaf = (depth == 2);
140 for (const auto& m : MoveList<LEGAL>(pos))
142 if (Root && depth <= 1)
147 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - 1);
152 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
160 /// Search::init() is called at startup to initialize various lookup tables
162 void Search::init() {
164 for (int i = 1; i < MAX_MOVES; ++i)
165 Reductions[i] = int((19.47 + std::log(Threads.size()) / 2) * std::log(i));
169 /// Search::clear() resets search state to its initial value
171 void Search::clear() {
173 Threads.main()->wait_for_search_finished();
175 Time.availableNodes = 0;
178 Tablebases::init(Options["SyzygyPath"]); // Free mapped files
182 /// MainThread::search() is started when the program receives the UCI 'go'
183 /// command. It searches from the root position and outputs the "bestmove".
185 void MainThread::search() {
189 nodes = perft<true>(rootPos, Limits.perft);
190 sync_cout << "\nNodes searched: " << nodes << "\n" << sync_endl;
194 Color us = rootPos.side_to_move();
195 Time.init(Limits, us, rootPos.game_ply());
198 Eval::NNUE::verify();
200 if (rootMoves.empty())
202 rootMoves.emplace_back(MOVE_NONE);
203 sync_cout << "info depth 0 score "
204 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
209 Threads.start_searching(); // start non-main threads
210 Thread::search(); // main thread start searching
213 // When we reach the maximum depth, we can arrive here without a raise of
214 // Threads.stop. However, if we are pondering or in an infinite search,
215 // the UCI protocol states that we shouldn't print the best move before the
216 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
217 // until the GUI sends one of those commands.
219 while (!Threads.stop && (ponder || Limits.infinite))
220 {} // Busy wait for a stop or a ponder reset
222 // Stop the threads if not already stopped (also raise the stop if
223 // "ponderhit" just reset Threads.ponder).
226 // Wait until all threads have finished
227 Threads.wait_for_search_finished();
229 // When playing in 'nodes as time' mode, subtract the searched nodes from
230 // the available ones before exiting.
232 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
234 Thread* bestThread = this;
235 Skill skill = Skill(Options["Skill Level"], Options["UCI_LimitStrength"] ? int(Options["UCI_Elo"]) : 0);
237 if ( int(Options["MultiPV"]) == 1
240 && rootMoves[0].pv[0] != MOVE_NONE)
241 bestThread = Threads.get_best_thread();
243 bestPreviousScore = bestThread->rootMoves[0].score;
244 bestPreviousAverageScore = bestThread->rootMoves[0].averageScore;
246 // Send again PV info if we have a new best thread
247 if (bestThread != this)
248 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth) << sync_endl;
250 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
252 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
253 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
255 std::cout << sync_endl;
259 /// Thread::search() is the main iterative deepening loop. It calls search()
260 /// repeatedly with increasing depth until the allocated thinking time has been
261 /// consumed, the user stops the search, or the maximum search depth is reached.
263 void Thread::search() {
265 // To allow access to (ss-7) up to (ss+2), the stack must be oversized.
266 // The former is needed to allow update_continuation_histories(ss-1, ...),
267 // which accesses its argument at ss-6, also near the root.
268 // The latter is needed for statScore and killer initialization.
269 Stack stack[MAX_PLY+10], *ss = stack+7;
271 Value alpha, beta, delta;
272 Move lastBestMove = MOVE_NONE;
273 Depth lastBestMoveDepth = 0;
274 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
275 double timeReduction = 1, totBestMoveChanges = 0;
276 Color us = rootPos.side_to_move();
279 std::memset(ss-7, 0, 10 * sizeof(Stack));
280 for (int i = 7; i > 0; --i)
282 (ss-i)->continuationHistory = &this->continuationHistory[0][0][NO_PIECE][0]; // Use as a sentinel
283 (ss-i)->staticEval = VALUE_NONE;
286 for (int i = 0; i <= MAX_PLY + 2; ++i)
291 bestValue = delta = alpha = -VALUE_INFINITE;
292 beta = VALUE_INFINITE;
293 optimism[WHITE] = optimism[BLACK] = VALUE_ZERO;
298 if (!rootPos.checkers())
301 Eval::evaluate(rootPos, &rootComplexity);
302 mainThread->complexity = std::min(1.03 + (rootComplexity - 241) / 1552.0, 1.45);
305 if (mainThread->bestPreviousScore == VALUE_INFINITE)
306 for (int i = 0; i < 4; ++i)
307 mainThread->iterValue[i] = VALUE_ZERO;
309 for (int i = 0; i < 4; ++i)
310 mainThread->iterValue[i] = mainThread->bestPreviousScore;
313 size_t multiPV = size_t(Options["MultiPV"]);
314 Skill skill(Options["Skill Level"], Options["UCI_LimitStrength"] ? int(Options["UCI_Elo"]) : 0);
316 // When playing with strength handicap enable MultiPV search that we will
317 // use behind the scenes to retrieve a set of possible moves.
319 multiPV = std::max(multiPV, (size_t)4);
321 multiPV = std::min(multiPV, rootMoves.size());
323 int searchAgainCounter = 0;
325 // Iterative deepening loop until requested to stop or the target depth is reached
326 while ( ++rootDepth < MAX_PLY
328 && !(Limits.depth && mainThread && rootDepth > Limits.depth))
330 // Age out PV variability metric
332 totBestMoveChanges /= 2;
334 // Save the last iteration's scores before first PV line is searched and
335 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
336 for (RootMove& rm : rootMoves)
337 rm.previousScore = rm.score;
342 if (!Threads.increaseDepth)
343 searchAgainCounter++;
345 // MultiPV loop. We perform a full root search for each PV line
346 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
351 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
352 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
356 // Reset UCI info selDepth for each depth and each PV line
359 // Reset aspiration window starting size
362 Value prev = rootMoves[pvIdx].averageScore;
363 delta = Value(10) + int(prev) * prev / 16502;
364 alpha = std::max(prev - delta,-VALUE_INFINITE);
365 beta = std::min(prev + delta, VALUE_INFINITE);
367 // Adjust optimism based on root move's previousScore
368 int opt = 120 * prev / (std::abs(prev) + 161);
369 optimism[ us] = Value(opt);
370 optimism[~us] = -optimism[us];
373 // Start with a small aspiration window and, in the case of a fail
374 // high/low, re-search with a bigger window until we don't fail
376 int failedHighCnt = 0;
379 // Adjust the effective depth searched, but ensuring at least one effective increment for every
380 // four searchAgain steps (see issue #2717).
381 Depth adjustedDepth = std::max(1, rootDepth - failedHighCnt - 3 * (searchAgainCounter + 1) / 4);
382 bestValue = Stockfish::search<Root>(rootPos, ss, alpha, beta, adjustedDepth, false);
384 // Bring the best move to the front. It is critical that sorting
385 // is done with a stable algorithm because all the values but the
386 // first and eventually the new best one are set to -VALUE_INFINITE
387 // and we want to keep the same order for all the moves except the
388 // new PV that goes to the front. Note that in case of MultiPV
389 // search the already searched PV lines are preserved.
390 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
392 // If search has been stopped, we break immediately. Sorting is
393 // safe because RootMoves is still valid, although it refers to
394 // the previous iteration.
398 // When failing high/low give some update (without cluttering
399 // the UI) before a re-search.
402 && (bestValue <= alpha || bestValue >= beta)
403 && Time.elapsed() > 3000)
404 sync_cout << UCI::pv(rootPos, rootDepth) << sync_endl;
406 // In case of failing low/high increase aspiration window and
407 // re-search, otherwise exit the loop.
408 if (bestValue <= alpha)
410 beta = (alpha + beta) / 2;
411 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
415 mainThread->stopOnPonderhit = false;
417 else if (bestValue >= beta)
419 beta = std::min(bestValue + delta, VALUE_INFINITE);
425 delta += delta / 4 + 2;
427 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
430 // Sort the PV lines searched so far and update the GUI
431 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
434 && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
435 sync_cout << UCI::pv(rootPos, rootDepth) << sync_endl;
439 completedDepth = rootDepth;
441 if (rootMoves[0].pv[0] != lastBestMove)
443 lastBestMove = rootMoves[0].pv[0];
444 lastBestMoveDepth = rootDepth;
447 // Have we found a "mate in x"?
449 && bestValue >= VALUE_MATE_IN_MAX_PLY
450 && VALUE_MATE - bestValue <= 2 * Limits.mate)
456 // If skill level is enabled and time is up, pick a sub-optimal best move
457 if (skill.enabled() && skill.time_to_pick(rootDepth))
458 skill.pick_best(multiPV);
460 // Use part of the gained time from a previous stable move for the current move
461 for (Thread* th : Threads)
463 totBestMoveChanges += th->bestMoveChanges;
464 th->bestMoveChanges = 0;
467 // Do we have time for the next iteration? Can we stop searching now?
468 if ( Limits.use_time_management()
470 && !mainThread->stopOnPonderhit)
472 double fallingEval = (69 + 13 * (mainThread->bestPreviousAverageScore - bestValue)
473 + 6 * (mainThread->iterValue[iterIdx] - bestValue)) / 619.6;
474 fallingEval = std::clamp(fallingEval, 0.5, 1.5);
476 // If the bestMove is stable over several iterations, reduce time accordingly
477 timeReduction = lastBestMoveDepth + 8 < completedDepth ? 1.57 : 0.65;
478 double reduction = (1.4 + mainThread->previousTimeReduction) / (2.08 * timeReduction);
479 double bestMoveInstability = 1 + 1.8 * totBestMoveChanges / Threads.size();
481 double totalTime = Time.optimum() * fallingEval * reduction * bestMoveInstability * mainThread->complexity;
483 // Cap used time in case of a single legal move for a better viewer experience in tournaments
484 // yielding correct scores and sufficiently fast moves.
485 if (rootMoves.size() == 1)
486 totalTime = std::min(500.0, totalTime);
488 // Stop the search if we have exceeded the totalTime
489 if (Time.elapsed() > totalTime)
491 // If we are allowed to ponder do not stop the search now but
492 // keep pondering until the GUI sends "ponderhit" or "stop".
493 if (mainThread->ponder)
494 mainThread->stopOnPonderhit = true;
498 else if ( !mainThread->ponder
499 && Time.elapsed() > totalTime * 0.50)
500 Threads.increaseDepth = false;
502 Threads.increaseDepth = true;
505 mainThread->iterValue[iterIdx] = bestValue;
506 iterIdx = (iterIdx + 1) & 3;
512 mainThread->previousTimeReduction = timeReduction;
514 // If skill level is enabled, swap best PV line with the sub-optimal one
516 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
517 skill.best ? skill.best : skill.pick_best(multiPV)));
523 // search<>() is the main search function for both PV and non-PV nodes
525 template <NodeType nodeType>
526 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
528 constexpr bool PvNode = nodeType != NonPV;
529 constexpr bool rootNode = nodeType == Root;
531 // Check if we have an upcoming move which draws by repetition, or
532 // if the opponent had an alternative move earlier to this position.
534 && pos.rule50_count() >= 3
535 && alpha < VALUE_DRAW
536 && pos.has_game_cycle(ss->ply))
538 alpha = value_draw(pos.this_thread());
543 // Dive into quiescence search when the depth reaches zero
545 return qsearch<PvNode ? PV : NonPV>(pos, ss, alpha, beta);
547 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
548 assert(PvNode || (alpha == beta - 1));
549 assert(0 < depth && depth < MAX_PLY);
550 assert(!(PvNode && cutNode));
552 Move pv[MAX_PLY+1], capturesSearched[32], quietsSearched[64];
554 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
558 Move ttMove, move, excludedMove, bestMove;
559 Depth extension, newDepth;
560 Value bestValue, value, ttValue, eval, maxValue, probCutBeta;
561 bool givesCheck, improving, priorCapture, singularQuietLMR;
562 bool capture, moveCountPruning, ttCapture;
564 int moveCount, captureCount, quietCount, improvement, complexity;
566 // Step 1. Initialize node
567 Thread* thisThread = pos.this_thread();
568 ss->inCheck = pos.checkers();
569 priorCapture = pos.captured_piece();
570 Color us = pos.side_to_move();
571 moveCount = captureCount = quietCount = ss->moveCount = 0;
572 bestValue = -VALUE_INFINITE;
573 maxValue = VALUE_INFINITE;
575 // Check for the available remaining time
576 if (thisThread == Threads.main())
577 static_cast<MainThread*>(thisThread)->check_time();
579 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
580 if (PvNode && thisThread->selDepth < ss->ply + 1)
581 thisThread->selDepth = ss->ply + 1;
585 // Step 2. Check for aborted search and immediate draw
586 if ( Threads.stop.load(std::memory_order_relaxed)
587 || pos.is_draw(ss->ply)
588 || ss->ply >= MAX_PLY)
589 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos)
590 : value_draw(pos.this_thread());
592 // Step 3. Mate distance pruning. Even if we mate at the next move our score
593 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
594 // a shorter mate was found upward in the tree then there is no need to search
595 // because we will never beat the current alpha. Same logic but with reversed
596 // signs applies also in the opposite condition of being mated instead of giving
597 // mate. In this case return a fail-high score.
598 alpha = std::max(mated_in(ss->ply), alpha);
599 beta = std::min(mate_in(ss->ply+1), beta);
604 thisThread->rootDelta = beta - alpha;
606 assert(0 <= ss->ply && ss->ply < MAX_PLY);
608 (ss+1)->excludedMove = bestMove = MOVE_NONE;
609 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
610 (ss+2)->cutoffCnt = 0;
611 ss->doubleExtensions = (ss-1)->doubleExtensions;
612 Square prevSq = is_ok((ss-1)->currentMove) ? to_sq((ss-1)->currentMove) : SQ_NONE;
615 // Step 4. Transposition table lookup.
616 excludedMove = ss->excludedMove;
618 tte = TT.probe(posKey, ss->ttHit);
619 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
620 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
621 : ss->ttHit ? tte->move() : MOVE_NONE;
622 ttCapture = ttMove && pos.capture_stage(ttMove);
624 // At this point, if excluded, skip straight to step 6, static eval. However,
625 // to save indentation, we list the condition in all code between here and there.
627 ss->ttPv = PvNode || (ss->ttHit && tte->is_pv());
629 // At non-PV nodes we check for an early TT cutoff
633 && tte->depth() > depth - (tte->bound() == BOUND_EXACT)
634 && ttValue != VALUE_NONE // Possible in case of TT access race
635 && (tte->bound() & (ttValue >= beta ? BOUND_LOWER : BOUND_UPPER)))
637 // If ttMove is quiet, update move sorting heuristics on TT hit (~2 Elo)
642 // Bonus for a quiet ttMove that fails high (~2 Elo)
644 update_quiet_stats(pos, ss, ttMove, stat_bonus(depth));
646 // Extra penalty for early quiet moves of the previous ply (~0 Elo on STC, ~2 Elo on LTC)
647 if (prevSq != SQ_NONE && (ss-1)->moveCount <= 2 && !priorCapture)
648 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + 1));
650 // Penalty for a quiet ttMove that fails low (~1 Elo)
653 int penalty = -stat_bonus(depth);
654 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
655 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
659 // Partial workaround for the graph history interaction problem
660 // For high rule50 counts don't produce transposition table cutoffs.
661 if (pos.rule50_count() < 90)
665 // Step 5. Tablebases probe
666 if (!rootNode && !excludedMove && TB::Cardinality)
668 int piecesCount = pos.count<ALL_PIECES>();
670 if ( piecesCount <= TB::Cardinality
671 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
672 && pos.rule50_count() == 0
673 && !pos.can_castle(ANY_CASTLING))
676 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
678 // Force check of time on the next occasion
679 if (thisThread == Threads.main())
680 static_cast<MainThread*>(thisThread)->callsCnt = 0;
682 if (err != TB::ProbeState::FAIL)
684 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
686 int drawScore = TB::UseRule50 ? 1 : 0;
688 // use the range VALUE_MATE_IN_MAX_PLY to VALUE_TB_WIN_IN_MAX_PLY to score
689 value = wdl < -drawScore ? VALUE_MATED_IN_MAX_PLY + ss->ply + 1
690 : wdl > drawScore ? VALUE_MATE_IN_MAX_PLY - ss->ply - 1
691 : VALUE_DRAW + 2 * wdl * drawScore;
693 Bound b = wdl < -drawScore ? BOUND_UPPER
694 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
696 if ( b == BOUND_EXACT
697 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
699 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, b,
700 std::min(MAX_PLY - 1, depth + 6),
701 MOVE_NONE, VALUE_NONE);
708 if (b == BOUND_LOWER)
709 bestValue = value, alpha = std::max(alpha, bestValue);
717 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
719 // Step 6. Static evaluation of the position
722 // Skip early pruning when in check
723 ss->staticEval = eval = VALUE_NONE;
729 else if (excludedMove)
731 // Providing the hint that this node's accumulator will be used often brings significant Elo gain (13 Elo)
732 Eval::NNUE::hint_common_parent_position(pos);
733 eval = ss->staticEval;
734 complexity = abs(ss->staticEval - pos.psq_eg_stm());
738 // Never assume anything about values stored in TT
739 ss->staticEval = eval = tte->eval();
740 if (eval == VALUE_NONE)
741 ss->staticEval = eval = evaluate(pos, &complexity);
742 else // Fall back to (semi)classical complexity for TT hits, the NNUE complexity is lost
744 complexity = abs(ss->staticEval - pos.psq_eg_stm());
746 Eval::NNUE::hint_common_parent_position(pos);
749 // ttValue can be used as a better position evaluation (~7 Elo)
750 if ( ttValue != VALUE_NONE
751 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
756 ss->staticEval = eval = evaluate(pos, &complexity);
757 // Save static evaluation into transposition table
758 tte->save(posKey, VALUE_NONE, ss->ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, eval);
761 // Use static evaluation difference to improve quiet move ordering (~4 Elo)
762 if (is_ok((ss-1)->currentMove) && !(ss-1)->inCheck && !priorCapture)
764 int bonus = std::clamp(-19 * int((ss-1)->staticEval + ss->staticEval), -1920, 1920);
765 thisThread->mainHistory[~us][from_to((ss-1)->currentMove)] << bonus;
768 // Set up the improvement variable, which is the difference between the current
769 // static evaluation and the previous static evaluation at our turn (if we were
770 // in check at our previous move we look at the move prior to it). The improvement
771 // margin and the improving flag are used in various pruning heuristics.
772 improvement = (ss-2)->staticEval != VALUE_NONE ? ss->staticEval - (ss-2)->staticEval
773 : (ss-4)->staticEval != VALUE_NONE ? ss->staticEval - (ss-4)->staticEval
775 improving = improvement > 0;
777 // Step 7. Razoring (~1 Elo).
778 // If eval is really low check with qsearch if it can exceed alpha, if it can't,
779 // return a fail low.
780 if (eval < alpha - 426 - 256 * depth * depth)
782 value = qsearch<NonPV>(pos, ss, alpha - 1, alpha);
787 // Step 8. Futility pruning: child node (~40 Elo).
788 // The depth condition is important for mate finding.
791 && eval - futility_margin(depth, improving) - (ss-1)->statScore / 280 >= beta
793 && eval < 25128) // larger than VALUE_KNOWN_WIN, but smaller than TB wins
796 // Step 9. Null move search with verification search (~35 Elo)
798 && (ss-1)->currentMove != MOVE_NULL
799 && (ss-1)->statScore < 18755
801 && eval >= ss->staticEval
802 && ss->staticEval >= beta - 20 * depth - improvement / 13 + 253 + complexity / 25
804 && pos.non_pawn_material(us)
805 && (ss->ply >= thisThread->nmpMinPly || us != thisThread->nmpColor))
807 assert(eval - beta >= 0);
809 // Null move dynamic reduction based on depth, eval and complexity of position
810 Depth R = std::min(int(eval - beta) / 172, 6) + depth / 3 + 4 - (complexity > 825);
812 ss->currentMove = MOVE_NULL;
813 ss->continuationHistory = &thisThread->continuationHistory[0][0][NO_PIECE][0];
815 pos.do_null_move(st);
817 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
819 pos.undo_null_move();
821 if (nullValue >= beta)
823 // Do not return unproven mate or TB scores
824 if (nullValue >= VALUE_TB_WIN_IN_MAX_PLY)
827 if (thisThread->nmpMinPly || (abs(beta) < VALUE_KNOWN_WIN && depth < 14))
830 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
832 // Do verification search at high depths, with null move pruning disabled
833 // for us, until ply exceeds nmpMinPly.
834 thisThread->nmpMinPly = ss->ply + 3 * (depth-R) / 4;
835 thisThread->nmpColor = us;
837 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
839 thisThread->nmpMinPly = 0;
846 probCutBeta = beta + 186 - 54 * improving;
848 // Step 10. ProbCut (~10 Elo)
849 // If we have a good enough capture (or queen promotion) and a reduced search returns a value
850 // much above beta, we can (almost) safely prune the previous move.
853 && abs(beta) < VALUE_TB_WIN_IN_MAX_PLY
854 // if value from transposition table is lower than probCutBeta, don't attempt probCut
855 // there and in further interactions with transposition table cutoff depth is set to depth - 3
856 // because probCut search has depth set to depth - 4 but we also do a move before it
857 // so effective depth is equal to depth - 3
859 && tte->depth() >= depth - 3
860 && ttValue != VALUE_NONE
861 && ttValue < probCutBeta))
863 assert(probCutBeta < VALUE_INFINITE);
865 MovePicker mp(pos, ttMove, probCutBeta - ss->staticEval, &captureHistory);
867 while ((move = mp.next_move()) != MOVE_NONE)
868 if (move != excludedMove && pos.legal(move))
870 assert(pos.capture_stage(move));
872 ss->currentMove = move;
873 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
875 [pos.moved_piece(move)]
878 pos.do_move(move, st);
880 // Perform a preliminary qsearch to verify that the move holds
881 value = -qsearch<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1);
883 // If the qsearch held, perform the regular search
884 if (value >= probCutBeta)
885 value = -search<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1, depth - 4, !cutNode);
889 if (value >= probCutBeta)
891 // Save ProbCut data into transposition table
892 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, BOUND_LOWER, depth - 3, move, ss->staticEval);
897 Eval::NNUE::hint_common_parent_position(pos);
900 // Step 11. If the position is not in TT, decrease depth by 2 (or by 4 if the TT entry for the current position was hit and the stored depth is greater than or equal to the current depth).
901 // Use qsearch if depth is equal or below zero (~9 Elo)
904 depth -= 2 + 2 * (ss->ttHit && tte->depth() >= depth);
907 return qsearch<PV>(pos, ss, alpha, beta);
914 moves_loop: // When in check, search starts here
916 // Step 12. A small Probcut idea, when we are in check (~4 Elo)
917 probCutBeta = beta + 391;
922 && (tte->bound() & BOUND_LOWER)
923 && tte->depth() >= depth - 3
924 && ttValue >= probCutBeta
925 && abs(ttValue) <= VALUE_KNOWN_WIN
926 && abs(beta) <= VALUE_KNOWN_WIN)
929 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
930 nullptr , (ss-4)->continuationHistory,
931 nullptr , (ss-6)->continuationHistory };
933 Move countermove = prevSq != SQ_NONE ? thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] : MOVE_NONE;
935 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
942 moveCountPruning = singularQuietLMR = false;
944 // Indicate PvNodes that will probably fail low if the node was searched
945 // at a depth equal or greater than the current depth, and the result of this search was a fail low.
946 bool likelyFailLow = PvNode
948 && (tte->bound() & BOUND_UPPER)
949 && tte->depth() >= depth;
951 // Step 13. Loop through all pseudo-legal moves until no moves remain
952 // or a beta cutoff occurs.
953 while ((move = mp.next_move(moveCountPruning)) != MOVE_NONE)
957 if (move == excludedMove)
960 // At root obey the "searchmoves" option and skip moves not listed in Root
961 // Move List. As a consequence any illegal move is also skipped. In MultiPV
962 // mode we also skip PV moves which have been already searched and those
963 // of lower "TB rank" if we are in a TB root position.
964 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
965 thisThread->rootMoves.begin() + thisThread->pvLast, move))
968 // Check for legality
969 if (!rootNode && !pos.legal(move))
972 ss->moveCount = ++moveCount;
974 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
975 sync_cout << "info depth " << depth
976 << " currmove " << UCI::move(move, pos.is_chess960())
977 << " currmovenumber " << moveCount + thisThread->pvIdx << sync_endl;
979 (ss+1)->pv = nullptr;
982 capture = pos.capture_stage(move);
983 movedPiece = pos.moved_piece(move);
984 givesCheck = pos.gives_check(move);
986 // Calculate new depth for this move
987 newDepth = depth - 1;
989 Value delta = beta - alpha;
991 Depth r = reduction(improving, depth, moveCount, delta, thisThread->rootDelta);
993 // Step 14. Pruning at shallow depth (~120 Elo). Depth conditions are important for mate finding.
995 && pos.non_pawn_material(us)
996 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY)
998 // Skip quiet moves if movecount exceeds our FutilityMoveCount threshold (~8 Elo)
999 moveCountPruning = moveCount >= futility_move_count(improving, depth);
1001 // Reduced depth of the next LMR search
1002 int lmrDepth = std::max(newDepth - r, 0);
1007 // Futility pruning for captures (~2 Elo)
1011 && ss->staticEval + 182 + 230 * lmrDepth + PieceValue[EG][pos.piece_on(to_sq(move))]
1012 + captureHistory[movedPiece][to_sq(move)][type_of(pos.piece_on(to_sq(move)))] / 7 < alpha)
1016 // SEE based pruning (~11 Elo)
1017 if (!pos.see_ge(move, occupied, Value(-206) * depth))
1019 if (depth < 2 - capture)
1021 // Don't prune the move if opp. King/Queen/Rook is attacked by a slider after the exchanges.
1022 // Since in see_ge we don't update occupied when the king recaptures, we also don't prune the
1023 // move when the opp. King gets a discovered slider attack DURING the exchanges.
1024 Bitboard leftEnemies = pos.pieces(~us, ROOK, QUEEN, KING) & occupied;
1025 Bitboard attacks = 0;
1026 occupied |= to_sq(move);
1027 while (leftEnemies && !attacks)
1029 Square sq = pop_lsb(leftEnemies);
1030 attacks = pos.attackers_to(sq, occupied) & pos.pieces(us) & occupied;
1031 // Exclude Queen/Rook(s) which were already threatened before SEE
1032 if (attacks && sq != pos.square<KING>(~us) && (pos.attackers_to(sq, pos.pieces()) & pos.pieces(us)))
1041 int history = (*contHist[0])[movedPiece][to_sq(move)]
1042 + (*contHist[1])[movedPiece][to_sq(move)]
1043 + (*contHist[3])[movedPiece][to_sq(move)];
1045 // Continuation history based pruning (~2 Elo)
1047 && history < -4405 * (depth - 1))
1050 history += 2 * thisThread->mainHistory[us][from_to(move)];
1052 lmrDepth += history / 7278;
1053 lmrDepth = std::max(lmrDepth, -2);
1055 // Futility pruning: parent node (~13 Elo)
1058 && ss->staticEval + 103 + 138 * lmrDepth <= alpha)
1061 lmrDepth = std::max(lmrDepth, 0);
1063 // Prune moves with negative SEE (~4 Elo)
1064 if (!pos.see_ge(move, Value(-24 * lmrDepth * lmrDepth - 16 * lmrDepth)))
1069 // Step 15. Extensions (~100 Elo)
1070 // We take care to not overdo to avoid search getting stuck.
1071 if (ss->ply < thisThread->rootDepth * 2)
1073 // Singular extension search (~94 Elo). If all moves but one fail low on a
1074 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
1075 // then that move is singular and should be extended. To verify this we do
1076 // a reduced search on all the other moves but the ttMove and if the
1077 // result is lower than ttValue minus a margin, then we will extend the ttMove.
1079 && depth >= 4 - (thisThread->completedDepth > 21) + 2 * (PvNode && tte->is_pv())
1081 && !excludedMove // Avoid recursive singular search
1082 /* && ttValue != VALUE_NONE Already implicit in the next condition */
1083 && abs(ttValue) < VALUE_KNOWN_WIN
1084 && (tte->bound() & BOUND_LOWER)
1085 && tte->depth() >= depth - 3)
1087 Value singularBeta = ttValue - (3 + 2 * (ss->ttPv && !PvNode)) * depth / 2;
1088 Depth singularDepth = (depth - 1) / 2;
1090 ss->excludedMove = move;
1091 value = search<NonPV>(pos, ss, singularBeta - 1, singularBeta, singularDepth, cutNode);
1092 ss->excludedMove = MOVE_NONE;
1094 if (value < singularBeta)
1097 singularQuietLMR = !ttCapture;
1099 // Avoid search explosion by limiting the number of double extensions
1101 && value < singularBeta - 25
1102 && ss->doubleExtensions <= 10)
1105 depth += depth < 13;
1109 // Multi-cut pruning
1110 // Our ttMove is assumed to fail high, and now we failed high also on a reduced
1111 // search without the ttMove. So we assume this expected Cut-node is not singular,
1112 // that multiple moves fail high, and we can prune the whole subtree by returning
1114 else if (singularBeta >= beta)
1115 return singularBeta;
1117 // If the eval of ttMove is greater than beta, we reduce it (negative extension) (~7 Elo)
1118 else if (ttValue >= beta)
1119 extension = -2 - !PvNode;
1121 // If the eval of ttMove is less than value, we reduce it (negative extension) (~1 Elo)
1122 else if (ttValue <= value)
1125 // If the eval of ttMove is less than alpha, we reduce it (negative extension) (~1 Elo)
1126 else if (ttValue <= alpha)
1130 // Check extensions (~1 Elo)
1131 else if ( givesCheck
1133 && abs(ss->staticEval) > 88)
1136 // Quiet ttMove extensions (~1 Elo)
1139 && move == ss->killers[0]
1140 && (*contHist[0])[movedPiece][to_sq(move)] >= 5705)
1144 // Add extension to new depth
1145 newDepth += extension;
1146 ss->doubleExtensions = (ss-1)->doubleExtensions + (extension == 2);
1148 // Speculative prefetch as early as possible
1149 prefetch(TT.first_entry(pos.key_after(move)));
1151 // Update the current move (this must be done after singular extension search)
1152 ss->currentMove = move;
1153 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1158 // Step 16. Make the move
1159 pos.do_move(move, st, givesCheck);
1161 // Decrease reduction if position is or has been on the PV
1162 // and node is not likely to fail low. (~3 Elo)
1167 // Decrease reduction if opponent's move count is high (~1 Elo)
1168 if ((ss-1)->moveCount > 7)
1171 // Increase reduction for cut nodes (~3 Elo)
1175 // Increase reduction if ttMove is a capture (~3 Elo)
1179 // Decrease reduction for PvNodes based on depth (~2 Elo)
1181 r -= 1 + 12 / (3 + depth);
1183 // Decrease reduction if ttMove has been singularly extended (~1 Elo)
1184 if (singularQuietLMR)
1187 // Increase reduction if next ply has a lot of fail high (~5 Elo)
1188 if ((ss+1)->cutoffCnt > 3)
1191 // Decrease reduction if move is a killer and we have a good history (~1 Elo)
1192 if (move == ss->killers[0]
1193 && (*contHist[0])[movedPiece][to_sq(move)] >= 3722)
1196 ss->statScore = 2 * thisThread->mainHistory[us][from_to(move)]
1197 + (*contHist[0])[movedPiece][to_sq(move)]
1198 + (*contHist[1])[movedPiece][to_sq(move)]
1199 + (*contHist[3])[movedPiece][to_sq(move)]
1202 // Decrease/increase reduction for moves with a good/bad history (~25 Elo)
1203 r -= ss->statScore / (11079 + 4626 * (depth > 6 && depth < 19));
1205 // Step 17. Late moves reduction / extension (LMR, ~117 Elo)
1206 // We use various heuristics for the sons of a node after the first son has
1207 // been searched. In general we would like to reduce them, but there are many
1208 // cases where we extend a son if it has good chances to be "interesting".
1210 && moveCount > 1 + (PvNode && ss->ply <= 1)
1213 || (cutNode && (ss-1)->moveCount > 1)))
1215 // In general we want to cap the LMR depth search at newDepth, but when
1216 // reduction is negative, we allow this move a limited search extension
1217 // beyond the first move depth. This may lead to hidden double extensions.
1218 Depth d = std::clamp(newDepth - r, 1, newDepth + 1);
1220 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1222 // Do full depth search when reduced LMR search fails high
1223 if (value > alpha && d < newDepth)
1225 // Adjust full depth search based on LMR results - if result
1226 // was good enough search deeper, if it was bad enough search shallower
1227 const bool doDeeperSearch = value > (alpha + 58 + 12 * (newDepth - d));
1228 const bool doEvenDeeperSearch = value > alpha + 588 && ss->doubleExtensions <= 5;
1229 const bool doShallowerSearch = value < bestValue + newDepth;
1231 ss->doubleExtensions = ss->doubleExtensions + doEvenDeeperSearch;
1233 newDepth += doDeeperSearch - doShallowerSearch + doEvenDeeperSearch;
1236 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1238 int bonus = value > alpha ? stat_bonus(newDepth)
1239 : -stat_bonus(newDepth);
1241 update_continuation_histories(ss, movedPiece, to_sq(move), bonus);
1245 // Step 18. Full depth search when LMR is skipped. If expected reduction is high, reduce its depth by 1.
1246 else if (!PvNode || moveCount > 1)
1248 // Increase reduction for cut nodes and not ttMove (~1 Elo)
1249 if (!ttMove && cutNode)
1252 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth - (r > 4), !cutNode);
1255 // For PV nodes only, do a full PV search on the first move or after a fail
1256 // high (in the latter case search only if value < beta), otherwise let the
1257 // parent node fail low with value <= alpha and try another move.
1258 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1261 (ss+1)->pv[0] = MOVE_NONE;
1263 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, false);
1265 if (moveCount > 1 && newDepth >= depth && !capture)
1266 update_continuation_histories(ss, movedPiece, to_sq(move), -stat_bonus(newDepth));
1269 // Step 19. Undo move
1270 pos.undo_move(move);
1272 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1274 // Step 20. Check for a new best move
1275 // Finished searching the move. If a stop occurred, the return value of
1276 // the search cannot be trusted, and we return immediately without
1277 // updating best move, PV and TT.
1278 if (Threads.stop.load(std::memory_order_relaxed))
1283 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1284 thisThread->rootMoves.end(), move);
1286 rm.averageScore = rm.averageScore != -VALUE_INFINITE ? (2 * value + rm.averageScore) / 3 : value;
1288 // PV move or new best move?
1289 if (moveCount == 1 || value > alpha)
1291 rm.score = rm.uciScore = value;
1292 rm.selDepth = thisThread->selDepth;
1293 rm.scoreLowerbound = rm.scoreUpperbound = false;
1297 rm.scoreLowerbound = true;
1300 else if (value <= alpha)
1302 rm.scoreUpperbound = true;
1303 rm.uciScore = alpha;
1310 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1311 rm.pv.push_back(*m);
1313 // We record how often the best move has been changed in each iteration.
1314 // This information is used for time management. In MultiPV mode,
1315 // we must take care to only do this for the first PV line.
1317 && !thisThread->pvIdx)
1318 ++thisThread->bestMoveChanges;
1321 // All other moves but the PV are set to the lowest value: this
1322 // is not a problem when sorting because the sort is stable and the
1323 // move position in the list is preserved - just the PV is pushed up.
1324 rm.score = -VALUE_INFINITE;
1327 if (value > bestValue)
1335 if (PvNode && !rootNode) // Update pv even in fail-high case
1336 update_pv(ss->pv, move, (ss+1)->pv);
1338 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1340 // Reduce other moves if we have found at least one score improvement (~1 Elo)
1342 && ( (improving && complexity > 971)
1343 || value < (5 * alpha + 75 * beta) / 87
1355 assert(value >= beta); // Fail high
1362 // If the move is worse than some previously searched move, remember it to update its stats later
1363 if (move != bestMove)
1365 if (capture && captureCount < 32)
1366 capturesSearched[captureCount++] = move;
1368 else if (!capture && quietCount < 64)
1369 quietsSearched[quietCount++] = move;
1373 // The following condition would detect a stop only after move loop has been
1374 // completed. But in this case bestValue is valid because we have fully
1375 // searched our subtree, and we can anyhow save the result in TT.
1381 // Step 21. Check for mate and stalemate
1382 // All legal moves have been searched and if there are no legal moves, it
1383 // must be a mate or a stalemate. If we are in a singular extension search then
1384 // return a fail low score.
1386 assert(moveCount || !ss->inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1389 bestValue = excludedMove ? alpha :
1390 ss->inCheck ? mated_in(ss->ply)
1393 // If there is a move which produces search value greater than alpha we update stats of searched moves
1395 update_all_stats(pos, ss, bestMove, bestValue, beta, prevSq,
1396 quietsSearched, quietCount, capturesSearched, captureCount, depth);
1398 // Bonus for prior countermove that caused the fail low
1399 else if (!priorCapture && prevSq != SQ_NONE)
1401 int bonus = (depth > 5) + (PvNode || cutNode) + (bestValue < alpha - 97 * depth) + ((ss-1)->moveCount > 10);
1402 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth) * bonus);
1406 bestValue = std::min(bestValue, maxValue);
1408 // If no good move is found and the previous position was ttPv, then the previous
1409 // opponent move is probably good and the new position is added to the search tree. (~7 Elo)
1410 if (bestValue <= alpha)
1411 ss->ttPv = ss->ttPv || ((ss-1)->ttPv && depth > 3);
1413 // Write gathered information in transposition table
1414 if (!excludedMove && !(rootNode && thisThread->pvIdx))
1415 tte->save(posKey, value_to_tt(bestValue, ss->ply), ss->ttPv,
1416 bestValue >= beta ? BOUND_LOWER :
1417 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1418 depth, bestMove, ss->staticEval);
1420 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1426 // qsearch() is the quiescence search function, which is called by the main search
1427 // function with zero depth, or recursively with further decreasing depth per call.
1429 template <NodeType nodeType>
1430 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1432 static_assert(nodeType != Root);
1433 constexpr bool PvNode = nodeType == PV;
1435 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1436 assert(PvNode || (alpha == beta - 1));
1441 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1445 Move ttMove, move, bestMove;
1447 Value bestValue, value, ttValue, futilityValue, futilityBase;
1448 bool pvHit, givesCheck, capture;
1451 // Step 1. Initialize node
1455 ss->pv[0] = MOVE_NONE;
1458 Thread* thisThread = pos.this_thread();
1459 bestMove = MOVE_NONE;
1460 ss->inCheck = pos.checkers();
1463 // Step 2. Check for an immediate draw or maximum ply reached
1464 if ( pos.is_draw(ss->ply)
1465 || ss->ply >= MAX_PLY)
1466 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos) : VALUE_DRAW;
1468 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1470 // Decide whether or not to include checks: this fixes also the type of
1471 // TT entry depth that we are going to use. Note that in qsearch we use
1472 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1473 ttDepth = ss->inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1474 : DEPTH_QS_NO_CHECKS;
1476 // Step 3. Transposition table lookup
1478 tte = TT.probe(posKey, ss->ttHit);
1479 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
1480 ttMove = ss->ttHit ? tte->move() : MOVE_NONE;
1481 pvHit = ss->ttHit && tte->is_pv();
1483 // At non-PV nodes we check for an early TT cutoff
1486 && tte->depth() >= ttDepth
1487 && ttValue != VALUE_NONE // Only in case of TT access race
1488 && (tte->bound() & (ttValue >= beta ? BOUND_LOWER : BOUND_UPPER)))
1491 // Step 4. Static evaluation of the position
1494 ss->staticEval = VALUE_NONE;
1495 bestValue = futilityBase = -VALUE_INFINITE;
1501 // Never assume anything about values stored in TT
1502 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1503 ss->staticEval = bestValue = evaluate(pos);
1505 // ttValue can be used as a better position evaluation (~13 Elo)
1506 if ( ttValue != VALUE_NONE
1507 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1508 bestValue = ttValue;
1511 // In case of null move search use previous static eval with a different sign
1512 ss->staticEval = bestValue =
1513 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1514 : -(ss-1)->staticEval;
1516 // Stand pat. Return immediately if static value is at least beta
1517 if (bestValue >= beta)
1519 // Save gathered info in transposition table
1521 tte->save(posKey, value_to_tt(bestValue, ss->ply), false, BOUND_LOWER,
1522 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1527 if (PvNode && bestValue > alpha)
1530 futilityBase = bestValue + 168;
1533 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
1534 nullptr , (ss-4)->continuationHistory,
1535 nullptr , (ss-6)->continuationHistory };
1537 // Initialize a MovePicker object for the current position, and prepare
1538 // to search the moves. Because the depth is <= 0 here, only captures,
1539 // queen promotions, and other checks (only if depth >= DEPTH_QS_CHECKS)
1540 // will be generated.
1541 Square prevSq = (ss-1)->currentMove != MOVE_NULL ? to_sq((ss-1)->currentMove) : SQ_NONE;
1542 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
1543 &thisThread->captureHistory,
1547 int quietCheckEvasions = 0;
1549 // Step 5. Loop through all pseudo-legal moves until no moves remain
1550 // or a beta cutoff occurs.
1551 while ((move = mp.next_move()) != MOVE_NONE)
1553 assert(is_ok(move));
1555 // Check for legality
1556 if (!pos.legal(move))
1559 givesCheck = pos.gives_check(move);
1560 capture = pos.capture_stage(move);
1565 if (bestValue > VALUE_TB_LOSS_IN_MAX_PLY)
1567 // Futility pruning and moveCount pruning (~10 Elo)
1569 && to_sq(move) != prevSq
1570 && futilityBase > -VALUE_KNOWN_WIN
1571 && type_of(move) != PROMOTION)
1576 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1578 if (futilityValue <= alpha)
1580 bestValue = std::max(bestValue, futilityValue);
1584 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1586 bestValue = std::max(bestValue, futilityBase);
1591 // We prune after 2nd quiet check evasion where being 'in check' is implicitly checked through the counter
1592 // and being a 'quiet' apart from being a tt move is assumed after an increment because captures are pushed ahead.
1593 if (quietCheckEvasions > 1)
1596 // Continuation history based pruning (~3 Elo)
1598 && (*contHist[0])[pos.moved_piece(move)][to_sq(move)] < 0
1599 && (*contHist[1])[pos.moved_piece(move)][to_sq(move)] < 0)
1602 // Do not search moves with bad enough SEE values (~5 Elo)
1603 if (!pos.see_ge(move, Value(-110)))
1607 // Speculative prefetch as early as possible
1608 prefetch(TT.first_entry(pos.key_after(move)));
1610 // Update the current move
1611 ss->currentMove = move;
1612 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1614 [pos.moved_piece(move)]
1617 quietCheckEvasions += !capture && ss->inCheck;
1619 // Step 7. Make and search the move
1620 pos.do_move(move, st, givesCheck);
1621 value = -qsearch<nodeType>(pos, ss+1, -beta, -alpha, depth - 1);
1622 pos.undo_move(move);
1624 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1626 // Step 8. Check for a new best move
1627 if (value > bestValue)
1635 if (PvNode) // Update pv even in fail-high case
1636 update_pv(ss->pv, move, (ss+1)->pv);
1638 if (PvNode && value < beta) // Update alpha here!
1646 // Step 9. Check for mate
1647 // All legal moves have been searched. A special case: if we're in check
1648 // and no legal moves were found, it is checkmate.
1649 if (ss->inCheck && bestValue == -VALUE_INFINITE)
1651 assert(!MoveList<LEGAL>(pos).size());
1653 return mated_in(ss->ply); // Plies to mate from the root
1656 // Save gathered info in transposition table
1657 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1658 bestValue >= beta ? BOUND_LOWER : BOUND_UPPER,
1659 ttDepth, bestMove, ss->staticEval);
1661 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1667 // value_to_tt() adjusts a mate or TB score from "plies to mate from the root" to
1668 // "plies to mate from the current position". Standard scores are unchanged.
1669 // The function is called before storing a value in the transposition table.
1671 Value value_to_tt(Value v, int ply) {
1673 assert(v != VALUE_NONE);
1675 return v >= VALUE_TB_WIN_IN_MAX_PLY ? v + ply
1676 : v <= VALUE_TB_LOSS_IN_MAX_PLY ? v - ply : v;
1680 // value_from_tt() is the inverse of value_to_tt(): it adjusts a mate or TB score
1681 // from the transposition table (which refers to the plies to mate/be mated from
1682 // current position) to "plies to mate/be mated (TB win/loss) from the root". However,
1683 // for mate scores, to avoid potentially false mate scores related to the 50 moves rule
1684 // and the graph history interaction, we return an optimal TB score instead.
1686 Value value_from_tt(Value v, int ply, int r50c) {
1688 if (v == VALUE_NONE)
1691 if (v >= VALUE_TB_WIN_IN_MAX_PLY) // TB win or better
1693 if (v >= VALUE_MATE_IN_MAX_PLY && VALUE_MATE - v > 99 - r50c)
1694 return VALUE_MATE_IN_MAX_PLY - 1; // do not return a potentially false mate score
1699 if (v <= VALUE_TB_LOSS_IN_MAX_PLY) // TB loss or worse
1701 if (v <= VALUE_MATED_IN_MAX_PLY && VALUE_MATE + v > 99 - r50c)
1702 return VALUE_MATED_IN_MAX_PLY + 1; // do not return a potentially false mate score
1711 // update_pv() adds current move and appends child pv[]
1713 void update_pv(Move* pv, Move move, const Move* childPv) {
1715 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1721 // update_all_stats() updates stats at the end of search() when a bestMove is found
1723 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
1724 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth) {
1726 Color us = pos.side_to_move();
1727 Thread* thisThread = pos.this_thread();
1728 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
1729 Piece moved_piece = pos.moved_piece(bestMove);
1732 int bonus1 = stat_bonus(depth + 1);
1734 if (!pos.capture_stage(bestMove))
1736 int bonus2 = bestValue > beta + 153 ? bonus1 // larger bonus
1737 : stat_bonus(depth); // smaller bonus
1739 // Increase stats for the best move in case it was a quiet move
1740 update_quiet_stats(pos, ss, bestMove, bonus2);
1742 // Decrease stats for all non-best quiet moves
1743 for (int i = 0; i < quietCount; ++i)
1745 thisThread->mainHistory[us][from_to(quietsSearched[i])] << -bonus2;
1746 update_continuation_histories(ss, pos.moved_piece(quietsSearched[i]), to_sq(quietsSearched[i]), -bonus2);
1751 // Increase stats for the best move in case it was a capture move
1752 captured = type_of(pos.piece_on(to_sq(bestMove)));
1753 captureHistory[moved_piece][to_sq(bestMove)][captured] << bonus1;
1756 // Extra penalty for a quiet early move that was not a TT move or
1757 // main killer move in previous ply when it gets refuted.
1758 if ( prevSq != SQ_NONE
1759 && ((ss-1)->moveCount == 1 + (ss-1)->ttHit || ((ss-1)->currentMove == (ss-1)->killers[0]))
1760 && !pos.captured_piece())
1761 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -bonus1);
1763 // Decrease stats for all non-best capture moves
1764 for (int i = 0; i < captureCount; ++i)
1766 moved_piece = pos.moved_piece(capturesSearched[i]);
1767 captured = type_of(pos.piece_on(to_sq(capturesSearched[i])));
1768 captureHistory[moved_piece][to_sq(capturesSearched[i])][captured] << -bonus1;
1773 // update_continuation_histories() updates histories of the move pairs formed
1774 // by moves at ply -1, -2, -4, and -6 with current move.
1776 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1778 for (int i : {1, 2, 4, 6})
1780 // Only update first 2 continuation histories if we are in check
1781 if (ss->inCheck && i > 2)
1783 if (is_ok((ss-i)->currentMove))
1784 (*(ss-i)->continuationHistory)[pc][to] << bonus;
1789 // update_quiet_stats() updates move sorting heuristics
1791 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus) {
1794 if (ss->killers[0] != move)
1796 ss->killers[1] = ss->killers[0];
1797 ss->killers[0] = move;
1800 Color us = pos.side_to_move();
1801 Thread* thisThread = pos.this_thread();
1802 thisThread->mainHistory[us][from_to(move)] << bonus;
1803 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1805 // Update countermove history
1806 if (is_ok((ss-1)->currentMove))
1808 Square prevSq = to_sq((ss-1)->currentMove);
1809 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1813 // When playing with strength handicap, choose best move among a set of RootMoves
1814 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1816 Move Skill::pick_best(size_t multiPV) {
1818 const RootMoves& rootMoves = Threads.main()->rootMoves;
1819 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1821 // RootMoves are already sorted by score in descending order
1822 Value topScore = rootMoves[0].score;
1823 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1824 int maxScore = -VALUE_INFINITE;
1825 double weakness = 120 - 2 * level;
1827 // Choose best move. For each move score we add two terms, both dependent on
1828 // weakness. One is deterministic and bigger for weaker levels, and one is
1829 // random. Then we choose the move with the resulting highest score.
1830 for (size_t i = 0; i < multiPV; ++i)
1832 // This is our magic formula
1833 int push = int(( weakness * int(topScore - rootMoves[i].score)
1834 + delta * (rng.rand<unsigned>() % int(weakness))) / 128);
1836 if (rootMoves[i].score + push >= maxScore)
1838 maxScore = rootMoves[i].score + push;
1839 best = rootMoves[i].pv[0];
1849 /// MainThread::check_time() is used to print debug info and, more importantly,
1850 /// to detect when we are out of available time and thus stop the search.
1852 void MainThread::check_time() {
1857 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1858 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1860 static TimePoint lastInfoTime = now();
1862 TimePoint elapsed = Time.elapsed();
1863 TimePoint tick = Limits.startTime + elapsed;
1865 if (tick - lastInfoTime >= 1000)
1867 lastInfoTime = tick;
1871 // We should not stop pondering until told so by the GUI
1875 if ( (Limits.use_time_management() && (elapsed > Time.maximum() - 10 || stopOnPonderhit))
1876 || (Limits.movetime && elapsed >= Limits.movetime)
1877 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1878 Threads.stop = true;
1882 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1883 /// that all (if any) unsearched PV lines are sent using a previous search score.
1885 string UCI::pv(const Position& pos, Depth depth) {
1887 std::stringstream ss;
1888 TimePoint elapsed = Time.elapsed() + 1;
1889 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1890 size_t pvIdx = pos.this_thread()->pvIdx;
1891 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1892 uint64_t nodesSearched = Threads.nodes_searched();
1893 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1895 for (size_t i = 0; i < multiPV; ++i)
1897 bool updated = rootMoves[i].score != -VALUE_INFINITE;
1899 if (depth == 1 && !updated && i > 0)
1902 Depth d = updated ? depth : std::max(1, depth - 1);
1903 Value v = updated ? rootMoves[i].uciScore : rootMoves[i].previousScore;
1905 if (v == -VALUE_INFINITE)
1908 bool tb = TB::RootInTB && abs(v) < VALUE_MATE_IN_MAX_PLY;
1909 v = tb ? rootMoves[i].tbScore : v;
1911 if (ss.rdbuf()->in_avail()) // Not at first line
1916 << " seldepth " << rootMoves[i].selDepth
1917 << " multipv " << i + 1
1918 << " score " << UCI::value(v);
1920 if (Options["UCI_ShowWDL"])
1921 ss << UCI::wdl(v, pos.game_ply());
1923 if (i == pvIdx && !tb && updated) // tablebase- and previous-scores are exact
1924 ss << (rootMoves[i].scoreLowerbound ? " lowerbound" : (rootMoves[i].scoreUpperbound ? " upperbound" : ""));
1926 ss << " nodes " << nodesSearched
1927 << " nps " << nodesSearched * 1000 / elapsed
1928 << " hashfull " << TT.hashfull()
1929 << " tbhits " << tbHits
1930 << " time " << elapsed
1933 for (Move m : rootMoves[i].pv)
1934 ss << " " << UCI::move(m, pos.is_chess960());
1941 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1942 /// before exiting the search, for instance, in case we stop the search during a
1943 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1944 /// otherwise in case of 'ponder on' we have nothing to think on.
1946 bool RootMove::extract_ponder_from_tt(Position& pos) {
1949 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1953 assert(pv.size() == 1);
1955 if (pv[0] == MOVE_NONE)
1958 pos.do_move(pv[0], st);
1959 TTEntry* tte = TT.probe(pos.key(), ttHit);
1963 Move m = tte->move(); // Local copy to be SMP safe
1964 if (MoveList<LEGAL>(pos).contains(m))
1968 pos.undo_move(pv[0]);
1969 return pv.size() > 1;
1972 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1975 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1976 ProbeDepth = int(Options["SyzygyProbeDepth"]);
1977 Cardinality = int(Options["SyzygyProbeLimit"]);
1978 bool dtz_available = true;
1980 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1981 // ProbeDepth == DEPTH_ZERO
1982 if (Cardinality > MaxCardinality)
1984 Cardinality = MaxCardinality;
1988 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1990 // Rank moves using DTZ tables
1991 RootInTB = root_probe(pos, rootMoves);
1995 // DTZ tables are missing; try to rank moves using WDL tables
1996 dtz_available = false;
1997 RootInTB = root_probe_wdl(pos, rootMoves);
2003 // Sort moves according to TB rank
2004 std::stable_sort(rootMoves.begin(), rootMoves.end(),
2005 [](const RootMove &a, const RootMove &b) { return a.tbRank > b.tbRank; } );
2007 // Probe during search only if DTZ is not available and we are winning
2008 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
2013 // Clean up if root_probe() and root_probe_wdl() have failed
2014 for (auto& m : rootMoves)
2019 } // namespace Stockfish