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"
45 namespace Tablebases {
53 namespace TB = Tablebases;
57 using namespace Search;
61 // Different node types, used as a template parameter
62 enum NodeType { NonPV, PV, Root };
65 Value futility_margin(Depth d, bool improving) {
66 return Value(158 * (d - improving));
69 // Reductions lookup table, initialized at startup
70 int Reductions[MAX_MOVES]; // [depth or moveNumber]
72 Depth reduction(bool i, Depth d, int mn, Value delta, Value rootDelta) {
73 int r = Reductions[d] * Reductions[mn];
74 return (r + 1460 - int(delta) * 1024 / int(rootDelta)) / 1024 + (!i && r > 937);
77 constexpr int futility_move_count(bool improving, Depth depth) {
78 return improving ? (3 + depth * depth)
79 : (3 + depth * depth) / 2;
82 // History and stats update bonus, based on depth
83 int stat_bonus(Depth d) {
84 return std::min((11 * d + 284) * d - 363 , 1650);
87 // Add a small random component to draw evaluations to avoid 3-fold blindness
88 Value value_draw(const Thread* thisThread) {
89 return VALUE_DRAW - 1 + Value(thisThread->nodes & 0x2);
92 // Skill structure is used to implement strength limit. If we have an uci_elo then
93 // we convert it to a suitable fractional skill level using anchoring to CCRL Elo
94 // (goldfish 1.13 = 2000) and a fit through Ordo derived Elo for match (TC 60+0.6)
95 // results spanning a wide range of k values.
97 Skill(int skill_level, int uci_elo) {
100 double e = double(uci_elo - 1320) / (3190 - 1320);
101 level = std::clamp((((37.2473 * e - 40.8525) * e + 22.2943) * e - 0.311438), 0.0, 19.0);
104 level = double(skill_level);
106 bool enabled() const { return level < 20.0; }
107 bool time_to_pick(Depth depth) const { return depth == 1 + int(level); }
108 Move pick_best(size_t multiPV);
111 Move best = MOVE_NONE;
114 template <NodeType nodeType>
115 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
117 template <NodeType nodeType>
118 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = 0);
120 Value value_to_tt(Value v, int ply);
121 Value value_from_tt(Value v, int ply, int r50c);
122 void update_pv(Move* pv, Move move, const Move* childPv);
123 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
124 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus);
125 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
126 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth);
128 // perft() is our utility to verify move generation. All the leaf nodes up
129 // to the given depth are generated and counted, and the sum is returned.
131 uint64_t perft(Position& pos, Depth depth) {
134 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
136 uint64_t cnt, nodes = 0;
137 const bool leaf = (depth == 2);
139 for (const auto& m : MoveList<LEGAL>(pos))
141 if (Root && depth <= 1)
146 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - 1);
151 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
159 /// Search::init() is called at startup to initialize various lookup tables
161 void Search::init() {
163 for (int i = 1; i < MAX_MOVES; ++i)
164 Reductions[i] = int((20.26 + std::log(Threads.size()) / 2) * std::log(i));
168 /// Search::clear() resets search state to its initial value
170 void Search::clear() {
172 Threads.main()->wait_for_search_finished();
174 Time.availableNodes = 0;
177 Tablebases::init(Options["SyzygyPath"]); // Free mapped files
181 /// MainThread::search() is started when the program receives the UCI 'go'
182 /// command. It searches from the root position and outputs the "bestmove".
184 void MainThread::search() {
188 nodes = perft<true>(rootPos, Limits.perft);
189 sync_cout << "\nNodes searched: " << nodes << "\n" << sync_endl;
193 Color us = rootPos.side_to_move();
194 Time.init(Limits, us, rootPos.game_ply());
197 Eval::NNUE::verify();
199 if (rootMoves.empty())
201 rootMoves.emplace_back(MOVE_NONE);
202 sync_cout << "info depth 0 score "
203 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
208 Threads.start_searching(); // start non-main threads
209 Thread::search(); // main thread start searching
212 // When we reach the maximum depth, we can arrive here without a raise of
213 // Threads.stop. However, if we are pondering or in an infinite search,
214 // the UCI protocol states that we shouldn't print the best move before the
215 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
216 // until the GUI sends one of those commands.
218 while (!Threads.stop && (ponder || Limits.infinite))
219 {} // Busy wait for a stop or a ponder reset
221 // Stop the threads if not already stopped (also raise the stop if
222 // "ponderhit" just reset Threads.ponder).
225 // Wait until all threads have finished
226 Threads.wait_for_search_finished();
228 // When playing in 'nodes as time' mode, subtract the searched nodes from
229 // the available ones before exiting.
231 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
233 Thread* bestThread = this;
234 Skill skill = Skill(Options["Skill Level"], Options["UCI_LimitStrength"] ? int(Options["UCI_Elo"]) : 0);
236 if ( int(Options["MultiPV"]) == 1
239 && rootMoves[0].pv[0] != MOVE_NONE)
240 bestThread = Threads.get_best_thread();
242 bestPreviousScore = bestThread->rootMoves[0].score;
243 bestPreviousAverageScore = bestThread->rootMoves[0].averageScore;
245 for (Thread* th : Threads)
246 th->previousDepth = bestThread->completedDepth;
248 // Send again PV info if we have a new best thread
249 if (bestThread != this)
250 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth) << sync_endl;
252 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
254 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
255 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
257 std::cout << sync_endl;
261 /// Thread::search() is the main iterative deepening loop. It calls search()
262 /// repeatedly with increasing depth until the allocated thinking time has been
263 /// consumed, the user stops the search, or the maximum search depth is reached.
265 void Thread::search() {
267 // To allow access to (ss-7) up to (ss+2), the stack must be oversized.
268 // The former is needed to allow update_continuation_histories(ss-1, ...),
269 // which accesses its argument at ss-6, also near the root.
270 // The latter is needed for statScore and killer initialization.
271 Stack stack[MAX_PLY+10], *ss = stack+7;
273 Value alpha, beta, delta;
274 Move lastBestMove = MOVE_NONE;
275 Depth lastBestMoveDepth = 0;
276 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
277 double timeReduction = 1, totBestMoveChanges = 0;
278 Color us = rootPos.side_to_move();
281 std::memset(ss-7, 0, 10 * sizeof(Stack));
282 for (int i = 7; i > 0; --i)
284 (ss-i)->continuationHistory = &this->continuationHistory[0][0][NO_PIECE][0]; // Use as a sentinel
285 (ss-i)->staticEval = VALUE_NONE;
288 for (int i = 0; i <= MAX_PLY + 2; ++i)
293 bestValue = delta = alpha = -VALUE_INFINITE;
294 beta = VALUE_INFINITE;
298 if (mainThread->bestPreviousScore == VALUE_INFINITE)
299 for (int i = 0; i < 4; ++i)
300 mainThread->iterValue[i] = VALUE_ZERO;
302 for (int i = 0; i < 4; ++i)
303 mainThread->iterValue[i] = mainThread->bestPreviousScore;
306 size_t multiPV = size_t(Options["MultiPV"]);
307 Skill skill(Options["Skill Level"], Options["UCI_LimitStrength"] ? int(Options["UCI_Elo"]) : 0);
309 // When playing with strength handicap enable MultiPV search that we will
310 // use behind the scenes to retrieve a set of possible moves.
312 multiPV = std::max(multiPV, (size_t)4);
314 multiPV = std::min(multiPV, rootMoves.size());
316 complexityAverage.set(153, 1);
318 optimism[us] = optimism[~us] = VALUE_ZERO;
320 int searchAgainCounter = 0;
322 // Iterative deepening loop until requested to stop or the target depth is reached
323 while ( ++rootDepth < MAX_PLY
325 && !(Limits.depth && mainThread && rootDepth > Limits.depth))
327 // Age out PV variability metric
329 totBestMoveChanges /= 2;
331 // Save the last iteration's scores before first PV line is searched and
332 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
333 for (RootMove& rm : rootMoves)
334 rm.previousScore = rm.score;
339 if (!Threads.increaseDepth)
340 searchAgainCounter++;
342 // MultiPV loop. We perform a full root search for each PV line
343 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
348 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
349 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
353 // Reset UCI info selDepth for each depth and each PV line
356 // Reset aspiration window starting size
359 Value prev = rootMoves[pvIdx].averageScore;
360 delta = Value(10) + int(prev) * prev / 15400;
361 alpha = std::max(prev - delta,-VALUE_INFINITE);
362 beta = std::min(prev + delta, VALUE_INFINITE);
364 // Adjust optimism based on root move's previousScore
365 int opt = 116 * prev / (std::abs(prev) + 170);
366 optimism[ us] = Value(opt);
367 optimism[~us] = -optimism[us];
370 // Start with a small aspiration window and, in the case of a fail
371 // high/low, re-search with a bigger window until we don't fail
373 int failedHighCnt = 0;
376 // Adjust the effective depth searched, but ensuring at least one effective increment for every
377 // four searchAgain steps (see issue #2717).
378 Depth adjustedDepth = std::max(1, rootDepth - failedHighCnt - 3 * (searchAgainCounter + 1) / 4);
379 bestValue = Stockfish::search<Root>(rootPos, ss, alpha, beta, adjustedDepth, false);
381 // Bring the best move to the front. It is critical that sorting
382 // is done with a stable algorithm because all the values but the
383 // first and eventually the new best one are set to -VALUE_INFINITE
384 // and we want to keep the same order for all the moves except the
385 // new PV that goes to the front. Note that in case of MultiPV
386 // search the already searched PV lines are preserved.
387 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
389 // If search has been stopped, we break immediately. Sorting is
390 // safe because RootMoves is still valid, although it refers to
391 // the previous iteration.
395 // When failing high/low give some update (without cluttering
396 // the UI) before a re-search.
399 && (bestValue <= alpha || bestValue >= beta)
400 && Time.elapsed() > 3000)
401 sync_cout << UCI::pv(rootPos, rootDepth) << sync_endl;
403 // In case of failing low/high increase aspiration window and
404 // re-search, otherwise exit the loop.
405 if (bestValue <= alpha)
407 beta = (alpha + beta) / 2;
408 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
412 mainThread->stopOnPonderhit = false;
414 else if (bestValue >= beta)
416 beta = std::min(bestValue + delta, VALUE_INFINITE);
422 delta += delta / 4 + 2;
424 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
427 // Sort the PV lines searched so far and update the GUI
428 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
431 && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
432 sync_cout << UCI::pv(rootPos, rootDepth) << sync_endl;
436 completedDepth = rootDepth;
438 if (rootMoves[0].pv[0] != lastBestMove) {
439 lastBestMove = rootMoves[0].pv[0];
440 lastBestMoveDepth = rootDepth;
443 // Have we found a "mate in x"?
445 && bestValue >= VALUE_MATE_IN_MAX_PLY
446 && VALUE_MATE - bestValue <= 2 * Limits.mate)
452 // If skill level is enabled and time is up, pick a sub-optimal best move
453 if (skill.enabled() && skill.time_to_pick(rootDepth))
454 skill.pick_best(multiPV);
456 // Use part of the gained time from a previous stable move for the current move
457 for (Thread* th : Threads)
459 totBestMoveChanges += th->bestMoveChanges;
460 th->bestMoveChanges = 0;
463 // Do we have time for the next iteration? Can we stop searching now?
464 if ( Limits.use_time_management()
466 && !mainThread->stopOnPonderhit)
468 double fallingEval = (71 + 12 * (mainThread->bestPreviousAverageScore - bestValue)
469 + 6 * (mainThread->iterValue[iterIdx] - bestValue)) / 656.7;
470 fallingEval = std::clamp(fallingEval, 0.5, 1.5);
472 // If the bestMove is stable over several iterations, reduce time accordingly
473 timeReduction = lastBestMoveDepth + 9 < completedDepth ? 1.37 : 0.65;
474 double reduction = (1.4 + mainThread->previousTimeReduction) / (2.15 * timeReduction);
475 double bestMoveInstability = 1 + 1.7 * totBestMoveChanges / Threads.size();
476 int complexity = mainThread->complexityAverage.value();
477 double complexPosition = std::min(1.0 + (complexity - 261) / 1738.7, 1.5);
479 double totalTime = Time.optimum() * fallingEval * reduction * bestMoveInstability * complexPosition;
481 // Cap used time in case of a single legal move for a better viewer experience in tournaments
482 // yielding correct scores and sufficiently fast moves.
483 if (rootMoves.size() == 1)
484 totalTime = std::min(500.0, totalTime);
486 // Stop the search if we have exceeded the totalTime
487 if (Time.elapsed() > totalTime)
489 // If we are allowed to ponder do not stop the search now but
490 // keep pondering until the GUI sends "ponderhit" or "stop".
491 if (mainThread->ponder)
492 mainThread->stopOnPonderhit = true;
496 else if ( !mainThread->ponder
497 && Time.elapsed() > totalTime * 0.53)
498 Threads.increaseDepth = false;
500 Threads.increaseDepth = true;
503 mainThread->iterValue[iterIdx] = bestValue;
504 iterIdx = (iterIdx + 1) & 3;
510 mainThread->previousTimeReduction = timeReduction;
512 // If skill level is enabled, swap best PV line with the sub-optimal one
514 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
515 skill.best ? skill.best : skill.pick_best(multiPV)));
521 // search<>() is the main search function for both PV and non-PV nodes
523 template <NodeType nodeType>
524 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
526 constexpr bool PvNode = nodeType != NonPV;
527 constexpr bool rootNode = nodeType == Root;
528 const Depth maxNextDepth = rootNode ? depth : depth + 1;
530 // Check if we have an upcoming move which draws by repetition, or
531 // if the opponent had an alternative move earlier to this position.
533 && pos.rule50_count() >= 3
534 && alpha < VALUE_DRAW
535 && pos.has_game_cycle(ss->ply))
537 alpha = value_draw(pos.this_thread());
542 // Dive into quiescence search when the depth reaches zero
544 return qsearch<PvNode ? PV : NonPV>(pos, ss, alpha, beta);
546 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
547 assert(PvNode || (alpha == beta - 1));
548 assert(0 < depth && depth < MAX_PLY);
549 assert(!(PvNode && cutNode));
551 Move pv[MAX_PLY+1], capturesSearched[32], quietsSearched[64];
553 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
557 Move ttMove, move, excludedMove, bestMove;
558 Depth extension, newDepth;
559 Value bestValue, value, ttValue, eval, maxValue, probCutBeta;
560 bool givesCheck, improving, priorCapture, singularQuietLMR;
561 bool capture, moveCountPruning, ttCapture;
563 int moveCount, captureCount, quietCount, improvement, complexity;
565 // Step 1. Initialize node
566 Thread* thisThread = pos.this_thread();
567 ss->inCheck = pos.checkers();
568 priorCapture = pos.captured_piece();
569 Color us = pos.side_to_move();
570 moveCount = captureCount = quietCount = ss->moveCount = 0;
571 bestValue = -VALUE_INFINITE;
572 maxValue = VALUE_INFINITE;
574 // Check for the available remaining time
575 if (thisThread == Threads.main())
576 static_cast<MainThread*>(thisThread)->check_time();
578 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
579 if (PvNode && thisThread->selDepth < ss->ply + 1)
580 thisThread->selDepth = ss->ply + 1;
584 // Step 2. Check for aborted search and immediate draw
585 if ( Threads.stop.load(std::memory_order_relaxed)
586 || pos.is_draw(ss->ply)
587 || ss->ply >= MAX_PLY)
588 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos)
589 : value_draw(pos.this_thread());
591 // Step 3. Mate distance pruning. Even if we mate at the next move our score
592 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
593 // a shorter mate was found upward in the tree then there is no need to search
594 // because we will never beat the current alpha. Same logic but with reversed
595 // signs applies also in the opposite condition of being mated instead of giving
596 // mate. In this case return a fail-high score.
597 alpha = std::max(mated_in(ss->ply), alpha);
598 beta = std::min(mate_in(ss->ply+1), beta);
603 thisThread->rootDelta = beta - alpha;
605 assert(0 <= ss->ply && ss->ply < MAX_PLY);
607 (ss+1)->ttPv = false;
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 = to_sq((ss-1)->currentMove);
614 // Initialize statScore to zero for the grandchildren of the current position.
615 // So statScore is shared between all grandchildren and only the first grandchild
616 // starts with statScore = 0. Later grandchildren start with the last calculated
617 // statScore of the previous grandchild. This influences the reduction rules in
618 // LMR which are based on the statScore of parent position.
620 (ss+2)->statScore = 0;
622 // Step 4. Transposition table lookup. We don't want the score of a partial
623 // search to overwrite a previous full search TT value, so we use a different
624 // position key in case of an excluded move.
625 excludedMove = ss->excludedMove;
626 posKey = excludedMove == MOVE_NONE ? pos.key() : pos.key() ^ make_key(excludedMove);
627 tte = TT.probe(posKey, ss->ttHit);
628 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
629 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
630 : ss->ttHit ? tte->move() : MOVE_NONE;
631 ttCapture = ttMove && pos.capture(ttMove);
633 ss->ttPv = PvNode || (ss->ttHit && tte->is_pv());
635 // At non-PV nodes we check for an early TT cutoff
638 && tte->depth() > depth - (tte->bound() == BOUND_EXACT)
639 && ttValue != VALUE_NONE // Possible in case of TT access race
640 && (tte->bound() & (ttValue >= beta ? BOUND_LOWER : BOUND_UPPER)))
642 // If ttMove is quiet, update move sorting heuristics on TT hit (~2 Elo)
647 // Bonus for a quiet ttMove that fails high (~2 Elo)
649 update_quiet_stats(pos, ss, ttMove, stat_bonus(depth));
651 // Extra penalty for early quiet moves of the previous ply (~0 Elo on STC, ~2 Elo on LTC)
652 if ((ss-1)->moveCount <= 2 && !priorCapture)
653 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + 1));
655 // Penalty for a quiet ttMove that fails low (~1 Elo)
658 int penalty = -stat_bonus(depth);
659 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
660 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
664 // Partial workaround for the graph history interaction problem
665 // For high rule50 counts don't produce transposition table cutoffs.
666 if (pos.rule50_count() < 90)
670 // Step 5. Tablebases probe
671 if (!rootNode && TB::Cardinality)
673 int piecesCount = pos.count<ALL_PIECES>();
675 if ( piecesCount <= TB::Cardinality
676 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
677 && pos.rule50_count() == 0
678 && !pos.can_castle(ANY_CASTLING))
681 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
683 // Force check of time on the next occasion
684 if (thisThread == Threads.main())
685 static_cast<MainThread*>(thisThread)->callsCnt = 0;
687 if (err != TB::ProbeState::FAIL)
689 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
691 int drawScore = TB::UseRule50 ? 1 : 0;
693 // use the range VALUE_MATE_IN_MAX_PLY to VALUE_TB_WIN_IN_MAX_PLY to score
694 value = wdl < -drawScore ? VALUE_MATED_IN_MAX_PLY + ss->ply + 1
695 : wdl > drawScore ? VALUE_MATE_IN_MAX_PLY - ss->ply - 1
696 : VALUE_DRAW + 2 * wdl * drawScore;
698 Bound b = wdl < -drawScore ? BOUND_UPPER
699 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
701 if ( b == BOUND_EXACT
702 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
704 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, b,
705 std::min(MAX_PLY - 1, depth + 6),
706 MOVE_NONE, VALUE_NONE);
713 if (b == BOUND_LOWER)
714 bestValue = value, alpha = std::max(alpha, bestValue);
722 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
724 // Step 6. Static evaluation of the position
727 // Skip early pruning when in check
728 ss->staticEval = eval = VALUE_NONE;
736 // Never assume anything about values stored in TT
737 ss->staticEval = eval = tte->eval();
738 if (eval == VALUE_NONE)
739 ss->staticEval = eval = evaluate(pos, &complexity);
740 else // Fall back to (semi)classical complexity for TT hits, the NNUE complexity is lost
741 complexity = abs(ss->staticEval - pos.psq_eg_stm());
743 // ttValue can be used as a better position evaluation (~7 Elo)
744 if ( ttValue != VALUE_NONE
745 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
750 ss->staticEval = eval = evaluate(pos, &complexity);
752 // Save static evaluation into transposition table
754 tte->save(posKey, VALUE_NONE, ss->ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, eval);
757 thisThread->complexityAverage.update(complexity);
759 // Use static evaluation difference to improve quiet move ordering (~4 Elo)
760 if (is_ok((ss-1)->currentMove) && !(ss-1)->inCheck && !priorCapture)
762 int bonus = std::clamp(-19 * int((ss-1)->staticEval + ss->staticEval), -1940, 1940);
763 thisThread->mainHistory[~us][from_to((ss-1)->currentMove)] << bonus;
766 // Set up the improvement variable, which is the difference between the current
767 // static evaluation and the previous static evaluation at our turn (if we were
768 // in check at our previous move we look at the move prior to it). The improvement
769 // margin and the improving flag are used in various pruning heuristics.
770 improvement = (ss-2)->staticEval != VALUE_NONE ? ss->staticEval - (ss-2)->staticEval
771 : (ss-4)->staticEval != VALUE_NONE ? ss->staticEval - (ss-4)->staticEval
773 improving = improvement > 0;
775 // Step 7. Razoring (~1 Elo).
776 // If eval is really low check with qsearch if it can exceed alpha, if it can't,
777 // return a fail low.
778 if (eval < alpha - 394 - 255 * depth * depth)
780 value = qsearch<NonPV>(pos, ss, alpha - 1, alpha);
785 // Step 8. Futility pruning: child node (~40 Elo).
786 // The depth condition is important for mate finding.
789 && eval - futility_margin(depth, improving) - (ss-1)->statScore / 304 >= beta
791 && eval < 28580) // larger than VALUE_KNOWN_WIN, but smaller than TB wins
794 // Step 9. Null move search with verification search (~35 Elo)
796 && (ss-1)->currentMove != MOVE_NULL
797 && (ss-1)->statScore < 18200
799 && eval >= ss->staticEval
800 && ss->staticEval >= beta - 20 * depth - improvement / 14 + 235 + complexity / 24
802 && pos.non_pawn_material(us)
803 && (ss->ply >= thisThread->nmpMinPly || us != thisThread->nmpColor))
805 assert(eval - beta >= 0);
807 // Null move dynamic reduction based on depth, eval and complexity of position
808 Depth R = std::min(int(eval - beta) / 165, 6) + depth / 3 + 4 - (complexity > 800);
810 ss->currentMove = MOVE_NULL;
811 ss->continuationHistory = &thisThread->continuationHistory[0][0][NO_PIECE][0];
813 pos.do_null_move(st);
815 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
817 pos.undo_null_move();
819 if (nullValue >= beta)
821 // Do not return unproven mate or TB scores
822 if (nullValue >= VALUE_TB_WIN_IN_MAX_PLY)
825 if (thisThread->nmpMinPly || (abs(beta) < VALUE_KNOWN_WIN && depth < 14))
828 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
830 // Do verification search at high depths, with null move pruning disabled
831 // for us, until ply exceeds nmpMinPly.
832 thisThread->nmpMinPly = ss->ply + 3 * (depth-R) / 4;
833 thisThread->nmpColor = us;
835 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
837 thisThread->nmpMinPly = 0;
844 probCutBeta = beta + 180 - 54 * improving;
846 // Step 10. ProbCut (~10 Elo)
847 // If we have a good enough capture and a reduced search returns a value
848 // much above beta, we can (almost) safely prune the previous move.
851 && abs(beta) < VALUE_TB_WIN_IN_MAX_PLY
852 // if value from transposition table is lower than probCutBeta, don't attempt probCut
853 // there and in further interactions with transposition table cutoff depth is set to depth - 3
854 // because probCut search has depth set to depth - 4 but we also do a move before it
855 // so effective depth is equal to depth - 3
857 && tte->depth() >= depth - 3
858 && ttValue != VALUE_NONE
859 && ttValue < probCutBeta))
861 assert(probCutBeta < VALUE_INFINITE);
863 MovePicker mp(pos, ttMove, probCutBeta - ss->staticEval, &captureHistory);
865 while ((move = mp.next_move()) != MOVE_NONE)
866 if (move != excludedMove && pos.legal(move))
868 assert(pos.capture(move) || promotion_type(move) == QUEEN);
870 ss->currentMove = move;
871 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
873 [pos.moved_piece(move)]
876 pos.do_move(move, st);
878 // Perform a preliminary qsearch to verify that the move holds
879 value = -qsearch<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1);
881 // If the qsearch held, perform the regular search
882 if (value >= probCutBeta)
883 value = -search<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1, depth - 4, !cutNode);
887 if (value >= probCutBeta)
889 // Save ProbCut data into transposition table
890 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, BOUND_LOWER, depth - 3, move, ss->staticEval);
896 // Step 11. If the position is not in TT, decrease depth by 3.
897 // Use qsearch if depth is equal or below zero (~9 Elo)
903 return qsearch<PV>(pos, ss, alpha, beta);
910 moves_loop: // When in check, search starts here
912 // Step 12. A small Probcut idea, when we are in check (~4 Elo)
913 probCutBeta = beta + 402;
918 && (tte->bound() & BOUND_LOWER)
919 && tte->depth() >= depth - 3
920 && ttValue >= probCutBeta
921 && abs(ttValue) <= VALUE_KNOWN_WIN
922 && abs(beta) <= VALUE_KNOWN_WIN
927 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
928 nullptr , (ss-4)->continuationHistory,
929 nullptr , (ss-6)->continuationHistory };
931 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
933 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
940 moveCountPruning = singularQuietLMR = false;
942 // Indicate PvNodes that will probably fail low if the node was searched
943 // at a depth equal or greater than the current depth, and the result of this search was a fail low.
944 bool likelyFailLow = PvNode
946 && (tte->bound() & BOUND_UPPER)
947 && tte->depth() >= depth;
949 // Step 13. Loop through all pseudo-legal moves until no moves remain
950 // or a beta cutoff occurs.
951 while ((move = mp.next_move(moveCountPruning)) != MOVE_NONE)
955 if (move == excludedMove)
958 // At root obey the "searchmoves" option and skip moves not listed in Root
959 // Move List. As a consequence any illegal move is also skipped. In MultiPV
960 // mode we also skip PV moves which have been already searched and those
961 // of lower "TB rank" if we are in a TB root position.
962 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
963 thisThread->rootMoves.begin() + thisThread->pvLast, move))
966 // Check for legality
967 if (!rootNode && !pos.legal(move))
970 ss->moveCount = ++moveCount;
972 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
973 sync_cout << "info depth " << depth
974 << " currmove " << UCI::move(move, pos.is_chess960())
975 << " currmovenumber " << moveCount + thisThread->pvIdx << sync_endl;
977 (ss+1)->pv = nullptr;
980 capture = pos.capture(move);
981 movedPiece = pos.moved_piece(move);
982 givesCheck = pos.gives_check(move);
984 // Calculate new depth for this move
985 newDepth = depth - 1;
987 Value delta = beta - alpha;
989 // Step 14. Pruning at shallow depth (~120 Elo). Depth conditions are important for mate finding.
991 && pos.non_pawn_material(us)
992 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY)
994 // Skip quiet moves if movecount exceeds our FutilityMoveCount threshold (~8 Elo)
995 moveCountPruning = moveCount >= futility_move_count(improving, depth);
997 // Reduced depth of the next LMR search
998 int lmrDepth = std::max(newDepth - reduction(improving, depth, moveCount, delta, thisThread->rootDelta), 0);
1003 // Futility pruning for captures (~2 Elo)
1008 && ss->staticEval + 185 + 203 * lmrDepth + PieceValue[EG][pos.piece_on(to_sq(move))]
1009 + captureHistory[movedPiece][to_sq(move)][type_of(pos.piece_on(to_sq(move)))] / 6 < alpha)
1012 // SEE based pruning (~11 Elo)
1013 if (!pos.see_ge(move, Value(-220) * depth))
1018 int history = (*contHist[0])[movedPiece][to_sq(move)]
1019 + (*contHist[1])[movedPiece][to_sq(move)]
1020 + (*contHist[3])[movedPiece][to_sq(move)];
1022 // Continuation history based pruning (~2 Elo)
1024 && history < -4180 * (depth - 1))
1027 history += 2 * thisThread->mainHistory[us][from_to(move)];
1029 // Futility pruning: parent node (~13 Elo)
1032 && ss->staticEval + 103 + 136 * lmrDepth + history / 53 <= alpha)
1035 // Prune moves with negative SEE (~4 Elo)
1036 if (!pos.see_ge(move, Value(-25 * lmrDepth * lmrDepth - 16 * lmrDepth)))
1041 // Step 15. Extensions (~100 Elo)
1042 // We take care to not overdo to avoid search getting stuck.
1043 if (ss->ply < thisThread->rootDepth * 2)
1045 // Singular extension search (~94 Elo). If all moves but one fail low on a
1046 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
1047 // then that move is singular and should be extended. To verify this we do
1048 // a reduced search on all the other moves but the ttMove and if the
1049 // result is lower than ttValue minus a margin, then we will extend the ttMove.
1051 && depth >= 4 - (thisThread->previousDepth > 24) + 2 * (PvNode && tte->is_pv())
1053 && !excludedMove // Avoid recursive singular search
1054 /* && ttValue != VALUE_NONE Already implicit in the next condition */
1055 && abs(ttValue) < VALUE_KNOWN_WIN
1056 && (tte->bound() & BOUND_LOWER)
1057 && tte->depth() >= depth - 3)
1059 Value singularBeta = ttValue - (3 + (ss->ttPv && !PvNode)) * depth;
1060 Depth singularDepth = (depth - 1) / 2;
1062 ss->excludedMove = move;
1063 value = search<NonPV>(pos, ss, singularBeta - 1, singularBeta, singularDepth, cutNode);
1064 ss->excludedMove = MOVE_NONE;
1066 if (value < singularBeta)
1069 singularQuietLMR = !ttCapture;
1071 // Avoid search explosion by limiting the number of double extensions
1073 && value < singularBeta - 25
1074 && ss->doubleExtensions <= 10)
1077 depth += depth < 12;
1081 // Multi-cut pruning
1082 // Our ttMove is assumed to fail high, and now we failed high also on a reduced
1083 // search without the ttMove. So we assume this expected Cut-node is not singular,
1084 // that multiple moves fail high, and we can prune the whole subtree by returning
1086 else if (singularBeta >= beta)
1087 return singularBeta;
1089 // If the eval of ttMove is greater than beta, we reduce it (negative extension)
1090 else if (ttValue >= beta)
1093 // If the eval of ttMove is less than alpha and value, we reduce it (negative extension)
1094 else if (ttValue <= alpha && ttValue <= value)
1098 // Check extensions (~1 Elo)
1099 else if ( givesCheck
1101 && abs(ss->staticEval) > 78)
1104 // Quiet ttMove extensions (~1 Elo)
1107 && move == ss->killers[0]
1108 && (*contHist[0])[movedPiece][to_sq(move)] >= 5600)
1112 // Add extension to new depth
1113 newDepth += extension;
1114 ss->doubleExtensions = (ss-1)->doubleExtensions + (extension == 2);
1116 // Speculative prefetch as early as possible
1117 prefetch(TT.first_entry(pos.key_after(move)));
1119 // Update the current move (this must be done after singular extension search)
1120 ss->currentMove = move;
1121 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1126 // Step 16. Make the move
1127 pos.do_move(move, st, givesCheck);
1129 Depth r = reduction(improving, depth, moveCount, delta, thisThread->rootDelta);
1131 // Decrease reduction if position is or has been on the PV
1132 // and node is not likely to fail low. (~3 Elo)
1137 // Decrease reduction if opponent's move count is high (~1 Elo)
1138 if ((ss-1)->moveCount > 7)
1141 // Increase reduction for cut nodes (~3 Elo)
1145 // Increase reduction if ttMove is a capture (~3 Elo)
1149 // Decrease reduction for PvNodes based on depth
1151 r -= 1 + 11 / (3 + depth);
1153 // Decrease reduction if ttMove has been singularly extended (~1 Elo)
1154 if (singularQuietLMR)
1157 // Decrease reduction if we move a threatened piece (~1 Elo)
1159 && (mp.threatenedPieces & from_sq(move)))
1162 // Increase reduction if next ply has a lot of fail high
1163 if ((ss+1)->cutoffCnt > 3)
1166 ss->statScore = 2 * thisThread->mainHistory[us][from_to(move)]
1167 + (*contHist[0])[movedPiece][to_sq(move)]
1168 + (*contHist[1])[movedPiece][to_sq(move)]
1169 + (*contHist[3])[movedPiece][to_sq(move)]
1172 // Decrease/increase reduction for moves with a good/bad history (~30 Elo)
1173 r -= ss->statScore / (12800 + 4410 * (depth > 7 && depth < 19));
1175 // Step 17. Late moves reduction / extension (LMR, ~117 Elo)
1176 // We use various heuristics for the sons of a node after the first son has
1177 // been searched. In general we would like to reduce them, but there are many
1178 // cases where we extend a son if it has good chances to be "interesting".
1180 && moveCount > 1 + (PvNode && ss->ply <= 1)
1183 || (cutNode && (ss-1)->moveCount > 1)))
1185 // In general we want to cap the LMR depth search at newDepth, but when
1186 // reduction is negative, we allow this move a limited search extension
1187 // beyond the first move depth. This may lead to hidden double extensions.
1188 Depth d = std::clamp(newDepth - r, 1, newDepth + 1);
1190 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1192 // Do full depth search when reduced LMR search fails high
1193 if (value > alpha && d < newDepth)
1195 // Adjust full depth search based on LMR results - if result
1196 // was good enough search deeper, if it was bad enough search shallower
1197 const bool doDeeperSearch = value > (alpha + 66 + 11 * (newDepth - d));
1198 const bool doEvenDeeperSearch = value > alpha + 582 && ss->doubleExtensions <= 5;
1199 const bool doShallowerSearch = value < bestValue + newDepth;
1201 ss->doubleExtensions = ss->doubleExtensions + doEvenDeeperSearch;
1203 newDepth += doDeeperSearch - doShallowerSearch + doEvenDeeperSearch;
1206 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1208 int bonus = value > alpha ? stat_bonus(newDepth)
1209 : -stat_bonus(newDepth);
1214 update_continuation_histories(ss, movedPiece, to_sq(move), bonus);
1218 // Step 18. Full depth search when LMR is skipped. If expected reduction is high, reduce its depth by 1.
1219 else if (!PvNode || moveCount > 1)
1221 // Increase reduction for cut nodes and not ttMove (~1 Elo)
1222 if (!ttMove && cutNode)
1225 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth - (r > 4), !cutNode);
1228 // For PV nodes only, do a full PV search on the first move or after a fail
1229 // high (in the latter case search only if value < beta), otherwise let the
1230 // parent node fail low with value <= alpha and try another move.
1231 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1234 (ss+1)->pv[0] = MOVE_NONE;
1236 value = -search<PV>(pos, ss+1, -beta, -alpha,
1237 std::min(maxNextDepth, newDepth), false);
1240 // Step 19. Undo move
1241 pos.undo_move(move);
1243 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1245 // Step 20. Check for a new best move
1246 // Finished searching the move. If a stop occurred, the return value of
1247 // the search cannot be trusted, and we return immediately without
1248 // updating best move, PV and TT.
1249 if (Threads.stop.load(std::memory_order_relaxed))
1254 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1255 thisThread->rootMoves.end(), move);
1257 rm.averageScore = rm.averageScore != -VALUE_INFINITE ? (2 * value + rm.averageScore) / 3 : value;
1259 // PV move or new best move?
1260 if (moveCount == 1 || value > alpha)
1262 rm.score = rm.uciScore = value;
1263 rm.selDepth = thisThread->selDepth;
1264 rm.scoreLowerbound = rm.scoreUpperbound = false;
1266 if (value >= beta) {
1267 rm.scoreLowerbound = true;
1270 else if (value <= alpha) {
1271 rm.scoreUpperbound = true;
1272 rm.uciScore = alpha;
1278 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1279 rm.pv.push_back(*m);
1281 // We record how often the best move has been changed in each iteration.
1282 // This information is used for time management. In MultiPV mode,
1283 // we must take care to only do this for the first PV line.
1285 && !thisThread->pvIdx)
1286 ++thisThread->bestMoveChanges;
1289 // All other moves but the PV are set to the lowest value: this
1290 // is not a problem when sorting because the sort is stable and the
1291 // move position in the list is preserved - just the PV is pushed up.
1292 rm.score = -VALUE_INFINITE;
1295 if (value > bestValue)
1303 if (PvNode && !rootNode) // Update pv even in fail-high case
1304 update_pv(ss->pv, move, (ss+1)->pv);
1306 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1310 // Reduce other moves if we have found at least one score improvement
1313 && beta < VALUE_KNOWN_WIN
1314 && alpha > -VALUE_KNOWN_WIN)
1322 assert(value >= beta); // Fail high
1329 // If the move is worse than some previously searched move, remember it to update its stats later
1330 if (move != bestMove)
1332 if (capture && captureCount < 32)
1333 capturesSearched[captureCount++] = move;
1335 else if (!capture && quietCount < 64)
1336 quietsSearched[quietCount++] = move;
1340 // The following condition would detect a stop only after move loop has been
1341 // completed. But in this case bestValue is valid because we have fully
1342 // searched our subtree, and we can anyhow save the result in TT.
1348 // Step 21. Check for mate and stalemate
1349 // All legal moves have been searched and if there are no legal moves, it
1350 // must be a mate or a stalemate. If we are in a singular extension search then
1351 // return a fail low score.
1353 assert(moveCount || !ss->inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1356 bestValue = excludedMove ? alpha :
1357 ss->inCheck ? mated_in(ss->ply)
1360 // If there is a move which produces search value greater than alpha we update stats of searched moves
1362 update_all_stats(pos, ss, bestMove, bestValue, beta, prevSq,
1363 quietsSearched, quietCount, capturesSearched, captureCount, depth);
1365 // Bonus for prior countermove that caused the fail low
1366 else if ( (depth >= 5 || PvNode || bestValue < alpha - 65 * depth)
1369 // Extra bonuses for PV/Cut nodes or bad fail lows
1370 int bonus = 1 + (PvNode || cutNode) + (bestValue < alpha - 88 * depth);
1371 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth) * bonus);
1375 bestValue = std::min(bestValue, maxValue);
1377 // If no good move is found and the previous position was ttPv, then the previous
1378 // opponent move is probably good and the new position is added to the search tree.
1379 if (bestValue <= alpha)
1380 ss->ttPv = ss->ttPv || ((ss-1)->ttPv && depth > 3);
1382 // Write gathered information in transposition table
1383 if (!excludedMove && !(rootNode && thisThread->pvIdx))
1384 tte->save(posKey, value_to_tt(bestValue, ss->ply), ss->ttPv,
1385 bestValue >= beta ? BOUND_LOWER :
1386 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1387 depth, bestMove, ss->staticEval);
1389 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1395 // qsearch() is the quiescence search function, which is called by the main search
1396 // function with zero depth, or recursively with further decreasing depth per call.
1398 template <NodeType nodeType>
1399 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1401 static_assert(nodeType != Root);
1402 constexpr bool PvNode = nodeType == PV;
1404 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1405 assert(PvNode || (alpha == beta - 1));
1410 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1414 Move ttMove, move, bestMove;
1416 Value bestValue, value, ttValue, futilityValue, futilityBase;
1417 bool pvHit, givesCheck, capture;
1423 ss->pv[0] = MOVE_NONE;
1426 Thread* thisThread = pos.this_thread();
1427 bestMove = MOVE_NONE;
1428 ss->inCheck = pos.checkers();
1431 // Check for an immediate draw or maximum ply reached
1432 if ( pos.is_draw(ss->ply)
1433 || ss->ply >= MAX_PLY)
1434 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos) : VALUE_DRAW;
1436 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1438 // Decide whether or not to include checks: this fixes also the type of
1439 // TT entry depth that we are going to use. Note that in qsearch we use
1440 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1441 ttDepth = ss->inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1442 : DEPTH_QS_NO_CHECKS;
1443 // Transposition table lookup
1445 tte = TT.probe(posKey, ss->ttHit);
1446 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
1447 ttMove = ss->ttHit ? tte->move() : MOVE_NONE;
1448 pvHit = ss->ttHit && tte->is_pv();
1452 && tte->depth() >= ttDepth
1453 && ttValue != VALUE_NONE // Only in case of TT access race
1454 && (tte->bound() & (ttValue >= beta ? BOUND_LOWER : BOUND_UPPER)))
1457 // Evaluate the position statically
1460 ss->staticEval = VALUE_NONE;
1461 bestValue = futilityBase = -VALUE_INFINITE;
1467 // Never assume anything about values stored in TT
1468 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1469 ss->staticEval = bestValue = evaluate(pos);
1471 // ttValue can be used as a better position evaluation (~13 Elo)
1472 if ( ttValue != VALUE_NONE
1473 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1474 bestValue = ttValue;
1477 // In case of null move search use previous static eval with a different sign
1478 ss->staticEval = bestValue =
1479 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1480 : -(ss-1)->staticEval;
1482 // Stand pat. Return immediately if static value is at least beta
1483 if (bestValue >= beta)
1485 // Save gathered info in transposition table
1487 tte->save(posKey, value_to_tt(bestValue, ss->ply), false, BOUND_LOWER,
1488 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1493 if (PvNode && bestValue > alpha)
1496 futilityBase = bestValue + 158;
1499 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
1500 nullptr , (ss-4)->continuationHistory,
1501 nullptr , (ss-6)->continuationHistory };
1503 // Initialize a MovePicker object for the current position, and prepare
1504 // to search the moves. Because the depth is <= 0 here, only captures,
1505 // queen promotions, and other checks (only if depth >= DEPTH_QS_CHECKS)
1506 // will be generated.
1507 Square prevSq = to_sq((ss-1)->currentMove);
1508 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
1509 &thisThread->captureHistory,
1513 int quietCheckEvasions = 0;
1515 // Loop through the moves until no moves remain or a beta cutoff occurs
1516 while ((move = mp.next_move()) != MOVE_NONE)
1518 assert(is_ok(move));
1520 // Check for legality
1521 if (!pos.legal(move))
1524 givesCheck = pos.gives_check(move);
1525 capture = pos.capture(move);
1529 // Futility pruning and moveCount pruning (~10 Elo)
1530 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1532 && to_sq(move) != prevSq
1533 && futilityBase > -VALUE_KNOWN_WIN
1534 && type_of(move) != PROMOTION)
1539 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1541 if (futilityValue <= alpha)
1543 bestValue = std::max(bestValue, futilityValue);
1547 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1549 bestValue = std::max(bestValue, futilityBase);
1554 // Do not search moves with negative SEE values (~5 Elo)
1555 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1556 && !pos.see_ge(move))
1559 // Speculative prefetch as early as possible
1560 prefetch(TT.first_entry(pos.key_after(move)));
1562 ss->currentMove = move;
1563 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1565 [pos.moved_piece(move)]
1568 // Continuation history based pruning (~3 Elo)
1570 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1571 && (*contHist[0])[pos.moved_piece(move)][to_sq(move)] < 0
1572 && (*contHist[1])[pos.moved_piece(move)][to_sq(move)] < 0)
1575 // We prune after 2nd quiet check evasion where being 'in check' is implicitly checked through the counter
1576 // and being a 'quiet' apart from being a tt move is assumed after an increment because captures are pushed ahead.
1577 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1578 && quietCheckEvasions > 1)
1581 quietCheckEvasions += !capture && ss->inCheck;
1583 // Make and search the move
1584 pos.do_move(move, st, givesCheck);
1585 value = -qsearch<nodeType>(pos, ss+1, -beta, -alpha, depth - 1);
1586 pos.undo_move(move);
1588 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1590 // Check for a new best move
1591 if (value > bestValue)
1599 if (PvNode) // Update pv even in fail-high case
1600 update_pv(ss->pv, move, (ss+1)->pv);
1602 if (PvNode && value < beta) // Update alpha here!
1610 // All legal moves have been searched. A special case: if we're in check
1611 // and no legal moves were found, it is checkmate.
1612 if (ss->inCheck && bestValue == -VALUE_INFINITE)
1614 assert(!MoveList<LEGAL>(pos).size());
1616 return mated_in(ss->ply); // Plies to mate from the root
1619 // Save gathered info in transposition table
1620 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1621 bestValue >= beta ? BOUND_LOWER : BOUND_UPPER,
1622 ttDepth, bestMove, ss->staticEval);
1624 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1630 // value_to_tt() adjusts a mate or TB score from "plies to mate from the root" to
1631 // "plies to mate from the current position". Standard scores are unchanged.
1632 // The function is called before storing a value in the transposition table.
1634 Value value_to_tt(Value v, int ply) {
1636 assert(v != VALUE_NONE);
1638 return v >= VALUE_TB_WIN_IN_MAX_PLY ? v + ply
1639 : v <= VALUE_TB_LOSS_IN_MAX_PLY ? v - ply : v;
1643 // value_from_tt() is the inverse of value_to_tt(): it adjusts a mate or TB score
1644 // from the transposition table (which refers to the plies to mate/be mated from
1645 // current position) to "plies to mate/be mated (TB win/loss) from the root". However,
1646 // for mate scores, to avoid potentially false mate scores related to the 50 moves rule
1647 // and the graph history interaction, we return an optimal TB score instead.
1649 Value value_from_tt(Value v, int ply, int r50c) {
1651 if (v == VALUE_NONE)
1654 if (v >= VALUE_TB_WIN_IN_MAX_PLY) // TB win or better
1656 if (v >= VALUE_MATE_IN_MAX_PLY && VALUE_MATE - v > 99 - r50c)
1657 return VALUE_MATE_IN_MAX_PLY - 1; // do not return a potentially false mate score
1662 if (v <= VALUE_TB_LOSS_IN_MAX_PLY) // TB loss or worse
1664 if (v <= VALUE_MATED_IN_MAX_PLY && VALUE_MATE + v > 99 - r50c)
1665 return VALUE_MATED_IN_MAX_PLY + 1; // do not return a potentially false mate score
1674 // update_pv() adds current move and appends child pv[]
1676 void update_pv(Move* pv, Move move, const Move* childPv) {
1678 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1684 // update_all_stats() updates stats at the end of search() when a bestMove is found
1686 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
1687 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth) {
1689 Color us = pos.side_to_move();
1690 Thread* thisThread = pos.this_thread();
1691 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
1692 Piece moved_piece = pos.moved_piece(bestMove);
1693 PieceType captured = type_of(pos.piece_on(to_sq(bestMove)));
1694 int bonus1 = stat_bonus(depth + 1);
1696 if (!pos.capture(bestMove))
1698 int bonus2 = bestValue > beta + 146 ? bonus1 // larger bonus
1699 : stat_bonus(depth); // smaller bonus
1701 // Increase stats for the best move in case it was a quiet move
1702 update_quiet_stats(pos, ss, bestMove, bonus2);
1704 // Decrease stats for all non-best quiet moves
1705 for (int i = 0; i < quietCount; ++i)
1707 thisThread->mainHistory[us][from_to(quietsSearched[i])] << -bonus2;
1708 update_continuation_histories(ss, pos.moved_piece(quietsSearched[i]), to_sq(quietsSearched[i]), -bonus2);
1712 // Increase stats for the best move in case it was a capture move
1713 captureHistory[moved_piece][to_sq(bestMove)][captured] << bonus1;
1715 // Extra penalty for a quiet early move that was not a TT move or
1716 // main killer move in previous ply when it gets refuted.
1717 if ( ((ss-1)->moveCount == 1 + (ss-1)->ttHit || ((ss-1)->currentMove == (ss-1)->killers[0]))
1718 && !pos.captured_piece())
1719 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -bonus1);
1721 // Decrease stats for all non-best capture moves
1722 for (int i = 0; i < captureCount; ++i)
1724 moved_piece = pos.moved_piece(capturesSearched[i]);
1725 captured = type_of(pos.piece_on(to_sq(capturesSearched[i])));
1726 captureHistory[moved_piece][to_sq(capturesSearched[i])][captured] << -bonus1;
1731 // update_continuation_histories() updates histories of the move pairs formed
1732 // by moves at ply -1, -2, -4, and -6 with current move.
1734 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1736 for (int i : {1, 2, 4, 6})
1738 // Only update first 2 continuation histories if we are in check
1739 if (ss->inCheck && i > 2)
1741 if (is_ok((ss-i)->currentMove))
1742 (*(ss-i)->continuationHistory)[pc][to] << bonus;
1747 // update_quiet_stats() updates move sorting heuristics
1749 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus) {
1752 if (ss->killers[0] != move)
1754 ss->killers[1] = ss->killers[0];
1755 ss->killers[0] = move;
1758 Color us = pos.side_to_move();
1759 Thread* thisThread = pos.this_thread();
1760 thisThread->mainHistory[us][from_to(move)] << bonus;
1761 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1763 // Update countermove history
1764 if (is_ok((ss-1)->currentMove))
1766 Square prevSq = to_sq((ss-1)->currentMove);
1767 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1771 // When playing with strength handicap, choose best move among a set of RootMoves
1772 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1774 Move Skill::pick_best(size_t multiPV) {
1776 const RootMoves& rootMoves = Threads.main()->rootMoves;
1777 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1779 // RootMoves are already sorted by score in descending order
1780 Value topScore = rootMoves[0].score;
1781 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1782 int maxScore = -VALUE_INFINITE;
1783 double weakness = 120 - 2 * level;
1785 // Choose best move. For each move score we add two terms, both dependent on
1786 // weakness. One is deterministic and bigger for weaker levels, and one is
1787 // random. Then we choose the move with the resulting highest score.
1788 for (size_t i = 0; i < multiPV; ++i)
1790 // This is our magic formula
1791 int push = int(( weakness * int(topScore - rootMoves[i].score)
1792 + delta * (rng.rand<unsigned>() % int(weakness))) / 128);
1794 if (rootMoves[i].score + push >= maxScore)
1796 maxScore = rootMoves[i].score + push;
1797 best = rootMoves[i].pv[0];
1807 /// MainThread::check_time() is used to print debug info and, more importantly,
1808 /// to detect when we are out of available time and thus stop the search.
1810 void MainThread::check_time() {
1815 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1816 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1818 static TimePoint lastInfoTime = now();
1820 TimePoint elapsed = Time.elapsed();
1821 TimePoint tick = Limits.startTime + elapsed;
1823 if (tick - lastInfoTime >= 1000)
1825 lastInfoTime = tick;
1829 // We should not stop pondering until told so by the GUI
1833 if ( (Limits.use_time_management() && (elapsed > Time.maximum() - 10 || stopOnPonderhit))
1834 || (Limits.movetime && elapsed >= Limits.movetime)
1835 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1836 Threads.stop = true;
1840 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1841 /// that all (if any) unsearched PV lines are sent using a previous search score.
1843 string UCI::pv(const Position& pos, Depth depth) {
1845 std::stringstream ss;
1846 TimePoint elapsed = Time.elapsed() + 1;
1847 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1848 size_t pvIdx = pos.this_thread()->pvIdx;
1849 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1850 uint64_t nodesSearched = Threads.nodes_searched();
1851 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1853 for (size_t i = 0; i < multiPV; ++i)
1855 bool updated = rootMoves[i].score != -VALUE_INFINITE;
1857 if (depth == 1 && !updated && i > 0)
1860 Depth d = updated ? depth : std::max(1, depth - 1);
1861 Value v = updated ? rootMoves[i].uciScore : rootMoves[i].previousScore;
1863 if (v == -VALUE_INFINITE)
1866 bool tb = TB::RootInTB && abs(v) < VALUE_MATE_IN_MAX_PLY;
1867 v = tb ? rootMoves[i].tbScore : v;
1869 if (ss.rdbuf()->in_avail()) // Not at first line
1874 << " seldepth " << rootMoves[i].selDepth
1875 << " multipv " << i + 1
1876 << " score " << UCI::value(v);
1878 if (Options["UCI_ShowWDL"])
1879 ss << UCI::wdl(v, pos.game_ply());
1881 if (i == pvIdx && !tb && updated) // tablebase- and previous-scores are exact
1882 ss << (rootMoves[i].scoreLowerbound ? " lowerbound" : (rootMoves[i].scoreUpperbound ? " upperbound" : ""));
1884 ss << " nodes " << nodesSearched
1885 << " nps " << nodesSearched * 1000 / elapsed
1886 << " hashfull " << TT.hashfull()
1887 << " tbhits " << tbHits
1888 << " time " << elapsed
1891 for (Move m : rootMoves[i].pv)
1892 ss << " " << UCI::move(m, pos.is_chess960());
1899 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1900 /// before exiting the search, for instance, in case we stop the search during a
1901 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1902 /// otherwise in case of 'ponder on' we have nothing to think on.
1904 bool RootMove::extract_ponder_from_tt(Position& pos) {
1907 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1911 assert(pv.size() == 1);
1913 if (pv[0] == MOVE_NONE)
1916 pos.do_move(pv[0], st);
1917 TTEntry* tte = TT.probe(pos.key(), ttHit);
1921 Move m = tte->move(); // Local copy to be SMP safe
1922 if (MoveList<LEGAL>(pos).contains(m))
1926 pos.undo_move(pv[0]);
1927 return pv.size() > 1;
1930 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1933 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1934 ProbeDepth = int(Options["SyzygyProbeDepth"]);
1935 Cardinality = int(Options["SyzygyProbeLimit"]);
1936 bool dtz_available = true;
1938 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1939 // ProbeDepth == DEPTH_ZERO
1940 if (Cardinality > MaxCardinality)
1942 Cardinality = MaxCardinality;
1946 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1948 // Rank moves using DTZ tables
1949 RootInTB = root_probe(pos, rootMoves);
1953 // DTZ tables are missing; try to rank moves using WDL tables
1954 dtz_available = false;
1955 RootInTB = root_probe_wdl(pos, rootMoves);
1961 // Sort moves according to TB rank
1962 std::stable_sort(rootMoves.begin(), rootMoves.end(),
1963 [](const RootMove &a, const RootMove &b) { return a.tbRank > b.tbRank; } );
1965 // Probe during search only if DTZ is not available and we are winning
1966 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
1971 // Clean up if root_probe() and root_probe_wdl() have failed
1972 for (auto& m : rootMoves)
1977 } // namespace Stockfish