2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2022 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(165 * (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 + 1642 - int(delta) * 1024 / int(rootDelta)) / 1024 + (!i && r > 916);
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((12 * d + 282) * d - 349 , 1480);
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) {
99 level = std::clamp(std::pow((uci_elo - 1346.6) / 143.4, 1 / 0.806), 0.0, 20.0);
101 level = double(skill_level);
103 bool enabled() const { return level < 20.0; }
104 bool time_to_pick(Depth depth) const { return depth == 1 + int(level); }
105 Move pick_best(size_t multiPV);
108 Move best = MOVE_NONE;
111 template <NodeType nodeType>
112 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
114 template <NodeType nodeType>
115 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = 0);
117 Value value_to_tt(Value v, int ply);
118 Value value_from_tt(Value v, int ply, int r50c);
119 void update_pv(Move* pv, Move move, const Move* childPv);
120 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
121 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus);
122 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
123 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth);
125 // perft() is our utility to verify move generation. All the leaf nodes up
126 // to the given depth are generated and counted, and the sum is returned.
128 uint64_t perft(Position& pos, Depth depth) {
131 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
133 uint64_t cnt, nodes = 0;
134 const bool leaf = (depth == 2);
136 for (const auto& m : MoveList<LEGAL>(pos))
138 if (Root && depth <= 1)
143 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - 1);
148 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
156 /// Search::init() is called at startup to initialize various lookup tables
158 void Search::init() {
160 for (int i = 1; i < MAX_MOVES; ++i)
161 Reductions[i] = int((20.26 + std::log(Threads.size()) / 2) * std::log(i));
165 /// Search::clear() resets search state to its initial value
167 void Search::clear() {
169 Threads.main()->wait_for_search_finished();
171 Time.availableNodes = 0;
174 Tablebases::init(Options["SyzygyPath"]); // Free mapped files
178 /// MainThread::search() is started when the program receives the UCI 'go'
179 /// command. It searches from the root position and outputs the "bestmove".
181 void MainThread::search() {
185 nodes = perft<true>(rootPos, Limits.perft);
186 sync_cout << "\nNodes searched: " << nodes << "\n" << sync_endl;
190 Color us = rootPos.side_to_move();
191 Time.init(Limits, us, rootPos.game_ply());
194 Eval::NNUE::verify();
196 if (rootMoves.empty())
198 rootMoves.emplace_back(MOVE_NONE);
199 sync_cout << "info depth 0 score "
200 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
205 Threads.start_searching(); // start non-main threads
206 Thread::search(); // main thread start searching
209 // When we reach the maximum depth, we can arrive here without a raise of
210 // Threads.stop. However, if we are pondering or in an infinite search,
211 // the UCI protocol states that we shouldn't print the best move before the
212 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
213 // until the GUI sends one of those commands.
215 while (!Threads.stop && (ponder || Limits.infinite))
216 {} // Busy wait for a stop or a ponder reset
218 // Stop the threads if not already stopped (also raise the stop if
219 // "ponderhit" just reset Threads.ponder).
222 // Wait until all threads have finished
223 Threads.wait_for_search_finished();
225 // When playing in 'nodes as time' mode, subtract the searched nodes from
226 // the available ones before exiting.
228 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
230 Thread* bestThread = this;
231 Skill skill = Skill(Options["Skill Level"], Options["UCI_LimitStrength"] ? int(Options["UCI_Elo"]) : 0);
233 if ( int(Options["MultiPV"]) == 1
236 && rootMoves[0].pv[0] != MOVE_NONE)
237 bestThread = Threads.get_best_thread();
239 bestPreviousScore = bestThread->rootMoves[0].score;
240 bestPreviousAverageScore = bestThread->rootMoves[0].averageScore;
242 for (Thread* th : Threads)
243 th->previousDepth = bestThread->completedDepth;
245 // Send again PV info if we have a new best thread
246 if (bestThread != this)
247 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth) << sync_endl;
249 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
251 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
252 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
254 std::cout << sync_endl;
258 /// Thread::search() is the main iterative deepening loop. It calls search()
259 /// repeatedly with increasing depth until the allocated thinking time has been
260 /// consumed, the user stops the search, or the maximum search depth is reached.
262 void Thread::search() {
264 // To allow access to (ss-7) up to (ss+2), the stack must be oversized.
265 // The former is needed to allow update_continuation_histories(ss-1, ...),
266 // which accesses its argument at ss-6, also near the root.
267 // The latter is needed for statScore and killer initialization.
268 Stack stack[MAX_PLY+10], *ss = stack+7;
270 Value alpha, beta, delta;
271 Move lastBestMove = MOVE_NONE;
272 Depth lastBestMoveDepth = 0;
273 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
274 double timeReduction = 1, totBestMoveChanges = 0;
275 Color us = rootPos.side_to_move();
278 std::memset(ss-7, 0, 10 * sizeof(Stack));
279 for (int i = 7; i > 0; i--)
280 (ss-i)->continuationHistory = &this->continuationHistory[0][0][NO_PIECE][0]; // Use as a sentinel
282 for (int i = 0; i <= MAX_PLY + 2; ++i)
287 bestValue = delta = alpha = -VALUE_INFINITE;
288 beta = VALUE_INFINITE;
292 if (mainThread->bestPreviousScore == VALUE_INFINITE)
293 for (int i = 0; i < 4; ++i)
294 mainThread->iterValue[i] = VALUE_ZERO;
296 for (int i = 0; i < 4; ++i)
297 mainThread->iterValue[i] = mainThread->bestPreviousScore;
300 size_t multiPV = size_t(Options["MultiPV"]);
301 Skill skill(Options["Skill Level"], Options["UCI_LimitStrength"] ? int(Options["UCI_Elo"]) : 0);
303 // When playing with strength handicap enable MultiPV search that we will
304 // use behind the scenes to retrieve a set of possible moves.
306 multiPV = std::max(multiPV, (size_t)4);
308 multiPV = std::min(multiPV, rootMoves.size());
310 complexityAverage.set(155, 1);
312 optimism[us] = optimism[~us] = VALUE_ZERO;
314 int searchAgainCounter = 0;
316 // Iterative deepening loop until requested to stop or the target depth is reached
317 while ( ++rootDepth < MAX_PLY
319 && !(Limits.depth && mainThread && rootDepth > Limits.depth))
321 // Age out PV variability metric
323 totBestMoveChanges /= 2;
325 // Save the last iteration's scores before first PV line is searched and
326 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
327 for (RootMove& rm : rootMoves)
328 rm.previousScore = rm.score;
333 if (!Threads.increaseDepth)
334 searchAgainCounter++;
336 // MultiPV loop. We perform a full root search for each PV line
337 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
342 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
343 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
347 // Reset UCI info selDepth for each depth and each PV line
350 // Reset aspiration window starting size
353 Value prev = rootMoves[pvIdx].averageScore;
354 delta = Value(10) + int(prev) * prev / 15620;
355 alpha = std::max(prev - delta,-VALUE_INFINITE);
356 beta = std::min(prev + delta, VALUE_INFINITE);
358 // Adjust optimism based on root move's previousScore
359 int opt = 118 * prev / (std::abs(prev) + 169);
360 optimism[ us] = Value(opt);
361 optimism[~us] = -optimism[us];
364 // Start with a small aspiration window and, in the case of a fail
365 // high/low, re-search with a bigger window until we don't fail
367 int failedHighCnt = 0;
370 // Adjust the effective depth searched, but ensuring at least one effective increment for every
371 // four searchAgain steps (see issue #2717).
372 Depth adjustedDepth = std::max(1, rootDepth - failedHighCnt - 3 * (searchAgainCounter + 1) / 4);
373 bestValue = Stockfish::search<Root>(rootPos, ss, alpha, beta, adjustedDepth, false);
375 // Bring the best move to the front. It is critical that sorting
376 // is done with a stable algorithm because all the values but the
377 // first and eventually the new best one are set to -VALUE_INFINITE
378 // and we want to keep the same order for all the moves except the
379 // new PV that goes to the front. Note that in case of MultiPV
380 // search the already searched PV lines are preserved.
381 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
383 // If search has been stopped, we break immediately. Sorting is
384 // safe because RootMoves is still valid, although it refers to
385 // the previous iteration.
389 // When failing high/low give some update (without cluttering
390 // the UI) before a re-search.
393 && (bestValue <= alpha || bestValue >= beta)
394 && Time.elapsed() > 3000)
395 sync_cout << UCI::pv(rootPos, rootDepth) << sync_endl;
397 // In case of failing low/high increase aspiration window and
398 // re-search, otherwise exit the loop.
399 if (bestValue <= alpha)
401 beta = (alpha + beta) / 2;
402 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
406 mainThread->stopOnPonderhit = false;
408 else if (bestValue >= beta)
410 beta = std::min(bestValue + delta, VALUE_INFINITE);
416 delta += delta / 4 + 2;
418 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
421 // Sort the PV lines searched so far and update the GUI
422 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
425 && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
426 sync_cout << UCI::pv(rootPos, rootDepth) << sync_endl;
430 completedDepth = rootDepth;
432 if (rootMoves[0].pv[0] != lastBestMove) {
433 lastBestMove = rootMoves[0].pv[0];
434 lastBestMoveDepth = rootDepth;
437 // Have we found a "mate in x"?
439 && bestValue >= VALUE_MATE_IN_MAX_PLY
440 && VALUE_MATE - bestValue <= 2 * Limits.mate)
446 // If skill level is enabled and time is up, pick a sub-optimal best move
447 if (skill.enabled() && skill.time_to_pick(rootDepth))
448 skill.pick_best(multiPV);
450 // Use part of the gained time from a previous stable move for the current move
451 for (Thread* th : Threads)
453 totBestMoveChanges += th->bestMoveChanges;
454 th->bestMoveChanges = 0;
457 // Do we have time for the next iteration? Can we stop searching now?
458 if ( Limits.use_time_management()
460 && !mainThread->stopOnPonderhit)
462 double fallingEval = (71 + 12 * (mainThread->bestPreviousAverageScore - bestValue)
463 + 6 * (mainThread->iterValue[iterIdx] - bestValue)) / 656.7;
464 fallingEval = std::clamp(fallingEval, 0.5, 1.5);
466 // If the bestMove is stable over several iterations, reduce time accordingly
467 timeReduction = lastBestMoveDepth + 9 < completedDepth ? 1.37 : 0.65;
468 double reduction = (1.4 + mainThread->previousTimeReduction) / (2.15 * timeReduction);
469 double bestMoveInstability = 1 + 1.7 * totBestMoveChanges / Threads.size();
470 int complexity = mainThread->complexityAverage.value();
471 double complexPosition = std::min(1.0 + (complexity - 261) / 1738.7, 1.5);
473 double totalTime = Time.optimum() * fallingEval * reduction * bestMoveInstability * complexPosition;
475 // Cap used time in case of a single legal move for a better viewer experience in tournaments
476 // yielding correct scores and sufficiently fast moves.
477 if (rootMoves.size() == 1)
478 totalTime = std::min(500.0, totalTime);
480 // Stop the search if we have exceeded the totalTime
481 if (Time.elapsed() > totalTime)
483 // If we are allowed to ponder do not stop the search now but
484 // keep pondering until the GUI sends "ponderhit" or "stop".
485 if (mainThread->ponder)
486 mainThread->stopOnPonderhit = true;
490 else if ( !mainThread->ponder
491 && Time.elapsed() > totalTime * 0.53)
492 Threads.increaseDepth = false;
494 Threads.increaseDepth = true;
497 mainThread->iterValue[iterIdx] = bestValue;
498 iterIdx = (iterIdx + 1) & 3;
504 mainThread->previousTimeReduction = timeReduction;
506 // If skill level is enabled, swap best PV line with the sub-optimal one
508 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
509 skill.best ? skill.best : skill.pick_best(multiPV)));
515 // search<>() is the main search function for both PV and non-PV nodes
517 template <NodeType nodeType>
518 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
520 constexpr bool PvNode = nodeType != NonPV;
521 constexpr bool rootNode = nodeType == Root;
522 const Depth maxNextDepth = rootNode ? depth : depth + 1;
524 // Check if we have an upcoming move which draws by repetition, or
525 // if the opponent had an alternative move earlier to this position.
527 && pos.rule50_count() >= 3
528 && alpha < VALUE_DRAW
529 && pos.has_game_cycle(ss->ply))
531 alpha = value_draw(pos.this_thread());
536 // Dive into quiescence search when the depth reaches zero
538 return qsearch<PvNode ? PV : NonPV>(pos, ss, alpha, beta);
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[64];
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, improvement, complexity;
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)
580 || pos.is_draw(ss->ply)
581 || ss->ply >= MAX_PLY)
582 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos)
583 : value_draw(pos.this_thread());
585 // Step 3. Mate distance pruning. Even if we mate at the next move our score
586 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
587 // a shorter mate was found upward in the tree then there is no need to search
588 // because we will never beat the current alpha. Same logic but with reversed
589 // signs applies also in the opposite condition of being mated instead of giving
590 // mate. In this case return a fail-high score.
591 alpha = std::max(mated_in(ss->ply), alpha);
592 beta = std::min(mate_in(ss->ply+1), beta);
597 thisThread->rootDelta = beta - alpha;
599 assert(0 <= ss->ply && ss->ply < MAX_PLY);
601 (ss+1)->ttPv = false;
602 (ss+1)->excludedMove = bestMove = MOVE_NONE;
603 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
604 (ss+2)->cutoffCnt = 0;
605 ss->doubleExtensions = (ss-1)->doubleExtensions;
606 Square prevSq = to_sq((ss-1)->currentMove);
608 // Initialize statScore to zero for the grandchildren of the current position.
609 // So statScore is shared between all grandchildren and only the first grandchild
610 // starts with statScore = 0. Later grandchildren start with the last calculated
611 // statScore of the previous grandchild. This influences the reduction rules in
612 // LMR which are based on the statScore of parent position.
614 (ss+2)->statScore = 0;
616 // Step 4. Transposition table lookup. We don't want the score of a partial
617 // search to overwrite a previous full search TT value, so we use a different
618 // position key in case of an excluded move.
619 excludedMove = ss->excludedMove;
620 posKey = excludedMove == MOVE_NONE ? pos.key() : pos.key() ^ make_key(excludedMove);
621 tte = TT.probe(posKey, ss->ttHit);
622 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
623 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
624 : ss->ttHit ? tte->move() : MOVE_NONE;
625 ttCapture = ttMove && pos.capture(ttMove);
627 ss->ttPv = PvNode || (ss->ttHit && tte->is_pv());
629 // At non-PV nodes we check for an early TT cutoff
632 && tte->depth() > depth - (tte->bound() == BOUND_EXACT)
633 && ttValue != VALUE_NONE // Possible in case of TT access race
634 && (tte->bound() & (ttValue >= beta ? BOUND_LOWER : BOUND_UPPER)))
636 // If ttMove is quiet, update move sorting heuristics on TT hit (~1 Elo)
641 // Bonus for a quiet ttMove that fails high (~3 Elo)
643 update_quiet_stats(pos, ss, ttMove, stat_bonus(depth));
645 // Extra penalty for early quiet moves of the previous ply (~0 Elo)
646 if ((ss-1)->moveCount <= 2 && !priorCapture)
647 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + 1));
649 // Penalty for a quiet ttMove that fails low (~1 Elo)
652 int penalty = -stat_bonus(depth);
653 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
654 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
658 // Partial workaround for the graph history interaction problem
659 // For high rule50 counts don't produce transposition table cutoffs.
660 if (pos.rule50_count() < 90)
664 // Step 5. Tablebases probe
665 if (!rootNode && TB::Cardinality)
667 int piecesCount = pos.count<ALL_PIECES>();
669 if ( piecesCount <= TB::Cardinality
670 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
671 && pos.rule50_count() == 0
672 && !pos.can_castle(ANY_CASTLING))
675 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
677 // Force check of time on the next occasion
678 if (thisThread == Threads.main())
679 static_cast<MainThread*>(thisThread)->callsCnt = 0;
681 if (err != TB::ProbeState::FAIL)
683 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
685 int drawScore = TB::UseRule50 ? 1 : 0;
687 // use the range VALUE_MATE_IN_MAX_PLY to VALUE_TB_WIN_IN_MAX_PLY to score
688 value = wdl < -drawScore ? VALUE_MATED_IN_MAX_PLY + ss->ply + 1
689 : wdl > drawScore ? VALUE_MATE_IN_MAX_PLY - ss->ply - 1
690 : VALUE_DRAW + 2 * wdl * drawScore;
692 Bound b = wdl < -drawScore ? BOUND_UPPER
693 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
695 if ( b == BOUND_EXACT
696 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
698 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, b,
699 std::min(MAX_PLY - 1, depth + 6),
700 MOVE_NONE, VALUE_NONE);
707 if (b == BOUND_LOWER)
708 bestValue = value, alpha = std::max(alpha, bestValue);
716 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
718 // Step 6. Static evaluation of the position
721 // Skip early pruning when in check
722 ss->staticEval = eval = VALUE_NONE;
730 // Never assume anything about values stored in TT
731 ss->staticEval = eval = tte->eval();
732 if (eval == VALUE_NONE)
733 ss->staticEval = eval = evaluate(pos, &complexity);
734 else // Fall back to (semi)classical complexity for TT hits, the NNUE complexity is lost
735 complexity = abs(ss->staticEval - pos.psq_eg_stm());
737 // ttValue can be used as a better position evaluation (~4 Elo)
738 if ( ttValue != VALUE_NONE
739 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
744 ss->staticEval = eval = evaluate(pos, &complexity);
746 // Save static evaluation into transposition table
748 tte->save(posKey, VALUE_NONE, ss->ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, eval);
751 thisThread->complexityAverage.update(complexity);
753 // Use static evaluation difference to improve quiet move ordering (~3 Elo)
754 if (is_ok((ss-1)->currentMove) && !(ss-1)->inCheck && !priorCapture)
756 int bonus = std::clamp(-19 * int((ss-1)->staticEval + ss->staticEval), -1914, 1914);
757 thisThread->mainHistory[~us][from_to((ss-1)->currentMove)] << bonus;
760 // Set up the improvement variable, which is the difference between the current
761 // static evaluation and the previous static evaluation at our turn (if we were
762 // in check at our previous move we look at the move prior to it). The improvement
763 // margin and the improving flag are used in various pruning heuristics.
764 improvement = (ss-2)->staticEval != VALUE_NONE ? ss->staticEval - (ss-2)->staticEval
765 : (ss-4)->staticEval != VALUE_NONE ? ss->staticEval - (ss-4)->staticEval
767 improving = improvement > 0;
770 // If eval is really low check with qsearch if it can exceed alpha, if it can't,
771 // return a fail low.
772 if (eval < alpha - 369 - 254 * depth * depth)
774 value = qsearch<NonPV>(pos, ss, alpha - 1, alpha);
779 // Step 8. Futility pruning: child node (~25 Elo).
780 // The depth condition is important for mate finding.
783 && eval - futility_margin(depth, improving) - (ss-1)->statScore / 303 >= beta
785 && eval < 28031) // larger than VALUE_KNOWN_WIN, but smaller than TB wins
788 // Step 9. Null move search with verification search (~22 Elo)
790 && (ss-1)->currentMove != MOVE_NULL
791 && (ss-1)->statScore < 17139
793 && eval >= ss->staticEval
794 && ss->staticEval >= beta - 20 * depth - improvement / 13 + 233 + complexity / 25
796 && pos.non_pawn_material(us)
797 && (ss->ply >= thisThread->nmpMinPly || us != thisThread->nmpColor))
799 assert(eval - beta >= 0);
801 // Null move dynamic reduction based on depth, eval and complexity of position
802 Depth R = std::min(int(eval - beta) / 168, 7) + depth / 3 + 4 - (complexity > 861);
804 ss->currentMove = MOVE_NULL;
805 ss->continuationHistory = &thisThread->continuationHistory[0][0][NO_PIECE][0];
807 pos.do_null_move(st);
809 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
811 pos.undo_null_move();
813 if (nullValue >= beta)
815 // Do not return unproven mate or TB scores
816 if (nullValue >= VALUE_TB_WIN_IN_MAX_PLY)
819 if (thisThread->nmpMinPly || (abs(beta) < VALUE_KNOWN_WIN && depth < 14))
822 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
824 // Do verification search at high depths, with null move pruning disabled
825 // for us, until ply exceeds nmpMinPly.
826 thisThread->nmpMinPly = ss->ply + 3 * (depth-R) / 4;
827 thisThread->nmpColor = us;
829 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
831 thisThread->nmpMinPly = 0;
838 probCutBeta = beta + 191 - 54 * improving;
840 // Step 10. ProbCut (~4 Elo)
841 // If we have a good enough capture and a reduced search returns a value
842 // much above beta, we can (almost) safely prune the previous move.
845 && abs(beta) < VALUE_TB_WIN_IN_MAX_PLY
846 // if value from transposition table is lower than probCutBeta, don't attempt probCut
847 // there and in further interactions with transposition table cutoff depth is set to depth - 3
848 // because probCut search has depth set to depth - 4 but we also do a move before it
849 // so effective depth is equal to depth - 3
851 && tte->depth() >= depth - 3
852 && ttValue != VALUE_NONE
853 && ttValue < probCutBeta))
855 assert(probCutBeta < VALUE_INFINITE);
857 MovePicker mp(pos, ttMove, probCutBeta - ss->staticEval, &captureHistory);
859 while ((move = mp.next_move()) != MOVE_NONE)
860 if (move != excludedMove && pos.legal(move))
862 assert(pos.capture(move) || promotion_type(move) == QUEEN);
864 ss->currentMove = move;
865 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
867 [pos.moved_piece(move)]
870 pos.do_move(move, st);
872 // Perform a preliminary qsearch to verify that the move holds
873 value = -qsearch<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1);
875 // If the qsearch held, perform the regular search
876 if (value >= probCutBeta)
877 value = -search<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1, depth - 4, !cutNode);
881 if (value >= probCutBeta)
883 // Save ProbCut data into transposition table
884 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, BOUND_LOWER, depth - 3, move, ss->staticEval);
890 // Step 11. If the position is not in TT, decrease depth by 3.
891 // Use qsearch if depth is equal or below zero (~4 Elo)
897 return qsearch<PV>(pos, ss, alpha, beta);
904 moves_loop: // When in check, search starts here
906 // Step 12. A small Probcut idea, when we are in check (~0 Elo)
907 probCutBeta = beta + 417;
912 && (tte->bound() & BOUND_LOWER)
913 && tte->depth() >= depth - 3
914 && ttValue >= probCutBeta
915 && abs(ttValue) <= VALUE_KNOWN_WIN
916 && abs(beta) <= VALUE_KNOWN_WIN
921 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
922 nullptr , (ss-4)->continuationHistory,
923 nullptr , (ss-6)->continuationHistory };
925 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
927 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
934 moveCountPruning = singularQuietLMR = false;
936 // Indicate PvNodes that will probably fail low if the node was searched
937 // at a depth equal or greater than the current depth, and the result of this search was a fail low.
938 bool likelyFailLow = PvNode
940 && (tte->bound() & BOUND_UPPER)
941 && tte->depth() >= depth;
943 // Step 13. Loop through all pseudo-legal moves until no moves remain
944 // or a beta cutoff occurs.
945 while ((move = mp.next_move(moveCountPruning)) != MOVE_NONE)
949 if (move == excludedMove)
952 // At root obey the "searchmoves" option and skip moves not listed in Root
953 // Move List. As a consequence any illegal move is also skipped. In MultiPV
954 // mode we also skip PV moves which have been already searched and those
955 // of lower "TB rank" if we are in a TB root position.
956 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
957 thisThread->rootMoves.begin() + thisThread->pvLast, move))
960 // Check for legality
961 if (!rootNode && !pos.legal(move))
964 ss->moveCount = ++moveCount;
966 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
967 sync_cout << "info depth " << depth
968 << " currmove " << UCI::move(move, pos.is_chess960())
969 << " currmovenumber " << moveCount + thisThread->pvIdx << sync_endl;
971 (ss+1)->pv = nullptr;
974 capture = pos.capture(move);
975 movedPiece = pos.moved_piece(move);
976 givesCheck = pos.gives_check(move);
978 // Calculate new depth for this move
979 newDepth = depth - 1;
981 Value delta = beta - alpha;
983 // Step 14. Pruning at shallow depth (~98 Elo). Depth conditions are important for mate finding.
985 && pos.non_pawn_material(us)
986 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY)
988 // Skip quiet moves if movecount exceeds our FutilityMoveCount threshold (~7 Elo)
989 moveCountPruning = moveCount >= futility_move_count(improving, depth);
991 // Reduced depth of the next LMR search
992 int lmrDepth = std::max(newDepth - reduction(improving, depth, moveCount, delta, thisThread->rootDelta), 0);
997 // Futility pruning for captures (~0 Elo)
1002 && ss->staticEval + 180 + 201 * lmrDepth + PieceValue[EG][pos.piece_on(to_sq(move))]
1003 + captureHistory[movedPiece][to_sq(move)][type_of(pos.piece_on(to_sq(move)))] / 6 < alpha)
1006 // SEE based pruning (~9 Elo)
1007 if (!pos.see_ge(move, Value(-222) * depth))
1012 int history = (*contHist[0])[movedPiece][to_sq(move)]
1013 + (*contHist[1])[movedPiece][to_sq(move)]
1014 + (*contHist[3])[movedPiece][to_sq(move)];
1016 // Continuation history based pruning (~2 Elo)
1018 && history < -3875 * (depth - 1))
1021 history += 2 * thisThread->mainHistory[us][from_to(move)];
1023 // Futility pruning: parent node (~9 Elo)
1026 && ss->staticEval + 106 + 145 * lmrDepth + history / 52 <= alpha)
1029 // Prune moves with negative SEE (~3 Elo)
1030 if (!pos.see_ge(move, Value(-24 * lmrDepth * lmrDepth - 15 * lmrDepth)))
1035 // Step 15. Extensions (~66 Elo)
1036 // We take care to not overdo to avoid search getting stuck.
1037 if (ss->ply < thisThread->rootDepth * 2)
1039 // Singular extension search (~58 Elo). If all moves but one fail low on a
1040 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
1041 // then that move is singular and should be extended. To verify this we do
1042 // a reduced search on all the other moves but the ttMove and if the
1043 // result is lower than ttValue minus a margin, then we will extend the ttMove.
1045 && depth >= 4 - (thisThread->previousDepth > 24) + 2 * (PvNode && tte->is_pv())
1047 && !excludedMove // Avoid recursive singular search
1048 /* && ttValue != VALUE_NONE Already implicit in the next condition */
1049 && abs(ttValue) < VALUE_KNOWN_WIN
1050 && (tte->bound() & BOUND_LOWER)
1051 && tte->depth() >= depth - 3)
1053 Value singularBeta = ttValue - (3 + (ss->ttPv && !PvNode)) * depth;
1054 Depth singularDepth = (depth - 1) / 2;
1056 ss->excludedMove = move;
1057 value = search<NonPV>(pos, ss, singularBeta - 1, singularBeta, singularDepth, cutNode);
1058 ss->excludedMove = MOVE_NONE;
1060 if (value < singularBeta)
1063 singularQuietLMR = !ttCapture;
1065 // Avoid search explosion by limiting the number of double extensions
1067 && value < singularBeta - 25
1068 && ss->doubleExtensions <= 10)
1071 depth += depth < 12;
1075 // Multi-cut pruning
1076 // Our ttMove is assumed to fail high, and now we failed high also on a reduced
1077 // search without the ttMove. So we assume this expected Cut-node is not singular,
1078 // that multiple moves fail high, and we can prune the whole subtree by returning
1080 else if (singularBeta >= beta)
1081 return singularBeta;
1083 // If the eval of ttMove is greater than beta, we reduce it (negative extension)
1084 else if (ttValue >= beta)
1087 // If the eval of ttMove is less than alpha and value, we reduce it (negative extension)
1088 else if (ttValue <= alpha && ttValue <= value)
1092 // Check extensions (~1 Elo)
1093 else if ( givesCheck
1095 && abs(ss->staticEval) > 82)
1098 // Quiet ttMove extensions (~0 Elo)
1101 && move == ss->killers[0]
1102 && (*contHist[0])[movedPiece][to_sq(move)] >= 5177)
1106 // Add extension to new depth
1107 newDepth += extension;
1108 ss->doubleExtensions = (ss-1)->doubleExtensions + (extension == 2);
1110 // Speculative prefetch as early as possible
1111 prefetch(TT.first_entry(pos.key_after(move)));
1113 // Update the current move (this must be done after singular extension search)
1114 ss->currentMove = move;
1115 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1120 // Step 16. Make the move
1121 pos.do_move(move, st, givesCheck);
1123 // Step 17. Late moves reduction / extension (LMR, ~98 Elo)
1124 // We use various heuristics for the sons of a node after the first son has
1125 // been searched. In general we would like to reduce them, but there are many
1126 // cases where we extend a son if it has good chances to be "interesting".
1128 && moveCount > 1 + (PvNode && ss->ply <= 1)
1131 || (cutNode && (ss-1)->moveCount > 1)))
1133 Depth r = reduction(improving, depth, moveCount, delta, thisThread->rootDelta);
1135 // Decrease reduction if position is or has been on the PV
1136 // and node is not likely to fail low. (~3 Elo)
1141 // Decrease reduction if opponent's move count is high (~1 Elo)
1142 if ((ss-1)->moveCount > 7)
1145 // Increase reduction for cut nodes (~3 Elo)
1149 // Increase reduction if ttMove is a capture (~3 Elo)
1153 // Decrease reduction for PvNodes based on depth
1155 r -= 1 + 11 / (3 + depth);
1157 // Decrease reduction if ttMove has been singularly extended (~1 Elo)
1158 if (singularQuietLMR)
1161 // Decrease reduction if we move a threatened piece (~1 Elo)
1163 && (mp.threatenedPieces & from_sq(move)))
1166 // Increase reduction if next ply has a lot of fail high
1167 if ((ss+1)->cutoffCnt > 3)
1170 ss->statScore = 2 * thisThread->mainHistory[us][from_to(move)]
1171 + (*contHist[0])[movedPiece][to_sq(move)]
1172 + (*contHist[1])[movedPiece][to_sq(move)]
1173 + (*contHist[3])[movedPiece][to_sq(move)]
1176 // Decrease/increase reduction for moves with a good/bad history (~30 Elo)
1177 r -= ss->statScore / (13000 + 4152 * (depth > 7 && depth < 19));
1179 // In general we want to cap the LMR depth search at newDepth, but when
1180 // reduction is negative, we allow this move a limited search extension
1181 // beyond the first move depth. This may lead to hidden double extensions.
1182 Depth d = std::clamp(newDepth - r, 1, newDepth + 1);
1184 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1186 // Do full depth search when reduced LMR search fails high
1187 if (value > alpha && d < newDepth)
1189 // Adjust full depth search based on LMR results - if result
1190 // was good enough search deeper, if it was bad enough search shallower
1191 const bool doDeeperSearch = value > (alpha + 64 + 11 * (newDepth - d));
1192 const bool doEvenDeeperSearch = value > alpha + 582 && ss->doubleExtensions <= 5;
1193 const bool doShallowerSearch = value < bestValue + newDepth;
1195 ss->doubleExtensions = ss->doubleExtensions + doEvenDeeperSearch;
1197 newDepth += doDeeperSearch - doShallowerSearch + doEvenDeeperSearch;
1200 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1202 int bonus = value > alpha ? stat_bonus(newDepth)
1203 : -stat_bonus(newDepth);
1208 update_continuation_histories(ss, movedPiece, to_sq(move), bonus);
1212 // Step 18. Full depth search when LMR is skipped
1213 else if (!PvNode || moveCount > 1)
1215 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1218 // For PV nodes only, do a full PV search on the first move or after a fail
1219 // high (in the latter case search only if value < beta), otherwise let the
1220 // parent node fail low with value <= alpha and try another move.
1221 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1224 (ss+1)->pv[0] = MOVE_NONE;
1226 value = -search<PV>(pos, ss+1, -beta, -alpha,
1227 std::min(maxNextDepth, newDepth), false);
1230 // Step 19. Undo move
1231 pos.undo_move(move);
1233 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1235 // Step 20. Check for a new best move
1236 // Finished searching the move. If a stop occurred, the return value of
1237 // the search cannot be trusted, and we return immediately without
1238 // updating best move, PV and TT.
1239 if (Threads.stop.load(std::memory_order_relaxed))
1244 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1245 thisThread->rootMoves.end(), move);
1247 rm.averageScore = rm.averageScore != -VALUE_INFINITE ? (2 * value + rm.averageScore) / 3 : value;
1249 // PV move or new best move?
1250 if (moveCount == 1 || value > alpha)
1252 rm.score = rm.uciScore = value;
1253 rm.selDepth = thisThread->selDepth;
1254 rm.scoreLowerbound = rm.scoreUpperbound = false;
1256 if (value >= beta) {
1257 rm.scoreLowerbound = true;
1260 else if (value <= alpha) {
1261 rm.scoreUpperbound = true;
1262 rm.uciScore = alpha;
1268 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1269 rm.pv.push_back(*m);
1271 // We record how often the best move has been changed in each iteration.
1272 // This information is used for time management. In MultiPV mode,
1273 // we must take care to only do this for the first PV line.
1275 && !thisThread->pvIdx)
1276 ++thisThread->bestMoveChanges;
1279 // All other moves but the PV are set to the lowest value: this
1280 // is not a problem when sorting because the sort is stable and the
1281 // move position in the list is preserved - just the PV is pushed up.
1282 rm.score = -VALUE_INFINITE;
1285 if (value > bestValue)
1293 if (PvNode && !rootNode) // Update pv even in fail-high case
1294 update_pv(ss->pv, move, (ss+1)->pv);
1296 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1300 // Reduce other moves if we have found at least one score improvement
1303 && beta < VALUE_KNOWN_WIN
1304 && alpha > -VALUE_KNOWN_WIN)
1312 assert(value >= beta); // Fail high
1319 // If the move is worse than some previously searched move, remember it to update its stats later
1320 if (move != bestMove)
1322 if (capture && captureCount < 32)
1323 capturesSearched[captureCount++] = move;
1325 else if (!capture && quietCount < 64)
1326 quietsSearched[quietCount++] = move;
1330 // The following condition would detect a stop only after move loop has been
1331 // completed. But in this case bestValue is valid because we have fully
1332 // searched our subtree, and we can anyhow save the result in TT.
1338 // Step 21. Check for mate and stalemate
1339 // All legal moves have been searched and if there are no legal moves, it
1340 // must be a mate or a stalemate. If we are in a singular extension search then
1341 // return a fail low score.
1343 assert(moveCount || !ss->inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1346 bestValue = excludedMove ? alpha :
1347 ss->inCheck ? mated_in(ss->ply)
1350 // If there is a move which produces search value greater than alpha we update stats of searched moves
1352 update_all_stats(pos, ss, bestMove, bestValue, beta, prevSq,
1353 quietsSearched, quietCount, capturesSearched, captureCount, depth);
1355 // Bonus for prior countermove that caused the fail low
1356 else if ( (depth >= 5 || PvNode)
1359 //Assign extra bonus if current node is PvNode or cutNode
1360 //or fail low was really bad
1361 bool extraBonus = PvNode
1363 || bestValue < alpha - 62 * depth;
1365 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth) * (1 + extraBonus));
1369 bestValue = std::min(bestValue, maxValue);
1371 // If no good move is found and the previous position was ttPv, then the previous
1372 // opponent move is probably good and the new position is added to the search tree.
1373 if (bestValue <= alpha)
1374 ss->ttPv = ss->ttPv || ((ss-1)->ttPv && depth > 3);
1376 // Write gathered information in transposition table
1377 if (!excludedMove && !(rootNode && thisThread->pvIdx))
1378 tte->save(posKey, value_to_tt(bestValue, ss->ply), ss->ttPv,
1379 bestValue >= beta ? BOUND_LOWER :
1380 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1381 depth, bestMove, ss->staticEval);
1383 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1389 // qsearch() is the quiescence search function, which is called by the main search
1390 // function with zero depth, or recursively with further decreasing depth per call.
1392 template <NodeType nodeType>
1393 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1395 static_assert(nodeType != Root);
1396 constexpr bool PvNode = nodeType == PV;
1398 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1399 assert(PvNode || (alpha == beta - 1));
1404 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1408 Move ttMove, move, bestMove;
1410 Value bestValue, value, ttValue, futilityValue, futilityBase;
1411 bool pvHit, givesCheck, capture;
1417 ss->pv[0] = MOVE_NONE;
1420 Thread* thisThread = pos.this_thread();
1421 bestMove = MOVE_NONE;
1422 ss->inCheck = pos.checkers();
1425 // Check for an immediate draw or maximum ply reached
1426 if ( pos.is_draw(ss->ply)
1427 || ss->ply >= MAX_PLY)
1428 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos) : VALUE_DRAW;
1430 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1432 // Decide whether or not to include checks: this fixes also the type of
1433 // TT entry depth that we are going to use. Note that in qsearch we use
1434 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1435 ttDepth = ss->inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1436 : DEPTH_QS_NO_CHECKS;
1437 // Transposition table lookup
1439 tte = TT.probe(posKey, ss->ttHit);
1440 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
1441 ttMove = ss->ttHit ? tte->move() : MOVE_NONE;
1442 pvHit = ss->ttHit && tte->is_pv();
1446 && tte->depth() >= ttDepth
1447 && ttValue != VALUE_NONE // Only in case of TT access race
1448 && (tte->bound() & (ttValue >= beta ? BOUND_LOWER : BOUND_UPPER)))
1451 // Evaluate the position statically
1454 ss->staticEval = VALUE_NONE;
1455 bestValue = futilityBase = -VALUE_INFINITE;
1461 // Never assume anything about values stored in TT
1462 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1463 ss->staticEval = bestValue = evaluate(pos);
1465 // ttValue can be used as a better position evaluation (~7 Elo)
1466 if ( ttValue != VALUE_NONE
1467 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1468 bestValue = ttValue;
1471 // In case of null move search use previous static eval with a different sign
1472 ss->staticEval = bestValue =
1473 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1474 : -(ss-1)->staticEval;
1476 // Stand pat. Return immediately if static value is at least beta
1477 if (bestValue >= beta)
1479 // Save gathered info in transposition table
1481 tte->save(posKey, value_to_tt(bestValue, ss->ply), false, BOUND_LOWER,
1482 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1487 if (PvNode && bestValue > alpha)
1490 futilityBase = bestValue + 153;
1493 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
1494 nullptr , (ss-4)->continuationHistory,
1495 nullptr , (ss-6)->continuationHistory };
1497 // Initialize a MovePicker object for the current position, and prepare
1498 // to search the moves. Because the depth is <= 0 here, only captures,
1499 // queen promotions, and other checks (only if depth >= DEPTH_QS_CHECKS)
1500 // will be generated.
1501 Square prevSq = to_sq((ss-1)->currentMove);
1502 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
1503 &thisThread->captureHistory,
1507 int quietCheckEvasions = 0;
1509 // Loop through the moves until no moves remain or a beta cutoff occurs
1510 while ((move = mp.next_move()) != MOVE_NONE)
1512 assert(is_ok(move));
1514 // Check for legality
1515 if (!pos.legal(move))
1518 givesCheck = pos.gives_check(move);
1519 capture = pos.capture(move);
1523 // Futility pruning and moveCount pruning (~5 Elo)
1524 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1526 && to_sq(move) != prevSq
1527 && futilityBase > -VALUE_KNOWN_WIN
1528 && type_of(move) != PROMOTION)
1533 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1535 if (futilityValue <= alpha)
1537 bestValue = std::max(bestValue, futilityValue);
1541 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1543 bestValue = std::max(bestValue, futilityBase);
1548 // Do not search moves with negative SEE values (~5 Elo)
1549 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1550 && !pos.see_ge(move))
1553 // Speculative prefetch as early as possible
1554 prefetch(TT.first_entry(pos.key_after(move)));
1556 ss->currentMove = move;
1557 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1559 [pos.moved_piece(move)]
1562 // Continuation history based pruning (~2 Elo)
1564 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1565 && (*contHist[0])[pos.moved_piece(move)][to_sq(move)] < 0
1566 && (*contHist[1])[pos.moved_piece(move)][to_sq(move)] < 0)
1569 // We prune after 2nd quiet check evasion where being 'in check' is implicitly checked through the counter
1570 // and being a 'quiet' apart from being a tt move is assumed after an increment because captures are pushed ahead.
1571 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1572 && quietCheckEvasions > 1)
1575 quietCheckEvasions += !capture && ss->inCheck;
1577 // Make and search the move
1578 pos.do_move(move, st, givesCheck);
1579 value = -qsearch<nodeType>(pos, ss+1, -beta, -alpha, depth - 1);
1580 pos.undo_move(move);
1582 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1584 // Check for a new best move
1585 if (value > bestValue)
1593 if (PvNode) // Update pv even in fail-high case
1594 update_pv(ss->pv, move, (ss+1)->pv);
1596 if (PvNode && value < beta) // Update alpha here!
1604 // All legal moves have been searched. A special case: if we're in check
1605 // and no legal moves were found, it is checkmate.
1606 if (ss->inCheck && bestValue == -VALUE_INFINITE)
1608 assert(!MoveList<LEGAL>(pos).size());
1610 return mated_in(ss->ply); // Plies to mate from the root
1613 // Save gathered info in transposition table
1614 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1615 bestValue >= beta ? BOUND_LOWER : BOUND_UPPER,
1616 ttDepth, bestMove, ss->staticEval);
1618 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1624 // value_to_tt() adjusts a mate or TB score from "plies to mate from the root" to
1625 // "plies to mate from the current position". Standard scores are unchanged.
1626 // The function is called before storing a value in the transposition table.
1628 Value value_to_tt(Value v, int ply) {
1630 assert(v != VALUE_NONE);
1632 return v >= VALUE_TB_WIN_IN_MAX_PLY ? v + ply
1633 : v <= VALUE_TB_LOSS_IN_MAX_PLY ? v - ply : v;
1637 // value_from_tt() is the inverse of value_to_tt(): it adjusts a mate or TB score
1638 // from the transposition table (which refers to the plies to mate/be mated from
1639 // current position) to "plies to mate/be mated (TB win/loss) from the root". However,
1640 // for mate scores, to avoid potentially false mate scores related to the 50 moves rule
1641 // and the graph history interaction, we return an optimal TB score instead.
1643 Value value_from_tt(Value v, int ply, int r50c) {
1645 if (v == VALUE_NONE)
1648 if (v >= VALUE_TB_WIN_IN_MAX_PLY) // TB win or better
1650 if (v >= VALUE_MATE_IN_MAX_PLY && VALUE_MATE - v > 99 - r50c)
1651 return VALUE_MATE_IN_MAX_PLY - 1; // do not return a potentially false mate score
1656 if (v <= VALUE_TB_LOSS_IN_MAX_PLY) // TB loss or worse
1658 if (v <= VALUE_MATED_IN_MAX_PLY && VALUE_MATE + v > 99 - r50c)
1659 return VALUE_MATED_IN_MAX_PLY + 1; // do not return a potentially false mate score
1668 // update_pv() adds current move and appends child pv[]
1670 void update_pv(Move* pv, Move move, const Move* childPv) {
1672 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1678 // update_all_stats() updates stats at the end of search() when a bestMove is found
1680 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
1681 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth) {
1683 Color us = pos.side_to_move();
1684 Thread* thisThread = pos.this_thread();
1685 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
1686 Piece moved_piece = pos.moved_piece(bestMove);
1687 PieceType captured = type_of(pos.piece_on(to_sq(bestMove)));
1688 int bonus1 = stat_bonus(depth + 1);
1690 if (!pos.capture(bestMove))
1692 int bonus2 = bestValue > beta + 137 ? bonus1 // larger bonus
1693 : stat_bonus(depth); // smaller bonus
1695 // Increase stats for the best move in case it was a quiet move
1696 update_quiet_stats(pos, ss, bestMove, bonus2);
1698 // Decrease stats for all non-best quiet moves
1699 for (int i = 0; i < quietCount; ++i)
1701 thisThread->mainHistory[us][from_to(quietsSearched[i])] << -bonus2;
1702 update_continuation_histories(ss, pos.moved_piece(quietsSearched[i]), to_sq(quietsSearched[i]), -bonus2);
1706 // Increase stats for the best move in case it was a capture move
1707 captureHistory[moved_piece][to_sq(bestMove)][captured] << bonus1;
1709 // Extra penalty for a quiet early move that was not a TT move or
1710 // main killer move in previous ply when it gets refuted.
1711 if ( ((ss-1)->moveCount == 1 + (ss-1)->ttHit || ((ss-1)->currentMove == (ss-1)->killers[0]))
1712 && !pos.captured_piece())
1713 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -bonus1);
1715 // Decrease stats for all non-best capture moves
1716 for (int i = 0; i < captureCount; ++i)
1718 moved_piece = pos.moved_piece(capturesSearched[i]);
1719 captured = type_of(pos.piece_on(to_sq(capturesSearched[i])));
1720 captureHistory[moved_piece][to_sq(capturesSearched[i])][captured] << -bonus1;
1725 // update_continuation_histories() updates histories of the move pairs formed
1726 // by moves at ply -1, -2, -4, and -6 with current move.
1728 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1730 for (int i : {1, 2, 4, 6})
1732 // Only update first 2 continuation histories if we are in check
1733 if (ss->inCheck && i > 2)
1735 if (is_ok((ss-i)->currentMove))
1736 (*(ss-i)->continuationHistory)[pc][to] << bonus;
1741 // update_quiet_stats() updates move sorting heuristics
1743 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus) {
1746 if (ss->killers[0] != move)
1748 ss->killers[1] = ss->killers[0];
1749 ss->killers[0] = move;
1752 Color us = pos.side_to_move();
1753 Thread* thisThread = pos.this_thread();
1754 thisThread->mainHistory[us][from_to(move)] << bonus;
1755 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1757 // Update countermove history
1758 if (is_ok((ss-1)->currentMove))
1760 Square prevSq = to_sq((ss-1)->currentMove);
1761 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1765 // When playing with strength handicap, choose best move among a set of RootMoves
1766 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1768 Move Skill::pick_best(size_t multiPV) {
1770 const RootMoves& rootMoves = Threads.main()->rootMoves;
1771 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1773 // RootMoves are already sorted by score in descending order
1774 Value topScore = rootMoves[0].score;
1775 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1776 int maxScore = -VALUE_INFINITE;
1777 double weakness = 120 - 2 * level;
1779 // Choose best move. For each move score we add two terms, both dependent on
1780 // weakness. One is deterministic and bigger for weaker levels, and one is
1781 // random. Then we choose the move with the resulting highest score.
1782 for (size_t i = 0; i < multiPV; ++i)
1784 // This is our magic formula
1785 int push = int(( weakness * int(topScore - rootMoves[i].score)
1786 + delta * (rng.rand<unsigned>() % int(weakness))) / 128);
1788 if (rootMoves[i].score + push >= maxScore)
1790 maxScore = rootMoves[i].score + push;
1791 best = rootMoves[i].pv[0];
1801 /// MainThread::check_time() is used to print debug info and, more importantly,
1802 /// to detect when we are out of available time and thus stop the search.
1804 void MainThread::check_time() {
1809 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1810 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1812 static TimePoint lastInfoTime = now();
1814 TimePoint elapsed = Time.elapsed();
1815 TimePoint tick = Limits.startTime + elapsed;
1817 if (tick - lastInfoTime >= 1000)
1819 lastInfoTime = tick;
1823 // We should not stop pondering until told so by the GUI
1827 if ( (Limits.use_time_management() && (elapsed > Time.maximum() - 10 || stopOnPonderhit))
1828 || (Limits.movetime && elapsed >= Limits.movetime)
1829 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1830 Threads.stop = true;
1834 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1835 /// that all (if any) unsearched PV lines are sent using a previous search score.
1837 string UCI::pv(const Position& pos, Depth depth) {
1839 std::stringstream ss;
1840 TimePoint elapsed = Time.elapsed() + 1;
1841 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1842 size_t pvIdx = pos.this_thread()->pvIdx;
1843 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1844 uint64_t nodesSearched = Threads.nodes_searched();
1845 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1847 for (size_t i = 0; i < multiPV; ++i)
1849 bool updated = rootMoves[i].score != -VALUE_INFINITE;
1851 if (depth == 1 && !updated && i > 0)
1854 Depth d = updated ? depth : std::max(1, depth - 1);
1855 Value v = updated ? rootMoves[i].uciScore : rootMoves[i].previousScore;
1857 if (v == -VALUE_INFINITE)
1860 bool tb = TB::RootInTB && abs(v) < VALUE_MATE_IN_MAX_PLY;
1861 v = tb ? rootMoves[i].tbScore : v;
1863 if (ss.rdbuf()->in_avail()) // Not at first line
1868 << " seldepth " << rootMoves[i].selDepth
1869 << " multipv " << i + 1
1870 << " score " << UCI::value(v);
1872 if (Options["UCI_ShowWDL"])
1873 ss << UCI::wdl(v, pos.game_ply());
1875 if (i == pvIdx && !tb && updated) // tablebase- and previous-scores are exact
1876 ss << (rootMoves[i].scoreLowerbound ? " lowerbound" : (rootMoves[i].scoreUpperbound ? " upperbound" : ""));
1878 ss << " nodes " << nodesSearched
1879 << " nps " << nodesSearched * 1000 / elapsed
1880 << " hashfull " << TT.hashfull()
1881 << " tbhits " << tbHits
1882 << " time " << elapsed
1885 for (Move m : rootMoves[i].pv)
1886 ss << " " << UCI::move(m, pos.is_chess960());
1893 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1894 /// before exiting the search, for instance, in case we stop the search during a
1895 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1896 /// otherwise in case of 'ponder on' we have nothing to think on.
1898 bool RootMove::extract_ponder_from_tt(Position& pos) {
1901 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1905 assert(pv.size() == 1);
1907 if (pv[0] == MOVE_NONE)
1910 pos.do_move(pv[0], st);
1911 TTEntry* tte = TT.probe(pos.key(), ttHit);
1915 Move m = tte->move(); // Local copy to be SMP safe
1916 if (MoveList<LEGAL>(pos).contains(m))
1920 pos.undo_move(pv[0]);
1921 return pv.size() > 1;
1924 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1927 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1928 ProbeDepth = int(Options["SyzygyProbeDepth"]);
1929 Cardinality = int(Options["SyzygyProbeLimit"]);
1930 bool dtz_available = true;
1932 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1933 // ProbeDepth == DEPTH_ZERO
1934 if (Cardinality > MaxCardinality)
1936 Cardinality = MaxCardinality;
1940 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1942 // Rank moves using DTZ tables
1943 RootInTB = root_probe(pos, rootMoves);
1947 // DTZ tables are missing; try to rank moves using WDL tables
1948 dtz_available = false;
1949 RootInTB = root_probe_wdl(pos, rootMoves);
1955 // Sort moves according to TB rank
1956 std::stable_sort(rootMoves.begin(), rootMoves.end(),
1957 [](const RootMove &a, const RootMove &b) { return a.tbRank > b.tbRank; } );
1959 // Probe during search only if DTZ is not available and we are winning
1960 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
1965 // Clean up if root_probe() and root_probe_wdl() have failed
1966 for (auto& m : rootMoves)
1971 } // namespace Stockfish