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) {
73 int r = Reductions[d] * Reductions[mn];
74 return (r + 534) / 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, int depth);
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 std::copy(&lowPlyHistory[2][0], &lowPlyHistory.back().back() + 1, &lowPlyHistory[0][0]);
321 std::fill(&lowPlyHistory[MAX_LPH - 2][0], &lowPlyHistory.back().back() + 1, 0);
323 size_t multiPV = size_t(Options["MultiPV"]);
324 Skill skill(Options["Skill Level"], Options["UCI_LimitStrength"] ? int(Options["UCI_Elo"]) : 0);
326 // When playing with strength handicap enable MultiPV search that we will
327 // use behind the scenes to retrieve a set of possible moves.
329 multiPV = std::max(multiPV, (size_t)4);
331 multiPV = std::min(multiPV, rootMoves.size());
333 doubleExtensionAverage[WHITE].set(0, 100); // initialize the running average at 0%
334 doubleExtensionAverage[BLACK].set(0, 100); // initialize the running average at 0%
336 nodesLastExplosive = nodes;
337 nodesLastNormal = nodes;
338 state = EXPLOSION_NONE;
340 optimism[ us] = Value(25);
341 optimism[~us] = -optimism[us];
343 int searchAgainCounter = 0;
345 // Iterative deepening loop until requested to stop or the target depth is reached
346 while ( ++rootDepth < MAX_PLY
348 && !(Limits.depth && mainThread && rootDepth > Limits.depth))
350 // Age out PV variability metric
352 totBestMoveChanges /= 2;
354 // Save the last iteration's scores before first PV line is searched and
355 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
356 for (RootMove& rm : rootMoves)
357 rm.previousScore = rm.score;
362 if (!Threads.increaseDepth)
363 searchAgainCounter++;
365 // MultiPV loop. We perform a full root search for each PV line
366 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
371 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
372 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
376 // Reset UCI info selDepth for each depth and each PV line
379 // Reset aspiration window starting size
382 Value prev = rootMoves[pvIdx].averageScore;
383 delta = Value(17) + int(prev) * prev / 16384;
384 alpha = std::max(prev - delta,-VALUE_INFINITE);
385 beta = std::min(prev + delta, VALUE_INFINITE);
387 // Adjust trend and optimism based on root move's previousScore
388 int tr = sigmoid(prev, 0, 0, 147, 113, 1);
389 trend = (us == WHITE ? make_score(tr, tr / 2)
390 : -make_score(tr, tr / 2));
392 int opt = sigmoid(prev, 0, 25, 147, 14464, 256);
393 optimism[ us] = Value(opt);
394 optimism[~us] = -optimism[us];
397 // Start with a small aspiration window and, in the case of a fail
398 // high/low, re-search with a bigger window until we don't fail
400 int failedHighCnt = 0;
403 Depth adjustedDepth = std::max(1, rootDepth - failedHighCnt - searchAgainCounter);
404 bestValue = Stockfish::search<Root>(rootPos, ss, alpha, beta, adjustedDepth, false);
406 // Bring the best move to the front. It is critical that sorting
407 // is done with a stable algorithm because all the values but the
408 // first and eventually the new best one are set to -VALUE_INFINITE
409 // and we want to keep the same order for all the moves except the
410 // new PV that goes to the front. Note that in case of MultiPV
411 // search the already searched PV lines are preserved.
412 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
414 // If search has been stopped, we break immediately. Sorting is
415 // safe because RootMoves is still valid, although it refers to
416 // the previous iteration.
420 // When failing high/low give some update (without cluttering
421 // the UI) before a re-search.
424 && (bestValue <= alpha || bestValue >= beta)
425 && Time.elapsed() > 3000)
426 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
428 // In case of failing low/high increase aspiration window and
429 // re-search, otherwise exit the loop.
430 if (bestValue <= alpha)
432 beta = (alpha + beta) / 2;
433 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
437 mainThread->stopOnPonderhit = false;
439 else if (bestValue >= beta)
441 beta = std::min(bestValue + delta, VALUE_INFINITE);
447 delta += delta / 4 + 5;
449 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
452 // Sort the PV lines searched so far and update the GUI
453 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
456 && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
457 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
461 completedDepth = rootDepth;
463 if (rootMoves[0].pv[0] != lastBestMove) {
464 lastBestMove = rootMoves[0].pv[0];
465 lastBestMoveDepth = rootDepth;
468 // Have we found a "mate in x"?
470 && bestValue >= VALUE_MATE_IN_MAX_PLY
471 && VALUE_MATE - bestValue <= 2 * Limits.mate)
477 // If skill level is enabled and time is up, pick a sub-optimal best move
478 if (skill.enabled() && skill.time_to_pick(rootDepth))
479 skill.pick_best(multiPV);
481 // Use part of the gained time from a previous stable move for the current move
482 for (Thread* th : Threads)
484 totBestMoveChanges += th->bestMoveChanges;
485 th->bestMoveChanges = 0;
488 // Do we have time for the next iteration? Can we stop searching now?
489 if ( Limits.use_time_management()
491 && !mainThread->stopOnPonderhit)
493 double fallingEval = (142 + 6 * (mainThread->bestPreviousScore - bestValue)
494 + 6 * (mainThread->bestPreviousAverageScore - bestValue)
495 + 6 * (mainThread->iterValue[iterIdx] - bestValue)) / 825.0;
496 fallingEval = std::clamp(fallingEval, 0.5, 1.5);
498 // If the bestMove is stable over several iterations, reduce time accordingly
499 timeReduction = lastBestMoveDepth + 9 < completedDepth ? 1.92 : 0.95;
500 double reduction = (1.47 + mainThread->previousTimeReduction) / (2.32 * timeReduction);
501 double bestMoveInstability = 1.073 + std::max(1.0, 2.25 - 9.9 / rootDepth)
502 * totBestMoveChanges / Threads.size();
503 double totalTime = Time.optimum() * fallingEval * reduction * bestMoveInstability;
505 // Cap used time in case of a single legal move for a better viewer experience in tournaments
506 // yielding correct scores and sufficiently fast moves.
507 if (rootMoves.size() == 1)
508 totalTime = std::min(500.0, totalTime);
510 // Stop the search if we have exceeded the totalTime
511 if (Time.elapsed() > totalTime)
513 // If we are allowed to ponder do not stop the search now but
514 // keep pondering until the GUI sends "ponderhit" or "stop".
515 if (mainThread->ponder)
516 mainThread->stopOnPonderhit = true;
520 else if ( Threads.increaseDepth
521 && !mainThread->ponder
522 && Time.elapsed() > totalTime * 0.58)
523 Threads.increaseDepth = false;
525 Threads.increaseDepth = true;
528 mainThread->iterValue[iterIdx] = bestValue;
529 iterIdx = (iterIdx + 1) & 3;
535 mainThread->previousTimeReduction = timeReduction;
537 // If skill level is enabled, swap best PV line with the sub-optimal one
539 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
540 skill.best ? skill.best : skill.pick_best(multiPV)));
546 // search<>() is the main search function for both PV and non-PV nodes
548 template <NodeType nodeType>
549 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
551 Thread* thisThread = pos.this_thread();
553 // Step 0. Limit search explosion
555 && search_explosion(thisThread) == MUST_CALM_DOWN
556 && depth > (ss-1)->depth)
557 depth = (ss-1)->depth;
559 constexpr bool PvNode = nodeType != NonPV;
560 constexpr bool rootNode = nodeType == Root;
561 const Depth maxNextDepth = rootNode ? depth : depth + 1;
563 // Check if we have an upcoming move which draws by repetition, or
564 // if the opponent had an alternative move earlier to this position.
566 && pos.rule50_count() >= 3
567 && alpha < VALUE_DRAW
568 && pos.has_game_cycle(ss->ply))
570 alpha = value_draw(pos.this_thread());
575 // Dive into quiescence search when the depth reaches zero
577 return qsearch<PvNode ? PV : NonPV>(pos, ss, alpha, beta);
579 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
580 assert(PvNode || (alpha == beta - 1));
581 assert(0 < depth && depth < MAX_PLY);
582 assert(!(PvNode && cutNode));
584 Move pv[MAX_PLY+1], capturesSearched[32], quietsSearched[64];
586 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
590 Move ttMove, move, excludedMove, bestMove;
591 Depth extension, newDepth;
592 Value bestValue, value, ttValue, eval, maxValue, probCutBeta;
593 bool givesCheck, improving, didLMR, priorCapture;
594 bool captureOrPromotion, doFullDepthSearch, moveCountPruning,
595 ttCapture, singularQuietLMR;
597 int moveCount, captureCount, quietCount, bestMoveCount, improvement;
599 // Step 1. Initialize node
600 ss->inCheck = pos.checkers();
601 priorCapture = pos.captured_piece();
602 Color us = pos.side_to_move();
603 moveCount = bestMoveCount = captureCount = quietCount = ss->moveCount = 0;
604 bestValue = -VALUE_INFINITE;
605 maxValue = VALUE_INFINITE;
607 // Check for the available remaining time
608 if (thisThread == Threads.main())
609 static_cast<MainThread*>(thisThread)->check_time();
611 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
612 if (PvNode && thisThread->selDepth < ss->ply + 1)
613 thisThread->selDepth = ss->ply + 1;
617 // Step 2. Check for aborted search and immediate draw
618 if ( Threads.stop.load(std::memory_order_relaxed)
619 || pos.is_draw(ss->ply)
620 || ss->ply >= MAX_PLY)
621 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos)
622 : value_draw(pos.this_thread());
624 // Step 3. Mate distance pruning. Even if we mate at the next move our score
625 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
626 // a shorter mate was found upward in the tree then there is no need to search
627 // because we will never beat the current alpha. Same logic but with reversed
628 // signs applies also in the opposite condition of being mated instead of giving
629 // mate. In this case return a fail-high score.
630 alpha = std::max(mated_in(ss->ply), alpha);
631 beta = std::min(mate_in(ss->ply+1), beta);
636 thisThread->rootDelta = beta - alpha;
638 assert(0 <= ss->ply && ss->ply < MAX_PLY);
640 (ss+1)->ttPv = false;
641 (ss+1)->excludedMove = bestMove = MOVE_NONE;
642 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
643 ss->doubleExtensions = (ss-1)->doubleExtensions;
645 Square prevSq = to_sq((ss-1)->currentMove);
647 // Update the running average statistics for double extensions
648 thisThread->doubleExtensionAverage[us].update(ss->depth > (ss-1)->depth);
650 // Initialize statScore to zero for the grandchildren of the current position.
651 // So statScore is shared between all grandchildren and only the first grandchild
652 // starts with statScore = 0. Later grandchildren start with the last calculated
653 // statScore of the previous grandchild. This influences the reduction rules in
654 // LMR which are based on the statScore of parent position.
656 (ss+2)->statScore = 0;
658 // Step 4. Transposition table lookup. We don't want the score of a partial
659 // search to overwrite a previous full search TT value, so we use a different
660 // position key in case of an excluded move.
661 excludedMove = ss->excludedMove;
662 posKey = excludedMove == MOVE_NONE ? pos.key() : pos.key() ^ make_key(excludedMove);
663 tte = TT.probe(posKey, ss->ttHit);
664 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
665 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
666 : ss->ttHit ? tte->move() : MOVE_NONE;
667 ttCapture = ttMove && pos.capture_or_promotion(ttMove);
669 ss->ttPv = PvNode || (ss->ttHit && tte->is_pv());
671 // Update low ply history for previous move if we are near root and position is or has been in PV
674 && ss->ply - 1 < MAX_LPH
676 && is_ok((ss-1)->currentMove))
677 thisThread->lowPlyHistory[ss->ply - 1][from_to((ss-1)->currentMove)] << stat_bonus(depth - 5);
679 // At non-PV nodes we check for an early TT cutoff
682 && tte->depth() > depth - (thisThread->id() % 2 == 1)
683 && ttValue != VALUE_NONE // Possible in case of TT access race
684 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
685 : (tte->bound() & BOUND_UPPER)))
687 // If ttMove is quiet, update move sorting heuristics on TT hit
692 // Bonus for a quiet ttMove that fails high
694 update_quiet_stats(pos, ss, ttMove, stat_bonus(depth), depth);
696 // Extra penalty for early quiet moves of the previous ply
697 if ((ss-1)->moveCount <= 2 && !priorCapture)
698 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + 1));
700 // Penalty for a quiet ttMove that fails low
703 int penalty = -stat_bonus(depth);
704 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
705 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
709 // Partial workaround for the graph history interaction problem
710 // For high rule50 counts don't produce transposition table cutoffs.
711 if (pos.rule50_count() < 90)
715 // Step 5. Tablebases probe
716 if (!rootNode && TB::Cardinality)
718 int piecesCount = pos.count<ALL_PIECES>();
720 if ( piecesCount <= TB::Cardinality
721 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
722 && pos.rule50_count() == 0
723 && !pos.can_castle(ANY_CASTLING))
726 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
728 // Force check of time on the next occasion
729 if (thisThread == Threads.main())
730 static_cast<MainThread*>(thisThread)->callsCnt = 0;
732 if (err != TB::ProbeState::FAIL)
734 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
736 int drawScore = TB::UseRule50 ? 1 : 0;
738 // use the range VALUE_MATE_IN_MAX_PLY to VALUE_TB_WIN_IN_MAX_PLY to score
739 value = wdl < -drawScore ? VALUE_MATED_IN_MAX_PLY + ss->ply + 1
740 : wdl > drawScore ? VALUE_MATE_IN_MAX_PLY - ss->ply - 1
741 : VALUE_DRAW + 2 * wdl * drawScore;
743 Bound b = wdl < -drawScore ? BOUND_UPPER
744 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
746 if ( b == BOUND_EXACT
747 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
749 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, b,
750 std::min(MAX_PLY - 1, depth + 6),
751 MOVE_NONE, VALUE_NONE);
758 if (b == BOUND_LOWER)
759 bestValue = value, alpha = std::max(alpha, bestValue);
767 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
769 // Step 6. Static evaluation of the position
772 // Skip early pruning when in check
773 ss->staticEval = eval = VALUE_NONE;
780 // Never assume anything about values stored in TT
781 ss->staticEval = eval = tte->eval();
782 if (eval == VALUE_NONE)
783 ss->staticEval = eval = evaluate(pos);
785 // Randomize draw evaluation
786 if (eval == VALUE_DRAW)
787 eval = value_draw(thisThread);
789 // Can ttValue be used as a better position evaluation?
790 if ( ttValue != VALUE_NONE
791 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
796 ss->staticEval = eval = evaluate(pos);
798 // Save static evaluation into transposition table
800 tte->save(posKey, VALUE_NONE, ss->ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, eval);
803 // Use static evaluation difference to improve quiet move ordering
804 if (is_ok((ss-1)->currentMove) && !(ss-1)->inCheck && !priorCapture)
806 int bonus = std::clamp(-16 * int((ss-1)->staticEval + ss->staticEval), -2000, 2000);
807 thisThread->mainHistory[~us][from_to((ss-1)->currentMove)] << bonus;
810 // Set up the improvement variable, which is the difference between the current
811 // static evaluation and the previous static evaluation at our turn (if we were
812 // in check at our previous move we look at the move prior to it). The improvement
813 // margin and the improving flag are used in various pruning heuristics.
814 improvement = (ss-2)->staticEval != VALUE_NONE ? ss->staticEval - (ss-2)->staticEval
815 : (ss-4)->staticEval != VALUE_NONE ? ss->staticEval - (ss-4)->staticEval
818 improving = improvement > 0;
820 // Step 7. Futility pruning: child node (~50 Elo).
821 // The depth condition is important for mate finding.
824 && eval - futility_margin(depth, improving) >= beta
825 && eval < 15000) // 50% larger than VALUE_KNOWN_WIN, but smaller than TB wins.
828 // Step 8. Null move search with verification search (~40 Elo)
830 && (ss-1)->currentMove != MOVE_NULL
831 && (ss-1)->statScore < 23767
833 && eval >= ss->staticEval
834 && ss->staticEval >= beta - 20 * depth - improvement / 15 + 204
836 && pos.non_pawn_material(us)
837 && (ss->ply >= thisThread->nmpMinPly || us != thisThread->nmpColor))
839 assert(eval - beta >= 0);
841 // Null move dynamic reduction based on depth and value
842 Depth R = std::min(int(eval - beta) / 205, 3) + depth / 3 + 4;
844 ss->currentMove = MOVE_NULL;
845 ss->continuationHistory = &thisThread->continuationHistory[0][0][NO_PIECE][0];
847 pos.do_null_move(st);
849 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
851 pos.undo_null_move();
853 if (nullValue >= beta)
855 // Do not return unproven mate or TB scores
856 if (nullValue >= VALUE_TB_WIN_IN_MAX_PLY)
859 if (thisThread->nmpMinPly || (abs(beta) < VALUE_KNOWN_WIN && depth < 14))
862 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
864 // Do verification search at high depths, with null move pruning disabled
865 // for us, until ply exceeds nmpMinPly.
866 thisThread->nmpMinPly = ss->ply + 3 * (depth-R) / 4;
867 thisThread->nmpColor = us;
869 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
871 thisThread->nmpMinPly = 0;
878 probCutBeta = beta + 209 - 44 * improving;
880 // Step 9. ProbCut (~4 Elo)
881 // If we have a good enough capture and a reduced search returns a value
882 // much above beta, we can (almost) safely prune the previous move.
885 && abs(beta) < VALUE_TB_WIN_IN_MAX_PLY
886 // if value from transposition table is lower than probCutBeta, don't attempt probCut
887 // there and in further interactions with transposition table cutoff depth is set to depth - 3
888 // because probCut search has depth set to depth - 4 but we also do a move before it
889 // so effective depth is equal to depth - 3
891 && tte->depth() >= depth - 3
892 && ttValue != VALUE_NONE
893 && ttValue < probCutBeta))
895 assert(probCutBeta < VALUE_INFINITE);
897 MovePicker mp(pos, ttMove, probCutBeta - ss->staticEval, &captureHistory);
898 bool ttPv = ss->ttPv;
901 while ((move = mp.next_move()) != MOVE_NONE)
902 if (move != excludedMove && pos.legal(move))
904 assert(pos.capture_or_promotion(move));
907 captureOrPromotion = true;
909 ss->currentMove = move;
910 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
912 [pos.moved_piece(move)]
915 pos.do_move(move, st);
917 // Perform a preliminary qsearch to verify that the move holds
918 value = -qsearch<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1);
920 // If the qsearch held, perform the regular search
921 if (value >= probCutBeta)
922 value = -search<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1, depth - 4, !cutNode);
926 if (value >= probCutBeta)
928 // if transposition table doesn't have equal or more deep info write probCut data into it
930 && tte->depth() >= depth - 3
931 && ttValue != VALUE_NONE))
932 tte->save(posKey, value_to_tt(value, ss->ply), ttPv,
934 depth - 3, move, ss->staticEval);
941 // Step 10. If the position is not in TT, decrease depth by 2 or 1 depending on node type
952 moves_loop: // When in check, search starts here
954 int rangeReduction = 0;
956 // Step 11. A small Probcut idea, when we are in check
957 probCutBeta = beta + 409;
962 && (tte->bound() & BOUND_LOWER)
963 && tte->depth() >= depth - 3
964 && ttValue >= probCutBeta
965 && abs(ttValue) <= VALUE_KNOWN_WIN
966 && abs(beta) <= VALUE_KNOWN_WIN
971 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
972 nullptr , (ss-4)->continuationHistory,
973 nullptr , (ss-6)->continuationHistory };
975 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
977 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
978 &thisThread->lowPlyHistory,
986 singularQuietLMR = moveCountPruning = false;
988 // Indicate PvNodes that will probably fail low if the node was searched
989 // at a depth equal or greater than the current depth, and the result of this search was a fail low.
990 bool likelyFailLow = PvNode
992 && (tte->bound() & BOUND_UPPER)
993 && tte->depth() >= depth;
995 // Step 12. Loop through all pseudo-legal moves until no moves remain
996 // or a beta cutoff occurs.
997 while ((move = mp.next_move(moveCountPruning)) != MOVE_NONE)
1001 if (move == excludedMove)
1004 // At root obey the "searchmoves" option and skip moves not listed in Root
1005 // Move List. As a consequence any illegal move is also skipped. In MultiPV
1006 // mode we also skip PV moves which have been already searched and those
1007 // of lower "TB rank" if we are in a TB root position.
1008 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
1009 thisThread->rootMoves.begin() + thisThread->pvLast, move))
1012 // Check for legality
1013 if (!rootNode && !pos.legal(move))
1016 ss->moveCount = ++moveCount;
1018 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
1019 sync_cout << "info depth " << depth
1020 << " currmove " << UCI::move(move, pos.is_chess960())
1021 << " currmovenumber " << moveCount + thisThread->pvIdx << sync_endl;
1023 (ss+1)->pv = nullptr;
1026 captureOrPromotion = pos.capture_or_promotion(move);
1027 movedPiece = pos.moved_piece(move);
1028 givesCheck = pos.gives_check(move);
1030 // Calculate new depth for this move
1031 newDepth = depth - 1;
1033 // Step 13. Pruning at shallow depth (~200 Elo). Depth conditions are important for mate finding.
1035 && pos.non_pawn_material(us)
1036 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY)
1038 // Skip quiet moves if movecount exceeds our FutilityMoveCount threshold
1039 moveCountPruning = moveCount >= futility_move_count(improving, depth);
1041 // Reduced depth of the next LMR search
1042 int lmrDepth = std::max(newDepth - reduction(improving, depth, moveCount, rangeReduction > 2), 0);
1044 if ( captureOrPromotion
1047 // Capture history based pruning when the move doesn't give check
1050 && captureHistory[movedPiece][to_sq(move)][type_of(pos.piece_on(to_sq(move)))] < 0)
1053 // SEE based pruning
1054 if (!pos.see_ge(move, Value(-218) * depth)) // (~25 Elo)
1059 int history = (*contHist[0])[movedPiece][to_sq(move)]
1060 + (*contHist[1])[movedPiece][to_sq(move)]
1061 + (*contHist[3])[movedPiece][to_sq(move)];
1063 // Continuation history based pruning (~20 Elo)
1065 && history < -3000 * depth + 3000)
1068 history += thisThread->mainHistory[us][from_to(move)];
1070 lmrDepth = std::max(0, lmrDepth - (beta - alpha < thisThread->rootDelta / 4));
1072 // Futility pruning: parent node (~5 Elo)
1075 && ss->staticEval + 142 + 139 * lmrDepth + history / 64 <= alpha)
1078 // Prune moves with negative SEE (~20 Elo)
1079 if (!pos.see_ge(move, Value(-21 * lmrDepth * lmrDepth - 21 * lmrDepth)))
1084 // Step 14. Extensions (~75 Elo)
1086 // Singular extension search (~70 Elo). If all moves but one fail low on a
1087 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
1088 // then that move is singular and should be extended. To verify this we do
1089 // a reduced search on all the other moves but the ttMove and if the
1090 // result is lower than ttValue minus a margin, then we will extend the ttMove.
1094 && !excludedMove // Avoid recursive singular search
1095 /* && ttValue != VALUE_NONE Already implicit in the next condition */
1096 && abs(ttValue) < VALUE_KNOWN_WIN
1097 && (tte->bound() & BOUND_LOWER)
1098 && tte->depth() >= depth - 3)
1100 Value singularBeta = ttValue - 3 * depth;
1101 Depth singularDepth = (depth - 1) / 2;
1103 ss->excludedMove = move;
1104 value = search<NonPV>(pos, ss, singularBeta - 1, singularBeta, singularDepth, cutNode);
1105 ss->excludedMove = MOVE_NONE;
1107 if (value < singularBeta)
1110 singularQuietLMR = !ttCapture;
1112 // Avoid search explosion by limiting the number of double extensions
1114 && value < singularBeta - 75
1115 && ss->doubleExtensions <= 6)
1119 // Multi-cut pruning
1120 // Our ttMove is assumed to fail high, and now we failed high also on a reduced
1121 // search without the ttMove. So we assume this expected Cut-node is not singular,
1122 // that multiple moves fail high, and we can prune the whole subtree by returning
1124 else if (singularBeta >= beta)
1125 return singularBeta;
1127 // If the eval of ttMove is greater than beta, we reduce it (negative extension)
1128 else if (ttValue >= beta)
1132 // Capture extensions for PvNodes and cutNodes
1133 else if ( (PvNode || cutNode)
1134 && captureOrPromotion
1139 else if ( givesCheck
1141 && abs(ss->staticEval) > 100)
1144 // Quiet ttMove extensions
1147 && move == ss->killers[0]
1148 && (*contHist[0])[movedPiece][to_sq(move)] >= 10000)
1151 // Add extension to new depth
1152 newDepth += extension;
1153 ss->doubleExtensions = (ss-1)->doubleExtensions + (extension == 2);
1155 // Speculative prefetch as early as possible
1156 prefetch(TT.first_entry(pos.key_after(move)));
1158 // Update the current move (this must be done after singular extension search)
1159 ss->currentMove = move;
1160 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1161 [captureOrPromotion]
1165 // Step 15. Make the move
1166 pos.do_move(move, st, givesCheck);
1168 // Step 16. Late moves reduction / extension (LMR, ~200 Elo)
1169 // We use various heuristics for the sons of a node after the first son has
1170 // been searched. In general we would like to reduce them, but there are many
1171 // cases where we extend a son if it has good chances to be "interesting".
1173 && moveCount > 1 + 2 * rootNode
1175 || !captureOrPromotion
1176 || (cutNode && (ss-1)->moveCount > 1)))
1178 Depth r = reduction(improving, depth, moveCount, rangeReduction > 2);
1180 // Decrease reduction at some PvNodes (~2 Elo)
1182 && bestMoveCount <= 3
1183 && beta - alpha >= thisThread->rootDelta / 4)
1186 // Decrease reduction if position is or has been on the PV
1187 // and node is not likely to fail low. (~3 Elo)
1192 // Increase reduction at non-PV nodes
1196 // Decrease reduction if opponent's move count is high (~1 Elo)
1197 if ((ss-1)->moveCount > 13)
1200 // Decrease reduction if ttMove has been singularly extended (~1 Elo)
1201 if (singularQuietLMR)
1204 // Increase reduction for cut nodes (~3 Elo)
1205 if (cutNode && move != ss->killers[0])
1208 // Increase reduction if ttMove is a capture (~3 Elo)
1212 ss->statScore = thisThread->mainHistory[us][from_to(move)]
1213 + (*contHist[0])[movedPiece][to_sq(move)]
1214 + (*contHist[1])[movedPiece][to_sq(move)]
1215 + (*contHist[3])[movedPiece][to_sq(move)]
1218 // Decrease/increase reduction for moves with a good/bad history (~30 Elo)
1219 r -= ss->statScore / 14721;
1221 // In general we want to cap the LMR depth search at newDepth. But if reductions
1222 // are really negative and movecount is low, we allow this move to be searched
1223 // deeper than the first move (this may lead to hidden double extensions).
1224 int deeper = r >= -1 ? 0
1225 : moveCount <= 5 ? 2
1226 : PvNode && depth > 6 ? 1
1227 : cutNode && moveCount <= 7 ? 1
1230 Depth d = std::clamp(newDepth - r, 1, newDepth + deeper);
1232 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1234 // Range reductions (~3 Elo)
1235 if (ss->staticEval - value < 30 && depth > 7)
1238 // If the son is reduced and fails high it will be re-searched at full depth
1239 doFullDepthSearch = value > alpha && d < newDepth;
1244 doFullDepthSearch = !PvNode || moveCount > 1;
1248 // Step 17. Full depth search when LMR is skipped or fails high
1249 if (doFullDepthSearch)
1251 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1253 // If the move passed LMR update its stats
1254 if (didLMR && !captureOrPromotion)
1256 int bonus = value > alpha ? stat_bonus(newDepth)
1257 : -stat_bonus(newDepth);
1259 update_continuation_histories(ss, movedPiece, to_sq(move), bonus);
1263 // For PV nodes only, do a full PV search on the first move or after a fail
1264 // high (in the latter case search only if value < beta), otherwise let the
1265 // parent node fail low with value <= alpha and try another move.
1266 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1269 (ss+1)->pv[0] = MOVE_NONE;
1271 value = -search<PV>(pos, ss+1, -beta, -alpha,
1272 std::min(maxNextDepth, newDepth), false);
1275 // Step 18. Undo move
1276 pos.undo_move(move);
1278 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1280 // Step 19. Check for a new best move
1281 // Finished searching the move. If a stop occurred, the return value of
1282 // the search cannot be trusted, and we return immediately without
1283 // updating best move, PV and TT.
1284 if (Threads.stop.load(std::memory_order_relaxed))
1289 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1290 thisThread->rootMoves.end(), move);
1292 rm.averageScore = rm.averageScore != -VALUE_INFINITE ? (2 * value + rm.averageScore) / 3 : value;
1294 // PV move or new best move?
1295 if (moveCount == 1 || value > alpha)
1298 rm.selDepth = thisThread->selDepth;
1303 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1304 rm.pv.push_back(*m);
1306 // We record how often the best move has been changed in each iteration.
1307 // This information is used for time management and LMR. In MultiPV mode,
1308 // we must take care to only do this for the first PV line.
1310 && !thisThread->pvIdx)
1311 ++thisThread->bestMoveChanges;
1314 // All other moves but the PV are set to the lowest value: this
1315 // is not a problem when sorting because the sort is stable and the
1316 // move position in the list is preserved - just the PV is pushed up.
1317 rm.score = -VALUE_INFINITE;
1320 if (value > bestValue)
1328 if (PvNode && !rootNode) // Update pv even in fail-high case
1329 update_pv(ss->pv, move, (ss+1)->pv);
1331 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1338 assert(value >= beta); // Fail high
1344 // If the move is worse than some previously searched move, remember it to update its stats later
1345 if (move != bestMove)
1347 if (captureOrPromotion && captureCount < 32)
1348 capturesSearched[captureCount++] = move;
1350 else if (!captureOrPromotion && quietCount < 64)
1351 quietsSearched[quietCount++] = move;
1355 // The following condition would detect a stop only after move loop has been
1356 // completed. But in this case bestValue is valid because we have fully
1357 // searched our subtree, and we can anyhow save the result in TT.
1363 // Step 20. Check for mate and stalemate
1364 // All legal moves have been searched and if there are no legal moves, it
1365 // must be a mate or a stalemate. If we are in a singular extension search then
1366 // return a fail low score.
1368 assert(moveCount || !ss->inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1371 bestValue = excludedMove ? alpha :
1372 ss->inCheck ? mated_in(ss->ply)
1375 // If there is a move which produces search value greater than alpha we update stats of searched moves
1377 update_all_stats(pos, ss, bestMove, bestValue, beta, prevSq,
1378 quietsSearched, quietCount, capturesSearched, captureCount, depth);
1380 // Bonus for prior countermove that caused the fail low
1381 else if ( (depth >= 3 || PvNode)
1384 //Assign extra bonus if current node is PvNode or cutNode
1385 //or fail low was really bad
1386 bool extraBonus = PvNode
1388 || bestValue < alpha - 94 * depth;
1390 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth) * (1 + extraBonus));
1394 bestValue = std::min(bestValue, maxValue);
1396 // If no good move is found and the previous position was ttPv, then the previous
1397 // opponent move is probably good and the new position is added to the search tree.
1398 if (bestValue <= alpha)
1399 ss->ttPv = ss->ttPv || ((ss-1)->ttPv && depth > 3);
1400 // Otherwise, a counter move has been found and if the position is the last leaf
1401 // in the search tree, remove the position from the search tree.
1403 ss->ttPv = ss->ttPv && (ss+1)->ttPv;
1405 // Write gathered information in transposition table
1406 if (!excludedMove && !(rootNode && thisThread->pvIdx))
1407 tte->save(posKey, value_to_tt(bestValue, ss->ply), ss->ttPv,
1408 bestValue >= beta ? BOUND_LOWER :
1409 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1410 depth, bestMove, ss->staticEval);
1412 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1418 // qsearch() is the quiescence search function, which is called by the main search
1419 // function with zero depth, or recursively with further decreasing depth per call.
1420 template <NodeType nodeType>
1421 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1423 static_assert(nodeType != Root);
1424 constexpr bool PvNode = nodeType == PV;
1426 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1427 assert(PvNode || (alpha == beta - 1));
1432 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1436 Move ttMove, move, bestMove;
1438 Value bestValue, value, ttValue, futilityValue, futilityBase;
1439 bool pvHit, givesCheck, captureOrPromotion;
1445 ss->pv[0] = MOVE_NONE;
1448 Thread* thisThread = pos.this_thread();
1449 bestMove = MOVE_NONE;
1450 ss->inCheck = pos.checkers();
1453 // Check for an immediate draw or maximum ply reached
1454 if ( pos.is_draw(ss->ply)
1455 || ss->ply >= MAX_PLY)
1456 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos) : VALUE_DRAW;
1458 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1460 // Decide whether or not to include checks: this fixes also the type of
1461 // TT entry depth that we are going to use. Note that in qsearch we use
1462 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1463 ttDepth = ss->inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1464 : DEPTH_QS_NO_CHECKS;
1465 // Transposition table lookup
1467 tte = TT.probe(posKey, ss->ttHit);
1468 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
1469 ttMove = ss->ttHit ? tte->move() : MOVE_NONE;
1470 pvHit = ss->ttHit && tte->is_pv();
1474 && tte->depth() >= ttDepth
1475 && ttValue != VALUE_NONE // Only in case of TT access race
1476 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1477 : (tte->bound() & BOUND_UPPER)))
1480 // Evaluate the position statically
1483 ss->staticEval = VALUE_NONE;
1484 bestValue = futilityBase = -VALUE_INFINITE;
1490 // Never assume anything about values stored in TT
1491 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1492 ss->staticEval = bestValue = evaluate(pos);
1494 // Can ttValue be used as a better position evaluation?
1495 if ( ttValue != VALUE_NONE
1496 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1497 bestValue = ttValue;
1500 // In case of null move search use previous static eval with a different sign
1501 ss->staticEval = bestValue =
1502 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1503 : -(ss-1)->staticEval;
1505 // Stand pat. Return immediately if static value is at least beta
1506 if (bestValue >= beta)
1508 // Save gathered info in transposition table
1510 tte->save(posKey, value_to_tt(bestValue, ss->ply), false, BOUND_LOWER,
1511 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1516 if (PvNode && bestValue > alpha)
1519 futilityBase = bestValue + 155;
1522 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
1523 nullptr , (ss-4)->continuationHistory,
1524 nullptr , (ss-6)->continuationHistory };
1526 // Initialize a MovePicker object for the current position, and prepare
1527 // to search the moves. Because the depth is <= 0 here, only captures,
1528 // queen promotions, and other checks (only if depth >= DEPTH_QS_CHECKS)
1529 // will be generated.
1530 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
1531 &thisThread->captureHistory,
1533 to_sq((ss-1)->currentMove));
1535 // Loop through the moves until no moves remain or a beta cutoff occurs
1536 while ((move = mp.next_move()) != MOVE_NONE)
1538 assert(is_ok(move));
1540 // Check for legality
1541 if (!pos.legal(move))
1544 givesCheck = pos.gives_check(move);
1545 captureOrPromotion = pos.capture_or_promotion(move);
1549 // Futility pruning and moveCount pruning
1550 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1552 && futilityBase > -VALUE_KNOWN_WIN
1553 && type_of(move) != PROMOTION)
1559 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1561 if (futilityValue <= alpha)
1563 bestValue = std::max(bestValue, futilityValue);
1567 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1569 bestValue = std::max(bestValue, futilityBase);
1574 // Do not search moves with negative SEE values
1575 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1576 && !pos.see_ge(move))
1579 // Speculative prefetch as early as possible
1580 prefetch(TT.first_entry(pos.key_after(move)));
1582 ss->currentMove = move;
1583 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1584 [captureOrPromotion]
1585 [pos.moved_piece(move)]
1588 // Continuation history based pruning
1589 if ( !captureOrPromotion
1590 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1591 && (*contHist[0])[pos.moved_piece(move)][to_sq(move)] < CounterMovePruneThreshold
1592 && (*contHist[1])[pos.moved_piece(move)][to_sq(move)] < CounterMovePruneThreshold)
1595 // Make and search the move
1596 pos.do_move(move, st, givesCheck);
1597 value = -qsearch<nodeType>(pos, ss+1, -beta, -alpha, depth - 1);
1598 pos.undo_move(move);
1600 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1602 // Check for a new best move
1603 if (value > bestValue)
1611 if (PvNode) // Update pv even in fail-high case
1612 update_pv(ss->pv, move, (ss+1)->pv);
1614 if (PvNode && value < beta) // Update alpha here!
1622 // All legal moves have been searched. A special case: if we're in check
1623 // and no legal moves were found, it is checkmate.
1624 if (ss->inCheck && bestValue == -VALUE_INFINITE)
1626 assert(!MoveList<LEGAL>(pos).size());
1628 return mated_in(ss->ply); // Plies to mate from the root
1631 // Save gathered info in transposition table
1632 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1633 bestValue >= beta ? BOUND_LOWER : BOUND_UPPER,
1634 ttDepth, bestMove, ss->staticEval);
1636 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1642 // value_to_tt() adjusts a mate or TB score from "plies to mate from the root" to
1643 // "plies to mate from the current position". Standard scores are unchanged.
1644 // The function is called before storing a value in the transposition table.
1646 Value value_to_tt(Value v, int ply) {
1648 assert(v != VALUE_NONE);
1650 return v >= VALUE_TB_WIN_IN_MAX_PLY ? v + ply
1651 : v <= VALUE_TB_LOSS_IN_MAX_PLY ? v - ply : v;
1655 // value_from_tt() is the inverse of value_to_tt(): it adjusts a mate or TB score
1656 // from the transposition table (which refers to the plies to mate/be mated from
1657 // current position) to "plies to mate/be mated (TB win/loss) from the root". However,
1658 // for mate scores, to avoid potentially false mate scores related to the 50 moves rule
1659 // and the graph history interaction, we return an optimal TB score instead.
1661 Value value_from_tt(Value v, int ply, int r50c) {
1663 if (v == VALUE_NONE)
1666 if (v >= VALUE_TB_WIN_IN_MAX_PLY) // TB win or better
1668 if (v >= VALUE_MATE_IN_MAX_PLY && VALUE_MATE - v > 99 - r50c)
1669 return VALUE_MATE_IN_MAX_PLY - 1; // do not return a potentially false mate score
1674 if (v <= VALUE_TB_LOSS_IN_MAX_PLY) // TB loss or worse
1676 if (v <= VALUE_MATED_IN_MAX_PLY && VALUE_MATE + v > 99 - r50c)
1677 return VALUE_MATED_IN_MAX_PLY + 1; // do not return a potentially false mate score
1686 // update_pv() adds current move and appends child pv[]
1688 void update_pv(Move* pv, Move move, Move* childPv) {
1690 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1696 // update_all_stats() updates stats at the end of search() when a bestMove is found
1698 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
1699 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth) {
1702 Color us = pos.side_to_move();
1703 Thread* thisThread = pos.this_thread();
1704 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
1705 Piece moved_piece = pos.moved_piece(bestMove);
1706 PieceType captured = type_of(pos.piece_on(to_sq(bestMove)));
1708 bonus1 = stat_bonus(depth + 1);
1709 bonus2 = bestValue > beta + PawnValueMg ? bonus1 // larger bonus
1710 : stat_bonus(depth); // smaller bonus
1712 if (!pos.capture_or_promotion(bestMove))
1714 // Increase stats for the best move in case it was a quiet move
1715 update_quiet_stats(pos, ss, bestMove, bonus2, depth);
1717 // Decrease stats for all non-best quiet moves
1718 for (int i = 0; i < quietCount; ++i)
1720 thisThread->mainHistory[us][from_to(quietsSearched[i])] << -bonus2;
1721 update_continuation_histories(ss, pos.moved_piece(quietsSearched[i]), to_sq(quietsSearched[i]), -bonus2);
1725 // Increase stats for the best move in case it was a capture move
1726 captureHistory[moved_piece][to_sq(bestMove)][captured] << bonus1;
1728 // Extra penalty for a quiet early move that was not a TT move or
1729 // main killer move in previous ply when it gets refuted.
1730 if ( ((ss-1)->moveCount == 1 + (ss-1)->ttHit || ((ss-1)->currentMove == (ss-1)->killers[0]))
1731 && !pos.captured_piece())
1732 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -bonus1);
1734 // Decrease stats for all non-best capture moves
1735 for (int i = 0; i < captureCount; ++i)
1737 moved_piece = pos.moved_piece(capturesSearched[i]);
1738 captured = type_of(pos.piece_on(to_sq(capturesSearched[i])));
1739 captureHistory[moved_piece][to_sq(capturesSearched[i])][captured] << -bonus1;
1744 // update_continuation_histories() updates histories of the move pairs formed
1745 // by moves at ply -1, -2, -4, and -6 with current move.
1747 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1749 for (int i : {1, 2, 4, 6})
1751 // Only update first 2 continuation histories if we are in check
1752 if (ss->inCheck && i > 2)
1754 if (is_ok((ss-i)->currentMove))
1755 (*(ss-i)->continuationHistory)[pc][to] << bonus;
1760 // update_quiet_stats() updates move sorting heuristics
1762 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus, int depth) {
1765 if (ss->killers[0] != move)
1767 ss->killers[1] = ss->killers[0];
1768 ss->killers[0] = move;
1771 Color us = pos.side_to_move();
1772 Thread* thisThread = pos.this_thread();
1773 thisThread->mainHistory[us][from_to(move)] << bonus;
1774 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1776 // Update countermove history
1777 if (is_ok((ss-1)->currentMove))
1779 Square prevSq = to_sq((ss-1)->currentMove);
1780 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1783 // Update low ply history
1784 if (depth > 11 && ss->ply < MAX_LPH)
1785 thisThread->lowPlyHistory[ss->ply][from_to(move)] << stat_bonus(depth - 7);
1788 // When playing with strength handicap, choose best move among a set of RootMoves
1789 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1791 Move Skill::pick_best(size_t multiPV) {
1793 const RootMoves& rootMoves = Threads.main()->rootMoves;
1794 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1796 // RootMoves are already sorted by score in descending order
1797 Value topScore = rootMoves[0].score;
1798 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1799 int maxScore = -VALUE_INFINITE;
1800 double weakness = 120 - 2 * level;
1802 // Choose best move. For each move score we add two terms, both dependent on
1803 // weakness. One is deterministic and bigger for weaker levels, and one is
1804 // random. Then we choose the move with the resulting highest score.
1805 for (size_t i = 0; i < multiPV; ++i)
1807 // This is our magic formula
1808 int push = int(( weakness * int(topScore - rootMoves[i].score)
1809 + delta * (rng.rand<unsigned>() % int(weakness))) / 128);
1811 if (rootMoves[i].score + push >= maxScore)
1813 maxScore = rootMoves[i].score + push;
1814 best = rootMoves[i].pv[0];
1824 /// MainThread::check_time() is used to print debug info and, more importantly,
1825 /// to detect when we are out of available time and thus stop the search.
1827 void MainThread::check_time() {
1832 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1833 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1835 static TimePoint lastInfoTime = now();
1837 TimePoint elapsed = Time.elapsed();
1838 TimePoint tick = Limits.startTime + elapsed;
1840 if (tick - lastInfoTime >= 1000)
1842 lastInfoTime = tick;
1846 // We should not stop pondering until told so by the GUI
1850 if ( (Limits.use_time_management() && (elapsed > Time.maximum() - 10 || stopOnPonderhit))
1851 || (Limits.movetime && elapsed >= Limits.movetime)
1852 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1853 Threads.stop = true;
1857 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1858 /// that all (if any) unsearched PV lines are sent using a previous search score.
1860 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1862 std::stringstream ss;
1863 TimePoint elapsed = Time.elapsed() + 1;
1864 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1865 size_t pvIdx = pos.this_thread()->pvIdx;
1866 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1867 uint64_t nodesSearched = Threads.nodes_searched();
1868 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1870 for (size_t i = 0; i < multiPV; ++i)
1872 bool updated = rootMoves[i].score != -VALUE_INFINITE;
1874 if (depth == 1 && !updated && i > 0)
1877 Depth d = updated ? depth : std::max(1, depth - 1);
1878 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1880 if (v == -VALUE_INFINITE)
1883 bool tb = TB::RootInTB && abs(v) < VALUE_MATE_IN_MAX_PLY;
1884 v = tb ? rootMoves[i].tbScore : v;
1886 if (ss.rdbuf()->in_avail()) // Not at first line
1891 << " seldepth " << rootMoves[i].selDepth
1892 << " multipv " << i + 1
1893 << " score " << UCI::value(v);
1895 if (Options["UCI_ShowWDL"])
1896 ss << UCI::wdl(v, pos.game_ply());
1898 if (!tb && i == pvIdx)
1899 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1901 ss << " nodes " << nodesSearched
1902 << " nps " << nodesSearched * 1000 / elapsed;
1904 if (elapsed > 1000) // Earlier makes little sense
1905 ss << " hashfull " << TT.hashfull();
1907 ss << " tbhits " << tbHits
1908 << " time " << elapsed
1911 for (Move m : rootMoves[i].pv)
1912 ss << " " << UCI::move(m, pos.is_chess960());
1919 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1920 /// before exiting the search, for instance, in case we stop the search during a
1921 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1922 /// otherwise in case of 'ponder on' we have nothing to think on.
1924 bool RootMove::extract_ponder_from_tt(Position& pos) {
1927 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1931 assert(pv.size() == 1);
1933 if (pv[0] == MOVE_NONE)
1936 pos.do_move(pv[0], st);
1937 TTEntry* tte = TT.probe(pos.key(), ttHit);
1941 Move m = tte->move(); // Local copy to be SMP safe
1942 if (MoveList<LEGAL>(pos).contains(m))
1946 pos.undo_move(pv[0]);
1947 return pv.size() > 1;
1950 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1953 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1954 ProbeDepth = int(Options["SyzygyProbeDepth"]);
1955 Cardinality = int(Options["SyzygyProbeLimit"]);
1956 bool dtz_available = true;
1958 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1959 // ProbeDepth == DEPTH_ZERO
1960 if (Cardinality > MaxCardinality)
1962 Cardinality = MaxCardinality;
1966 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1968 // Rank moves using DTZ tables
1969 RootInTB = root_probe(pos, rootMoves);
1973 // DTZ tables are missing; try to rank moves using WDL tables
1974 dtz_available = false;
1975 RootInTB = root_probe_wdl(pos, rootMoves);
1981 // Sort moves according to TB rank
1982 std::stable_sort(rootMoves.begin(), rootMoves.end(),
1983 [](const RootMove &a, const RootMove &b) { return a.tbRank > b.tbRank; } );
1985 // Probe during search only if DTZ is not available and we are winning
1986 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
1991 // Clean up if root_probe() and root_probe_wdl() have failed
1992 for (auto& m : rootMoves)
1997 } // namespace Stockfish