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 };
64 constexpr uint64_t TtHitAverageWindow = 4096;
65 constexpr uint64_t TtHitAverageResolution = 1024;
68 Value futility_margin(Depth d, bool improving) {
69 return Value(214 * (d - improving));
72 // Reductions lookup table, initialized at startup
73 int Reductions[MAX_MOVES]; // [depth or moveNumber]
75 Depth reduction(bool i, Depth d, int mn) {
76 int r = Reductions[d] * Reductions[mn];
77 return (r + 534) / 1024 + (!i && r > 904);
80 constexpr int futility_move_count(bool improving, Depth depth) {
81 return (3 + depth * depth) / (2 - improving);
84 // History and stats update bonus, based on depth
85 int stat_bonus(Depth d) {
86 return d > 14 ? 73 : 6 * d * d + 229 * d - 215;
89 // Add a small random component to draw evaluations to avoid 3-fold blindness
90 Value value_draw(Thread* thisThread) {
91 return VALUE_DRAW + Value(2 * (thisThread->nodes & 1) - 1);
94 // Skill structure is used to implement strength limit
96 explicit Skill(int l) : level(l) {}
97 bool enabled() const { return level < 20; }
98 bool time_to_pick(Depth depth) const { return depth == 1 + level; }
99 Move pick_best(size_t multiPV);
102 Move best = MOVE_NONE;
105 template <NodeType NT>
106 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
108 template <NodeType NT>
109 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = 0);
111 Value value_to_tt(Value v, int ply);
112 Value value_from_tt(Value v, int ply, int r50c);
113 void update_pv(Move* pv, Move move, Move* childPv);
114 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
115 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus, int depth);
116 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
117 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth);
119 // perft() is our utility to verify move generation. All the leaf nodes up
120 // to the given depth are generated and counted, and the sum is returned.
122 uint64_t perft(Position& pos, Depth depth) {
125 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
127 uint64_t cnt, nodes = 0;
128 const bool leaf = (depth == 2);
130 for (const auto& m : MoveList<LEGAL>(pos))
132 if (Root && depth <= 1)
137 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - 1);
142 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
150 /// Search::init() is called at startup to initialize various lookup tables
152 void Search::init() {
154 for (int i = 1; i < MAX_MOVES; ++i)
155 Reductions[i] = int(21.3 * std::log(i + 0.25 * std::log(i)));
159 /// Search::clear() resets search state to its initial value
161 void Search::clear() {
163 Threads.main()->wait_for_search_finished();
165 Time.availableNodes = 0;
168 Tablebases::init(Options["SyzygyPath"]); // Free mapped files
172 /// MainThread::search() is started when the program receives the UCI 'go'
173 /// command. It searches from the root position and outputs the "bestmove".
175 void MainThread::search() {
179 nodes = perft<true>(rootPos, Limits.perft);
180 sync_cout << "\nNodes searched: " << nodes << "\n" << sync_endl;
184 Color us = rootPos.side_to_move();
185 Time.init(Limits, us, rootPos.game_ply());
188 Eval::NNUE::verify();
190 if (rootMoves.empty())
192 rootMoves.emplace_back(MOVE_NONE);
193 sync_cout << "info depth 0 score "
194 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
199 Threads.start_searching(); // start non-main threads
200 Thread::search(); // main thread start searching
203 // When we reach the maximum depth, we can arrive here without a raise of
204 // Threads.stop. However, if we are pondering or in an infinite search,
205 // the UCI protocol states that we shouldn't print the best move before the
206 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
207 // until the GUI sends one of those commands.
209 while (!Threads.stop && (ponder || Limits.infinite))
210 {} // Busy wait for a stop or a ponder reset
212 // Stop the threads if not already stopped (also raise the stop if
213 // "ponderhit" just reset Threads.ponder).
216 // Wait until all threads have finished
217 Threads.wait_for_search_finished();
219 // When playing in 'nodes as time' mode, subtract the searched nodes from
220 // the available ones before exiting.
222 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
224 Thread* bestThread = this;
226 if ( int(Options["MultiPV"]) == 1
228 && !(Skill(Options["Skill Level"]).enabled() || int(Options["UCI_LimitStrength"]))
229 && rootMoves[0].pv[0] != MOVE_NONE)
230 bestThread = Threads.get_best_thread();
232 bestPreviousScore = bestThread->rootMoves[0].score;
234 // Send again PV info if we have a new best thread
235 if (bestThread != this)
236 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth, -VALUE_INFINITE, VALUE_INFINITE) << sync_endl;
238 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
240 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
241 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
243 std::cout << sync_endl;
247 /// Thread::search() is the main iterative deepening loop. It calls search()
248 /// repeatedly with increasing depth until the allocated thinking time has been
249 /// consumed, the user stops the search, or the maximum search depth is reached.
251 void Thread::search() {
253 // To allow access to (ss-7) up to (ss+2), the stack must be oversized.
254 // The former is needed to allow update_continuation_histories(ss-1, ...),
255 // which accesses its argument at ss-6, also near the root.
256 // The latter is needed for statScore and killer initialization.
257 Stack stack[MAX_PLY+10], *ss = stack+7;
259 Value bestValue, alpha, beta, delta;
260 Move lastBestMove = MOVE_NONE;
261 Depth lastBestMoveDepth = 0;
262 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
263 double timeReduction = 1, totBestMoveChanges = 0;
264 Color us = rootPos.side_to_move();
267 std::memset(ss-7, 0, 10 * sizeof(Stack));
268 for (int i = 7; i > 0; i--)
269 (ss-i)->continuationHistory = &this->continuationHistory[0][0][NO_PIECE][0]; // Use as a sentinel
271 for (int i = 0; i <= MAX_PLY + 2; ++i)
276 bestValue = delta = alpha = -VALUE_INFINITE;
277 beta = VALUE_INFINITE;
281 if (mainThread->bestPreviousScore == VALUE_INFINITE)
282 for (int i = 0; i < 4; ++i)
283 mainThread->iterValue[i] = VALUE_ZERO;
285 for (int i = 0; i < 4; ++i)
286 mainThread->iterValue[i] = mainThread->bestPreviousScore;
289 std::copy(&lowPlyHistory[2][0], &lowPlyHistory.back().back() + 1, &lowPlyHistory[0][0]);
290 std::fill(&lowPlyHistory[MAX_LPH - 2][0], &lowPlyHistory.back().back() + 1, 0);
292 size_t multiPV = size_t(Options["MultiPV"]);
294 // Pick integer skill levels, but non-deterministically round up or down
295 // such that the average integer skill corresponds to the input floating point one.
296 // UCI_Elo is converted to a suitable fractional skill level, using anchoring
297 // to CCRL Elo (goldfish 1.13 = 2000) and a fit through Ordo derived Elo
298 // for match (TC 60+0.6) results spanning a wide range of k values.
300 double floatLevel = Options["UCI_LimitStrength"] ?
301 std::clamp(std::pow((Options["UCI_Elo"] - 1346.6) / 143.4, 1 / 0.806), 0.0, 20.0) :
302 double(Options["Skill Level"]);
303 int intLevel = int(floatLevel) +
304 ((floatLevel - int(floatLevel)) * 1024 > rng.rand<unsigned>() % 1024 ? 1 : 0);
305 Skill skill(intLevel);
307 // When playing with strength handicap enable MultiPV search that we will
308 // use behind the scenes to retrieve a set of possible moves.
310 multiPV = std::max(multiPV, (size_t)4);
312 multiPV = std::min(multiPV, rootMoves.size());
313 ttHitAverage = TtHitAverageWindow * TtHitAverageResolution / 2;
315 int ct = int(Options["Contempt"]) * PawnValueEg / 100; // From centipawns
317 // In analysis mode, adjust contempt in accordance with user preference
318 if (Limits.infinite || Options["UCI_AnalyseMode"])
319 ct = Options["Analysis Contempt"] == "Off" ? 0
320 : Options["Analysis Contempt"] == "Both" ? ct
321 : Options["Analysis Contempt"] == "White" && us == BLACK ? -ct
322 : Options["Analysis Contempt"] == "Black" && us == WHITE ? -ct
325 // Evaluation score is from the white point of view
326 contempt = (us == WHITE ? make_score(ct, ct / 2)
327 : -make_score(ct, ct / 2));
329 int searchAgainCounter = 0;
331 // Iterative deepening loop until requested to stop or the target depth is reached
332 while ( ++rootDepth < MAX_PLY
334 && !(Limits.depth && mainThread && rootDepth > Limits.depth))
336 // Age out PV variability metric
338 totBestMoveChanges /= 2;
340 // Save the last iteration's scores before first PV line is searched and
341 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
342 for (RootMove& rm : rootMoves)
343 rm.previousScore = rm.score;
348 if (!Threads.increaseDepth)
349 searchAgainCounter++;
351 // MultiPV loop. We perform a full root search for each PV line
352 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
357 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
358 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
362 // Reset UCI info selDepth for each depth and each PV line
365 // Reset aspiration window starting size
368 Value prev = rootMoves[pvIdx].previousScore;
370 alpha = std::max(prev - delta,-VALUE_INFINITE);
371 beta = std::min(prev + delta, VALUE_INFINITE);
373 // Adjust contempt based on root move's previousScore (dynamic contempt)
374 int dct = ct + (113 - ct / 2) * prev / (abs(prev) + 147);
376 contempt = (us == WHITE ? make_score(dct, dct / 2)
377 : -make_score(dct, dct / 2));
380 // Start with a small aspiration window and, in the case of a fail
381 // high/low, re-search with a bigger window until we don't fail
383 int failedHighCnt = 0;
386 Depth adjustedDepth = std::max(1, rootDepth - failedHighCnt - searchAgainCounter);
387 bestValue = Stockfish::search<PV>(rootPos, ss, alpha, beta, adjustedDepth, false);
389 // Bring the best move to the front. It is critical that sorting
390 // is done with a stable algorithm because all the values but the
391 // first and eventually the new best one are set to -VALUE_INFINITE
392 // and we want to keep the same order for all the moves except the
393 // new PV that goes to the front. Note that in case of MultiPV
394 // search the already searched PV lines are preserved.
395 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
397 // If search has been stopped, we break immediately. Sorting is
398 // safe because RootMoves is still valid, although it refers to
399 // the previous iteration.
403 // When failing high/low give some update (without cluttering
404 // the UI) before a re-search.
407 && (bestValue <= alpha || bestValue >= beta)
408 && Time.elapsed() > 3000)
409 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
411 // In case of failing low/high increase aspiration window and
412 // re-search, otherwise exit the loop.
413 if (bestValue <= alpha)
415 beta = (alpha + beta) / 2;
416 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
420 mainThread->stopOnPonderhit = false;
422 else if (bestValue >= beta)
424 beta = std::min(bestValue + delta, VALUE_INFINITE);
430 delta += delta / 4 + 5;
432 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
435 // Sort the PV lines searched so far and update the GUI
436 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
439 && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
440 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
444 completedDepth = rootDepth;
446 if (rootMoves[0].pv[0] != lastBestMove) {
447 lastBestMove = rootMoves[0].pv[0];
448 lastBestMoveDepth = rootDepth;
451 // Have we found a "mate in x"?
453 && bestValue >= VALUE_MATE_IN_MAX_PLY
454 && VALUE_MATE - bestValue <= 2 * Limits.mate)
460 // If skill level is enabled and time is up, pick a sub-optimal best move
461 if (skill.enabled() && skill.time_to_pick(rootDepth))
462 skill.pick_best(multiPV);
464 // Do we have time for the next iteration? Can we stop searching now?
465 if ( Limits.use_time_management()
467 && !mainThread->stopOnPonderhit)
469 double fallingEval = (318 + 6 * (mainThread->bestPreviousScore - bestValue)
470 + 6 * (mainThread->iterValue[iterIdx] - bestValue)) / 825.0;
471 fallingEval = std::clamp(fallingEval, 0.5, 1.5);
473 // If the bestMove is stable over several iterations, reduce time accordingly
474 timeReduction = lastBestMoveDepth + 9 < completedDepth ? 1.92 : 0.95;
475 double reduction = (1.47 + mainThread->previousTimeReduction) / (2.32 * timeReduction);
477 // Use part of the gained time from a previous stable move for the current move
478 for (Thread* th : Threads)
480 totBestMoveChanges += th->bestMoveChanges;
481 th->bestMoveChanges = 0;
483 double bestMoveInstability = 1 + 2 * totBestMoveChanges / Threads.size();
485 double totalTime = Time.optimum() * fallingEval * reduction * bestMoveInstability;
487 // Cap used time in case of a single legal move for a better viewer experience in tournaments
488 // yielding correct scores and sufficiently fast moves.
489 if (rootMoves.size() == 1)
490 totalTime = std::min(500.0, totalTime);
492 // Stop the search if we have exceeded the totalTime
493 if (Time.elapsed() > totalTime)
495 // If we are allowed to ponder do not stop the search now but
496 // keep pondering until the GUI sends "ponderhit" or "stop".
497 if (mainThread->ponder)
498 mainThread->stopOnPonderhit = true;
502 else if ( Threads.increaseDepth
503 && !mainThread->ponder
504 && Time.elapsed() > totalTime * 0.58)
505 Threads.increaseDepth = false;
507 Threads.increaseDepth = true;
510 mainThread->iterValue[iterIdx] = bestValue;
511 iterIdx = (iterIdx + 1) & 3;
517 mainThread->previousTimeReduction = timeReduction;
519 // If skill level is enabled, swap best PV line with the sub-optimal one
521 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
522 skill.best ? skill.best : skill.pick_best(multiPV)));
528 // search<>() is the main search function for both PV and non-PV nodes
530 template <NodeType NT>
531 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
533 constexpr bool PvNode = NT == PV;
534 const bool rootNode = PvNode && ss->ply == 0;
535 const Depth maxNextDepth = rootNode ? depth : depth + 1;
537 // Check if we have an upcoming move which draws by repetition, or
538 // if the opponent had an alternative move earlier to this position.
539 if ( pos.rule50_count() >= 3
540 && alpha < VALUE_DRAW
542 && pos.has_game_cycle(ss->ply))
544 alpha = value_draw(pos.this_thread());
549 // Dive into quiescence search when the depth reaches zero
551 return qsearch<NT>(pos, ss, alpha, beta);
553 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
554 assert(PvNode || (alpha == beta - 1));
555 assert(0 < depth && depth < MAX_PLY);
556 assert(!(PvNode && cutNode));
558 Move pv[MAX_PLY+1], capturesSearched[32], quietsSearched[64];
560 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
564 Move ttMove, move, excludedMove, bestMove;
565 Depth extension, newDepth;
566 Value bestValue, value, ttValue, eval, maxValue, probCutBeta;
567 bool givesCheck, improving, didLMR, priorCapture;
568 bool captureOrPromotion, doFullDepthSearch, moveCountPruning,
569 ttCapture, singularQuietLMR;
571 int moveCount, captureCount, quietCount;
573 // Step 1. Initialize node
574 Thread* thisThread = pos.this_thread();
575 ss->inCheck = pos.checkers();
576 priorCapture = pos.captured_piece();
577 Color us = pos.side_to_move();
578 moveCount = captureCount = quietCount = ss->moveCount = 0;
579 bestValue = -VALUE_INFINITE;
580 maxValue = VALUE_INFINITE;
582 // Check for the available remaining time
583 if (thisThread == Threads.main())
584 static_cast<MainThread*>(thisThread)->check_time();
586 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
587 if (PvNode && thisThread->selDepth < ss->ply + 1)
588 thisThread->selDepth = ss->ply + 1;
592 // Step 2. Check for aborted search and immediate draw
593 if ( Threads.stop.load(std::memory_order_relaxed)
594 || pos.is_draw(ss->ply)
595 || ss->ply >= MAX_PLY)
596 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos)
597 : value_draw(pos.this_thread());
599 // Step 3. Mate distance pruning. Even if we mate at the next move our score
600 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
601 // a shorter mate was found upward in the tree then there is no need to search
602 // because we will never beat the current alpha. Same logic but with reversed
603 // signs applies also in the opposite condition of being mated instead of giving
604 // mate. In this case return a fail-high score.
605 alpha = std::max(mated_in(ss->ply), alpha);
606 beta = std::min(mate_in(ss->ply+1), beta);
611 assert(0 <= ss->ply && ss->ply < MAX_PLY);
613 (ss+1)->ttPv = false;
614 (ss+1)->excludedMove = bestMove = MOVE_NONE;
615 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
616 Square prevSq = to_sq((ss-1)->currentMove);
618 // Initialize statScore to zero for the grandchildren of the current position.
619 // So statScore is shared between all grandchildren and only the first grandchild
620 // starts with statScore = 0. Later grandchildren start with the last calculated
621 // statScore of the previous grandchild. This influences the reduction rules in
622 // LMR which are based on the statScore of parent position.
624 (ss+2)->statScore = 0;
626 // Step 4. Transposition table lookup. We don't want the score of a partial
627 // search to overwrite a previous full search TT value, so we use a different
628 // position key in case of an excluded move.
629 excludedMove = ss->excludedMove;
630 posKey = excludedMove == MOVE_NONE ? pos.key() : pos.key() ^ make_key(excludedMove);
631 tte = TT.probe(posKey, ss->ttHit);
632 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
633 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
634 : ss->ttHit ? tte->move() : MOVE_NONE;
636 ss->ttPv = PvNode || (ss->ttHit && tte->is_pv());
638 // Update low ply history for previous move if we are near root and position is or has been in PV
641 && ss->ply - 1 < MAX_LPH
643 && is_ok((ss-1)->currentMove))
644 thisThread->lowPlyHistory[ss->ply - 1][from_to((ss-1)->currentMove)] << stat_bonus(depth - 5);
646 // thisThread->ttHitAverage can be used to approximate the running average of ttHit
647 thisThread->ttHitAverage = (TtHitAverageWindow - 1) * thisThread->ttHitAverage / TtHitAverageWindow
648 + TtHitAverageResolution * ss->ttHit;
650 // At non-PV nodes we check for an early TT cutoff
653 && tte->depth() >= depth
654 && ttValue != VALUE_NONE // Possible in case of TT access race
655 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
656 : (tte->bound() & BOUND_UPPER)))
658 // If ttMove is quiet, update move sorting heuristics on TT hit
663 // Bonus for a quiet ttMove that fails high
664 if (!pos.capture_or_promotion(ttMove))
665 update_quiet_stats(pos, ss, ttMove, stat_bonus(depth), depth);
667 // Extra penalty for early quiet moves of the previous ply
668 if ((ss-1)->moveCount <= 2 && !priorCapture)
669 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + 1));
671 // Penalty for a quiet ttMove that fails low
672 else if (!pos.capture_or_promotion(ttMove))
674 int penalty = -stat_bonus(depth);
675 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
676 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
680 // Partial workaround for the graph history interaction problem
681 // For high rule50 counts don't produce transposition table cutoffs.
682 if (pos.rule50_count() < 90)
686 // Step 5. Tablebases probe
687 if (!rootNode && TB::Cardinality)
689 int piecesCount = pos.count<ALL_PIECES>();
691 if ( piecesCount <= TB::Cardinality
692 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
693 && pos.rule50_count() == 0
694 && !pos.can_castle(ANY_CASTLING))
697 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
699 // Force check of time on the next occasion
700 if (thisThread == Threads.main())
701 static_cast<MainThread*>(thisThread)->callsCnt = 0;
703 if (err != TB::ProbeState::FAIL)
705 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
707 int drawScore = TB::UseRule50 ? 1 : 0;
709 // use the range VALUE_MATE_IN_MAX_PLY to VALUE_TB_WIN_IN_MAX_PLY to score
710 value = wdl < -drawScore ? VALUE_MATED_IN_MAX_PLY + ss->ply + 1
711 : wdl > drawScore ? VALUE_MATE_IN_MAX_PLY - ss->ply - 1
712 : VALUE_DRAW + 2 * wdl * drawScore;
714 Bound b = wdl < -drawScore ? BOUND_UPPER
715 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
717 if ( b == BOUND_EXACT
718 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
720 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, b,
721 std::min(MAX_PLY - 1, depth + 6),
722 MOVE_NONE, VALUE_NONE);
729 if (b == BOUND_LOWER)
730 bestValue = value, alpha = std::max(alpha, bestValue);
738 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
740 // Step 6. Static evaluation of the position
743 // Skip early pruning when in check
744 ss->staticEval = eval = VALUE_NONE;
750 // Never assume anything about values stored in TT
751 ss->staticEval = eval = tte->eval();
752 if (eval == VALUE_NONE)
753 ss->staticEval = eval = evaluate(pos);
755 // Randomize draw evaluation
756 if (eval == VALUE_DRAW)
757 eval = value_draw(thisThread);
759 // Can ttValue be used as a better position evaluation?
760 if ( ttValue != VALUE_NONE
761 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
766 // In case of null move search use previous static eval with a different sign
767 // and addition of two tempos
768 if ((ss-1)->currentMove != MOVE_NULL)
769 ss->staticEval = eval = evaluate(pos);
771 ss->staticEval = eval = -(ss-1)->staticEval;
773 // Save static evaluation into transposition table
774 tte->save(posKey, VALUE_NONE, ss->ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, eval);
777 // Use static evaluation difference to improve quiet move ordering
778 if (is_ok((ss-1)->currentMove) && !(ss-1)->inCheck && !priorCapture)
780 int bonus = std::clamp(-depth * 4 * int((ss-1)->staticEval + ss->staticEval), -1000, 1000);
781 thisThread->mainHistory[~us][from_to((ss-1)->currentMove)] << bonus;
784 // Set up improving flag that is used in various pruning heuristics
785 // We define position as improving if static evaluation of position is better
786 // Than the previous static evaluation at our turn
787 // In case of us being in check at our previous move we look at move prior to it
788 improving = (ss-2)->staticEval == VALUE_NONE
789 ? ss->staticEval > (ss-4)->staticEval || (ss-4)->staticEval == VALUE_NONE
790 : ss->staticEval > (ss-2)->staticEval;
792 // Step 7. Futility pruning: child node (~50 Elo)
795 && eval - futility_margin(depth, improving) >= beta
796 && eval < VALUE_KNOWN_WIN) // Do not return unproven wins
799 // Step 8. Null move search with verification search (~40 Elo)
801 && (ss-1)->currentMove != MOVE_NULL
802 && (ss-1)->statScore < 23767
804 && eval >= ss->staticEval
805 && ss->staticEval >= beta - 20 * depth - 22 * improving + 168 * ss->ttPv + 159
807 && pos.non_pawn_material(us)
808 && (ss->ply >= thisThread->nmpMinPly || us != thisThread->nmpColor))
810 assert(eval - beta >= 0);
812 // Null move dynamic reduction based on depth and value
813 Depth R = (1090 + 81 * depth) / 256 + std::min(int(eval - beta) / 205, 3);
815 ss->currentMove = MOVE_NULL;
816 ss->continuationHistory = &thisThread->continuationHistory[0][0][NO_PIECE][0];
818 pos.do_null_move(st);
820 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
822 pos.undo_null_move();
824 if (nullValue >= beta)
826 // Do not return unproven mate or TB scores
827 if (nullValue >= VALUE_TB_WIN_IN_MAX_PLY)
830 if (thisThread->nmpMinPly || (abs(beta) < VALUE_KNOWN_WIN && depth < 14))
833 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
835 // Do verification search at high depths, with null move pruning disabled
836 // for us, until ply exceeds nmpMinPly.
837 thisThread->nmpMinPly = ss->ply + 3 * (depth-R) / 4;
838 thisThread->nmpColor = us;
840 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
842 thisThread->nmpMinPly = 0;
849 probCutBeta = beta + 209 - 44 * improving;
851 // Step 9. ProbCut (~4 Elo)
852 // If we have a good enough capture and a reduced search returns a value
853 // much above beta, we can (almost) safely prune the previous move.
856 && abs(beta) < VALUE_TB_WIN_IN_MAX_PLY
857 // if value from transposition table is lower than probCutBeta, don't attempt probCut
858 // there and in further interactions with transposition table cutoff depth is set to depth - 3
859 // because probCut search has depth set to depth - 4 but we also do a move before it
860 // so effective depth is equal to depth - 3
862 && tte->depth() >= depth - 3
863 && ttValue != VALUE_NONE
864 && ttValue < probCutBeta))
866 assert(probCutBeta < VALUE_INFINITE);
868 MovePicker mp(pos, ttMove, probCutBeta - ss->staticEval, &captureHistory);
869 int probCutCount = 0;
870 bool ttPv = ss->ttPv;
873 while ( (move = mp.next_move()) != MOVE_NONE
874 && probCutCount < 2 + 2 * cutNode)
875 if (move != excludedMove && pos.legal(move))
877 assert(pos.capture_or_promotion(move));
880 captureOrPromotion = true;
883 ss->currentMove = move;
884 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
886 [pos.moved_piece(move)]
889 pos.do_move(move, st);
891 // Perform a preliminary qsearch to verify that the move holds
892 value = -qsearch<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1);
894 // If the qsearch held, perform the regular search
895 if (value >= probCutBeta)
896 value = -search<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1, depth - 4, !cutNode);
900 if (value >= probCutBeta)
902 // if transposition table doesn't have equal or more deep info write probCut data into it
904 && tte->depth() >= depth - 3
905 && ttValue != VALUE_NONE))
906 tte->save(posKey, value_to_tt(value, ss->ply), ttPv,
908 depth - 3, move, ss->staticEval);
915 // Step 10. If the position is not in TT, decrease depth by 2
921 moves_loop: // When in check, search starts from here
923 ttCapture = ttMove && pos.capture_or_promotion(ttMove);
925 // Step 11. A small Probcut idea, when we are in check
926 probCutBeta = beta + 409;
931 && (tte->bound() & BOUND_LOWER)
932 && tte->depth() >= depth - 3
933 && ttValue >= probCutBeta
934 && abs(ttValue) <= VALUE_KNOWN_WIN
935 && abs(beta) <= VALUE_KNOWN_WIN
940 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
941 nullptr , (ss-4)->continuationHistory,
942 nullptr , (ss-6)->continuationHistory };
944 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
946 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
947 &thisThread->lowPlyHistory,
955 singularQuietLMR = moveCountPruning = false;
957 // Indicate PvNodes that will probably fail low if the node was searched
958 // at a depth equal or greater than the current depth, and the result of this search was a fail low.
959 bool likelyFailLow = PvNode
961 && (tte->bound() & BOUND_UPPER)
962 && tte->depth() >= depth;
964 // Step 12. Loop through all pseudo-legal moves until no moves remain
965 // or a beta cutoff occurs.
966 while ((move = mp.next_move(moveCountPruning)) != MOVE_NONE)
970 if (move == excludedMove)
973 // At root obey the "searchmoves" option and skip moves not listed in Root
974 // Move List. As a consequence any illegal move is also skipped. In MultiPV
975 // mode we also skip PV moves which have been already searched and those
976 // of lower "TB rank" if we are in a TB root position.
977 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
978 thisThread->rootMoves.begin() + thisThread->pvLast, move))
981 // Check for legality
982 if (!rootNode && !pos.legal(move))
985 ss->moveCount = ++moveCount;
987 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
988 sync_cout << "info depth " << depth
989 << " currmove " << UCI::move(move, pos.is_chess960())
990 << " currmovenumber " << moveCount + thisThread->pvIdx << sync_endl;
992 (ss+1)->pv = nullptr;
995 captureOrPromotion = pos.capture_or_promotion(move);
996 movedPiece = pos.moved_piece(move);
997 givesCheck = pos.gives_check(move);
999 // Calculate new depth for this move
1000 newDepth = depth - 1;
1002 // Step 13. Pruning at shallow depth (~200 Elo)
1004 && pos.non_pawn_material(us)
1005 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY)
1007 // Skip quiet moves if movecount exceeds our FutilityMoveCount threshold
1008 moveCountPruning = moveCount >= futility_move_count(improving, depth);
1010 // Reduced depth of the next LMR search
1011 int lmrDepth = std::max(newDepth - reduction(improving, depth, moveCount), 0);
1013 if ( captureOrPromotion
1016 // Capture history based pruning when the move doesn't give check
1019 && captureHistory[movedPiece][to_sq(move)][type_of(pos.piece_on(to_sq(move)))] < 0)
1022 // SEE based pruning
1023 if (!pos.see_ge(move, Value(-218) * depth)) // (~25 Elo)
1028 // Continuation history based pruning (~20 Elo)
1030 && (*contHist[0])[movedPiece][to_sq(move)] < CounterMovePruneThreshold
1031 && (*contHist[1])[movedPiece][to_sq(move)] < CounterMovePruneThreshold)
1034 // Futility pruning: parent node (~5 Elo)
1037 && ss->staticEval + 174 + 157 * lmrDepth <= alpha
1038 && (*contHist[0])[movedPiece][to_sq(move)]
1039 + (*contHist[1])[movedPiece][to_sq(move)]
1040 + (*contHist[3])[movedPiece][to_sq(move)]
1041 + (*contHist[5])[movedPiece][to_sq(move)] / 3 < 28255)
1044 // Prune moves with negative SEE (~20 Elo)
1045 if (!pos.see_ge(move, Value(-(30 - std::min(lmrDepth, 18)) * lmrDepth * lmrDepth)))
1050 // Step 14. Extensions (~75 Elo)
1052 // Singular extension search (~70 Elo). If all moves but one fail low on a
1053 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
1054 // then that move is singular and should be extended. To verify this we do
1055 // a reduced search on all the other moves but the ttMove and if the
1056 // result is lower than ttValue minus a margin, then we will extend the ttMove.
1060 && !excludedMove // Avoid recursive singular search
1061 /* && ttValue != VALUE_NONE Already implicit in the next condition */
1062 && abs(ttValue) < VALUE_KNOWN_WIN
1063 && (tte->bound() & BOUND_LOWER)
1064 && tte->depth() >= depth - 3)
1066 Value singularBeta = ttValue - 2 * depth;
1067 Depth singularDepth = (depth - 1) / 2;
1069 ss->excludedMove = move;
1070 value = search<NonPV>(pos, ss, singularBeta - 1, singularBeta, singularDepth, cutNode);
1071 ss->excludedMove = MOVE_NONE;
1073 if (value < singularBeta)
1076 singularQuietLMR = !ttCapture;
1077 if (!PvNode && value < singularBeta - 93)
1081 // Multi-cut pruning
1082 // Our ttMove is assumed to fail high, and now we failed high also on a reduced
1083 // search without the ttMove. So we assume this expected Cut-node is not singular,
1084 // that multiple moves fail high, and we can prune the whole subtree by returning
1086 else if (singularBeta >= beta)
1087 return singularBeta;
1089 // If the eval of ttMove is greater than beta we try also if there is another
1090 // move that pushes it over beta, if so also produce a cutoff.
1091 else if (ttValue >= beta)
1093 ss->excludedMove = move;
1094 value = search<NonPV>(pos, ss, beta - 1, beta, (depth + 3) / 2, cutNode);
1095 ss->excludedMove = MOVE_NONE;
1101 else if ( givesCheck
1103 && abs(ss->staticEval) > Value(100))
1106 // Add extension to new depth
1107 newDepth += extension;
1109 // Speculative prefetch as early as possible
1110 prefetch(TT.first_entry(pos.key_after(move)));
1112 // Update the current move (this must be done after singular extension search)
1113 ss->currentMove = move;
1114 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1115 [captureOrPromotion]
1119 // Step 15. Make the move
1120 pos.do_move(move, st, givesCheck);
1122 // Step 16. Late moves reduction / extension (LMR, ~200 Elo)
1123 // We use various heuristics for the sons of a node after the first son has
1124 // been searched. In general we would like to reduce them, but there are many
1125 // cases where we extend a son if it has good chances to be "interesting".
1127 && moveCount > 1 + 2 * rootNode
1128 && ( !captureOrPromotion
1129 || (cutNode && (ss-1)->moveCount > 1)
1131 && (!PvNode || ss->ply > 1 || thisThread->id() % 4 != 3))
1133 Depth r = reduction(improving, depth, moveCount);
1135 // Decrease reduction if the ttHit running average is large (~0 Elo)
1136 if (thisThread->ttHitAverage > 537 * TtHitAverageResolution * TtHitAverageWindow / 1024)
1139 // Decrease reduction if position is or has been on the PV
1140 // and node is not likely to fail low. (~3 Elo)
1145 // Increase reduction at root and non-PV nodes when the best move does not change frequently
1146 if ( (rootNode || !PvNode)
1147 && thisThread->rootDepth > 10
1148 && thisThread->bestMoveChanges <= 2)
1151 // Decrease reduction if opponent's move count is high (~1 Elo)
1152 if ((ss-1)->moveCount > 13)
1155 // Decrease reduction if ttMove has been singularly extended (~1 Elo)
1156 if (singularQuietLMR)
1159 // Increase reduction for cut nodes (~3 Elo)
1161 r += 1 + !captureOrPromotion;
1163 if (!captureOrPromotion)
1165 // Increase reduction if ttMove is a capture (~3 Elo)
1169 ss->statScore = thisThread->mainHistory[us][from_to(move)]
1170 + (*contHist[0])[movedPiece][to_sq(move)]
1171 + (*contHist[1])[movedPiece][to_sq(move)]
1172 + (*contHist[3])[movedPiece][to_sq(move)]
1175 // Decrease/increase reduction for moves with a good/bad history (~30 Elo)
1177 r -= ss->statScore / 14721;
1180 // In general we want to cap the LMR depth search at newDepth. But if
1181 // reductions are really negative and movecount is low, we allow this move
1182 // to be searched deeper than the first move.
1183 Depth d = std::clamp(newDepth - r, 1, newDepth + (r < -1 && moveCount <= 5));
1185 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1187 // If the son is reduced and fails high it will be re-searched at full depth
1188 doFullDepthSearch = value > alpha && d < newDepth;
1193 doFullDepthSearch = !PvNode || moveCount > 1;
1197 // Step 17. Full depth search when LMR is skipped or fails high
1198 if (doFullDepthSearch)
1200 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1202 // If the move passed LMR update its stats
1203 if (didLMR && !captureOrPromotion)
1205 int bonus = value > alpha ? stat_bonus(newDepth)
1206 : -stat_bonus(newDepth);
1208 update_continuation_histories(ss, movedPiece, to_sq(move), bonus);
1212 // For PV nodes only, do a full PV search on the first move or after a fail
1213 // high (in the latter case search only if value < beta), otherwise let the
1214 // parent node fail low with value <= alpha and try another move.
1215 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1218 (ss+1)->pv[0] = MOVE_NONE;
1220 value = -search<PV>(pos, ss+1, -beta, -alpha,
1221 std::min(maxNextDepth, newDepth), false);
1224 // Step 18. Undo move
1225 pos.undo_move(move);
1227 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1229 // Step 19. Check for a new best move
1230 // Finished searching the move. If a stop occurred, the return value of
1231 // the search cannot be trusted, and we return immediately without
1232 // updating best move, PV and TT.
1233 if (Threads.stop.load(std::memory_order_relaxed))
1238 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1239 thisThread->rootMoves.end(), move);
1241 // PV move or new best move?
1242 if (moveCount == 1 || value > alpha)
1245 rm.selDepth = thisThread->selDepth;
1250 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1251 rm.pv.push_back(*m);
1253 // We record how often the best move has been changed in each
1254 // iteration. This information is used for time management and LMR
1256 ++thisThread->bestMoveChanges;
1259 // All other moves but the PV are set to the lowest value: this
1260 // is not a problem when sorting because the sort is stable and the
1261 // move position in the list is preserved - just the PV is pushed up.
1262 rm.score = -VALUE_INFINITE;
1265 if (value > bestValue)
1273 if (PvNode && !rootNode) // Update pv even in fail-high case
1274 update_pv(ss->pv, move, (ss+1)->pv);
1276 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1280 assert(value >= beta); // Fail high
1286 // If the move is worse than some previously searched move, remember it to update its stats later
1287 if (move != bestMove)
1289 if (captureOrPromotion && captureCount < 32)
1290 capturesSearched[captureCount++] = move;
1292 else if (!captureOrPromotion && quietCount < 64)
1293 quietsSearched[quietCount++] = move;
1297 // The following condition would detect a stop only after move loop has been
1298 // completed. But in this case bestValue is valid because we have fully
1299 // searched our subtree, and we can anyhow save the result in TT.
1305 // Step 20. Check for mate and stalemate
1306 // All legal moves have been searched and if there are no legal moves, it
1307 // must be a mate or a stalemate. If we are in a singular extension search then
1308 // return a fail low score.
1310 assert(moveCount || !ss->inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1313 bestValue = excludedMove ? alpha :
1314 ss->inCheck ? mated_in(ss->ply)
1317 // If there is a move which produces search value greater than alpha we update stats of searched moves
1319 update_all_stats(pos, ss, bestMove, bestValue, beta, prevSq,
1320 quietsSearched, quietCount, capturesSearched, captureCount, depth);
1322 // Bonus for prior countermove that caused the fail low
1323 else if ( (depth >= 3 || PvNode)
1325 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth));
1328 bestValue = std::min(bestValue, maxValue);
1330 // If no good move is found and the previous position was ttPv, then the previous
1331 // opponent move is probably good and the new position is added to the search tree.
1332 if (bestValue <= alpha)
1333 ss->ttPv = ss->ttPv || ((ss-1)->ttPv && depth > 3);
1334 // Otherwise, a counter move has been found and if the position is the last leaf
1335 // in the search tree, remove the position from the search tree.
1337 ss->ttPv = ss->ttPv && (ss+1)->ttPv;
1339 // Write gathered information in transposition table
1340 if (!excludedMove && !(rootNode && thisThread->pvIdx))
1341 tte->save(posKey, value_to_tt(bestValue, ss->ply), ss->ttPv,
1342 bestValue >= beta ? BOUND_LOWER :
1343 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1344 depth, bestMove, ss->staticEval);
1346 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1352 // qsearch() is the quiescence search function, which is called by the main search
1353 // function with zero depth, or recursively with further decreasing depth per call.
1354 template <NodeType NT>
1355 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1357 constexpr bool PvNode = NT == PV;
1359 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1360 assert(PvNode || (alpha == beta - 1));
1365 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1369 Move ttMove, move, bestMove;
1371 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1372 bool pvHit, givesCheck, captureOrPromotion;
1377 oldAlpha = alpha; // To flag BOUND_EXACT when eval above alpha and no available moves
1379 ss->pv[0] = MOVE_NONE;
1382 Thread* thisThread = pos.this_thread();
1383 bestMove = MOVE_NONE;
1384 ss->inCheck = pos.checkers();
1387 // Check for an immediate draw or maximum ply reached
1388 if ( pos.is_draw(ss->ply)
1389 || ss->ply >= MAX_PLY)
1390 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos) : VALUE_DRAW;
1392 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1394 // Decide whether or not to include checks: this fixes also the type of
1395 // TT entry depth that we are going to use. Note that in qsearch we use
1396 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1397 ttDepth = ss->inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1398 : DEPTH_QS_NO_CHECKS;
1399 // Transposition table lookup
1401 tte = TT.probe(posKey, ss->ttHit);
1402 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
1403 ttMove = ss->ttHit ? tte->move() : MOVE_NONE;
1404 pvHit = ss->ttHit && tte->is_pv();
1408 && tte->depth() >= ttDepth
1409 && ttValue != VALUE_NONE // Only in case of TT access race
1410 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1411 : (tte->bound() & BOUND_UPPER)))
1414 // Evaluate the position statically
1417 ss->staticEval = VALUE_NONE;
1418 bestValue = futilityBase = -VALUE_INFINITE;
1424 // Never assume anything about values stored in TT
1425 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1426 ss->staticEval = bestValue = evaluate(pos);
1428 // Can ttValue be used as a better position evaluation?
1429 if ( ttValue != VALUE_NONE
1430 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1431 bestValue = ttValue;
1434 // In case of null move search use previous static eval with a different sign
1435 // and addition of two tempos
1436 ss->staticEval = bestValue =
1437 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1438 : -(ss-1)->staticEval;
1440 // Stand pat. Return immediately if static value is at least beta
1441 if (bestValue >= beta)
1443 // Save gathered info in transposition table
1445 tte->save(posKey, value_to_tt(bestValue, ss->ply), false, BOUND_LOWER,
1446 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1451 if (PvNode && bestValue > alpha)
1454 futilityBase = bestValue + 155;
1457 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
1458 nullptr , (ss-4)->continuationHistory,
1459 nullptr , (ss-6)->continuationHistory };
1461 // Initialize a MovePicker object for the current position, and prepare
1462 // to search the moves. Because the depth is <= 0 here, only captures,
1463 // queen and checking knight promotions, and other checks(only if depth >= DEPTH_QS_CHECKS)
1464 // will be generated.
1465 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
1466 &thisThread->captureHistory,
1468 to_sq((ss-1)->currentMove));
1470 // Loop through the moves until no moves remain or a beta cutoff occurs
1471 while ((move = mp.next_move()) != MOVE_NONE)
1473 assert(is_ok(move));
1475 givesCheck = pos.gives_check(move);
1476 captureOrPromotion = pos.capture_or_promotion(move);
1480 // Futility pruning and moveCount pruning
1481 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1483 && futilityBase > -VALUE_KNOWN_WIN
1484 && type_of(move) != PROMOTION)
1490 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1492 if (futilityValue <= alpha)
1494 bestValue = std::max(bestValue, futilityValue);
1498 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1500 bestValue = std::max(bestValue, futilityBase);
1505 // Do not search moves with negative SEE values
1506 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1507 && !pos.see_ge(move))
1510 // Speculative prefetch as early as possible
1511 prefetch(TT.first_entry(pos.key_after(move)));
1513 // Check for legality just before making the move
1514 if (!pos.legal(move))
1520 ss->currentMove = move;
1521 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1522 [captureOrPromotion]
1523 [pos.moved_piece(move)]
1526 // Continuation history based pruning
1527 if ( !captureOrPromotion
1528 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1529 && (*contHist[0])[pos.moved_piece(move)][to_sq(move)] < CounterMovePruneThreshold
1530 && (*contHist[1])[pos.moved_piece(move)][to_sq(move)] < CounterMovePruneThreshold)
1533 // Make and search the move
1534 pos.do_move(move, st, givesCheck);
1535 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth - 1);
1536 pos.undo_move(move);
1538 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1540 // Check for a new best move
1541 if (value > bestValue)
1549 if (PvNode) // Update pv even in fail-high case
1550 update_pv(ss->pv, move, (ss+1)->pv);
1552 if (PvNode && value < beta) // Update alpha here!
1560 // All legal moves have been searched. A special case: if we're in check
1561 // and no legal moves were found, it is checkmate.
1562 if (ss->inCheck && bestValue == -VALUE_INFINITE)
1564 assert(!MoveList<LEGAL>(pos).size());
1566 return mated_in(ss->ply); // Plies to mate from the root
1569 // Save gathered info in transposition table
1570 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1571 bestValue >= beta ? BOUND_LOWER :
1572 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1573 ttDepth, bestMove, ss->staticEval);
1575 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1581 // value_to_tt() adjusts a mate or TB score from "plies to mate from the root" to
1582 // "plies to mate from the current position". Standard scores are unchanged.
1583 // The function is called before storing a value in the transposition table.
1585 Value value_to_tt(Value v, int ply) {
1587 assert(v != VALUE_NONE);
1589 return v >= VALUE_TB_WIN_IN_MAX_PLY ? v + ply
1590 : v <= VALUE_TB_LOSS_IN_MAX_PLY ? v - ply : v;
1594 // value_from_tt() is the inverse of value_to_tt(): it adjusts a mate or TB score
1595 // from the transposition table (which refers to the plies to mate/be mated from
1596 // current position) to "plies to mate/be mated (TB win/loss) from the root". However,
1597 // for mate scores, to avoid potentially false mate scores related to the 50 moves rule
1598 // and the graph history interaction, we return an optimal TB score instead.
1600 Value value_from_tt(Value v, int ply, int r50c) {
1602 if (v == VALUE_NONE)
1605 if (v >= VALUE_TB_WIN_IN_MAX_PLY) // TB win or better
1607 if (v >= VALUE_MATE_IN_MAX_PLY && VALUE_MATE - v > 99 - r50c)
1608 return VALUE_MATE_IN_MAX_PLY - 1; // do not return a potentially false mate score
1613 if (v <= VALUE_TB_LOSS_IN_MAX_PLY) // TB loss or worse
1615 if (v <= VALUE_MATED_IN_MAX_PLY && VALUE_MATE + v > 99 - r50c)
1616 return VALUE_MATED_IN_MAX_PLY + 1; // do not return a potentially false mate score
1625 // update_pv() adds current move and appends child pv[]
1627 void update_pv(Move* pv, Move move, Move* childPv) {
1629 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1635 // update_all_stats() updates stats at the end of search() when a bestMove is found
1637 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
1638 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth) {
1641 Color us = pos.side_to_move();
1642 Thread* thisThread = pos.this_thread();
1643 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
1644 Piece moved_piece = pos.moved_piece(bestMove);
1645 PieceType captured = type_of(pos.piece_on(to_sq(bestMove)));
1647 bonus1 = stat_bonus(depth + 1);
1648 bonus2 = bestValue > beta + PawnValueMg ? bonus1 // larger bonus
1649 : std::min(bonus1, stat_bonus(depth)); // smaller bonus
1651 if (!pos.capture_or_promotion(bestMove))
1653 // Increase stats for the best move in case it was a quiet move
1654 update_quiet_stats(pos, ss, bestMove, bonus2, depth);
1656 // Decrease stats for all non-best quiet moves
1657 for (int i = 0; i < quietCount; ++i)
1659 thisThread->mainHistory[us][from_to(quietsSearched[i])] << -bonus2;
1660 update_continuation_histories(ss, pos.moved_piece(quietsSearched[i]), to_sq(quietsSearched[i]), -bonus2);
1664 // Increase stats for the best move in case it was a capture move
1665 captureHistory[moved_piece][to_sq(bestMove)][captured] << bonus1;
1667 // Extra penalty for a quiet early move that was not a TT move or
1668 // main killer move in previous ply when it gets refuted.
1669 if ( ((ss-1)->moveCount == 1 + (ss-1)->ttHit || ((ss-1)->currentMove == (ss-1)->killers[0]))
1670 && !pos.captured_piece())
1671 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -bonus1);
1673 // Decrease stats for all non-best capture moves
1674 for (int i = 0; i < captureCount; ++i)
1676 moved_piece = pos.moved_piece(capturesSearched[i]);
1677 captured = type_of(pos.piece_on(to_sq(capturesSearched[i])));
1678 captureHistory[moved_piece][to_sq(capturesSearched[i])][captured] << -bonus1;
1683 // update_continuation_histories() updates histories of the move pairs formed
1684 // by moves at ply -1, -2, -4, and -6 with current move.
1686 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1688 for (int i : {1, 2, 4, 6})
1690 // Only update first 2 continuation histories if we are in check
1691 if (ss->inCheck && i > 2)
1693 if (is_ok((ss-i)->currentMove))
1694 (*(ss-i)->continuationHistory)[pc][to] << bonus;
1699 // update_quiet_stats() updates move sorting heuristics
1701 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus, int depth) {
1704 if (ss->killers[0] != move)
1706 ss->killers[1] = ss->killers[0];
1707 ss->killers[0] = move;
1710 Color us = pos.side_to_move();
1711 Thread* thisThread = pos.this_thread();
1712 thisThread->mainHistory[us][from_to(move)] << bonus;
1713 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1715 // Penalty for reversed move in case of moved piece not being a pawn
1716 if (type_of(pos.moved_piece(move)) != PAWN)
1717 thisThread->mainHistory[us][from_to(reverse_move(move))] << -bonus;
1719 // Update countermove history
1720 if (is_ok((ss-1)->currentMove))
1722 Square prevSq = to_sq((ss-1)->currentMove);
1723 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1726 // Update low ply history
1727 if (depth > 11 && ss->ply < MAX_LPH)
1728 thisThread->lowPlyHistory[ss->ply][from_to(move)] << stat_bonus(depth - 7);
1731 // When playing with strength handicap, choose best move among a set of RootMoves
1732 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1734 Move Skill::pick_best(size_t multiPV) {
1736 const RootMoves& rootMoves = Threads.main()->rootMoves;
1737 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1739 // RootMoves are already sorted by score in descending order
1740 Value topScore = rootMoves[0].score;
1741 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1742 int weakness = 120 - 2 * level;
1743 int maxScore = -VALUE_INFINITE;
1745 // Choose best move. For each move score we add two terms, both dependent on
1746 // weakness. One is deterministic and bigger for weaker levels, and one is
1747 // random. Then we choose the move with the resulting highest score.
1748 for (size_t i = 0; i < multiPV; ++i)
1750 // This is our magic formula
1751 int push = ( weakness * int(topScore - rootMoves[i].score)
1752 + delta * (rng.rand<unsigned>() % weakness)) / 128;
1754 if (rootMoves[i].score + push >= maxScore)
1756 maxScore = rootMoves[i].score + push;
1757 best = rootMoves[i].pv[0];
1767 /// MainThread::check_time() is used to print debug info and, more importantly,
1768 /// to detect when we are out of available time and thus stop the search.
1770 void MainThread::check_time() {
1775 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1776 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1778 static TimePoint lastInfoTime = now();
1780 TimePoint elapsed = Time.elapsed();
1781 TimePoint tick = Limits.startTime + elapsed;
1783 if (tick - lastInfoTime >= 1000)
1785 lastInfoTime = tick;
1789 // We should not stop pondering until told so by the GUI
1793 if ( (Limits.use_time_management() && (elapsed > Time.maximum() - 10 || stopOnPonderhit))
1794 || (Limits.movetime && elapsed >= Limits.movetime)
1795 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1796 Threads.stop = true;
1800 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1801 /// that all (if any) unsearched PV lines are sent using a previous search score.
1803 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1805 std::stringstream ss;
1806 TimePoint elapsed = Time.elapsed() + 1;
1807 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1808 size_t pvIdx = pos.this_thread()->pvIdx;
1809 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1810 uint64_t nodesSearched = Threads.nodes_searched();
1811 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1813 for (size_t i = 0; i < multiPV; ++i)
1815 bool updated = rootMoves[i].score != -VALUE_INFINITE;
1817 if (depth == 1 && !updated && i > 0)
1820 Depth d = updated ? depth : std::max(1, depth - 1);
1821 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1823 if (v == -VALUE_INFINITE)
1826 bool tb = TB::RootInTB && abs(v) < VALUE_MATE_IN_MAX_PLY;
1827 v = tb ? rootMoves[i].tbScore : v;
1829 if (ss.rdbuf()->in_avail()) // Not at first line
1834 << " seldepth " << rootMoves[i].selDepth
1835 << " multipv " << i + 1
1836 << " score " << UCI::value(v);
1838 if (Options["UCI_ShowWDL"])
1839 ss << UCI::wdl(v, pos.game_ply());
1841 if (!tb && i == pvIdx)
1842 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1844 ss << " nodes " << nodesSearched
1845 << " nps " << nodesSearched * 1000 / elapsed;
1847 if (elapsed > 1000) // Earlier makes little sense
1848 ss << " hashfull " << TT.hashfull();
1850 ss << " tbhits " << tbHits
1851 << " time " << elapsed
1854 for (Move m : rootMoves[i].pv)
1855 ss << " " << UCI::move(m, pos.is_chess960());
1862 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1863 /// before exiting the search, for instance, in case we stop the search during a
1864 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1865 /// otherwise in case of 'ponder on' we have nothing to think on.
1867 bool RootMove::extract_ponder_from_tt(Position& pos) {
1870 ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
1874 assert(pv.size() == 1);
1876 if (pv[0] == MOVE_NONE)
1879 pos.do_move(pv[0], st);
1880 TTEntry* tte = TT.probe(pos.key(), ttHit);
1884 Move m = tte->move(); // Local copy to be SMP safe
1885 if (MoveList<LEGAL>(pos).contains(m))
1889 pos.undo_move(pv[0]);
1890 return pv.size() > 1;
1893 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1896 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1897 ProbeDepth = int(Options["SyzygyProbeDepth"]);
1898 Cardinality = int(Options["SyzygyProbeLimit"]);
1899 bool dtz_available = true;
1901 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1902 // ProbeDepth == DEPTH_ZERO
1903 if (Cardinality > MaxCardinality)
1905 Cardinality = MaxCardinality;
1909 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1911 // Rank moves using DTZ tables
1912 RootInTB = root_probe(pos, rootMoves);
1916 // DTZ tables are missing; try to rank moves using WDL tables
1917 dtz_available = false;
1918 RootInTB = root_probe_wdl(pos, rootMoves);
1924 // Sort moves according to TB rank
1925 std::stable_sort(rootMoves.begin(), rootMoves.end(),
1926 [](const RootMove &a, const RootMove &b) { return a.tbRank > b.tbRank; } );
1928 // Probe during search only if DTZ is not available and we are winning
1929 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
1934 // Clean up if root_probe() and root_probe_wdl() have failed
1935 for (auto& m : rootMoves)
1940 } // namespace Stockfish