2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2021 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(214 * (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, bool rangeReduction, Value delta, Value rootDelta) {
73 int r = Reductions[d] * Reductions[mn];
74 return (r + 1358 - int(delta) * 1024 / int(rootDelta)) / 1024 + (!i && r > 904) + rangeReduction;
77 constexpr int futility_move_count(bool improving, Depth depth) {
78 return (3 + depth * depth) / (2 - improving);
81 // History and stats update bonus, based on depth
82 int stat_bonus(Depth d) {
83 return std::min((6 * d + 229) * d - 215 , 2000);
86 // Add a small random component to draw evaluations to avoid 3-fold blindness
87 Value value_draw(Thread* thisThread) {
88 return VALUE_DRAW + Value(2 * (thisThread->nodes & 1) - 1);
91 // Check if the current thread is in a search explosion
92 ExplosionState search_explosion(Thread* thisThread) {
94 uint64_t nodesNow = thisThread->nodes;
95 bool explosive = thisThread->doubleExtensionAverage[WHITE].is_greater(2, 100)
96 || thisThread->doubleExtensionAverage[BLACK].is_greater(2, 100);
99 thisThread->nodesLastExplosive = nodesNow;
101 thisThread->nodesLastNormal = nodesNow;
104 && thisThread->state == EXPLOSION_NONE
105 && nodesNow - thisThread->nodesLastNormal > 6000000)
106 thisThread->state = MUST_CALM_DOWN;
108 if ( thisThread->state == MUST_CALM_DOWN
109 && nodesNow - thisThread->nodesLastExplosive > 6000000)
110 thisThread->state = EXPLOSION_NONE;
112 return thisThread->state;
115 // Skill structure is used to implement strength limit. If we have an uci_elo then
116 // we convert it to a suitable fractional skill level using anchoring to CCRL Elo
117 // (goldfish 1.13 = 2000) and a fit through Ordo derived Elo for match (TC 60+0.6)
118 // results spanning a wide range of k values.
120 Skill(int skill_level, int uci_elo) {
122 level = std::clamp(std::pow((uci_elo - 1346.6) / 143.4, 1 / 0.806), 0.0, 20.0);
124 level = double(skill_level);
126 bool enabled() const { return level < 20.0; }
127 bool time_to_pick(Depth depth) const { return depth == 1 + int(level); }
128 Move pick_best(size_t multiPV);
131 Move best = MOVE_NONE;
134 template <NodeType nodeType>
135 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
137 template <NodeType nodeType>
138 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = 0);
140 Value value_to_tt(Value v, int ply);
141 Value value_from_tt(Value v, int ply, int r50c);
142 void update_pv(Move* pv, Move move, Move* childPv);
143 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
144 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus);
145 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
146 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth);
148 // perft() is our utility to verify move generation. All the leaf nodes up
149 // to the given depth are generated and counted, and the sum is returned.
151 uint64_t perft(Position& pos, Depth depth) {
154 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
156 uint64_t cnt, nodes = 0;
157 const bool leaf = (depth == 2);
159 for (const auto& m : MoveList<LEGAL>(pos))
161 if (Root && depth <= 1)
166 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - 1);
171 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
179 /// Search::init() is called at startup to initialize various lookup tables
181 void Search::init() {
183 for (int i = 1; i < MAX_MOVES; ++i)
184 Reductions[i] = int((21.9 + std::log(Threads.size()) / 2) * std::log(i));
188 /// Search::clear() resets search state to its initial value
190 void Search::clear() {
192 Threads.main()->wait_for_search_finished();
194 Time.availableNodes = 0;
197 Tablebases::init(Options["SyzygyPath"]); // Free mapped files
201 /// MainThread::search() is started when the program receives the UCI 'go'
202 /// 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)
228 Threads.start_searching(); // start non-main threads
229 Thread::search(); // main thread start searching
232 // When we reach the maximum depth, we can arrive here without a raise of
233 // Threads.stop. However, if we are pondering or in an infinite search,
234 // the UCI protocol states that we shouldn't print the best move before the
235 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
236 // until the GUI sends one of those commands.
238 while (!Threads.stop && (ponder || Limits.infinite))
239 {} // Busy wait for a stop or a ponder reset
241 // Stop the threads if not already stopped (also raise the stop if
242 // "ponderhit" just reset Threads.ponder).
245 // Wait until all threads have finished
246 Threads.wait_for_search_finished();
248 // When playing in 'nodes as time' mode, subtract the searched nodes from
249 // the available ones before exiting.
251 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
253 Thread* bestThread = this;
254 Skill skill = Skill(Options["Skill Level"], Options["UCI_LimitStrength"] ? int(Options["UCI_Elo"]) : 0);
256 if ( int(Options["MultiPV"]) == 1
259 && rootMoves[0].pv[0] != MOVE_NONE)
260 bestThread = Threads.get_best_thread();
262 bestPreviousScore = bestThread->rootMoves[0].score;
263 bestPreviousAverageScore = bestThread->rootMoves[0].averageScore;
265 // Send again PV info if we have a new best thread
266 if (bestThread != this)
267 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth, -VALUE_INFINITE, VALUE_INFINITE) << sync_endl;
269 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
271 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
272 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
274 std::cout << sync_endl;
278 /// Thread::search() is the main iterative deepening loop. It calls search()
279 /// repeatedly with increasing depth until the allocated thinking time has been
280 /// consumed, the user stops the search, or the maximum search depth is reached.
282 void Thread::search() {
284 // To allow access to (ss-7) up to (ss+2), the stack must be oversized.
285 // The former is needed to allow update_continuation_histories(ss-1, ...),
286 // which accesses its argument at ss-6, also near the root.
287 // The latter is needed for statScore and killer initialization.
288 Stack stack[MAX_PLY+10], *ss = stack+7;
290 Value alpha, beta, delta;
291 Move lastBestMove = MOVE_NONE;
292 Depth lastBestMoveDepth = 0;
293 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
294 double timeReduction = 1, totBestMoveChanges = 0;
295 Color us = rootPos.side_to_move();
298 std::memset(ss-7, 0, 10 * sizeof(Stack));
299 for (int i = 7; i > 0; i--)
300 (ss-i)->continuationHistory = &this->continuationHistory[0][0][NO_PIECE][0]; // Use as a sentinel
302 for (int i = 0; i <= MAX_PLY + 2; ++i)
307 bestValue = delta = alpha = -VALUE_INFINITE;
308 beta = 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 doubleExtensionAverage[WHITE].set(0, 100); // initialize the running average at 0%
331 doubleExtensionAverage[BLACK].set(0, 100); // initialize the running average at 0%
333 nodesLastExplosive = nodes;
334 nodesLastNormal = nodes;
335 state = EXPLOSION_NONE;
337 optimism[ us] = Value(25);
338 optimism[~us] = -optimism[us];
340 int searchAgainCounter = 0;
342 // Iterative deepening loop until requested to stop or the target depth is reached
343 while ( ++rootDepth < MAX_PLY
345 && !(Limits.depth && mainThread && rootDepth > Limits.depth))
347 // Age out PV variability metric
349 totBestMoveChanges /= 2;
351 // Save the last iteration's scores before first PV line is searched and
352 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
353 for (RootMove& rm : rootMoves)
354 rm.previousScore = rm.score;
359 if (!Threads.increaseDepth)
360 searchAgainCounter++;
362 // MultiPV loop. We perform a full root search for each PV line
363 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
368 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
369 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
373 // Reset UCI info selDepth for each depth and each PV line
376 // Reset aspiration window starting size
379 Value prev = rootMoves[pvIdx].averageScore;
380 delta = Value(17) + int(prev) * prev / 16384;
381 alpha = std::max(prev - delta,-VALUE_INFINITE);
382 beta = std::min(prev + delta, VALUE_INFINITE);
384 // Adjust trend and optimism based on root move's previousScore
385 int tr = sigmoid(prev, 0, 0, 147, 113, 1);
386 trend = (us == WHITE ? make_score(tr, tr / 2)
387 : -make_score(tr, tr / 2));
389 int opt = sigmoid(prev, 0, 25, 147, 14464, 256);
390 optimism[ us] = Value(opt);
391 optimism[~us] = -optimism[us];
394 // Start with a small aspiration window and, in the case of a fail
395 // high/low, re-search with a bigger window until we don't fail
397 int failedHighCnt = 0;
400 Depth adjustedDepth = std::max(1, rootDepth - failedHighCnt - searchAgainCounter);
401 bestValue = Stockfish::search<Root>(rootPos, ss, alpha, beta, adjustedDepth, false);
403 // Bring the best move to the front. It is critical that sorting
404 // is done with a stable algorithm because all the values but the
405 // first and eventually the new best one are set to -VALUE_INFINITE
406 // and we want to keep the same order for all the moves except the
407 // new PV that goes to the front. Note that in case of MultiPV
408 // search the already searched PV lines are preserved.
409 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
411 // If search has been stopped, we break immediately. Sorting is
412 // safe because RootMoves is still valid, although it refers to
413 // the previous iteration.
417 // When failing high/low give some update (without cluttering
418 // the UI) before a re-search.
421 && (bestValue <= alpha || bestValue >= beta)
422 && Time.elapsed() > 3000)
423 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
425 // In case of failing low/high increase aspiration window and
426 // re-search, otherwise exit the loop.
427 if (bestValue <= alpha)
429 beta = (alpha + beta) / 2;
430 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
434 mainThread->stopOnPonderhit = false;
436 else if (bestValue >= beta)
438 beta = std::min(bestValue + delta, VALUE_INFINITE);
444 delta += delta / 4 + 5;
446 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
449 // Sort the PV lines searched so far and update the GUI
450 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
453 && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
454 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
458 completedDepth = rootDepth;
460 if (rootMoves[0].pv[0] != lastBestMove) {
461 lastBestMove = rootMoves[0].pv[0];
462 lastBestMoveDepth = rootDepth;
465 // Have we found a "mate in x"?
467 && bestValue >= VALUE_MATE_IN_MAX_PLY
468 && VALUE_MATE - bestValue <= 2 * Limits.mate)
474 // If skill level is enabled and time is up, pick a sub-optimal best move
475 if (skill.enabled() && skill.time_to_pick(rootDepth))
476 skill.pick_best(multiPV);
478 // Use part of the gained time from a previous stable move for the current move
479 for (Thread* th : Threads)
481 totBestMoveChanges += th->bestMoveChanges;
482 th->bestMoveChanges = 0;
485 // Do we have time for the next iteration? Can we stop searching now?
486 if ( Limits.use_time_management()
488 && !mainThread->stopOnPonderhit)
490 double fallingEval = (142 + 12 * (mainThread->bestPreviousAverageScore - bestValue)
491 + 6 * (mainThread->iterValue[iterIdx] - bestValue)) / 825.0;
492 fallingEval = std::clamp(fallingEval, 0.5, 1.5);
494 // If the bestMove is stable over several iterations, reduce time accordingly
495 timeReduction = lastBestMoveDepth + 9 < completedDepth ? 1.92 : 0.95;
496 double reduction = (1.47 + mainThread->previousTimeReduction) / (2.32 * timeReduction);
497 double bestMoveInstability = 1.073 + std::max(1.0, 2.25 - 9.9 / rootDepth)
498 * totBestMoveChanges / Threads.size();
499 double totalTime = Time.optimum() * fallingEval * reduction * bestMoveInstability;
501 // Cap used time in case of a single legal move for a better viewer experience in tournaments
502 // yielding correct scores and sufficiently fast moves.
503 if (rootMoves.size() == 1)
504 totalTime = std::min(500.0, totalTime);
506 // Stop the search if we have exceeded the totalTime
507 if (Time.elapsed() > totalTime)
509 // If we are allowed to ponder do not stop the search now but
510 // keep pondering until the GUI sends "ponderhit" or "stop".
511 if (mainThread->ponder)
512 mainThread->stopOnPonderhit = true;
516 else if ( Threads.increaseDepth
517 && !mainThread->ponder
518 && Time.elapsed() > totalTime * 0.58)
519 Threads.increaseDepth = false;
521 Threads.increaseDepth = true;
524 mainThread->iterValue[iterIdx] = bestValue;
525 iterIdx = (iterIdx + 1) & 3;
531 mainThread->previousTimeReduction = timeReduction;
533 // If skill level is enabled, swap best PV line with the sub-optimal one
535 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
536 skill.best ? skill.best : skill.pick_best(multiPV)));
542 // search<>() is the main search function for both PV and non-PV nodes
544 template <NodeType nodeType>
545 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
547 Thread* thisThread = pos.this_thread();
549 // Step 0. Limit search explosion
551 && search_explosion(thisThread) == MUST_CALM_DOWN
552 && depth > (ss-1)->depth)
553 depth = (ss-1)->depth;
555 constexpr bool PvNode = nodeType != NonPV;
556 constexpr bool rootNode = nodeType == Root;
557 const Depth maxNextDepth = rootNode ? depth : depth + 1;
559 // Check if we have an upcoming move which draws by repetition, or
560 // if the opponent had an alternative move earlier to this position.
562 && pos.rule50_count() >= 3
563 && alpha < VALUE_DRAW
564 && pos.has_game_cycle(ss->ply))
566 alpha = value_draw(pos.this_thread());
571 // Dive into quiescence search when the depth reaches zero
573 return qsearch<PvNode ? PV : NonPV>(pos, ss, alpha, beta);
575 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
576 assert(PvNode || (alpha == beta - 1));
577 assert(0 < depth && depth < MAX_PLY);
578 assert(!(PvNode && cutNode));
580 Move pv[MAX_PLY+1], capturesSearched[32], quietsSearched[64];
582 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
586 Move ttMove, move, excludedMove, bestMove;
587 Depth extension, newDepth;
588 Value bestValue, value, ttValue, eval, maxValue, probCutBeta;
589 bool givesCheck, improving, didLMR, priorCapture;
590 bool captureOrPromotion, doFullDepthSearch, moveCountPruning, ttCapture;
592 int moveCount, captureCount, quietCount, bestMoveCount, improvement;
594 // Step 1. Initialize node
595 ss->inCheck = pos.checkers();
596 priorCapture = pos.captured_piece();
597 Color us = pos.side_to_move();
598 moveCount = bestMoveCount = captureCount = quietCount = ss->moveCount = 0;
599 bestValue = -VALUE_INFINITE;
600 maxValue = VALUE_INFINITE;
602 // Check for the available remaining time
603 if (thisThread == Threads.main())
604 static_cast<MainThread*>(thisThread)->check_time();
606 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
607 if (PvNode && thisThread->selDepth < ss->ply + 1)
608 thisThread->selDepth = ss->ply + 1;
612 // Step 2. Check for aborted search and immediate draw
613 if ( Threads.stop.load(std::memory_order_relaxed)
614 || pos.is_draw(ss->ply)
615 || ss->ply >= MAX_PLY)
616 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos)
617 : value_draw(pos.this_thread());
619 // Step 3. Mate distance pruning. Even if we mate at the next move our score
620 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
621 // a shorter mate was found upward in the tree then there is no need to search
622 // because we will never beat the current alpha. Same logic but with reversed
623 // signs applies also in the opposite condition of being mated instead of giving
624 // mate. In this case return a fail-high score.
625 alpha = std::max(mated_in(ss->ply), alpha);
626 beta = std::min(mate_in(ss->ply+1), beta);
631 thisThread->rootDelta = beta - alpha;
633 assert(0 <= ss->ply && ss->ply < MAX_PLY);
635 (ss+1)->ttPv = false;
636 (ss+1)->excludedMove = bestMove = MOVE_NONE;
637 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
638 ss->doubleExtensions = (ss-1)->doubleExtensions;
640 Square prevSq = to_sq((ss-1)->currentMove);
642 // Update the running average statistics for double extensions
643 thisThread->doubleExtensionAverage[us].update(ss->depth > (ss-1)->depth);
645 // Initialize statScore to zero for the grandchildren of the current position.
646 // So statScore is shared between all grandchildren and only the first grandchild
647 // starts with statScore = 0. Later grandchildren start with the last calculated
648 // statScore of the previous grandchild. This influences the reduction rules in
649 // LMR which are based on the statScore of parent position.
651 (ss+2)->statScore = 0;
653 // Step 4. Transposition table lookup. We don't want the score of a partial
654 // search to overwrite a previous full search TT value, so we use a different
655 // position key in case of an excluded move.
656 excludedMove = ss->excludedMove;
657 posKey = excludedMove == MOVE_NONE ? pos.key() : pos.key() ^ make_key(excludedMove);
658 tte = TT.probe(posKey, ss->ttHit);
659 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
660 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
661 : ss->ttHit ? tte->move() : MOVE_NONE;
662 ttCapture = ttMove && pos.capture_or_promotion(ttMove);
664 ss->ttPv = PvNode || (ss->ttHit && tte->is_pv());
666 // At non-PV nodes we check for an early TT cutoff
669 && tte->depth() > depth - (thisThread->id() % 2 == 1)
670 && ttValue != VALUE_NONE // Possible in case of TT access race
671 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
672 : (tte->bound() & BOUND_UPPER)))
674 // If ttMove is quiet, update move sorting heuristics on TT hit
679 // Bonus for a quiet ttMove that fails high
681 update_quiet_stats(pos, ss, ttMove, stat_bonus(depth));
683 // Extra penalty for early quiet moves of the previous ply
684 if ((ss-1)->moveCount <= 2 && !priorCapture)
685 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + 1));
687 // Penalty for a quiet ttMove that fails low
690 int penalty = -stat_bonus(depth);
691 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
692 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
696 // Partial workaround for the graph history interaction problem
697 // For high rule50 counts don't produce transposition table cutoffs.
698 if (pos.rule50_count() < 90)
702 // Step 5. Tablebases probe
703 if (!rootNode && TB::Cardinality)
705 int piecesCount = pos.count<ALL_PIECES>();
707 if ( piecesCount <= TB::Cardinality
708 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
709 && pos.rule50_count() == 0
710 && !pos.can_castle(ANY_CASTLING))
713 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
715 // Force check of time on the next occasion
716 if (thisThread == Threads.main())
717 static_cast<MainThread*>(thisThread)->callsCnt = 0;
719 if (err != TB::ProbeState::FAIL)
721 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
723 int drawScore = TB::UseRule50 ? 1 : 0;
725 // use the range VALUE_MATE_IN_MAX_PLY to VALUE_TB_WIN_IN_MAX_PLY to score
726 value = wdl < -drawScore ? VALUE_MATED_IN_MAX_PLY + ss->ply + 1
727 : wdl > drawScore ? VALUE_MATE_IN_MAX_PLY - ss->ply - 1
728 : VALUE_DRAW + 2 * wdl * drawScore;
730 Bound b = wdl < -drawScore ? BOUND_UPPER
731 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
733 if ( b == BOUND_EXACT
734 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
736 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, b,
737 std::min(MAX_PLY - 1, depth + 6),
738 MOVE_NONE, VALUE_NONE);
745 if (b == BOUND_LOWER)
746 bestValue = value, alpha = std::max(alpha, bestValue);
754 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
756 // Step 6. Static evaluation of the position
759 // Skip early pruning when in check
760 ss->staticEval = eval = VALUE_NONE;
767 // Never assume anything about values stored in TT
768 ss->staticEval = eval = tte->eval();
769 if (eval == VALUE_NONE)
770 ss->staticEval = eval = evaluate(pos);
772 // Randomize draw evaluation
773 if (eval == VALUE_DRAW)
774 eval = value_draw(thisThread);
776 // Can ttValue be used as a better position evaluation?
777 if ( ttValue != VALUE_NONE
778 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
783 ss->staticEval = eval = evaluate(pos);
785 // Save static evaluation into transposition table
787 tte->save(posKey, VALUE_NONE, ss->ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, eval);
790 // Use static evaluation difference to improve quiet move ordering
791 if (is_ok((ss-1)->currentMove) && !(ss-1)->inCheck && !priorCapture)
793 int bonus = std::clamp(-16 * int((ss-1)->staticEval + ss->staticEval), -2000, 2000);
794 thisThread->mainHistory[~us][from_to((ss-1)->currentMove)] << bonus;
797 // Set up the improvement variable, which is the difference between the current
798 // static evaluation and the previous static evaluation at our turn (if we were
799 // in check at our previous move we look at the move prior to it). The improvement
800 // margin and the improving flag are used in various pruning heuristics.
801 improvement = (ss-2)->staticEval != VALUE_NONE ? ss->staticEval - (ss-2)->staticEval
802 : (ss-4)->staticEval != VALUE_NONE ? ss->staticEval - (ss-4)->staticEval
805 improving = improvement > 0;
807 // Step 7. Futility pruning: child node (~50 Elo).
808 // The depth condition is important for mate finding.
811 && eval - futility_margin(depth, improving) >= beta
812 && eval < 15000) // 50% larger than VALUE_KNOWN_WIN, but smaller than TB wins.
815 // Step 8. Null move search with verification search (~40 Elo)
817 && (ss-1)->currentMove != MOVE_NULL
818 && (ss-1)->statScore < 23767
820 && eval >= ss->staticEval
821 && ss->staticEval >= beta - 20 * depth - improvement / 15 + 204
823 && pos.non_pawn_material(us)
824 && (ss->ply >= thisThread->nmpMinPly || us != thisThread->nmpColor))
826 assert(eval - beta >= 0);
828 // Null move dynamic reduction based on depth and value
829 Depth R = std::min(int(eval - beta) / 205, 3) + depth / 3 + 4;
831 ss->currentMove = MOVE_NULL;
832 ss->continuationHistory = &thisThread->continuationHistory[0][0][NO_PIECE][0];
834 pos.do_null_move(st);
836 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
838 pos.undo_null_move();
840 if (nullValue >= beta)
842 // Do not return unproven mate or TB scores
843 if (nullValue >= VALUE_TB_WIN_IN_MAX_PLY)
846 if (thisThread->nmpMinPly || (abs(beta) < VALUE_KNOWN_WIN && depth < 14))
849 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
851 // Do verification search at high depths, with null move pruning disabled
852 // for us, until ply exceeds nmpMinPly.
853 thisThread->nmpMinPly = ss->ply + 3 * (depth-R) / 4;
854 thisThread->nmpColor = us;
856 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
858 thisThread->nmpMinPly = 0;
865 probCutBeta = beta + 209 - 44 * improving;
867 // Step 9. ProbCut (~4 Elo)
868 // If we have a good enough capture and a reduced search returns a value
869 // much above beta, we can (almost) safely prune the previous move.
872 && abs(beta) < VALUE_TB_WIN_IN_MAX_PLY
873 // if value from transposition table is lower than probCutBeta, don't attempt probCut
874 // there and in further interactions with transposition table cutoff depth is set to depth - 3
875 // because probCut search has depth set to depth - 4 but we also do a move before it
876 // so effective depth is equal to depth - 3
878 && tte->depth() >= depth - 3
879 && ttValue != VALUE_NONE
880 && ttValue < probCutBeta))
882 assert(probCutBeta < VALUE_INFINITE);
884 MovePicker mp(pos, ttMove, probCutBeta - ss->staticEval, &captureHistory);
885 bool ttPv = ss->ttPv;
888 while ((move = mp.next_move()) != MOVE_NONE)
889 if (move != excludedMove && pos.legal(move))
891 assert(pos.capture_or_promotion(move));
894 captureOrPromotion = true;
896 ss->currentMove = move;
897 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
899 [pos.moved_piece(move)]
902 pos.do_move(move, st);
904 // Perform a preliminary qsearch to verify that the move holds
905 value = -qsearch<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1);
907 // If the qsearch held, perform the regular search
908 if (value >= probCutBeta)
909 value = -search<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1, depth - 4, !cutNode);
913 if (value >= probCutBeta)
915 // if transposition table doesn't have equal or more deep info write probCut data into it
917 && tte->depth() >= depth - 3
918 && ttValue != VALUE_NONE))
919 tte->save(posKey, value_to_tt(value, ss->ply), ttPv,
921 depth - 3, move, ss->staticEval);
928 // Step 10. If the position is not in TT, decrease depth by 2 or 1 depending on node type
939 moves_loop: // When in check, search starts here
941 int rangeReduction = 0;
943 // Step 11. A small Probcut idea, when we are in check
944 probCutBeta = beta + 409;
949 && (tte->bound() & BOUND_LOWER)
950 && tte->depth() >= depth - 3
951 && ttValue >= probCutBeta
952 && abs(ttValue) <= VALUE_KNOWN_WIN
953 && abs(beta) <= VALUE_KNOWN_WIN
958 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
959 nullptr , (ss-4)->continuationHistory,
960 nullptr , (ss-6)->continuationHistory };
962 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
964 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
971 moveCountPruning = false;
973 // Indicate PvNodes that will probably fail low if the node was searched
974 // at a depth equal or greater than the current depth, and the result of this search was a fail low.
975 bool likelyFailLow = PvNode
977 && (tte->bound() & BOUND_UPPER)
978 && tte->depth() >= depth;
980 // Step 12. Loop through all pseudo-legal moves until no moves remain
981 // or a beta cutoff occurs.
982 while ((move = mp.next_move(moveCountPruning)) != MOVE_NONE)
986 if (move == excludedMove)
989 // At root obey the "searchmoves" option and skip moves not listed in Root
990 // Move List. As a consequence any illegal move is also skipped. In MultiPV
991 // mode we also skip PV moves which have been already searched and those
992 // of lower "TB rank" if we are in a TB root position.
993 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
994 thisThread->rootMoves.begin() + thisThread->pvLast, move))
997 // Check for legality
998 if (!rootNode && !pos.legal(move))
1001 ss->moveCount = ++moveCount;
1003 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
1004 sync_cout << "info depth " << depth
1005 << " currmove " << UCI::move(move, pos.is_chess960())
1006 << " currmovenumber " << moveCount + thisThread->pvIdx << sync_endl;
1008 (ss+1)->pv = nullptr;
1011 captureOrPromotion = pos.capture_or_promotion(move);
1012 movedPiece = pos.moved_piece(move);
1013 givesCheck = pos.gives_check(move);
1015 // Calculate new depth for this move
1016 newDepth = depth - 1;
1018 Value delta = beta - alpha;
1020 // Step 13. Pruning at shallow depth (~200 Elo). Depth conditions are important for mate finding.
1022 && pos.non_pawn_material(us)
1023 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY)
1025 // Skip quiet moves if movecount exceeds our FutilityMoveCount threshold
1026 moveCountPruning = moveCount >= futility_move_count(improving, depth);
1028 // Reduced depth of the next LMR search
1029 int lmrDepth = std::max(newDepth - reduction(improving, depth, moveCount, rangeReduction > 2, delta, thisThread->rootDelta), 0);
1031 if ( captureOrPromotion
1034 // Capture history based pruning when the move doesn't give check
1037 && captureHistory[movedPiece][to_sq(move)][type_of(pos.piece_on(to_sq(move)))] < 0)
1040 // Futility pruning for captures
1041 if ( !pos.empty(to_sq(move))
1046 && ss->staticEval + 342 + 238 * lmrDepth + PieceValue[EG][pos.piece_on(to_sq(move))]
1047 + captureHistory[movedPiece][to_sq(move)][type_of(pos.piece_on(to_sq(move)))] / 8 < alpha)
1050 // SEE based pruning
1051 if (!pos.see_ge(move, Value(-218) * depth)) // (~25 Elo)
1056 int history = (*contHist[0])[movedPiece][to_sq(move)]
1057 + (*contHist[1])[movedPiece][to_sq(move)]
1058 + (*contHist[3])[movedPiece][to_sq(move)];
1060 // Continuation history based pruning (~20 Elo)
1062 && history < -3000 * depth + 3000)
1065 history += thisThread->mainHistory[us][from_to(move)];
1067 // Futility pruning: parent node (~5 Elo)
1070 && ss->staticEval + 142 + 139 * lmrDepth + history / 64 <= alpha)
1073 // Prune moves with negative SEE (~20 Elo)
1074 if (!pos.see_ge(move, Value(-21 * lmrDepth * lmrDepth - 21 * lmrDepth)))
1079 // Step 14. Extensions (~75 Elo)
1081 // Singular extension search (~70 Elo). If all moves but one fail low on a
1082 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
1083 // then that move is singular and should be extended. To verify this we do
1084 // a reduced search on all the other moves but the ttMove and if the
1085 // result is lower than ttValue minus a margin, then we will extend the ttMove.
1087 && depth >= 6 + 2 * (PvNode && tte->is_pv())
1089 && !excludedMove // Avoid recursive singular search
1090 /* && ttValue != VALUE_NONE Already implicit in the next condition */
1091 && abs(ttValue) < VALUE_KNOWN_WIN
1092 && (tte->bound() & BOUND_LOWER)
1093 && tte->depth() >= depth - 3)
1095 Value singularBeta = ttValue - 3 * depth;
1096 Depth singularDepth = (depth - 1) / 2;
1098 ss->excludedMove = move;
1099 value = search<NonPV>(pos, ss, singularBeta - 1, singularBeta, singularDepth, cutNode);
1100 ss->excludedMove = MOVE_NONE;
1102 if (value < singularBeta)
1106 // Avoid search explosion by limiting the number of double extensions
1108 && value < singularBeta - 75
1109 && ss->doubleExtensions <= 6)
1113 // Multi-cut pruning
1114 // Our ttMove is assumed to fail high, and now we failed high also on a reduced
1115 // search without the ttMove. So we assume this expected Cut-node is not singular,
1116 // that multiple moves fail high, and we can prune the whole subtree by returning
1118 else if (singularBeta >= beta)
1119 return singularBeta;
1121 // If the eval of ttMove is greater than beta, we reduce it (negative extension)
1122 else if (ttValue >= beta)
1126 // Capture extensions for PvNodes and cutNodes
1127 else if ( (PvNode || cutNode)
1128 && captureOrPromotion
1133 else if ( givesCheck
1135 && abs(ss->staticEval) > 100)
1138 // Quiet ttMove extensions
1141 && move == ss->killers[0]
1142 && (*contHist[0])[movedPiece][to_sq(move)] >= 10000)
1145 // Add extension to new depth
1146 newDepth += extension;
1147 ss->doubleExtensions = (ss-1)->doubleExtensions + (extension == 2);
1149 // Speculative prefetch as early as possible
1150 prefetch(TT.first_entry(pos.key_after(move)));
1152 // Update the current move (this must be done after singular extension search)
1153 ss->currentMove = move;
1154 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1155 [captureOrPromotion]
1159 // Step 15. Make the move
1160 pos.do_move(move, st, givesCheck);
1162 bool doDeeperSearch = false;
1164 // Step 16. Late moves reduction / extension (LMR, ~200 Elo)
1165 // We use various heuristics for the sons of a node after the first son has
1166 // been searched. In general we would like to reduce them, but there are many
1167 // cases where we extend a son if it has good chances to be "interesting".
1169 && moveCount > 1 + 2 * rootNode
1171 || !captureOrPromotion
1172 || (cutNode && (ss-1)->moveCount > 1)))
1174 Depth r = reduction(improving, depth, moveCount, rangeReduction > 2, delta, thisThread->rootDelta);
1176 // Decrease reduction at some PvNodes (~2 Elo)
1178 && bestMoveCount <= 3)
1181 // Decrease reduction if position is or has been on the PV
1182 // and node is not likely to fail low. (~3 Elo)
1187 // Decrease reduction if opponent's move count is high (~1 Elo)
1188 if ((ss-1)->moveCount > 13)
1191 // Increase reduction for cut nodes (~3 Elo)
1192 if (cutNode && move != ss->killers[0])
1195 // Increase reduction if ttMove is a capture (~3 Elo)
1199 ss->statScore = thisThread->mainHistory[us][from_to(move)]
1200 + (*contHist[0])[movedPiece][to_sq(move)]
1201 + (*contHist[1])[movedPiece][to_sq(move)]
1202 + (*contHist[3])[movedPiece][to_sq(move)]
1205 // Decrease/increase reduction for moves with a good/bad history (~30 Elo)
1206 r -= ss->statScore / 14721;
1208 // In general we want to cap the LMR depth search at newDepth. But if reductions
1209 // are really negative and movecount is low, we allow this move to be searched
1210 // deeper than the first move (this may lead to hidden double extensions).
1211 int deeper = r >= -1 ? 0
1212 : moveCount <= 5 ? 2
1213 : PvNode && depth > 6 ? 1
1214 : cutNode && moveCount <= 7 ? 1
1217 Depth d = std::clamp(newDepth - r, 1, newDepth + deeper);
1219 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1221 // Range reductions (~3 Elo)
1222 if (ss->staticEval - value < 30 && depth > 7)
1225 // If the son is reduced and fails high it will be re-searched at full depth
1226 doFullDepthSearch = value > alpha && d < newDepth;
1227 doDeeperSearch = value > alpha + 88;
1232 doFullDepthSearch = !PvNode || moveCount > 1;
1236 // Step 17. Full depth search when LMR is skipped or fails high
1237 if (doFullDepthSearch)
1239 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth + doDeeperSearch, !cutNode);
1241 // If the move passed LMR update its stats
1242 if (didLMR && !captureOrPromotion)
1244 int bonus = value > alpha ? stat_bonus(newDepth)
1245 : -stat_bonus(newDepth);
1247 update_continuation_histories(ss, movedPiece, to_sq(move), bonus);
1251 // For PV nodes only, do a full PV search on the first move or after a fail
1252 // high (in the latter case search only if value < beta), otherwise let the
1253 // parent node fail low with value <= alpha and try another move.
1254 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1257 (ss+1)->pv[0] = MOVE_NONE;
1259 value = -search<PV>(pos, ss+1, -beta, -alpha,
1260 std::min(maxNextDepth, newDepth), false);
1263 // Step 18. Undo move
1264 pos.undo_move(move);
1266 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1268 // Step 19. Check for a new best move
1269 // Finished searching the move. If a stop occurred, the return value of
1270 // the search cannot be trusted, and we return immediately without
1271 // updating best move, PV and TT.
1272 if (Threads.stop.load(std::memory_order_relaxed))
1277 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1278 thisThread->rootMoves.end(), move);
1280 rm.averageScore = rm.averageScore != -VALUE_INFINITE ? (2 * value + rm.averageScore) / 3 : value;
1282 // PV move or new best move?
1283 if (moveCount == 1 || value > alpha)
1286 rm.selDepth = thisThread->selDepth;
1291 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1292 rm.pv.push_back(*m);
1294 // We record how often the best move has been changed in each iteration.
1295 // This information is used for time management and LMR. In MultiPV mode,
1296 // we must take care to only do this for the first PV line.
1298 && !thisThread->pvIdx)
1299 ++thisThread->bestMoveChanges;
1302 // All other moves but the PV are set to the lowest value: this
1303 // is not a problem when sorting because the sort is stable and the
1304 // move position in the list is preserved - just the PV is pushed up.
1305 rm.score = -VALUE_INFINITE;
1308 if (value > bestValue)
1316 if (PvNode && !rootNode) // Update pv even in fail-high case
1317 update_pv(ss->pv, move, (ss+1)->pv);
1319 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1326 assert(value >= beta); // Fail high
1332 // If the move is worse than some previously searched move, remember it to update its stats later
1333 if (move != bestMove)
1335 if (captureOrPromotion && captureCount < 32)
1336 capturesSearched[captureCount++] = move;
1338 else if (!captureOrPromotion && quietCount < 64)
1339 quietsSearched[quietCount++] = move;
1343 // The following condition would detect a stop only after move loop has been
1344 // completed. But in this case bestValue is valid because we have fully
1345 // searched our subtree, and we can anyhow save the result in TT.
1351 // Step 20. Check for mate and stalemate
1352 // All legal moves have been searched and if there are no legal moves, it
1353 // must be a mate or a stalemate. If we are in a singular extension search then
1354 // return a fail low score.
1356 assert(moveCount || !ss->inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1359 bestValue = excludedMove ? alpha :
1360 ss->inCheck ? mated_in(ss->ply)
1363 // If there is a move which produces search value greater than alpha we update stats of searched moves
1365 update_all_stats(pos, ss, bestMove, bestValue, beta, prevSq,
1366 quietsSearched, quietCount, capturesSearched, captureCount, depth);
1368 // Bonus for prior countermove that caused the fail low
1369 else if ( (depth >= 3 || PvNode)
1372 //Assign extra bonus if current node is PvNode or cutNode
1373 //or fail low was really bad
1374 bool extraBonus = PvNode
1376 || bestValue < alpha - 94 * depth;
1378 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth) * (1 + extraBonus));
1382 bestValue = std::min(bestValue, maxValue);
1384 // If no good move is found and the previous position was ttPv, then the previous
1385 // opponent move is probably good and the new position is added to the search tree.
1386 if (bestValue <= alpha)
1387 ss->ttPv = ss->ttPv || ((ss-1)->ttPv && depth > 3);
1388 // Otherwise, a counter move has been found and if the position is the last leaf
1389 // in the search tree, remove the position from the search tree.
1391 ss->ttPv = ss->ttPv && (ss+1)->ttPv;
1393 // Write gathered information in transposition table
1394 if (!excludedMove && !(rootNode && thisThread->pvIdx))
1395 tte->save(posKey, value_to_tt(bestValue, ss->ply), ss->ttPv,
1396 bestValue >= beta ? BOUND_LOWER :
1397 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1398 depth, bestMove, ss->staticEval);
1400 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1406 // qsearch() is the quiescence search function, which is called by the main search
1407 // function with zero depth, or recursively with further decreasing depth per call.
1408 template <NodeType nodeType>
1409 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1411 static_assert(nodeType != Root);
1412 constexpr bool PvNode = nodeType == PV;
1414 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1415 assert(PvNode || (alpha == beta - 1));
1420 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1424 Move ttMove, move, bestMove;
1426 Value bestValue, value, ttValue, futilityValue, futilityBase;
1427 bool pvHit, givesCheck, captureOrPromotion;
1433 ss->pv[0] = MOVE_NONE;
1436 Thread* thisThread = pos.this_thread();
1437 bestMove = MOVE_NONE;
1438 ss->inCheck = pos.checkers();
1441 // Check for an immediate draw or maximum ply reached
1442 if ( pos.is_draw(ss->ply)
1443 || ss->ply >= MAX_PLY)
1444 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos) : VALUE_DRAW;
1446 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1448 // Decide whether or not to include checks: this fixes also the type of
1449 // TT entry depth that we are going to use. Note that in qsearch we use
1450 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1451 ttDepth = ss->inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1452 : DEPTH_QS_NO_CHECKS;
1453 // Transposition table lookup
1455 tte = TT.probe(posKey, ss->ttHit);
1456 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
1457 ttMove = ss->ttHit ? tte->move() : MOVE_NONE;
1458 pvHit = ss->ttHit && tte->is_pv();
1462 && tte->depth() >= ttDepth
1463 && ttValue != VALUE_NONE // Only in case of TT access race
1464 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1465 : (tte->bound() & BOUND_UPPER)))
1468 // Evaluate the position statically
1471 ss->staticEval = VALUE_NONE;
1472 bestValue = futilityBase = -VALUE_INFINITE;
1478 // Never assume anything about values stored in TT
1479 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1480 ss->staticEval = bestValue = evaluate(pos);
1482 // Can ttValue be used as a better position evaluation?
1483 if ( ttValue != VALUE_NONE
1484 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1485 bestValue = ttValue;
1488 // In case of null move search use previous static eval with a different sign
1489 ss->staticEval = bestValue =
1490 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1491 : -(ss-1)->staticEval;
1493 // Stand pat. Return immediately if static value is at least beta
1494 if (bestValue >= beta)
1496 // Save gathered info in transposition table
1498 tte->save(posKey, value_to_tt(bestValue, ss->ply), false, BOUND_LOWER,
1499 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1504 if (PvNode && bestValue > alpha)
1507 futilityBase = bestValue + 155;
1510 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
1511 nullptr , (ss-4)->continuationHistory,
1512 nullptr , (ss-6)->continuationHistory };
1514 // Initialize a MovePicker object for the current position, and prepare
1515 // to search the moves. Because the depth is <= 0 here, only captures,
1516 // queen promotions, and other checks (only if depth >= DEPTH_QS_CHECKS)
1517 // will be generated.
1518 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
1519 &thisThread->captureHistory,
1521 to_sq((ss-1)->currentMove));
1523 // Loop through the moves until no moves remain or a beta cutoff occurs
1524 while ((move = mp.next_move()) != MOVE_NONE)
1526 assert(is_ok(move));
1528 // Check for legality
1529 if (!pos.legal(move))
1532 givesCheck = pos.gives_check(move);
1533 captureOrPromotion = pos.capture_or_promotion(move);
1537 // Futility pruning and moveCount pruning
1538 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1540 && futilityBase > -VALUE_KNOWN_WIN
1541 && type_of(move) != PROMOTION)
1547 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1549 if (futilityValue <= alpha)
1551 bestValue = std::max(bestValue, futilityValue);
1555 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1557 bestValue = std::max(bestValue, futilityBase);
1562 // Do not search moves with negative SEE values
1563 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1564 && !pos.see_ge(move))
1567 // Speculative prefetch as early as possible
1568 prefetch(TT.first_entry(pos.key_after(move)));
1570 ss->currentMove = move;
1571 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1572 [captureOrPromotion]
1573 [pos.moved_piece(move)]
1576 // Continuation history based pruning
1577 if ( !captureOrPromotion
1578 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1579 && (*contHist[0])[pos.moved_piece(move)][to_sq(move)] < CounterMovePruneThreshold
1580 && (*contHist[1])[pos.moved_piece(move)][to_sq(move)] < CounterMovePruneThreshold)
1583 // Make and search the move
1584 pos.do_move(move, st, givesCheck);
1585 value = -qsearch<nodeType>(pos, ss+1, -beta, -alpha, depth - 1);
1586 pos.undo_move(move);
1588 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1590 // Check for a new best move
1591 if (value > bestValue)
1599 if (PvNode) // Update pv even in fail-high case
1600 update_pv(ss->pv, move, (ss+1)->pv);
1602 if (PvNode && value < beta) // Update alpha here!
1610 // All legal moves have been searched. A special case: if we're in check
1611 // and no legal moves were found, it is checkmate.
1612 if (ss->inCheck && bestValue == -VALUE_INFINITE)
1614 assert(!MoveList<LEGAL>(pos).size());
1616 return mated_in(ss->ply); // Plies to mate from the root
1619 // Save gathered info in transposition table
1620 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1621 bestValue >= beta ? BOUND_LOWER : BOUND_UPPER,
1622 ttDepth, bestMove, ss->staticEval);
1624 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1630 // value_to_tt() adjusts a mate or TB score from "plies to mate from the root" to
1631 // "plies to mate from the current position". Standard scores are unchanged.
1632 // The function is called before storing a value in the transposition table.
1634 Value value_to_tt(Value v, int ply) {
1636 assert(v != VALUE_NONE);
1638 return v >= VALUE_TB_WIN_IN_MAX_PLY ? v + ply
1639 : v <= VALUE_TB_LOSS_IN_MAX_PLY ? v - ply : v;
1643 // value_from_tt() is the inverse of value_to_tt(): it adjusts a mate or TB score
1644 // from the transposition table (which refers to the plies to mate/be mated from
1645 // current position) to "plies to mate/be mated (TB win/loss) from the root". However,
1646 // for mate scores, to avoid potentially false mate scores related to the 50 moves rule
1647 // and the graph history interaction, we return an optimal TB score instead.
1649 Value value_from_tt(Value v, int ply, int r50c) {
1651 if (v == VALUE_NONE)
1654 if (v >= VALUE_TB_WIN_IN_MAX_PLY) // TB win or better
1656 if (v >= VALUE_MATE_IN_MAX_PLY && VALUE_MATE - v > 99 - r50c)
1657 return VALUE_MATE_IN_MAX_PLY - 1; // do not return a potentially false mate score
1662 if (v <= VALUE_TB_LOSS_IN_MAX_PLY) // TB loss or worse
1664 if (v <= VALUE_MATED_IN_MAX_PLY && VALUE_MATE + v > 99 - r50c)
1665 return VALUE_MATED_IN_MAX_PLY + 1; // do not return a potentially false mate score
1674 // update_pv() adds current move and appends child pv[]
1676 void update_pv(Move* pv, Move move, Move* childPv) {
1678 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1684 // update_all_stats() updates stats at the end of search() when a bestMove is found
1686 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
1687 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth) {
1690 Color us = pos.side_to_move();
1691 Thread* thisThread = pos.this_thread();
1692 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
1693 Piece moved_piece = pos.moved_piece(bestMove);
1694 PieceType captured = type_of(pos.piece_on(to_sq(bestMove)));
1696 bonus1 = stat_bonus(depth + 1);
1697 bonus2 = bestValue > beta + PawnValueMg ? bonus1 // larger bonus
1698 : stat_bonus(depth); // smaller bonus
1700 if (!pos.capture_or_promotion(bestMove))
1702 // Increase stats for the best move in case it was a quiet move
1703 update_quiet_stats(pos, ss, bestMove, bonus2);
1705 // Decrease stats for all non-best quiet moves
1706 for (int i = 0; i < quietCount; ++i)
1708 thisThread->mainHistory[us][from_to(quietsSearched[i])] << -bonus2;
1709 update_continuation_histories(ss, pos.moved_piece(quietsSearched[i]), to_sq(quietsSearched[i]), -bonus2);
1713 // Increase stats for the best move in case it was a capture move
1714 captureHistory[moved_piece][to_sq(bestMove)][captured] << bonus1;
1716 // Extra penalty for a quiet early move that was not a TT move or
1717 // main killer move in previous ply when it gets refuted.
1718 if ( ((ss-1)->moveCount == 1 + (ss-1)->ttHit || ((ss-1)->currentMove == (ss-1)->killers[0]))
1719 && !pos.captured_piece())
1720 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -bonus1);
1722 // Decrease stats for all non-best capture moves
1723 for (int i = 0; i < captureCount; ++i)
1725 moved_piece = pos.moved_piece(capturesSearched[i]);
1726 captured = type_of(pos.piece_on(to_sq(capturesSearched[i])));
1727 captureHistory[moved_piece][to_sq(capturesSearched[i])][captured] << -bonus1;
1732 // update_continuation_histories() updates histories of the move pairs formed
1733 // by moves at ply -1, -2, -4, and -6 with current move.
1735 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1737 for (int i : {1, 2, 4, 6})
1739 // Only update first 2 continuation histories if we are in check
1740 if (ss->inCheck && i > 2)
1742 if (is_ok((ss-i)->currentMove))
1743 (*(ss-i)->continuationHistory)[pc][to] << bonus;
1748 // update_quiet_stats() updates move sorting heuristics
1750 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus) {
1753 if (ss->killers[0] != move)
1755 ss->killers[1] = ss->killers[0];
1756 ss->killers[0] = move;
1759 Color us = pos.side_to_move();
1760 Thread* thisThread = pos.this_thread();
1761 thisThread->mainHistory[us][from_to(move)] << bonus;
1762 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1764 // Update countermove history
1765 if (is_ok((ss-1)->currentMove))
1767 Square prevSq = to_sq((ss-1)->currentMove);
1768 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1772 // When playing with strength handicap, choose best move among a set of RootMoves
1773 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1775 Move Skill::pick_best(size_t multiPV) {
1777 const RootMoves& rootMoves = Threads.main()->rootMoves;
1778 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1780 // RootMoves are already sorted by score in descending order
1781 Value topScore = rootMoves[0].score;
1782 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1783 int maxScore = -VALUE_INFINITE;
1784 double weakness = 120 - 2 * level;
1786 // Choose best move. For each move score we add two terms, both dependent on
1787 // weakness. One is deterministic and bigger for weaker levels, and one is
1788 // random. Then we choose the move with the resulting highest score.
1789 for (size_t i = 0; i < multiPV; ++i)
1791 // This is our magic formula
1792 int push = int(( weakness * int(topScore - rootMoves[i].score)
1793 + delta * (rng.rand<unsigned>() % int(weakness))) / 128);
1795 if (rootMoves[i].score + push >= maxScore)
1797 maxScore = rootMoves[i].score + push;
1798 best = rootMoves[i].pv[0];
1808 /// MainThread::check_time() is used to print debug info and, more importantly,
1809 /// to detect when we are out of available time and thus stop the search.
1811 void MainThread::check_time() {
1816 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1817 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1819 static TimePoint lastInfoTime = now();
1821 TimePoint elapsed = Time.elapsed();
1822 TimePoint tick = Limits.startTime + elapsed;
1824 if (tick - lastInfoTime >= 1000)
1826 lastInfoTime = tick;
1830 // We should not stop pondering until told so by the GUI
1834 if ( (Limits.use_time_management() && (elapsed > Time.maximum() - 10 || stopOnPonderhit))
1835 || (Limits.movetime && elapsed >= Limits.movetime)
1836 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1837 Threads.stop = true;
1841 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1842 /// that all (if any) unsearched PV lines are sent using a previous search score.
1844 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1846 std::stringstream ss;
1847 TimePoint elapsed = Time.elapsed() + 1;
1848 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1849 size_t pvIdx = pos.this_thread()->pvIdx;
1850 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1851 uint64_t nodesSearched = Threads.nodes_searched();
1852 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1854 for (size_t i = 0; i < multiPV; ++i)
1856 bool updated = rootMoves[i].score != -VALUE_INFINITE;
1858 if (depth == 1 && !updated && i > 0)
1861 Depth d = updated ? depth : std::max(1, depth - 1);
1862 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1864 if (v == -VALUE_INFINITE)
1867 bool tb = TB::RootInTB && abs(v) < VALUE_MATE_IN_MAX_PLY;
1868 v = tb ? rootMoves[i].tbScore : v;
1870 if (ss.rdbuf()->in_avail()) // Not at first line
1875 << " seldepth " << rootMoves[i].selDepth
1876 << " multipv " << i + 1
1877 << " score " << UCI::value(v);
1879 if (Options["UCI_ShowWDL"])
1880 ss << UCI::wdl(v, pos.game_ply());
1882 if (!tb && i == pvIdx)
1883 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1885 ss << " nodes " << nodesSearched
1886 << " nps " << nodesSearched * 1000 / elapsed;
1888 if (elapsed > 1000) // Earlier makes little sense
1889 ss << " hashfull " << TT.hashfull();
1891 ss << " tbhits " << tbHits
1892 << " time " << elapsed
1895 for (Move m : rootMoves[i].pv)
1896 ss << " " << UCI::move(m, pos.is_chess960());
1903 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1904 /// before exiting the search, for instance, in case we stop the search during a
1905 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1906 /// otherwise in case of 'ponder on' we have nothing to think on.
1908 bool RootMove::extract_ponder_from_tt(Position& pos) {
1911 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1915 assert(pv.size() == 1);
1917 if (pv[0] == MOVE_NONE)
1920 pos.do_move(pv[0], st);
1921 TTEntry* tte = TT.probe(pos.key(), ttHit);
1925 Move m = tte->move(); // Local copy to be SMP safe
1926 if (MoveList<LEGAL>(pos).contains(m))
1930 pos.undo_move(pv[0]);
1931 return pv.size() > 1;
1934 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1937 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1938 ProbeDepth = int(Options["SyzygyProbeDepth"]);
1939 Cardinality = int(Options["SyzygyProbeLimit"]);
1940 bool dtz_available = true;
1942 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1943 // ProbeDepth == DEPTH_ZERO
1944 if (Cardinality > MaxCardinality)
1946 Cardinality = MaxCardinality;
1950 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1952 // Rank moves using DTZ tables
1953 RootInTB = root_probe(pos, rootMoves);
1957 // DTZ tables are missing; try to rank moves using WDL tables
1958 dtz_available = false;
1959 RootInTB = root_probe_wdl(pos, rootMoves);
1965 // Sort moves according to TB rank
1966 std::stable_sort(rootMoves.begin(), rootMoves.end(),
1967 [](const RootMove &a, const RootMove &b) { return a.tbRank > b.tbRank; } );
1969 // Probe during search only if DTZ is not available and we are winning
1970 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
1975 // Clean up if root_probe() and root_probe_wdl() have failed
1976 for (auto& m : rootMoves)
1981 } // namespace Stockfish