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/>.
28 #include <initializer_list>
39 #include "nnue/evaluate_nnue.h"
40 #include "nnue/nnue_common.h"
42 #include "syzygy/tbprobe.h"
55 namespace Tablebases {
63 namespace TB = Tablebases;
67 using namespace Search;
71 // Different node types, used as a template parameter
79 Value futility_margin(Depth d, bool noTtCutNode, bool improving) {
80 return Value((125 - 43 * noTtCutNode) * (d - improving));
83 // Reductions lookup table initialized at startup
84 int Reductions[MAX_MOVES]; // [depth or moveNumber]
86 Depth reduction(bool i, Depth d, int mn, Value delta, Value rootDelta) {
87 int reductionScale = Reductions[d] * Reductions[mn];
88 return (reductionScale + 1487 - int(delta) * 976 / int(rootDelta)) / 1024
89 + (!i && reductionScale > 808);
92 constexpr int futility_move_count(bool improving, Depth depth) {
93 return improving ? (3 + depth * depth) : (3 + depth * depth) / 2;
96 // History and stats update bonus, based on depth
97 int stat_bonus(Depth d) { return std::min(357 * d - 483, 1511); }
99 // Add a small random component to draw evaluations to avoid 3-fold blindness
100 Value value_draw(const Thread* thisThread) {
101 return VALUE_DRAW - 1 + Value(thisThread->nodes & 0x2);
104 // Skill structure is used to implement strength limit. If we have a UCI_Elo,
105 // we convert it to an appropriate skill level, anchored to the Stash engine.
106 // This method is based on a fit of the Elo results for games played between
107 // Stockfish at various skill levels and various versions of the Stash engine.
108 // Skill 0 .. 19 now covers CCRL Blitz Elo from 1320 to 3190, approximately
109 // Reference: https://github.com/vondele/Stockfish/commit/a08b8d4e9711c2
111 Skill(int skill_level, int uci_elo) {
114 double e = double(uci_elo - 1320) / (3190 - 1320);
115 level = std::clamp((((37.2473 * e - 40.8525) * e + 22.2943) * e - 0.311438), 0.0, 19.0);
118 level = double(skill_level);
120 bool enabled() const { return level < 20.0; }
121 bool time_to_pick(Depth depth) const { return depth == 1 + int(level); }
122 Move pick_best(size_t multiPV);
125 Move best = MOVE_NONE;
128 template<NodeType nodeType>
129 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
131 template<NodeType nodeType>
132 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = 0);
134 Value value_to_tt(Value v, int ply);
135 Value value_from_tt(Value v, int ply, int r50c);
136 void update_pv(Move* pv, Move move, const Move* childPv);
137 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
138 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus);
139 void update_all_stats(const Position& pos,
145 Move* quietsSearched,
147 Move* capturesSearched,
151 // Utility to verify move generation. All the leaf nodes up
152 // to the given depth are generated and counted, and the sum is returned.
154 uint64_t perft(Position& pos, Depth depth) {
157 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
159 uint64_t cnt, nodes = 0;
160 const bool leaf = (depth == 2);
162 for (const auto& m : MoveList<LEGAL>(pos))
164 if (Root && depth <= 1)
169 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - 1);
174 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
182 // Called at startup to initialize various lookup tables
183 void Search::init() {
185 for (int i = 1; i < MAX_MOVES; ++i)
186 Reductions[i] = int((20.37 + std::log(Threads.size()) / 2) * std::log(i));
190 // Resets search state to its initial value
191 void Search::clear() {
193 Threads.main()->wait_for_search_finished();
195 Time.availableNodes = 0;
198 Tablebases::init(Options["SyzygyPath"]); // Free mapped files
202 // Called when the program receives the UCI 'go'
203 // command. It searches from the root position and outputs the "bestmove".
204 void MainThread::search() {
208 nodes = perft<true>(rootPos, Limits.perft);
209 sync_cout << "\nNodes searched: " << nodes << "\n" << sync_endl;
213 Color us = rootPos.side_to_move();
214 Time.init(Limits, us, rootPos.game_ply());
217 Eval::NNUE::verify();
219 if (rootMoves.empty())
221 rootMoves.emplace_back(MOVE_NONE);
222 sync_cout << "info depth 0 score "
223 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW) << sync_endl;
227 Threads.start_searching(); // start non-main threads
228 Thread::search(); // main thread start searching
231 // When we reach the maximum depth, we can arrive here without a raise of
232 // Threads.stop. However, if we are pondering or in an infinite search,
233 // the UCI protocol states that we shouldn't print the best move before the
234 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
235 // until the GUI sends one of those commands.
237 while (!Threads.stop && (ponder || Limits.infinite))
238 {} // Busy wait for a stop or a ponder reset
240 // Stop the threads if not already stopped (also raise the stop if
241 // "ponderhit" just reset Threads.ponder).
244 // Wait until all threads have finished
245 Threads.wait_for_search_finished();
247 // When playing in 'nodes as time' mode, subtract the searched nodes from
248 // the available ones before exiting.
250 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
252 Thread* bestThread = this;
254 Skill(Options["Skill Level"], Options["UCI_LimitStrength"] ? int(Options["UCI_Elo"]) : 0);
256 if (int(Options["MultiPV"]) == 1 && !Limits.depth && !skill.enabled()
257 && rootMoves[0].pv[0] != MOVE_NONE)
258 bestThread = Threads.get_best_thread();
260 bestPreviousScore = bestThread->rootMoves[0].score;
261 bestPreviousAverageScore = bestThread->rootMoves[0].averageScore;
263 // Send again PV info if we have a new best thread
264 if (bestThread != this)
265 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth) << sync_endl;
267 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
269 if (bestThread->rootMoves[0].pv.size() > 1
270 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
271 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
273 std::cout << sync_endl;
277 // Main iterative deepening loop. It calls search()
278 // repeatedly with increasing depth until the allocated thinking time has been
279 // consumed, the user stops the search, or the maximum search depth is reached.
280 void Thread::search() {
282 // Allocate stack with extra size to allow access from (ss - 7) to (ss + 2):
283 // (ss - 7) is needed for update_continuation_histories(ss - 1) which accesses (ss - 6),
284 // (ss + 2) is needed for initialization of cutOffCnt and killers.
285 Stack stack[MAX_PLY + 10], *ss = stack + 7;
286 Move pv[MAX_PLY + 1];
287 Value alpha, beta, delta;
288 Move lastBestMove = MOVE_NONE;
289 Depth lastBestMoveDepth = 0;
290 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
291 double timeReduction = 1, totBestMoveChanges = 0;
292 Color us = rootPos.side_to_move();
295 std::memset(ss - 7, 0, 10 * sizeof(Stack));
296 for (int i = 7; i > 0; --i)
298 (ss - i)->continuationHistory =
299 &this->continuationHistory[0][0][NO_PIECE][0]; // Use as a sentinel
300 (ss - i)->staticEval = VALUE_NONE;
303 for (int i = 0; i <= MAX_PLY + 2; ++i)
308 bestValue = -VALUE_INFINITE;
312 if (mainThread->bestPreviousScore == VALUE_INFINITE)
313 for (int i = 0; i < 4; ++i)
314 mainThread->iterValue[i] = VALUE_ZERO;
316 for (int i = 0; i < 4; ++i)
317 mainThread->iterValue[i] = mainThread->bestPreviousScore;
320 size_t multiPV = size_t(Options["MultiPV"]);
321 Skill skill(Options["Skill Level"], Options["UCI_LimitStrength"] ? int(Options["UCI_Elo"]) : 0);
323 // When playing with strength handicap enable MultiPV search that we will
324 // use behind-the-scenes to retrieve a set of possible moves.
326 multiPV = std::max(multiPV, size_t(4));
328 multiPV = std::min(multiPV, rootMoves.size());
330 int searchAgainCounter = 0;
332 // Iterative deepening loop until requested to stop or the target depth is reached
333 while (++rootDepth < MAX_PLY && !Threads.stop
334 && !(Limits.depth && mainThread && rootDepth > Limits.depth))
336 // Age out PV variability metric
338 totBestMoveChanges /= 2;
340 // Save the last iteration's scores before the first PV line is searched and
341 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
342 for (RootMove& rm : rootMoves)
343 rm.previousScore = rm.score;
348 if (!Threads.increaseDepth)
349 searchAgainCounter++;
351 // MultiPV loop. We perform a full root search for each PV line
352 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
357 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
358 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
362 // Reset UCI info selDepth for each depth and each PV line
365 // Reset aspiration window starting size
366 Value avg = rootMoves[pvIdx].averageScore;
367 delta = Value(10) + int(avg) * avg / 17470;
368 alpha = std::max(avg - delta, -VALUE_INFINITE);
369 beta = std::min(avg + delta, VALUE_INFINITE);
371 // Adjust optimism based on root move's averageScore (~4 Elo)
372 int opt = 113 * avg / (std::abs(avg) + 109);
373 optimism[us] = Value(opt);
374 optimism[~us] = -optimism[us];
376 // Start with a small aspiration window and, in the case of a fail
377 // high/low, re-search with a bigger window until we don't fail
379 int failedHighCnt = 0;
382 // Adjust the effective depth searched, but ensure at least one effective increment
383 // for every four searchAgain steps (see issue #2717).
384 Depth adjustedDepth =
385 std::max(1, rootDepth - failedHighCnt - 3 * (searchAgainCounter + 1) / 4);
386 bestValue = Stockfish::search<Root>(rootPos, ss, alpha, beta, adjustedDepth, false);
388 // Bring the best move to the front. It is critical that sorting
389 // is done with a stable algorithm because all the values but the
390 // first and eventually the new best one is set to -VALUE_INFINITE
391 // and we want to keep the same order for all the moves except the
392 // new PV that goes to the front. Note that in the case of MultiPV
393 // search the already searched PV lines are preserved.
394 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
396 // If search has been stopped, we break immediately. Sorting is
397 // safe because RootMoves is still valid, although it refers to
398 // the previous iteration.
402 // When failing high/low give some update (without cluttering
403 // the UI) before a re-search.
404 if (mainThread && multiPV == 1 && (bestValue <= alpha || bestValue >= beta)
405 && Time.elapsed() > 3000)
406 sync_cout << UCI::pv(rootPos, rootDepth) << sync_endl;
408 // In case of failing low/high increase aspiration window and
409 // re-search, otherwise exit the loop.
410 if (bestValue <= alpha)
412 beta = (alpha + beta) / 2;
413 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
417 mainThread->stopOnPonderhit = false;
419 else if (bestValue >= beta)
421 beta = std::min(bestValue + delta, VALUE_INFINITE);
429 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
432 // Sort the PV lines searched so far and update the GUI
433 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
435 if (mainThread && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
436 sync_cout << UCI::pv(rootPos, rootDepth) << sync_endl;
440 completedDepth = rootDepth;
442 if (rootMoves[0].pv[0] != lastBestMove)
444 lastBestMove = rootMoves[0].pv[0];
445 lastBestMoveDepth = rootDepth;
448 // Have we found a "mate in x"?
449 if (Limits.mate && bestValue >= VALUE_MATE_IN_MAX_PLY
450 && VALUE_MATE - bestValue <= 2 * Limits.mate)
456 // If the 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() && !Threads.stop && !mainThread->stopOnPonderhit)
470 double fallingEval = (66 + 14 * (mainThread->bestPreviousAverageScore - bestValue)
471 + 6 * (mainThread->iterValue[iterIdx] - bestValue))
473 fallingEval = std::clamp(fallingEval, 0.5, 1.5);
475 // If the bestMove is stable over several iterations, reduce time accordingly
476 timeReduction = lastBestMoveDepth + 8 < completedDepth ? 1.56 : 0.69;
477 double reduction = (1.4 + mainThread->previousTimeReduction) / (2.03 * timeReduction);
478 double bestMoveInstability = 1 + 1.79 * totBestMoveChanges / Threads.size();
480 double totalTime = Time.optimum() * fallingEval * reduction * bestMoveInstability;
482 // Cap used time in case of a single legal move for a better viewer experience
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 && Time.elapsed() > totalTime * 0.50)
497 Threads.increaseDepth = false;
499 Threads.increaseDepth = true;
502 mainThread->iterValue[iterIdx] = bestValue;
503 iterIdx = (iterIdx + 1) & 3;
509 mainThread->previousTimeReduction = timeReduction;
511 // If the skill level is enabled, swap the best PV line with the sub-optimal one
513 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
514 skill.best ? skill.best : skill.pick_best(multiPV)));
520 // Main search function for both PV and non-PV nodes
521 template<NodeType nodeType>
522 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
524 constexpr bool PvNode = nodeType != NonPV;
525 constexpr bool rootNode = nodeType == Root;
527 // Dive into quiescence search when the depth reaches zero
529 return qsearch < PvNode ? PV : NonPV > (pos, ss, alpha, beta);
531 // Check if we have an upcoming move that draws by repetition, or
532 // if the opponent had an alternative move earlier to this position.
533 if (!rootNode && alpha < VALUE_DRAW && pos.has_game_cycle(ss->ply))
535 alpha = value_draw(pos.this_thread());
540 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
541 assert(PvNode || (alpha == beta - 1));
542 assert(0 < depth && depth < MAX_PLY);
543 assert(!(PvNode && cutNode));
545 Move pv[MAX_PLY + 1], capturesSearched[32], quietsSearched[32];
547 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
551 Move ttMove, move, excludedMove, bestMove;
552 Depth extension, newDepth;
553 Value bestValue, value, ttValue, eval, maxValue, probCutBeta;
554 bool givesCheck, improving, priorCapture, singularQuietLMR;
555 bool capture, moveCountPruning, ttCapture;
557 int moveCount, captureCount, quietCount;
559 // Step 1. Initialize node
560 Thread* thisThread = pos.this_thread();
561 ss->inCheck = pos.checkers();
562 priorCapture = pos.captured_piece();
563 Color us = pos.side_to_move();
564 moveCount = captureCount = quietCount = ss->moveCount = 0;
565 bestValue = -VALUE_INFINITE;
566 maxValue = VALUE_INFINITE;
568 // Check for the available remaining time
569 if (thisThread == Threads.main())
570 static_cast<MainThread*>(thisThread)->check_time();
572 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
573 if (PvNode && thisThread->selDepth < ss->ply + 1)
574 thisThread->selDepth = ss->ply + 1;
578 // Step 2. Check for aborted search and immediate draw
579 if (Threads.stop.load(std::memory_order_relaxed) || pos.is_draw(ss->ply)
580 || ss->ply >= MAX_PLY)
581 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos)
582 : value_draw(pos.this_thread());
584 // Step 3. Mate distance pruning. Even if we mate at the next move our score
585 // would be at best mate_in(ss->ply + 1), but if alpha is already bigger because
586 // a shorter mate was found upward in the tree then there is no need to search
587 // because we will never beat the current alpha. Same logic but with reversed
588 // signs apply also in the opposite condition of being mated instead of giving
589 // mate. In this case, return a fail-high score.
590 alpha = std::max(mated_in(ss->ply), alpha);
591 beta = std::min(mate_in(ss->ply + 1), beta);
596 thisThread->rootDelta = beta - alpha;
598 assert(0 <= ss->ply && ss->ply < MAX_PLY);
600 (ss + 1)->excludedMove = bestMove = MOVE_NONE;
601 (ss + 2)->killers[0] = (ss + 2)->killers[1] = MOVE_NONE;
602 (ss + 2)->cutoffCnt = 0;
603 ss->doubleExtensions = (ss - 1)->doubleExtensions;
604 Square prevSq = is_ok((ss - 1)->currentMove) ? to_sq((ss - 1)->currentMove) : SQ_NONE;
607 // Step 4. Transposition table lookup.
608 excludedMove = ss->excludedMove;
610 tte = TT.probe(posKey, ss->ttHit);
611 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
612 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
613 : ss->ttHit ? tte->move()
615 ttCapture = ttMove && pos.capture_stage(ttMove);
617 // At this point, if excluded, skip straight to step 6, static eval. However,
618 // to save indentation, we list the condition in all code between here and there.
620 ss->ttPv = PvNode || (ss->ttHit && tte->is_pv());
622 // At non-PV nodes we check for an early TT cutoff
623 if (!PvNode && !excludedMove && tte->depth() > depth
624 && ttValue != VALUE_NONE // Possible in case of TT access race or if !ttHit
625 && (tte->bound() & (ttValue >= beta ? BOUND_LOWER : BOUND_UPPER)))
627 // If ttMove is quiet, update move sorting heuristics on TT hit (~2 Elo)
632 // Bonus for a quiet ttMove that fails high (~2 Elo)
634 update_quiet_stats(pos, ss, ttMove, stat_bonus(depth));
636 // Extra penalty for early quiet moves of
637 // the previous ply (~0 Elo on STC, ~2 Elo on LTC).
638 if (prevSq != SQ_NONE && (ss - 1)->moveCount <= 2 && !priorCapture)
639 update_continuation_histories(ss - 1, pos.piece_on(prevSq), prevSq,
640 -stat_bonus(depth + 1));
642 // Penalty for a quiet ttMove that fails low (~1 Elo)
645 int penalty = -stat_bonus(depth);
646 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
647 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
651 // Partial workaround for the graph history interaction problem
652 // For high rule50 counts don't produce transposition table cutoffs.
653 if (pos.rule50_count() < 90)
657 // Step 5. Tablebases probe
658 if (!rootNode && !excludedMove && TB::Cardinality)
660 int piecesCount = pos.count<ALL_PIECES>();
662 if (piecesCount <= TB::Cardinality
663 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth) && pos.rule50_count() == 0
664 && !pos.can_castle(ANY_CASTLING))
667 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
669 // Force check of time on the next occasion
670 if (thisThread == Threads.main())
671 static_cast<MainThread*>(thisThread)->callsCnt = 0;
673 if (err != TB::ProbeState::FAIL)
675 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
677 int drawScore = TB::UseRule50 ? 1 : 0;
679 // use the range VALUE_MATE_IN_MAX_PLY to VALUE_TB_WIN_IN_MAX_PLY to score
680 value = wdl < -drawScore ? VALUE_MATED_IN_MAX_PLY + ss->ply + 1
681 : wdl > drawScore ? VALUE_MATE_IN_MAX_PLY - ss->ply - 1
682 : VALUE_DRAW + 2 * wdl * drawScore;
684 Bound b = wdl < -drawScore ? BOUND_UPPER
685 : wdl > drawScore ? BOUND_LOWER
688 if (b == BOUND_EXACT || (b == BOUND_LOWER ? value >= beta : value <= alpha))
690 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, b,
691 std::min(MAX_PLY - 1, depth + 6), MOVE_NONE, VALUE_NONE);
698 if (b == BOUND_LOWER)
699 bestValue = value, alpha = std::max(alpha, bestValue);
707 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
709 // Step 6. Static evaluation of the position
712 // Skip early pruning when in check
713 ss->staticEval = eval = VALUE_NONE;
717 else if (excludedMove)
719 // Providing the hint that this node's accumulator will be used often
720 // brings significant Elo gain (~13 Elo).
721 Eval::NNUE::hint_common_parent_position(pos);
722 eval = ss->staticEval;
726 // Never assume anything about values stored in TT
727 ss->staticEval = eval = tte->eval();
728 if (eval == VALUE_NONE)
729 ss->staticEval = eval = evaluate(pos);
731 Eval::NNUE::hint_common_parent_position(pos);
733 // ttValue can be used as a better position evaluation (~7 Elo)
734 if (ttValue != VALUE_NONE && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
739 ss->staticEval = eval = evaluate(pos);
740 // Save static evaluation into the transposition table
741 tte->save(posKey, VALUE_NONE, ss->ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, eval);
744 // Use static evaluation difference to improve quiet move ordering (~4 Elo)
745 if (is_ok((ss - 1)->currentMove) && !(ss - 1)->inCheck && !priorCapture)
747 int bonus = std::clamp(-18 * int((ss - 1)->staticEval + ss->staticEval), -1812, 1812);
748 thisThread->mainHistory[~us][from_to((ss - 1)->currentMove)] << bonus;
751 // Set up the improving flag, which is true if current static evaluation is
752 // bigger than the previous static evaluation at our turn (if we were in
753 // check at our previous move we look at static evaluation at move prior to it
754 // and if we were in check at move prior to it flag is set to true) and is
755 // false otherwise. The improving flag is used in various pruning heuristics.
756 improving = (ss - 2)->staticEval != VALUE_NONE ? ss->staticEval > (ss - 2)->staticEval
757 : (ss - 4)->staticEval != VALUE_NONE ? ss->staticEval > (ss - 4)->staticEval
760 // Step 7. Razoring (~1 Elo)
761 // If eval is really low check with qsearch if it can exceed alpha, if it can't,
762 // return a fail low.
763 // Adjust razor margin according to cutoffCnt. (~1 Elo)
764 if (eval < alpha - 474 - (270 - 174 * ((ss + 1)->cutoffCnt > 3)) * depth * depth)
766 value = qsearch<NonPV>(pos, ss, alpha - 1, alpha);
769 if (!priorCapture && prevSq != SQ_NONE)
771 int bonus = (depth > 6) + (PvNode || cutNode) + (value < alpha - 658) + ((ss-1)->moveCount > 11);
772 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth) * bonus);
773 thisThread->mainHistory[~us][from_to((ss-1)->currentMove)] << stat_bonus(depth) * bonus * 57 / 100;
779 // Step 8. Futility pruning: child node (~40 Elo)
780 // The depth condition is important for mate finding.
781 if (!ss->ttPv && depth < 9
782 && eval - futility_margin(depth, cutNode && !ss->ttHit, improving)
783 - (ss - 1)->statScore / 321
785 && eval >= beta && eval < 29462 // smaller than TB wins
786 && (!ttMove || ttCapture))
789 // Step 9. Null move search with verification search (~35 Elo)
790 if (!PvNode && (ss - 1)->currentMove != MOVE_NULL && (ss - 1)->statScore < 17257 && eval >= beta
791 && eval >= ss->staticEval && ss->staticEval >= beta - 24 * depth + 281 && !excludedMove
792 && pos.non_pawn_material(us) && ss->ply >= thisThread->nmpMinPly
793 && beta > VALUE_TB_LOSS_IN_MAX_PLY)
795 assert(eval - beta >= 0);
797 // Null move dynamic reduction based on depth and eval
798 Depth R = std::min(int(eval - beta) / 152, 6) + depth / 3 + 4;
800 ss->currentMove = MOVE_NULL;
801 ss->continuationHistory = &thisThread->continuationHistory[0][0][NO_PIECE][0];
803 pos.do_null_move(st);
805 Value nullValue = -search<NonPV>(pos, ss + 1, -beta, -beta + 1, depth - R, !cutNode);
807 pos.undo_null_move();
809 // Do not return unproven mate or TB scores
810 if (nullValue >= beta && nullValue < VALUE_TB_WIN_IN_MAX_PLY)
812 if (thisThread->nmpMinPly || depth < 14)
815 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
817 // Do verification search at high depths, with null move pruning disabled
818 // until ply exceeds nmpMinPly.
819 thisThread->nmpMinPly = ss->ply + 3 * (depth - R) / 4;
821 Value v = search<NonPV>(pos, ss, beta - 1, beta, depth - R, false);
823 thisThread->nmpMinPly = 0;
830 // Step 10. If the position doesn't have a ttMove, decrease depth by 2,
831 // or by 4 if the TT entry for the current position was hit and
832 // the stored depth is greater than or equal to the current depth.
833 // Use qsearch if depth is equal or below zero (~9 Elo)
834 if (PvNode && !ttMove)
835 depth -= 2 + 2 * (ss->ttHit && tte->depth() >= depth);
838 return qsearch<PV>(pos, ss, alpha, beta);
840 if (cutNode && depth >= 8 && !ttMove)
843 probCutBeta = beta + 168 - 70 * improving;
845 // Step 11. ProbCut (~10 Elo)
846 // If we have a good enough capture (or queen promotion) and a reduced search returns a value
847 // much above beta, we can (almost) safely prune the previous move.
850 && abs(beta) < VALUE_TB_WIN_IN_MAX_PLY
851 // If value from transposition table is lower than probCutBeta, don't attempt probCut
852 // there and in further interactions with transposition table cutoff depth is set to depth - 3
853 // because probCut search has depth set to depth - 4 but we also do a move before it
854 // So effective depth is equal to depth - 3
855 && !(tte->depth() >= depth - 3 && ttValue != VALUE_NONE && ttValue < probCutBeta))
857 assert(probCutBeta < VALUE_INFINITE);
859 MovePicker mp(pos, ttMove, probCutBeta - ss->staticEval, &captureHistory,
860 thisThread->pawnHistory);
862 while ((move = mp.next_move()) != MOVE_NONE)
863 if (move != excludedMove && pos.legal(move))
865 assert(pos.capture_stage(move));
867 ss->currentMove = move;
868 ss->continuationHistory =
870 ->continuationHistory[ss->inCheck][true][pos.moved_piece(move)][to_sq(move)];
872 pos.do_move(move, st);
874 // Perform a preliminary qsearch to verify that the move holds
875 value = -qsearch<NonPV>(pos, ss + 1, -probCutBeta, -probCutBeta + 1);
877 // If the qsearch held, perform the regular search
878 if (value >= probCutBeta)
879 value = -search<NonPV>(pos, ss + 1, -probCutBeta, -probCutBeta + 1, depth - 4,
884 if (value >= probCutBeta)
886 // Save ProbCut data into transposition table
887 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, BOUND_LOWER, depth - 3,
888 move, ss->staticEval);
889 return value - (probCutBeta - beta);
893 Eval::NNUE::hint_common_parent_position(pos);
896 moves_loop: // When in check, search starts here
898 // Step 12. A small Probcut idea, when we are in check (~4 Elo)
899 probCutBeta = beta + 416;
900 if (ss->inCheck && !PvNode && ttCapture && (tte->bound() & BOUND_LOWER)
901 && tte->depth() >= depth - 4 && ttValue >= probCutBeta
902 && abs(ttValue) < VALUE_TB_WIN_IN_MAX_PLY && abs(beta) < VALUE_TB_WIN_IN_MAX_PLY)
905 const PieceToHistory* contHist[] = {(ss - 1)->continuationHistory,
906 (ss - 2)->continuationHistory,
907 (ss - 3)->continuationHistory,
908 (ss - 4)->continuationHistory,
910 (ss - 6)->continuationHistory};
913 prevSq != SQ_NONE ? thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] : MOVE_NONE;
915 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory, &captureHistory, contHist,
916 thisThread->pawnHistory, countermove, ss->killers);
919 moveCountPruning = singularQuietLMR = false;
921 // Indicate PvNodes that will probably fail low if the node was searched
922 // at a depth equal to or greater than the current depth, and the result
923 // of this search was a fail low.
924 bool likelyFailLow = PvNode && ttMove && (tte->bound() & BOUND_UPPER) && tte->depth() >= depth;
926 // Step 13. Loop through all pseudo-legal moves until no moves remain
927 // or a beta cutoff occurs.
928 while ((move = mp.next_move(moveCountPruning)) != MOVE_NONE)
932 if (move == excludedMove)
935 // Check for legality
936 if (!pos.legal(move))
939 // At root obey the "searchmoves" option and skip moves not listed in Root
940 // Move List. In MultiPV mode we also skip PV moves that have been already
941 // searched and those of lower "TB rank" if we are in a TB root position.
943 && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
944 thisThread->rootMoves.begin() + thisThread->pvLast, move))
947 ss->moveCount = ++moveCount;
949 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
950 sync_cout << "info depth " << depth << " currmove "
951 << UCI::move(move, pos.is_chess960()) << " currmovenumber "
952 << moveCount + thisThread->pvIdx << sync_endl;
954 (ss + 1)->pv = nullptr;
957 capture = pos.capture_stage(move);
958 movedPiece = pos.moved_piece(move);
959 givesCheck = pos.gives_check(move);
961 // Calculate new depth for this move
962 newDepth = depth - 1;
964 Value delta = beta - alpha;
966 Depth r = reduction(improving, depth, moveCount, delta, thisThread->rootDelta);
968 // Step 14. Pruning at shallow depth (~120 Elo).
969 // Depth conditions are important for mate finding.
970 if (!rootNode && pos.non_pawn_material(us) && bestValue > VALUE_TB_LOSS_IN_MAX_PLY)
972 // Skip quiet moves if movecount exceeds our FutilityMoveCount threshold (~8 Elo)
973 if (!moveCountPruning)
974 moveCountPruning = moveCount >= futility_move_count(improving, depth);
976 // Reduced depth of the next LMR search
977 int lmrDepth = newDepth - r;
979 if (capture || givesCheck)
981 // Futility pruning for captures (~2 Elo)
982 if (!givesCheck && lmrDepth < 7 && !ss->inCheck)
984 Piece capturedPiece = pos.piece_on(to_sq(move));
986 ss->staticEval + 239 + 291 * lmrDepth + PieceValue[capturedPiece]
987 + captureHistory[movedPiece][to_sq(move)][type_of(capturedPiece)] / 7;
988 if (futilityEval < alpha)
992 // SEE based pruning for captures and checks (~11 Elo)
993 if (!pos.see_ge(move, Value(-185) * depth))
998 int history = (*contHist[0])[movedPiece][to_sq(move)]
999 + (*contHist[1])[movedPiece][to_sq(move)]
1000 + (*contHist[3])[movedPiece][to_sq(move)]
1001 + thisThread->pawnHistory[pawn_structure(pos)][movedPiece][to_sq(move)];
1003 // Continuation history based pruning (~2 Elo)
1004 if (lmrDepth < 6 && history < -3645 * depth)
1007 history += 2 * thisThread->mainHistory[us][from_to(move)];
1009 lmrDepth += history / 7836;
1010 lmrDepth = std::max(lmrDepth, -1);
1012 // Futility pruning: parent node (~13 Elo)
1013 if (!ss->inCheck && lmrDepth < 13 && ss->staticEval + 77 + 124 * lmrDepth <= alpha)
1016 lmrDepth = std::max(lmrDepth, 0);
1018 // Prune moves with negative SEE (~4 Elo)
1019 if (!pos.see_ge(move, Value(-26 * lmrDepth * lmrDepth)))
1024 // Step 15. Extensions (~100 Elo)
1025 // We take care to not overdo to avoid search getting stuck.
1026 if (ss->ply < thisThread->rootDepth * 2)
1028 // Singular extension search (~94 Elo). If all moves but one fail low on a
1029 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
1030 // then that move is singular and should be extended. To verify this we do
1031 // a reduced search on all the other moves but the ttMove and if the result
1032 // is lower than ttValue minus a margin, then we will extend the ttMove. Note
1033 // that depth margin and singularBeta margin are known for having non-linear
1034 // scaling. Their values are optimized to time controls of 180+1.8 and longer
1035 // so changing them requires tests at this type of time controls.
1036 // Recursive singular search is avoided.
1037 if (!rootNode && move == ttMove && !excludedMove
1038 && depth >= 4 - (thisThread->completedDepth > 24) + 2 * (PvNode && tte->is_pv())
1039 && abs(ttValue) < VALUE_TB_WIN_IN_MAX_PLY && (tte->bound() & BOUND_LOWER)
1040 && tte->depth() >= depth - 3)
1042 Value singularBeta = ttValue - (64 + 57 * (ss->ttPv && !PvNode)) * depth / 64;
1043 Depth singularDepth = (depth - 1) / 2;
1045 ss->excludedMove = move;
1047 search<NonPV>(pos, ss, singularBeta - 1, singularBeta, singularDepth, cutNode);
1048 ss->excludedMove = MOVE_NONE;
1050 if (value < singularBeta)
1053 singularQuietLMR = !ttCapture;
1055 // Avoid search explosion by limiting the number of double extensions
1056 if (!PvNode && value < singularBeta - 18 && ss->doubleExtensions <= 11)
1059 depth += depth < 15;
1063 // Multi-cut pruning
1064 // Our ttMove is assumed to fail high, and now we failed high also on a
1065 // reduced search without the ttMove. So we assume this expected cut-node
1066 // is not singular, that multiple moves fail high, and we can prune the
1067 // whole subtree by returning a softbound.
1068 else if (singularBeta >= beta)
1069 return singularBeta;
1071 // If the eval of ttMove is greater than beta, reduce it (negative extension) (~7 Elo)
1072 else if (ttValue >= beta)
1073 extension = -2 - !PvNode;
1075 // If we are on a cutNode, reduce it based on depth (negative extension) (~1 Elo)
1077 extension = depth < 19 ? -2 : -1;
1079 // If the eval of ttMove is less than value, reduce it (negative extension) (~1 Elo)
1080 else if (ttValue <= value)
1084 // Check extensions (~1 Elo)
1085 else if (givesCheck && depth > 9)
1088 // Quiet ttMove extensions (~1 Elo)
1089 else if (PvNode && move == ttMove && move == ss->killers[0]
1090 && (*contHist[0])[movedPiece][to_sq(move)] >= 4194)
1094 // Add extension to new depth
1095 newDepth += extension;
1096 ss->doubleExtensions = (ss - 1)->doubleExtensions + (extension == 2);
1098 // Speculative prefetch as early as possible
1099 prefetch(TT.first_entry(pos.key_after(move)));
1101 // Update the current move (this must be done after singular extension search)
1102 ss->currentMove = move;
1103 ss->continuationHistory =
1104 &thisThread->continuationHistory[ss->inCheck][capture][movedPiece][to_sq(move)];
1106 // Step 16. Make the move
1107 pos.do_move(move, st, givesCheck);
1109 // Decrease reduction if position is or has been on the PV (~4 Elo)
1110 if (ss->ttPv && !likelyFailLow)
1111 r -= cutNode && tte->depth() >= depth ? 3 : 2;
1113 // Decrease reduction if opponent's move count is high (~1 Elo)
1114 if ((ss - 1)->moveCount > 7)
1117 // Increase reduction for cut nodes (~3 Elo)
1121 // Increase reduction if ttMove is a capture (~3 Elo)
1125 // Decrease reduction for PvNodes (~2 Elo)
1129 // Decrease reduction if ttMove has been singularly extended (~1 Elo)
1130 if (singularQuietLMR)
1133 // Increase reduction on repetition (~1 Elo)
1134 if (move == (ss - 4)->currentMove && pos.has_repeated())
1137 // Increase reduction if next ply has a lot of fail high (~5 Elo)
1138 if ((ss + 1)->cutoffCnt > 3)
1141 // Decrease reduction for first generated move (ttMove)
1142 else if (move == ttMove)
1145 ss->statScore = 2 * thisThread->mainHistory[us][from_to(move)]
1146 + (*contHist[0])[movedPiece][to_sq(move)]
1147 + (*contHist[1])[movedPiece][to_sq(move)]
1148 + (*contHist[3])[movedPiece][to_sq(move)] - 3848;
1150 // Decrease/increase reduction for moves with a good/bad history (~25 Elo)
1151 r -= ss->statScore / (10216 + 3855 * (depth > 5 && depth < 23));
1153 // Step 17. Late moves reduction / extension (LMR, ~117 Elo)
1154 // We use various heuristics for the sons of a node after the first son has
1155 // been searched. In general, we would like to reduce them, but there are many
1156 // cases where we extend a son if it has good chances to be "interesting".
1157 if (depth >= 2 && moveCount > 1 + (PvNode && ss->ply <= 1)
1158 && (!ss->ttPv || !capture || (cutNode && (ss - 1)->moveCount > 1)))
1160 // In general we want to cap the LMR depth search at newDepth, but when
1161 // reduction is negative, we allow this move a limited search extension
1162 // beyond the first move depth. This may lead to hidden double extensions.
1163 Depth d = std::clamp(newDepth - r, 1, newDepth + 1);
1165 value = -search<NonPV>(pos, ss + 1, -(alpha + 1), -alpha, d, true);
1167 // Do a full-depth search when reduced LMR search fails high
1168 if (value > alpha && d < newDepth)
1170 // Adjust full-depth search based on LMR results - if the result
1171 // was good enough search deeper, if it was bad enough search shallower.
1172 const bool doDeeperSearch = value > (bestValue + 51 + 10 * (newDepth - d));
1173 const bool doEvenDeeperSearch = value > alpha + 700 && ss->doubleExtensions <= 6;
1174 const bool doShallowerSearch = value < bestValue + newDepth;
1176 ss->doubleExtensions = ss->doubleExtensions + doEvenDeeperSearch;
1178 newDepth += doDeeperSearch - doShallowerSearch + doEvenDeeperSearch;
1181 value = -search<NonPV>(pos, ss + 1, -(alpha + 1), -alpha, newDepth, !cutNode);
1183 int bonus = value <= alpha ? -stat_bonus(newDepth)
1184 : value >= beta ? stat_bonus(newDepth)
1187 update_continuation_histories(ss, movedPiece, to_sq(move), bonus);
1191 // Step 18. Full-depth search when LMR is skipped
1192 else if (!PvNode || moveCount > 1)
1194 // Increase reduction for cut nodes and not ttMove (~1 Elo)
1195 if (!ttMove && cutNode)
1198 // Note that if expected reduction is high, we reduce search depth by 1 here
1199 value = -search<NonPV>(pos, ss + 1, -(alpha + 1), -alpha, newDepth - (r > 3), !cutNode);
1202 // For PV nodes only, do a full PV search on the first move or after a fail high,
1203 // otherwise let the parent node fail low with value <= alpha and try another move.
1204 if (PvNode && (moveCount == 1 || value > alpha))
1207 (ss + 1)->pv[0] = MOVE_NONE;
1209 value = -search<PV>(pos, ss + 1, -beta, -alpha, newDepth, false);
1212 // Step 19. Undo move
1213 pos.undo_move(move);
1215 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1217 // Step 20. Check for a new best move
1218 // Finished searching the move. If a stop occurred, the return value of
1219 // the search cannot be trusted, and we return immediately without
1220 // updating best move, PV and TT.
1221 if (Threads.stop.load(std::memory_order_relaxed))
1227 *std::find(thisThread->rootMoves.begin(), thisThread->rootMoves.end(), move);
1230 rm.averageScore != -VALUE_INFINITE ? (2 * value + rm.averageScore) / 3 : value;
1232 // PV move or new best move?
1233 if (moveCount == 1 || value > alpha)
1235 rm.score = rm.uciScore = value;
1236 rm.selDepth = thisThread->selDepth;
1237 rm.scoreLowerbound = rm.scoreUpperbound = false;
1241 rm.scoreLowerbound = true;
1244 else if (value <= alpha)
1246 rm.scoreUpperbound = true;
1247 rm.uciScore = alpha;
1252 assert((ss + 1)->pv);
1254 for (Move* m = (ss + 1)->pv; *m != MOVE_NONE; ++m)
1255 rm.pv.push_back(*m);
1257 // We record how often the best move has been changed in each iteration.
1258 // This information is used for time management. In MultiPV mode,
1259 // we must take care to only do this for the first PV line.
1260 if (moveCount > 1 && !thisThread->pvIdx)
1261 ++thisThread->bestMoveChanges;
1264 // All other moves but the PV, are set to the lowest value: this
1265 // is not a problem when sorting because the sort is stable and the
1266 // move position in the list is preserved - just the PV is pushed up.
1267 rm.score = -VALUE_INFINITE;
1270 if (value > bestValue)
1278 if (PvNode && !rootNode) // Update pv even in fail-high case
1279 update_pv(ss->pv, move, (ss + 1)->pv);
1283 ss->cutoffCnt += 1 + !ttMove;
1284 assert(value >= beta); // Fail high
1289 // Reduce other moves if we have found at least one score improvement (~2 Elo)
1290 if (depth > 2 && depth < 12 && beta < 13828 && value > -11369)
1294 alpha = value; // Update alpha! Always alpha < beta
1299 // If the move is worse than some previously searched move,
1300 // remember it, to update its stats later.
1301 if (move != bestMove && moveCount <= 32)
1304 capturesSearched[captureCount++] = move;
1307 quietsSearched[quietCount++] = move;
1311 // Step 21. Check for mate and stalemate
1312 // All legal moves have been searched and if there are no legal moves, it
1313 // must be a mate or a stalemate. If we are in a singular extension search then
1314 // return a fail low score.
1316 assert(moveCount || !ss->inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1319 bestValue = excludedMove ? alpha : ss->inCheck ? mated_in(ss->ply) : VALUE_DRAW;
1321 // If there is a move that produces search value greater than alpha we update the stats of searched moves
1323 update_all_stats(pos, ss, bestMove, bestValue, beta, prevSq, quietsSearched, quietCount,
1324 capturesSearched, captureCount, depth);
1326 // Bonus for prior countermove that caused the fail low
1327 else if (!priorCapture && prevSq != SQ_NONE)
1329 int bonus = (depth > 6) + (PvNode || cutNode) + (bestValue < alpha - 657)
1330 + ((ss - 1)->moveCount > 10);
1331 update_continuation_histories(ss - 1, pos.piece_on(prevSq), prevSq,
1332 stat_bonus(depth) * bonus);
1333 thisThread->mainHistory[~us][from_to((ss - 1)->currentMove)]
1334 << stat_bonus(depth) * bonus * 61 / 100;
1338 bestValue = std::min(bestValue, maxValue);
1340 // If no good move is found and the previous position was ttPv, then the previous
1341 // opponent move is probably good and the new position is added to the search tree. (~7 Elo)
1342 if (bestValue <= alpha)
1343 ss->ttPv = ss->ttPv || ((ss - 1)->ttPv && depth > 3);
1345 // Write gathered information in transposition table
1346 if (!excludedMove && !(rootNode && thisThread->pvIdx))
1347 tte->save(posKey, value_to_tt(bestValue, ss->ply), ss->ttPv,
1348 bestValue >= beta ? BOUND_LOWER
1349 : PvNode && bestMove ? BOUND_EXACT
1351 depth, bestMove, ss->staticEval);
1353 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1359 // Quiescence search function, which is called by the main search
1360 // function with zero depth, or recursively with further decreasing depth per call.
1362 template<NodeType nodeType>
1363 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1365 static_assert(nodeType != Root);
1366 constexpr bool PvNode = nodeType == PV;
1368 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1369 assert(PvNode || (alpha == beta - 1));
1372 // Check if we have an upcoming move that draws by repetition, or
1373 // if the opponent had an alternative move earlier to this position.
1374 if (alpha < VALUE_DRAW && pos.has_game_cycle(ss->ply))
1376 alpha = value_draw(pos.this_thread());
1381 Move pv[MAX_PLY + 1];
1383 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1387 Move ttMove, move, bestMove;
1389 Value bestValue, value, ttValue, futilityValue, futilityBase;
1390 bool pvHit, givesCheck, capture;
1392 Color us = pos.side_to_move();
1394 // Step 1. Initialize node
1398 ss->pv[0] = MOVE_NONE;
1401 Thread* thisThread = pos.this_thread();
1402 bestMove = MOVE_NONE;
1403 ss->inCheck = pos.checkers();
1406 // Step 2. Check for an immediate draw or maximum ply reached
1407 if (pos.is_draw(ss->ply) || ss->ply >= MAX_PLY)
1408 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos) : VALUE_DRAW;
1410 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1412 // Decide whether or not to include checks: this fixes also the type of
1413 // TT entry depth that we are going to use. Note that in qsearch we use
1414 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1415 ttDepth = ss->inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS : DEPTH_QS_NO_CHECKS;
1417 // Step 3. Transposition table lookup
1419 tte = TT.probe(posKey, ss->ttHit);
1420 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
1421 ttMove = ss->ttHit ? tte->move() : MOVE_NONE;
1422 pvHit = ss->ttHit && tte->is_pv();
1424 // At non-PV nodes we check for an early TT cutoff
1425 if (!PvNode && tte->depth() >= ttDepth
1426 && ttValue != VALUE_NONE // Only in case of TT access race or if !ttHit
1427 && (tte->bound() & (ttValue >= beta ? BOUND_LOWER : BOUND_UPPER)))
1430 // Step 4. Static evaluation of the position
1432 bestValue = futilityBase = -VALUE_INFINITE;
1437 // Never assume anything about values stored in TT
1438 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1439 ss->staticEval = bestValue = evaluate(pos);
1441 // ttValue can be used as a better position evaluation (~13 Elo)
1442 if (ttValue != VALUE_NONE
1443 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1444 bestValue = ttValue;
1447 // In case of null move search use previous static eval with a different sign
1448 ss->staticEval = bestValue =
1449 (ss - 1)->currentMove != MOVE_NULL ? evaluate(pos) : -(ss - 1)->staticEval;
1451 // Stand pat. Return immediately if static value is at least beta
1452 if (bestValue >= beta)
1455 tte->save(posKey, value_to_tt(bestValue, ss->ply), false, BOUND_LOWER, DEPTH_NONE,
1456 MOVE_NONE, ss->staticEval);
1461 if (bestValue > alpha)
1464 futilityBase = ss->staticEval + 200;
1467 const PieceToHistory* contHist[] = {(ss - 1)->continuationHistory,
1468 (ss - 2)->continuationHistory};
1470 // Initialize a MovePicker object for the current position, and prepare
1471 // to search the moves. Because the depth is <= 0 here, only captures,
1472 // queen promotions, and other checks (only if depth >= DEPTH_QS_CHECKS)
1473 // will be generated.
1474 Square prevSq = is_ok((ss - 1)->currentMove) ? to_sq((ss - 1)->currentMove) : SQ_NONE;
1475 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory, &thisThread->captureHistory,
1476 contHist, thisThread->pawnHistory, prevSq);
1478 int quietCheckEvasions = 0;
1480 // Step 5. Loop through all pseudo-legal moves until no moves remain
1481 // or a beta cutoff occurs.
1482 while ((move = mp.next_move()) != MOVE_NONE)
1484 assert(is_ok(move));
1486 // Check for legality
1487 if (!pos.legal(move))
1490 givesCheck = pos.gives_check(move);
1491 capture = pos.capture_stage(move);
1496 if (bestValue > VALUE_TB_LOSS_IN_MAX_PLY && pos.non_pawn_material(us))
1498 // Futility pruning and moveCount pruning (~10 Elo)
1499 if (!givesCheck && to_sq(move) != prevSq && futilityBase > VALUE_TB_LOSS_IN_MAX_PLY
1500 && type_of(move) != PROMOTION)
1505 futilityValue = futilityBase + PieceValue[pos.piece_on(to_sq(move))];
1507 // If static eval + value of piece we are going to capture is much lower
1508 // than alpha we can prune this move.
1509 if (futilityValue <= alpha)
1511 bestValue = std::max(bestValue, futilityValue);
1515 // If static eval is much lower than alpha and move is not winning material
1516 // we can prune this move.
1517 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1519 bestValue = std::max(bestValue, futilityBase);
1523 // If static exchange evaluation is much worse than what is needed to not
1524 // fall below alpha we can prune this move.
1525 if (futilityBase > alpha && !pos.see_ge(move, (alpha - futilityBase) * 4))
1532 // We prune after the second quiet check evasion move, where being 'in check' is
1533 // implicitly checked through the counter, and being a 'quiet move' apart from
1534 // being a tt move is assumed after an increment because captures are pushed ahead.
1535 if (quietCheckEvasions > 1)
1538 // Continuation history based pruning (~3 Elo)
1539 if (!capture && (*contHist[0])[pos.moved_piece(move)][to_sq(move)] < 0
1540 && (*contHist[1])[pos.moved_piece(move)][to_sq(move)] < 0)
1543 // Do not search moves with bad enough SEE values (~5 Elo)
1544 if (!pos.see_ge(move, Value(-90)))
1548 // Speculative prefetch as early as possible
1549 prefetch(TT.first_entry(pos.key_after(move)));
1551 // Update the current move
1552 ss->currentMove = move;
1553 ss->continuationHistory =
1555 ->continuationHistory[ss->inCheck][capture][pos.moved_piece(move)][to_sq(move)];
1557 quietCheckEvasions += !capture && ss->inCheck;
1559 // Step 7. Make and search the move
1560 pos.do_move(move, st, givesCheck);
1561 value = -qsearch<nodeType>(pos, ss + 1, -beta, -alpha, depth - 1);
1562 pos.undo_move(move);
1564 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1566 // Step 8. Check for a new best move
1567 if (value > bestValue)
1575 if (PvNode) // Update pv even in fail-high case
1576 update_pv(ss->pv, move, (ss + 1)->pv);
1578 if (value < beta) // Update alpha here!
1586 // Step 9. Check for mate
1587 // All legal moves have been searched. A special case: if we're in check
1588 // and no legal moves were found, it is checkmate.
1589 if (ss->inCheck && bestValue == -VALUE_INFINITE)
1591 assert(!MoveList<LEGAL>(pos).size());
1593 return mated_in(ss->ply); // Plies to mate from the root
1596 // Save gathered info in transposition table
1597 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1598 bestValue >= beta ? BOUND_LOWER : BOUND_UPPER, ttDepth, bestMove, ss->staticEval);
1600 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1606 // Adjusts a mate or TB score from "plies to mate from the root"
1607 // to "plies to mate from the current position". Standard scores are unchanged.
1608 // The function is called before storing a value in the transposition table.
1609 Value value_to_tt(Value v, int ply) {
1611 assert(v != VALUE_NONE);
1613 return v >= VALUE_TB_WIN_IN_MAX_PLY ? v + ply : v <= VALUE_TB_LOSS_IN_MAX_PLY ? v - ply : v;
1617 // Inverse of value_to_tt(): it adjusts a mate or TB score
1618 // from the transposition table (which refers to the plies to mate/be mated from
1619 // current position) to "plies to mate/be mated (TB win/loss) from the root".
1620 // However, to avoid potentially false mate scores related to the 50 moves rule
1621 // and the graph history interaction problem, we return an optimal TB score instead.
1622 Value value_from_tt(Value v, int ply, int r50c) {
1624 if (v == VALUE_NONE)
1627 if (v >= VALUE_TB_WIN_IN_MAX_PLY) // TB win or better
1629 if (v >= VALUE_MATE_IN_MAX_PLY && VALUE_MATE - v > 99 - r50c)
1630 return VALUE_MATE_IN_MAX_PLY - 1; // do not return a potentially false mate score
1635 if (v <= VALUE_TB_LOSS_IN_MAX_PLY) // TB loss or worse
1637 if (v <= VALUE_MATED_IN_MAX_PLY && VALUE_MATE + v > 99 - r50c)
1638 return VALUE_MATED_IN_MAX_PLY + 1; // do not return a potentially false mate score
1647 // Adds current move and appends child pv[]
1648 void update_pv(Move* pv, Move move, const Move* childPv) {
1650 for (*pv++ = move; childPv && *childPv != MOVE_NONE;)
1656 // Updates stats at the end of search() when a bestMove is found
1657 void update_all_stats(const Position& pos,
1663 Move* quietsSearched,
1665 Move* capturesSearched,
1669 Color us = pos.side_to_move();
1670 Thread* thisThread = pos.this_thread();
1671 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
1672 Piece moved_piece = pos.moved_piece(bestMove);
1675 int quietMoveBonus = stat_bonus(depth + 1);
1677 if (!pos.capture_stage(bestMove))
1679 int bestMoveBonus = bestValue > beta + 168 ? quietMoveBonus // larger bonus
1680 : stat_bonus(depth); // smaller bonus
1682 // Increase stats for the best move in case it was a quiet move
1683 update_quiet_stats(pos, ss, bestMove, bestMoveBonus);
1684 thisThread->pawnHistory[pawn_structure(pos)][moved_piece][to_sq(bestMove)]
1687 // Decrease stats for all non-best quiet moves
1688 for (int i = 0; i < quietCount; ++i)
1690 thisThread->pawnHistory[pawn_structure(pos)][pos.moved_piece(quietsSearched[i])]
1691 [to_sq(quietsSearched[i])]
1693 thisThread->mainHistory[us][from_to(quietsSearched[i])] << -bestMoveBonus;
1694 update_continuation_histories(ss, pos.moved_piece(quietsSearched[i]),
1695 to_sq(quietsSearched[i]), -bestMoveBonus);
1700 // Increase stats for the best move in case it was a capture move
1701 captured = type_of(pos.piece_on(to_sq(bestMove)));
1702 captureHistory[moved_piece][to_sq(bestMove)][captured] << quietMoveBonus;
1705 // Extra penalty for a quiet early move that was not a TT move or
1706 // main killer move in previous ply when it gets refuted.
1707 if (prevSq != SQ_NONE
1708 && ((ss - 1)->moveCount == 1 + (ss - 1)->ttHit
1709 || ((ss - 1)->currentMove == (ss - 1)->killers[0]))
1710 && !pos.captured_piece())
1711 update_continuation_histories(ss - 1, pos.piece_on(prevSq), prevSq, -quietMoveBonus);
1713 // Decrease stats for all non-best capture moves
1714 for (int i = 0; i < captureCount; ++i)
1716 moved_piece = pos.moved_piece(capturesSearched[i]);
1717 captured = type_of(pos.piece_on(to_sq(capturesSearched[i])));
1718 captureHistory[moved_piece][to_sq(capturesSearched[i])][captured] << -quietMoveBonus;
1723 // Updates histories of the move pairs formed
1724 // by moves at ply -1, -2, -4, and -6 with current move.
1725 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1727 for (int i : {1, 2, 3, 4, 6})
1729 // Only update the first 2 continuation histories if we are in check
1730 if (ss->inCheck && i > 2)
1732 if (is_ok((ss - i)->currentMove))
1733 (*(ss - i)->continuationHistory)[pc][to] << bonus / (1 + 3 * (i == 3));
1738 // Updates move sorting heuristics
1739 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus) {
1742 if (ss->killers[0] != move)
1744 ss->killers[1] = ss->killers[0];
1745 ss->killers[0] = move;
1748 Color us = pos.side_to_move();
1749 Thread* thisThread = pos.this_thread();
1750 thisThread->mainHistory[us][from_to(move)] << bonus;
1751 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1753 // Update countermove history
1754 if (is_ok((ss - 1)->currentMove))
1756 Square prevSq = to_sq((ss - 1)->currentMove);
1757 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1761 // When playing with strength handicap, choose the best move among a set of RootMoves
1762 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1763 Move Skill::pick_best(size_t multiPV) {
1765 const RootMoves& rootMoves = Threads.main()->rootMoves;
1766 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1768 // RootMoves are already sorted by score in descending order
1769 Value topScore = rootMoves[0].score;
1770 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValue);
1771 int maxScore = -VALUE_INFINITE;
1772 double weakness = 120 - 2 * level;
1774 // Choose best move. For each move score we add two terms, both dependent on
1775 // weakness. One is deterministic and bigger for weaker levels, and one is
1776 // random. Then we choose the move with the resulting highest score.
1777 for (size_t i = 0; i < multiPV; ++i)
1779 // This is our magic formula
1780 int push = int((weakness * int(topScore - rootMoves[i].score)
1781 + delta * (rng.rand<unsigned>() % int(weakness)))
1784 if (rootMoves[i].score + push >= maxScore)
1786 maxScore = rootMoves[i].score + push;
1787 best = rootMoves[i].pv[0];
1797 // Used to print debug info and, more importantly,
1798 // to detect when we are out of available time and thus stop the search.
1799 void MainThread::check_time() {
1804 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1805 callsCnt = Limits.nodes ? std::min(512, int(Limits.nodes / 1024)) : 512;
1807 static TimePoint lastInfoTime = now();
1809 TimePoint elapsed = Time.elapsed();
1810 TimePoint tick = Limits.startTime + elapsed;
1812 if (tick - lastInfoTime >= 1000)
1814 lastInfoTime = tick;
1818 // We should not stop pondering until told so by the GUI
1822 if ((Limits.use_time_management() && (elapsed > Time.maximum() || stopOnPonderhit))
1823 || (Limits.movetime && elapsed >= Limits.movetime)
1824 || (Limits.nodes && Threads.nodes_searched() >= uint64_t(Limits.nodes)))
1825 Threads.stop = true;
1829 // Formats PV information according to the UCI protocol. UCI requires
1830 // that all (if any) unsearched PV lines are sent using a previous search score.
1831 string UCI::pv(const Position& pos, Depth depth) {
1833 std::stringstream ss;
1834 TimePoint elapsed = Time.elapsed() + 1;
1835 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1836 size_t pvIdx = pos.this_thread()->pvIdx;
1837 size_t multiPV = std::min(size_t(Options["MultiPV"]), rootMoves.size());
1838 uint64_t nodesSearched = Threads.nodes_searched();
1839 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1841 for (size_t i = 0; i < multiPV; ++i)
1843 bool updated = rootMoves[i].score != -VALUE_INFINITE;
1845 if (depth == 1 && !updated && i > 0)
1848 Depth d = updated ? depth : std::max(1, depth - 1);
1849 Value v = updated ? rootMoves[i].uciScore : rootMoves[i].previousScore;
1851 if (v == -VALUE_INFINITE)
1854 bool tb = TB::RootInTB && abs(v) < VALUE_MATE_IN_MAX_PLY;
1855 v = tb ? rootMoves[i].tbScore : v;
1857 if (ss.rdbuf()->in_avail()) // Not at first line
1861 << " depth " << d << " seldepth " << rootMoves[i].selDepth << " multipv " << i + 1
1862 << " score " << UCI::value(v);
1864 if (Options["UCI_ShowWDL"])
1865 ss << UCI::wdl(v, pos.game_ply());
1867 if (i == pvIdx && !tb && updated) // tablebase- and previous-scores are exact
1868 ss << (rootMoves[i].scoreLowerbound
1870 : (rootMoves[i].scoreUpperbound ? " upperbound" : ""));
1872 ss << " nodes " << nodesSearched << " nps " << nodesSearched * 1000 / elapsed
1873 << " hashfull " << TT.hashfull() << " tbhits " << tbHits << " time " << elapsed << " pv";
1875 for (Move m : rootMoves[i].pv)
1876 ss << " " << UCI::move(m, pos.is_chess960());
1883 // Called in case we have no ponder move
1884 // before exiting the search, for instance, in case we stop the search during a
1885 // fail high at root. We try hard to have a ponder move to return to the GUI,
1886 // otherwise in case of 'ponder on' we have nothing to think about.
1887 bool RootMove::extract_ponder_from_tt(Position& pos) {
1890 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1894 assert(pv.size() == 1);
1896 if (pv[0] == MOVE_NONE)
1899 pos.do_move(pv[0], st);
1900 TTEntry* tte = TT.probe(pos.key(), ttHit);
1904 Move m = tte->move(); // Local copy to be SMP safe
1905 if (MoveList<LEGAL>(pos).contains(m))
1909 pos.undo_move(pv[0]);
1910 return pv.size() > 1;
1913 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1916 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1917 ProbeDepth = int(Options["SyzygyProbeDepth"]);
1918 Cardinality = int(Options["SyzygyProbeLimit"]);
1919 bool dtz_available = true;
1921 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1922 // ProbeDepth == DEPTH_ZERO
1923 if (Cardinality > MaxCardinality)
1925 Cardinality = MaxCardinality;
1929 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1931 // Rank moves using DTZ tables
1932 RootInTB = root_probe(pos, rootMoves);
1936 // DTZ tables are missing; try to rank moves using WDL tables
1937 dtz_available = false;
1938 RootInTB = root_probe_wdl(pos, rootMoves);
1944 // Sort moves according to TB rank
1945 std::stable_sort(rootMoves.begin(), rootMoves.end(),
1946 [](const RootMove& a, const RootMove& b) { return a.tbRank > b.tbRank; });
1948 // Probe during search only if DTZ is not available and we are winning
1949 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
1954 // Clean up if root_probe() and root_probe_wdl() have failed
1955 for (auto& m : rootMoves)
1960 } // namespace Stockfish