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"
43 namespace Tablebases {
51 namespace TB = Tablebases;
55 using namespace Search;
59 // Different node types, used as a template parameter
60 enum NodeType { NonPV, PV };
62 constexpr uint64_t TtHitAverageWindow = 4096;
63 constexpr uint64_t TtHitAverageResolution = 1024;
66 Value futility_margin(Depth d, bool improving) {
67 return Value(234 * (d - improving));
70 // Reductions lookup table, initialized at startup
71 int Reductions[MAX_MOVES]; // [depth or moveNumber]
73 Depth reduction(bool i, Depth d, int mn) {
74 int r = Reductions[d] * Reductions[mn];
75 return (r + 503) / 1024 + (!i && r > 915);
78 constexpr int futility_move_count(bool improving, Depth depth) {
79 return (3 + depth * depth) / (2 - improving);
82 // History and stats update bonus, based on depth
83 int stat_bonus(Depth d) {
84 return d > 14 ? 66 : 6 * d * d + 231 * d - 206;
87 // Add a small random component to draw evaluations to avoid 3-fold blindness
88 Value value_draw(Thread* thisThread) {
89 return VALUE_DRAW + Value(2 * (thisThread->nodes & 1) - 1);
92 // Skill structure is used to implement strength limit
94 explicit Skill(int l) : level(l) {}
95 bool enabled() const { return level < 20; }
96 bool time_to_pick(Depth depth) const { return depth == 1 + level; }
97 Move pick_best(size_t multiPV);
100 Move best = MOVE_NONE;
103 // Breadcrumbs are used to mark nodes as being searched by a given thread
105 std::atomic<Thread*> thread;
106 std::atomic<Key> key;
108 std::array<Breadcrumb, 1024> breadcrumbs;
110 // ThreadHolding structure keeps track of which thread left breadcrumbs at the given
111 // node for potential reductions. A free node will be marked upon entering the moves
112 // loop by the constructor, and unmarked upon leaving that loop by the destructor.
113 struct ThreadHolding {
114 explicit ThreadHolding(Thread* thisThread, Key posKey, int ply) {
115 location = ply < 8 ? &breadcrumbs[posKey & (breadcrumbs.size() - 1)] : nullptr;
120 // See if another already marked this location, if not, mark it ourselves
121 Thread* tmp = (*location).thread.load(std::memory_order_relaxed);
124 (*location).thread.store(thisThread, std::memory_order_relaxed);
125 (*location).key.store(posKey, std::memory_order_relaxed);
128 else if ( tmp != thisThread
129 && (*location).key.load(std::memory_order_relaxed) == posKey)
135 if (owning) // Free the marked location
136 (*location).thread.store(nullptr, std::memory_order_relaxed);
139 bool marked() { return otherThread; }
142 Breadcrumb* location;
143 bool otherThread, owning;
146 template <NodeType NT>
147 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
149 template <NodeType NT>
150 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = 0);
152 Value value_to_tt(Value v, int ply);
153 Value value_from_tt(Value v, int ply, int r50c);
154 void update_pv(Move* pv, Move move, Move* childPv);
155 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
156 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus, int depth);
157 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
158 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth);
160 // perft() is our utility to verify move generation. All the leaf nodes up
161 // to the given depth are generated and counted, and the sum is returned.
163 uint64_t perft(Position& pos, Depth depth) {
166 ASSERT_ALIGNED(&st, Eval::NNUE::kCacheLineSize);
168 uint64_t cnt, nodes = 0;
169 const bool leaf = (depth == 2);
171 for (const auto& m : MoveList<LEGAL>(pos))
173 if (Root && depth <= 1)
178 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - 1);
183 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
191 /// Search::init() is called at startup to initialize various lookup tables
193 void Search::init() {
195 for (int i = 1; i < MAX_MOVES; ++i)
196 Reductions[i] = int((21.3 + 2 * std::log(Threads.size())) * std::log(i + 0.25 * std::log(i)));
200 /// Search::clear() resets search state to its initial value
202 void Search::clear() {
204 Threads.main()->wait_for_search_finished();
206 Time.availableNodes = 0;
209 Tablebases::init(Options["SyzygyPath"]); // Free mapped files
213 /// MainThread::search() is started when the program receives the UCI 'go'
214 /// command. It searches from the root position and outputs the "bestmove".
216 void MainThread::search() {
220 nodes = perft<true>(rootPos, Limits.perft);
221 sync_cout << "\nNodes searched: " << nodes << "\n" << sync_endl;
225 Color us = rootPos.side_to_move();
226 Time.init(Limits, us, rootPos.game_ply());
229 Eval::NNUE::verify();
231 if (rootMoves.empty())
233 rootMoves.emplace_back(MOVE_NONE);
234 sync_cout << "info depth 0 score "
235 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
240 Threads.start_searching(); // start non-main threads
241 Thread::search(); // main thread start searching
244 // When we reach the maximum depth, we can arrive here without a raise of
245 // Threads.stop. However, if we are pondering or in an infinite search,
246 // the UCI protocol states that we shouldn't print the best move before the
247 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
248 // until the GUI sends one of those commands.
250 while (!Threads.stop && (ponder || Limits.infinite))
251 {} // Busy wait for a stop or a ponder reset
253 // Stop the threads if not already stopped (also raise the stop if
254 // "ponderhit" just reset Threads.ponder).
257 // Wait until all threads have finished
258 Threads.wait_for_search_finished();
260 // When playing in 'nodes as time' mode, subtract the searched nodes from
261 // the available ones before exiting.
263 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
265 Thread* bestThread = this;
267 if ( int(Options["MultiPV"]) == 1
269 && !(Skill(Options["Skill Level"]).enabled() || int(Options["UCI_LimitStrength"]))
270 && rootMoves[0].pv[0] != MOVE_NONE)
271 bestThread = Threads.get_best_thread();
273 bestPreviousScore = bestThread->rootMoves[0].score;
275 // Send again PV info if we have a new best thread
276 if (bestThread != this)
277 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth, -VALUE_INFINITE, VALUE_INFINITE) << sync_endl;
279 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
281 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
282 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
284 std::cout << sync_endl;
288 /// Thread::search() is the main iterative deepening loop. It calls search()
289 /// repeatedly with increasing depth until the allocated thinking time has been
290 /// consumed, the user stops the search, or the maximum search depth is reached.
292 void Thread::search() {
294 // To allow access to (ss-7) up to (ss+2), the stack must be oversized.
295 // The former is needed to allow update_continuation_histories(ss-1, ...),
296 // which accesses its argument at ss-6, also near the root.
297 // The latter is needed for statScores and killer initialization.
298 Stack stack[MAX_PLY+10], *ss = stack+7;
300 Value bestValue, alpha, beta, delta;
301 Move lastBestMove = MOVE_NONE;
302 Depth lastBestMoveDepth = 0;
303 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
304 double timeReduction = 1, totBestMoveChanges = 0;
305 Color us = rootPos.side_to_move();
308 std::memset(ss-7, 0, 10 * sizeof(Stack));
309 for (int i = 7; i > 0; i--)
310 (ss-i)->continuationHistory = &this->continuationHistory[0][0][NO_PIECE][0]; // Use as a sentinel
314 bestValue = delta = alpha = -VALUE_INFINITE;
315 beta = VALUE_INFINITE;
319 if (mainThread->bestPreviousScore == VALUE_INFINITE)
320 for (int i = 0; i < 4; ++i)
321 mainThread->iterValue[i] = VALUE_ZERO;
323 for (int i = 0; i < 4; ++i)
324 mainThread->iterValue[i] = mainThread->bestPreviousScore;
327 std::copy(&lowPlyHistory[2][0], &lowPlyHistory.back().back() + 1, &lowPlyHistory[0][0]);
328 std::fill(&lowPlyHistory[MAX_LPH - 2][0], &lowPlyHistory.back().back() + 1, 0);
330 size_t multiPV = size_t(Options["MultiPV"]);
332 // Pick integer skill levels, but non-deterministically round up or down
333 // such that the average integer skill corresponds to the input floating point one.
334 // UCI_Elo is converted to a suitable fractional skill level, using anchoring
335 // to CCRL Elo (goldfish 1.13 = 2000) and a fit through Ordo derived Elo
336 // for match (TC 60+0.6) results spanning a wide range of k values.
338 double floatLevel = Options["UCI_LimitStrength"] ?
339 std::clamp(std::pow((Options["UCI_Elo"] - 1346.6) / 143.4, 1 / 0.806), 0.0, 20.0) :
340 double(Options["Skill Level"]);
341 int intLevel = int(floatLevel) +
342 ((floatLevel - int(floatLevel)) * 1024 > rng.rand<unsigned>() % 1024 ? 1 : 0);
343 Skill skill(intLevel);
345 // When playing with strength handicap enable MultiPV search that we will
346 // use behind the scenes to retrieve a set of possible moves.
348 multiPV = std::max(multiPV, (size_t)4);
350 multiPV = std::min(multiPV, rootMoves.size());
351 ttHitAverage = TtHitAverageWindow * TtHitAverageResolution / 2;
353 int ct = int(Options["Contempt"]) * PawnValueEg / 100; // From centipawns
355 // In analysis mode, adjust contempt in accordance with user preference
356 if (Limits.infinite || Options["UCI_AnalyseMode"])
357 ct = Options["Analysis Contempt"] == "Off" ? 0
358 : Options["Analysis Contempt"] == "Both" ? ct
359 : Options["Analysis Contempt"] == "White" && us == BLACK ? -ct
360 : Options["Analysis Contempt"] == "Black" && us == WHITE ? -ct
363 // Evaluation score is from the white point of view
364 contempt = (us == WHITE ? make_score(ct, ct / 2)
365 : -make_score(ct, ct / 2));
367 int searchAgainCounter = 0;
369 // Iterative deepening loop until requested to stop or the target depth is reached
370 while ( ++rootDepth < MAX_PLY
372 && !(Limits.depth && mainThread && rootDepth > Limits.depth))
374 // Age out PV variability metric
376 totBestMoveChanges /= 2;
378 // Save the last iteration's scores before first PV line is searched and
379 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
380 for (RootMove& rm : rootMoves)
381 rm.previousScore = rm.score;
386 if (!Threads.increaseDepth)
387 searchAgainCounter++;
389 // MultiPV loop. We perform a full root search for each PV line
390 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
395 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
396 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
400 // Reset UCI info selDepth for each depth and each PV line
403 // Reset aspiration window starting size
406 Value prev = rootMoves[pvIdx].previousScore;
408 alpha = std::max(prev - delta,-VALUE_INFINITE);
409 beta = std::min(prev + delta, VALUE_INFINITE);
411 // Adjust contempt based on root move's previousScore (dynamic contempt)
412 int dct = ct + (113 - ct / 2) * prev / (abs(prev) + 147);
414 contempt = (us == WHITE ? make_score(dct, dct / 2)
415 : -make_score(dct, dct / 2));
418 // Start with a small aspiration window and, in the case of a fail
419 // high/low, re-search with a bigger window until we don't fail
424 Depth adjustedDepth = std::max(1, rootDepth - failedHighCnt - searchAgainCounter);
425 bestValue = ::search<PV>(rootPos, ss, alpha, beta, adjustedDepth, false);
427 // Bring the best move to the front. It is critical that sorting
428 // is done with a stable algorithm because all the values but the
429 // first and eventually the new best one are set to -VALUE_INFINITE
430 // and we want to keep the same order for all the moves except the
431 // new PV that goes to the front. Note that in case of MultiPV
432 // search the already searched PV lines are preserved.
433 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
435 // If search has been stopped, we break immediately. Sorting is
436 // safe because RootMoves is still valid, although it refers to
437 // the previous iteration.
441 // When failing high/low give some update (without cluttering
442 // the UI) before a re-search.
445 && (bestValue <= alpha || bestValue >= beta)
446 && Time.elapsed() > 3000)
447 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
449 // In case of failing low/high increase aspiration window and
450 // re-search, otherwise exit the loop.
451 if (bestValue <= alpha)
453 beta = (alpha + beta) / 2;
454 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
458 mainThread->stopOnPonderhit = false;
460 else if (bestValue >= beta)
462 beta = std::min(bestValue + delta, VALUE_INFINITE);
468 delta += delta / 4 + 5;
470 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
473 // Sort the PV lines searched so far and update the GUI
474 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
477 && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
478 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
482 completedDepth = rootDepth;
484 if (rootMoves[0].pv[0] != lastBestMove) {
485 lastBestMove = rootMoves[0].pv[0];
486 lastBestMoveDepth = rootDepth;
489 // Have we found a "mate in x"?
491 && bestValue >= VALUE_MATE_IN_MAX_PLY
492 && VALUE_MATE - bestValue <= 2 * Limits.mate)
498 // If skill level is enabled and time is up, pick a sub-optimal best move
499 if (skill.enabled() && skill.time_to_pick(rootDepth))
500 skill.pick_best(multiPV);
502 // Do we have time for the next iteration? Can we stop searching now?
503 if ( Limits.use_time_management()
505 && !mainThread->stopOnPonderhit)
507 double fallingEval = (318 + 6 * (mainThread->bestPreviousScore - bestValue)
508 + 6 * (mainThread->iterValue[iterIdx] - bestValue)) / 825.0;
509 fallingEval = std::clamp(fallingEval, 0.5, 1.5);
511 // If the bestMove is stable over several iterations, reduce time accordingly
512 timeReduction = lastBestMoveDepth + 9 < completedDepth ? 1.92 : 0.95;
513 double reduction = (1.47 + mainThread->previousTimeReduction) / (2.32 * timeReduction);
515 // Use part of the gained time from a previous stable move for the current move
516 for (Thread* th : Threads)
518 totBestMoveChanges += th->bestMoveChanges;
519 th->bestMoveChanges = 0;
521 double bestMoveInstability = 1 + 2 * totBestMoveChanges / Threads.size();
523 double totalTime = Time.optimum() * fallingEval * reduction * bestMoveInstability;
525 // Cap used time in case of a single legal move for a better viewer experience in tournaments
526 // yielding correct scores and sufficiently fast moves.
527 if (rootMoves.size() == 1)
528 totalTime = std::min(500.0, totalTime);
530 // Stop the search if we have exceeded the totalTime
531 if (Time.elapsed() > totalTime)
533 // If we are allowed to ponder do not stop the search now but
534 // keep pondering until the GUI sends "ponderhit" or "stop".
535 if (mainThread->ponder)
536 mainThread->stopOnPonderhit = true;
540 else if ( Threads.increaseDepth
541 && !mainThread->ponder
542 && Time.elapsed() > totalTime * 0.58)
543 Threads.increaseDepth = false;
545 Threads.increaseDepth = true;
548 mainThread->iterValue[iterIdx] = bestValue;
549 iterIdx = (iterIdx + 1) & 3;
555 mainThread->previousTimeReduction = timeReduction;
557 // If skill level is enabled, swap best PV line with the sub-optimal one
559 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
560 skill.best ? skill.best : skill.pick_best(multiPV)));
566 // search<>() is the main search function for both PV and non-PV nodes
568 template <NodeType NT>
569 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
571 constexpr bool PvNode = NT == PV;
572 const bool rootNode = PvNode && ss->ply == 0;
573 const Depth maxNextDepth = rootNode ? depth : depth + 1;
575 // Check if we have an upcoming move which draws by repetition, or
576 // if the opponent had an alternative move earlier to this position.
577 if ( pos.rule50_count() >= 3
578 && alpha < VALUE_DRAW
580 && pos.has_game_cycle(ss->ply))
582 alpha = value_draw(pos.this_thread());
587 // Dive into quiescence search when the depth reaches zero
589 return qsearch<NT>(pos, ss, alpha, beta);
591 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
592 assert(PvNode || (alpha == beta - 1));
593 assert(0 < depth && depth < MAX_PLY);
594 assert(!(PvNode && cutNode));
596 Move pv[MAX_PLY+1], capturesSearched[32], quietsSearched[64];
598 ASSERT_ALIGNED(&st, Eval::NNUE::kCacheLineSize);
602 Move ttMove, move, excludedMove, bestMove;
603 Depth extension, newDepth;
604 Value bestValue, value, ttValue, eval, maxValue, probCutBeta;
605 bool formerPv, givesCheck, improving, didLMR, priorCapture;
606 bool captureOrPromotion, doFullDepthSearch, moveCountPruning,
607 ttCapture, singularQuietLMR;
609 int moveCount, captureCount, quietCount;
611 // Step 1. Initialize node
612 Thread* thisThread = pos.this_thread();
613 ss->inCheck = pos.checkers();
614 priorCapture = pos.captured_piece();
615 Color us = pos.side_to_move();
616 moveCount = captureCount = quietCount = ss->moveCount = 0;
617 bestValue = -VALUE_INFINITE;
618 maxValue = VALUE_INFINITE;
619 ss->distanceFromPv = (PvNode ? 0 : ss->distanceFromPv);
621 // Check for the available remaining time
622 if (thisThread == Threads.main())
623 static_cast<MainThread*>(thisThread)->check_time();
625 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
626 if (PvNode && thisThread->selDepth < ss->ply + 1)
627 thisThread->selDepth = ss->ply + 1;
631 // Step 2. Check for aborted search and immediate draw
632 if ( Threads.stop.load(std::memory_order_relaxed)
633 || pos.is_draw(ss->ply)
634 || ss->ply >= MAX_PLY)
635 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos)
636 : value_draw(pos.this_thread());
638 // Step 3. Mate distance pruning. Even if we mate at the next move our score
639 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
640 // a shorter mate was found upward in the tree then there is no need to search
641 // because we will never beat the current alpha. Same logic but with reversed
642 // signs applies also in the opposite condition of being mated instead of giving
643 // mate. In this case return a fail-high score.
644 alpha = std::max(mated_in(ss->ply), alpha);
645 beta = std::min(mate_in(ss->ply+1), beta);
650 assert(0 <= ss->ply && ss->ply < MAX_PLY);
652 (ss+1)->ply = ss->ply + 1;
653 (ss+1)->ttPv = false;
654 (ss+1)->excludedMove = bestMove = MOVE_NONE;
655 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
656 Square prevSq = to_sq((ss-1)->currentMove);
658 // Initialize statScore to zero for the grandchildren of the current position.
659 // So statScore is shared between all grandchildren and only the first grandchild
660 // starts with statScore = 0. Later grandchildren start with the last calculated
661 // statScore of the previous grandchild. This influences the reduction rules in
662 // LMR which are based on the statScore of parent position.
664 (ss+2)->statScore = 0;
666 // Step 4. Transposition table lookup. We don't want the score of a partial
667 // search to overwrite a previous full search TT value, so we use a different
668 // position key in case of an excluded move.
669 excludedMove = ss->excludedMove;
670 posKey = excludedMove == MOVE_NONE ? pos.key() : pos.key() ^ make_key(excludedMove);
671 tte = TT.probe(posKey, ss->ttHit);
672 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
673 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
674 : ss->ttHit ? tte->move() : MOVE_NONE;
676 ss->ttPv = PvNode || (ss->ttHit && tte->is_pv());
677 formerPv = ss->ttPv && !PvNode;
679 // Update low ply history for previous move if we are near root and position is or has been in PV
682 && ss->ply - 1 < MAX_LPH
684 && is_ok((ss-1)->currentMove))
685 thisThread->lowPlyHistory[ss->ply - 1][from_to((ss-1)->currentMove)] << stat_bonus(depth - 5);
687 // thisThread->ttHitAverage can be used to approximate the running average of ttHit
688 thisThread->ttHitAverage = (TtHitAverageWindow - 1) * thisThread->ttHitAverage / TtHitAverageWindow
689 + TtHitAverageResolution * ss->ttHit;
691 // At non-PV nodes we check for an early TT cutoff
694 && tte->depth() >= depth
695 && ttValue != VALUE_NONE // Possible in case of TT access race
696 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
697 : (tte->bound() & BOUND_UPPER)))
699 // If ttMove is quiet, update move sorting heuristics on TT hit
704 // Bonus for a quiet ttMove that fails high
705 if (!pos.capture_or_promotion(ttMove))
706 update_quiet_stats(pos, ss, ttMove, stat_bonus(depth), depth);
708 // Extra penalty for early quiet moves of the previous ply
709 if ((ss-1)->moveCount <= 2 && !priorCapture)
710 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + 1));
712 // Penalty for a quiet ttMove that fails low
713 else if (!pos.capture_or_promotion(ttMove))
715 int penalty = -stat_bonus(depth);
716 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
717 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
721 // Partial workaround for the graph history interaction problem
722 // For high rule50 counts don't produce transposition table cutoffs.
723 if (pos.rule50_count() < 90)
727 // Step 5. Tablebases probe
728 if (!rootNode && TB::Cardinality)
730 int piecesCount = pos.count<ALL_PIECES>();
732 if ( piecesCount <= TB::Cardinality
733 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
734 && pos.rule50_count() == 0
735 && !pos.can_castle(ANY_CASTLING))
738 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
740 // Force check of time on the next occasion
741 if (thisThread == Threads.main())
742 static_cast<MainThread*>(thisThread)->callsCnt = 0;
744 if (err != TB::ProbeState::FAIL)
746 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
748 int drawScore = TB::UseRule50 ? 1 : 0;
750 // use the range VALUE_MATE_IN_MAX_PLY to VALUE_TB_WIN_IN_MAX_PLY to score
751 value = wdl < -drawScore ? VALUE_MATED_IN_MAX_PLY + ss->ply + 1
752 : wdl > drawScore ? VALUE_MATE_IN_MAX_PLY - ss->ply - 1
753 : VALUE_DRAW + 2 * wdl * drawScore;
755 Bound b = wdl < -drawScore ? BOUND_UPPER
756 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
758 if ( b == BOUND_EXACT
759 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
761 tte->save(posKey, value_to_tt(value, ss->ply), ss->ttPv, b,
762 std::min(MAX_PLY - 1, depth + 6),
763 MOVE_NONE, VALUE_NONE);
770 if (b == BOUND_LOWER)
771 bestValue = value, alpha = std::max(alpha, bestValue);
779 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
781 // Step 6. Static evaluation of the position
784 // Skip early pruning when in check
785 ss->staticEval = eval = VALUE_NONE;
791 // Never assume anything about values stored in TT
792 ss->staticEval = eval = tte->eval();
793 if (eval == VALUE_NONE)
794 ss->staticEval = eval = evaluate(pos);
796 // Randomize draw evaluation
797 if (eval == VALUE_DRAW)
798 eval = value_draw(thisThread);
800 // Can ttValue be used as a better position evaluation?
801 if ( ttValue != VALUE_NONE
802 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
807 // In case of null move search use previous static eval with a different sign
808 // and addition of two tempos
809 if ((ss-1)->currentMove != MOVE_NULL)
810 ss->staticEval = eval = evaluate(pos);
812 ss->staticEval = eval = -(ss-1)->staticEval + 2 * Tempo;
814 // Save static evaluation into transposition table
815 tte->save(posKey, VALUE_NONE, ss->ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, eval);
818 // Use static evaluation difference to improve quiet move ordering
819 if (is_ok((ss-1)->currentMove) && !(ss-1)->inCheck && !priorCapture)
821 int bonus = std::clamp(-depth * 4 * int((ss-1)->staticEval + ss->staticEval - 2 * Tempo), -1000, 1000);
822 thisThread->mainHistory[~us][from_to((ss-1)->currentMove)] << bonus;
825 // Set up improving flag that is used in various pruning heuristics
826 // We define position as improving if static evaluation of position is better
827 // Than the previous static evaluation at our turn
828 // In case of us being in check at our previous move we look at move prior to it
829 improving = (ss-2)->staticEval == VALUE_NONE
830 ? ss->staticEval > (ss-4)->staticEval || (ss-4)->staticEval == VALUE_NONE
831 : ss->staticEval > (ss-2)->staticEval;
833 // Step 7. Futility pruning: child node (~50 Elo)
836 && eval - futility_margin(depth, improving) >= beta
837 && eval < VALUE_KNOWN_WIN) // Do not return unproven wins
840 // Step 8. Null move search with verification search (~40 Elo)
842 && (ss-1)->currentMove != MOVE_NULL
843 && (ss-1)->statScore < 24185
845 && eval >= ss->staticEval
846 && ss->staticEval >= beta - 24 * depth - 34 * improving + 162 * ss->ttPv + 159
848 && pos.non_pawn_material(us)
849 && (ss->ply >= thisThread->nmpMinPly || us != thisThread->nmpColor))
851 assert(eval - beta >= 0);
853 // Null move dynamic reduction based on depth and value
854 Depth R = (1062 + 68 * depth) / 256 + std::min(int(eval - beta) / 190, 3);
856 ss->currentMove = MOVE_NULL;
857 ss->continuationHistory = &thisThread->continuationHistory[0][0][NO_PIECE][0];
859 pos.do_null_move(st);
861 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
863 pos.undo_null_move();
865 if (nullValue >= beta)
867 // Do not return unproven mate or TB scores
868 if (nullValue >= VALUE_TB_WIN_IN_MAX_PLY)
871 if (thisThread->nmpMinPly || (abs(beta) < VALUE_KNOWN_WIN && depth < 14))
874 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
876 // Do verification search at high depths, with null move pruning disabled
877 // for us, until ply exceeds nmpMinPly.
878 thisThread->nmpMinPly = ss->ply + 3 * (depth-R) / 4;
879 thisThread->nmpColor = us;
881 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
883 thisThread->nmpMinPly = 0;
890 probCutBeta = beta + 209 - 44 * improving;
892 // Step 9. ProbCut (~10 Elo)
893 // If we have a good enough capture and a reduced search returns a value
894 // much above beta, we can (almost) safely prune the previous move.
897 && abs(beta) < VALUE_TB_WIN_IN_MAX_PLY
898 // if value from transposition table is lower than probCutBeta, don't attempt probCut
899 // there and in further interactions with transposition table cutoff depth is set to depth - 3
900 // because probCut search has depth set to depth - 4 but we also do a move before it
901 // so effective depth is equal to depth - 3
903 && tte->depth() >= depth - 3
904 && ttValue != VALUE_NONE
905 && ttValue < probCutBeta))
907 // if ttMove is a capture and value from transposition table is good enough produce probCut
908 // cutoff without digging into actual probCut search
910 && tte->depth() >= depth - 3
911 && ttValue != VALUE_NONE
912 && ttValue >= probCutBeta
914 && pos.capture_or_promotion(ttMove))
917 assert(probCutBeta < VALUE_INFINITE);
918 MovePicker mp(pos, ttMove, probCutBeta - ss->staticEval, &captureHistory);
919 int probCutCount = 0;
920 bool ttPv = ss->ttPv;
923 while ( (move = mp.next_move()) != MOVE_NONE
924 && probCutCount < 2 + 2 * cutNode)
925 if (move != excludedMove && pos.legal(move))
927 assert(pos.capture_or_promotion(move));
930 captureOrPromotion = true;
933 ss->currentMove = move;
934 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
936 [pos.moved_piece(move)]
939 pos.do_move(move, st);
941 // Perform a preliminary qsearch to verify that the move holds
942 value = -qsearch<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1);
944 // If the qsearch held, perform the regular search
945 if (value >= probCutBeta)
946 value = -search<NonPV>(pos, ss+1, -probCutBeta, -probCutBeta+1, depth - 4, !cutNode);
950 if (value >= probCutBeta)
952 // if transposition table doesn't have equal or more deep info write probCut data into it
954 && tte->depth() >= depth - 3
955 && ttValue != VALUE_NONE))
956 tte->save(posKey, value_to_tt(value, ss->ply), ttPv,
958 depth - 3, move, ss->staticEval);
965 // Step 10. If the position is not in TT, decrease depth by 2
971 moves_loop: // When in check, search starts from here
973 ttCapture = ttMove && pos.capture_or_promotion(ttMove);
975 // Step 11. A small Probcut idea, when we are in check
976 probCutBeta = beta + 400;
981 && (tte->bound() & BOUND_LOWER)
982 && tte->depth() >= depth - 3
983 && ttValue >= probCutBeta
984 && abs(ttValue) <= VALUE_KNOWN_WIN
985 && abs(beta) <= VALUE_KNOWN_WIN
990 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
991 nullptr , (ss-4)->continuationHistory,
992 nullptr , (ss-6)->continuationHistory };
994 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
996 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
997 &thisThread->lowPlyHistory,
1005 singularQuietLMR = moveCountPruning = false;
1007 // Mark this node as being searched
1008 ThreadHolding th(thisThread, posKey, ss->ply);
1010 // Step 12. Loop through all pseudo-legal moves until no moves remain
1011 // or a beta cutoff occurs.
1012 while ((move = mp.next_move(moveCountPruning)) != MOVE_NONE)
1014 assert(is_ok(move));
1016 if (move == excludedMove)
1019 // At root obey the "searchmoves" option and skip moves not listed in Root
1020 // Move List. As a consequence any illegal move is also skipped. In MultiPV
1021 // mode we also skip PV moves which have been already searched and those
1022 // of lower "TB rank" if we are in a TB root position.
1023 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
1024 thisThread->rootMoves.begin() + thisThread->pvLast, move))
1027 // Check for legality
1028 if (!rootNode && !pos.legal(move))
1031 ss->moveCount = ++moveCount;
1033 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
1034 sync_cout << "info depth " << depth
1035 << " currmove " << UCI::move(move, pos.is_chess960())
1036 << " currmovenumber " << moveCount + thisThread->pvIdx << sync_endl;
1038 (ss+1)->pv = nullptr;
1041 captureOrPromotion = pos.capture_or_promotion(move);
1042 movedPiece = pos.moved_piece(move);
1043 givesCheck = pos.gives_check(move);
1045 // Indicate PvNodes that will probably fail low if node was searched with non-PV search
1046 // at depth equal or greater to current depth and result of this search was far below alpha
1047 bool likelyFailLow = PvNode
1049 && (tte->bound() & BOUND_UPPER)
1050 && ttValue < alpha + 200 + 100 * depth
1051 && tte->depth() >= depth;
1053 // Calculate new depth for this move
1054 newDepth = depth - 1;
1056 // Step 13. Pruning at shallow depth (~200 Elo)
1058 && pos.non_pawn_material(us)
1059 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY)
1061 // Skip quiet moves if movecount exceeds our FutilityMoveCount threshold
1062 moveCountPruning = moveCount >= futility_move_count(improving, depth);
1064 // Reduced depth of the next LMR search
1065 int lmrDepth = std::max(newDepth - reduction(improving, depth, moveCount), 0);
1067 if ( captureOrPromotion
1070 // Capture history based pruning when the move doesn't give check
1073 && captureHistory[movedPiece][to_sq(move)][type_of(pos.piece_on(to_sq(move)))] < 0)
1076 // SEE based pruning
1077 if (!pos.see_ge(move, Value(-218) * depth)) // (~25 Elo)
1082 // Countermoves based pruning (~20 Elo)
1083 if ( lmrDepth < 4 + ((ss-1)->statScore > 0 || (ss-1)->moveCount == 1)
1084 && (*contHist[0])[movedPiece][to_sq(move)] < CounterMovePruneThreshold
1085 && (*contHist[1])[movedPiece][to_sq(move)] < CounterMovePruneThreshold)
1088 // Futility pruning: parent node (~5 Elo)
1091 && ss->staticEval + 174 + 157 * lmrDepth <= alpha
1092 && (*contHist[0])[movedPiece][to_sq(move)]
1093 + (*contHist[1])[movedPiece][to_sq(move)]
1094 + (*contHist[3])[movedPiece][to_sq(move)]
1095 + (*contHist[5])[movedPiece][to_sq(move)] / 3 < 28255)
1098 // Prune moves with negative SEE (~20 Elo)
1099 if (!pos.see_ge(move, Value(-(30 - std::min(lmrDepth, 18)) * lmrDepth * lmrDepth)))
1104 // Step 14. Extensions (~75 Elo)
1106 // Singular extension search (~70 Elo). If all moves but one fail low on a
1107 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
1108 // then that move is singular and should be extended. To verify this we do
1109 // a reduced search on all the other moves but the ttMove and if the
1110 // result is lower than ttValue minus a margin, then we will extend the ttMove.
1114 && !excludedMove // Avoid recursive singular search
1115 /* && ttValue != VALUE_NONE Already implicit in the next condition */
1116 && abs(ttValue) < VALUE_KNOWN_WIN
1117 && (tte->bound() & BOUND_LOWER)
1118 && tte->depth() >= depth - 3)
1120 Value singularBeta = ttValue - ((formerPv + 4) * depth) / 2;
1121 Depth singularDepth = (depth - 1 + 3 * formerPv) / 2;
1122 ss->excludedMove = move;
1123 value = search<NonPV>(pos, ss, singularBeta - 1, singularBeta, singularDepth, cutNode);
1124 ss->excludedMove = MOVE_NONE;
1126 if (value < singularBeta)
1129 singularQuietLMR = !ttCapture;
1132 // Multi-cut pruning
1133 // Our ttMove is assumed to fail high, and now we failed high also on a reduced
1134 // search without the ttMove. So we assume this expected Cut-node is not singular,
1135 // that multiple moves fail high, and we can prune the whole subtree by returning
1137 else if (singularBeta >= beta)
1138 return singularBeta;
1140 // If the eval of ttMove is greater than beta we try also if there is another
1141 // move that pushes it over beta, if so also produce a cutoff.
1142 else if (ttValue >= beta)
1144 ss->excludedMove = move;
1145 value = search<NonPV>(pos, ss, beta - 1, beta, (depth + 3) / 2, cutNode);
1146 ss->excludedMove = MOVE_NONE;
1153 // Check extension (~2 Elo)
1154 else if ( givesCheck
1155 && (pos.is_discovered_check_on_king(~us, move) || pos.see_ge(move)))
1158 // Last captures extension
1159 else if ( PieceValue[EG][pos.captured_piece()] > PawnValueEg
1160 && pos.non_pawn_material() <= 2 * RookValueMg)
1163 // Add extension to new depth
1164 newDepth += extension;
1166 // Speculative prefetch as early as possible
1167 prefetch(TT.first_entry(pos.key_after(move)));
1169 // Update the current move (this must be done after singular extension search)
1170 ss->currentMove = move;
1171 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1172 [captureOrPromotion]
1176 // Step 15. Make the move
1177 pos.do_move(move, st, givesCheck);
1179 (ss+1)->distanceFromPv = ss->distanceFromPv + moveCount - 1;
1181 // Step 16. Late moves reduction / extension (LMR, ~200 Elo)
1182 // We use various heuristics for the sons of a node after the first son has
1183 // been searched. In general we would like to reduce them, but there are many
1184 // cases where we extend a son if it has good chances to be "interesting".
1186 && moveCount > 1 + 2 * rootNode
1187 && ( !captureOrPromotion
1189 || ss->staticEval + PieceValue[EG][pos.captured_piece()] <= alpha
1191 || (!PvNode && !formerPv && captureHistory[movedPiece][to_sq(move)][type_of(pos.captured_piece())] < 3678)
1192 || thisThread->ttHitAverage < 432 * TtHitAverageResolution * TtHitAverageWindow / 1024))
1194 Depth r = reduction(improving, depth, moveCount);
1196 // Decrease reduction if the ttHit running average is large
1197 if (thisThread->ttHitAverage > 537 * TtHitAverageResolution * TtHitAverageWindow / 1024)
1200 // Increase reduction if other threads are searching this position
1204 // Decrease reduction if position is or has been on the PV
1205 // and node is not likely to fail low. (~10 Elo)
1206 if (ss->ttPv && !likelyFailLow)
1209 // Increase reduction at root and non-PV nodes when the best move does not change frequently
1210 if ((rootNode || !PvNode) && thisThread->rootDepth > 10 && thisThread->bestMoveChanges <= 2)
1213 // More reductions for late moves if position was not in previous PV
1214 if (moveCountPruning && !formerPv)
1217 // Decrease reduction if opponent's move count is high (~5 Elo)
1218 if ((ss-1)->moveCount > 13)
1221 // Decrease reduction if ttMove has been singularly extended (~3 Elo)
1222 if (singularQuietLMR)
1225 if (captureOrPromotion)
1227 // Unless giving check, this capture is likely bad
1229 && ss->staticEval + PieceValue[EG][pos.captured_piece()] + 210 * depth <= alpha)
1234 // Increase reduction if ttMove is a capture (~5 Elo)
1238 // Increase reduction at root if failing high
1239 r += rootNode ? thisThread->failedHighCnt * thisThread->failedHighCnt * moveCount / 512 : 0;
1241 // Increase reduction for cut nodes (~10 Elo)
1245 // Decrease reduction for moves that escape a capture. Filter out
1246 // castling moves, because they are coded as "king captures rook" and
1247 // hence break make_move(). (~2 Elo)
1248 else if ( type_of(move) == NORMAL
1249 && !pos.see_ge(reverse_move(move)))
1250 r -= 2 + ss->ttPv - (type_of(movedPiece) == PAWN);
1252 ss->statScore = thisThread->mainHistory[us][from_to(move)]
1253 + (*contHist[0])[movedPiece][to_sq(move)]
1254 + (*contHist[1])[movedPiece][to_sq(move)]
1255 + (*contHist[3])[movedPiece][to_sq(move)]
1258 // Decrease/increase reduction by comparing opponent's stat score (~10 Elo)
1259 if (ss->statScore >= -89 && (ss-1)->statScore < -116)
1262 else if ((ss-1)->statScore >= -112 && ss->statScore < -100)
1265 // Decrease/increase reduction for moves with a good/bad history (~30 Elo)
1266 // If we are not in check use statScore, but if we are in check we use
1267 // the sum of main history and first continuation history with an offset.
1269 r -= (thisThread->mainHistory[us][from_to(move)]
1270 + (*contHist[0])[movedPiece][to_sq(move)] - 3833) / 16384;
1272 r -= ss->statScore / 14790;
1275 // In general we want to cap the LMR depth search at newDepth. But for nodes
1276 // close to the principal variation the cap is at (newDepth + 1), which will
1277 // allow these nodes to be searched deeper than the pv (up to 4 plies deeper).
1278 Depth d = std::clamp(newDepth - r, 1, newDepth + ((ss+1)->distanceFromPv <= 4));
1280 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1282 // If the son is reduced and fails high it will be re-searched at full depth
1283 doFullDepthSearch = value > alpha && d < newDepth;
1288 doFullDepthSearch = !PvNode || moveCount > 1;
1292 // Step 17. Full depth search when LMR is skipped or fails high
1293 if (doFullDepthSearch)
1295 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1297 // If the move passed LMR update its stats
1298 if (didLMR && !captureOrPromotion)
1300 int bonus = value > alpha ? stat_bonus(newDepth)
1301 : -stat_bonus(newDepth);
1303 update_continuation_histories(ss, movedPiece, to_sq(move), bonus);
1307 // For PV nodes only, do a full PV search on the first move or after a fail
1308 // high (in the latter case search only if value < beta), otherwise let the
1309 // parent node fail low with value <= alpha and try another move.
1310 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1313 (ss+1)->pv[0] = MOVE_NONE;
1315 value = -search<PV>(pos, ss+1, -beta, -alpha,
1316 std::min(maxNextDepth, newDepth), false);
1319 // Step 18. Undo move
1320 pos.undo_move(move);
1322 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1324 // Step 19. Check for a new best move
1325 // Finished searching the move. If a stop occurred, the return value of
1326 // the search cannot be trusted, and we return immediately without
1327 // updating best move, PV and TT.
1328 if (Threads.stop.load(std::memory_order_relaxed))
1333 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1334 thisThread->rootMoves.end(), move);
1336 // PV move or new best move?
1337 if (moveCount == 1 || value > alpha)
1340 rm.selDepth = thisThread->selDepth;
1345 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1346 rm.pv.push_back(*m);
1348 // We record how often the best move has been changed in each
1349 // iteration. This information is used for time management and LMR
1351 ++thisThread->bestMoveChanges;
1354 // All other moves but the PV are set to the lowest value: this
1355 // is not a problem when sorting because the sort is stable and the
1356 // move position in the list is preserved - just the PV is pushed up.
1357 rm.score = -VALUE_INFINITE;
1360 if (value > bestValue)
1368 if (PvNode && !rootNode) // Update pv even in fail-high case
1369 update_pv(ss->pv, move, (ss+1)->pv);
1371 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1375 assert(value >= beta); // Fail high
1382 // If the move is worse than some previously searched move, remember it to update its stats later
1383 if (move != bestMove)
1385 if (captureOrPromotion && captureCount < 32)
1386 capturesSearched[captureCount++] = move;
1388 else if (!captureOrPromotion && quietCount < 64)
1389 quietsSearched[quietCount++] = move;
1393 // The following condition would detect a stop only after move loop has been
1394 // completed. But in this case bestValue is valid because we have fully
1395 // searched our subtree, and we can anyhow save the result in TT.
1401 // Step 20. Check for mate and stalemate
1402 // All legal moves have been searched and if there are no legal moves, it
1403 // must be a mate or a stalemate. If we are in a singular extension search then
1404 // return a fail low score.
1406 assert(moveCount || !ss->inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1409 bestValue = excludedMove ? alpha
1410 : ss->inCheck ? mated_in(ss->ply) : VALUE_DRAW;
1412 // If there is a move which produces search value greater than alpha we update stats of searched moves
1414 update_all_stats(pos, ss, bestMove, bestValue, beta, prevSq,
1415 quietsSearched, quietCount, capturesSearched, captureCount, depth);
1417 // Bonus for prior countermove that caused the fail low
1418 else if ( (depth >= 3 || PvNode)
1420 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth));
1423 bestValue = std::min(bestValue, maxValue);
1425 // If no good move is found and the previous position was ttPv, then the previous
1426 // opponent move is probably good and the new position is added to the search tree.
1427 if (bestValue <= alpha)
1428 ss->ttPv = ss->ttPv || ((ss-1)->ttPv && depth > 3);
1429 // Otherwise, a counter move has been found and if the position is the last leaf
1430 // in the search tree, remove the position from the search tree.
1432 ss->ttPv = ss->ttPv && (ss+1)->ttPv;
1434 // Write gathered information in transposition table
1435 if (!excludedMove && !(rootNode && thisThread->pvIdx))
1436 tte->save(posKey, value_to_tt(bestValue, ss->ply), ss->ttPv,
1437 bestValue >= beta ? BOUND_LOWER :
1438 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1439 depth, bestMove, ss->staticEval);
1441 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1447 // qsearch() is the quiescence search function, which is called by the main search
1448 // function with zero depth, or recursively with further decreasing depth per call.
1449 template <NodeType NT>
1450 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1452 constexpr bool PvNode = NT == PV;
1454 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1455 assert(PvNode || (alpha == beta - 1));
1460 ASSERT_ALIGNED(&st, Eval::NNUE::kCacheLineSize);
1464 Move ttMove, move, bestMove;
1466 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1467 bool pvHit, givesCheck, captureOrPromotion;
1472 oldAlpha = alpha; // To flag BOUND_EXACT when eval above alpha and no available moves
1474 ss->pv[0] = MOVE_NONE;
1477 Thread* thisThread = pos.this_thread();
1478 (ss+1)->ply = ss->ply + 1;
1479 bestMove = MOVE_NONE;
1480 ss->inCheck = pos.checkers();
1483 // Check for an immediate draw or maximum ply reached
1484 if ( pos.is_draw(ss->ply)
1485 || ss->ply >= MAX_PLY)
1486 return (ss->ply >= MAX_PLY && !ss->inCheck) ? evaluate(pos) : VALUE_DRAW;
1488 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1490 // Decide whether or not to include checks: this fixes also the type of
1491 // TT entry depth that we are going to use. Note that in qsearch we use
1492 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1493 ttDepth = ss->inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1494 : DEPTH_QS_NO_CHECKS;
1495 // Transposition table lookup
1497 tte = TT.probe(posKey, ss->ttHit);
1498 ttValue = ss->ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
1499 ttMove = ss->ttHit ? tte->move() : MOVE_NONE;
1500 pvHit = ss->ttHit && tte->is_pv();
1504 && tte->depth() >= ttDepth
1505 && ttValue != VALUE_NONE // Only in case of TT access race
1506 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1507 : (tte->bound() & BOUND_UPPER)))
1510 // Evaluate the position statically
1513 ss->staticEval = VALUE_NONE;
1514 bestValue = futilityBase = -VALUE_INFINITE;
1520 // Never assume anything about values stored in TT
1521 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1522 ss->staticEval = bestValue = evaluate(pos);
1524 // Can ttValue be used as a better position evaluation?
1525 if ( ttValue != VALUE_NONE
1526 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1527 bestValue = ttValue;
1530 // In case of null move search use previous static eval with a different sign
1531 // and addition of two tempos
1532 ss->staticEval = bestValue =
1533 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1534 : -(ss-1)->staticEval + 2 * Tempo;
1536 // Stand pat. Return immediately if static value is at least beta
1537 if (bestValue >= beta)
1539 // Save gathered info in transposition table
1541 tte->save(posKey, value_to_tt(bestValue, ss->ply), false, BOUND_LOWER,
1542 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1547 if (PvNode && bestValue > alpha)
1550 futilityBase = bestValue + 155;
1553 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
1554 nullptr , (ss-4)->continuationHistory,
1555 nullptr , (ss-6)->continuationHistory };
1557 // Initialize a MovePicker object for the current position, and prepare
1558 // to search the moves. Because the depth is <= 0 here, only captures,
1559 // queen and checking knight promotions, and other checks(only if depth >= DEPTH_QS_CHECKS)
1560 // will be generated.
1561 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
1562 &thisThread->captureHistory,
1564 to_sq((ss-1)->currentMove));
1566 // Loop through the moves until no moves remain or a beta cutoff occurs
1567 while ((move = mp.next_move()) != MOVE_NONE)
1569 assert(is_ok(move));
1571 givesCheck = pos.gives_check(move);
1572 captureOrPromotion = pos.capture_or_promotion(move);
1577 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1579 && futilityBase > -VALUE_KNOWN_WIN
1580 && !pos.advanced_pawn_push(move))
1582 assert(type_of(move) != EN_PASSANT); // Due to !pos.advanced_pawn_push
1584 // moveCount pruning
1588 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1590 if (futilityValue <= alpha)
1592 bestValue = std::max(bestValue, futilityValue);
1596 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1598 bestValue = std::max(bestValue, futilityBase);
1603 // Do not search moves with negative SEE values
1604 if ( bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1605 && !pos.see_ge(move))
1608 // Speculative prefetch as early as possible
1609 prefetch(TT.first_entry(pos.key_after(move)));
1611 // Check for legality just before making the move
1612 if (!pos.legal(move))
1618 ss->currentMove = move;
1619 ss->continuationHistory = &thisThread->continuationHistory[ss->inCheck]
1620 [captureOrPromotion]
1621 [pos.moved_piece(move)]
1624 // CounterMove based pruning
1625 if ( !captureOrPromotion
1626 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1627 && (*contHist[0])[pos.moved_piece(move)][to_sq(move)] < CounterMovePruneThreshold
1628 && (*contHist[1])[pos.moved_piece(move)][to_sq(move)] < CounterMovePruneThreshold)
1631 // Make and search the move
1632 pos.do_move(move, st, givesCheck);
1633 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth - 1);
1634 pos.undo_move(move);
1636 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1638 // Check for a new best move
1639 if (value > bestValue)
1647 if (PvNode) // Update pv even in fail-high case
1648 update_pv(ss->pv, move, (ss+1)->pv);
1650 if (PvNode && value < beta) // Update alpha here!
1658 // All legal moves have been searched. A special case: if we're in check
1659 // and no legal moves were found, it is checkmate.
1660 if (ss->inCheck && bestValue == -VALUE_INFINITE)
1662 assert(!MoveList<LEGAL>(pos).size());
1664 return mated_in(ss->ply); // Plies to mate from the root
1667 // Save gathered info in transposition table
1668 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1669 bestValue >= beta ? BOUND_LOWER :
1670 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1671 ttDepth, bestMove, ss->staticEval);
1673 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1679 // value_to_tt() adjusts a mate or TB score from "plies to mate from the root" to
1680 // "plies to mate from the current position". Standard scores are unchanged.
1681 // The function is called before storing a value in the transposition table.
1683 Value value_to_tt(Value v, int ply) {
1685 assert(v != VALUE_NONE);
1687 return v >= VALUE_TB_WIN_IN_MAX_PLY ? v + ply
1688 : v <= VALUE_TB_LOSS_IN_MAX_PLY ? v - ply : v;
1692 // value_from_tt() is the inverse of value_to_tt(): it adjusts a mate or TB score
1693 // from the transposition table (which refers to the plies to mate/be mated from
1694 // current position) to "plies to mate/be mated (TB win/loss) from the root". However,
1695 // for mate scores, to avoid potentially false mate scores related to the 50 moves rule
1696 // and the graph history interaction, we return an optimal TB score instead.
1698 Value value_from_tt(Value v, int ply, int r50c) {
1700 if (v == VALUE_NONE)
1703 if (v >= VALUE_TB_WIN_IN_MAX_PLY) // TB win or better
1705 if (v >= VALUE_MATE_IN_MAX_PLY && VALUE_MATE - v > 99 - r50c)
1706 return VALUE_MATE_IN_MAX_PLY - 1; // do not return a potentially false mate score
1711 if (v <= VALUE_TB_LOSS_IN_MAX_PLY) // TB loss or worse
1713 if (v <= VALUE_MATED_IN_MAX_PLY && VALUE_MATE + v > 99 - r50c)
1714 return VALUE_MATED_IN_MAX_PLY + 1; // do not return a potentially false mate score
1723 // update_pv() adds current move and appends child pv[]
1725 void update_pv(Move* pv, Move move, Move* childPv) {
1727 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1733 // update_all_stats() updates stats at the end of search() when a bestMove is found
1735 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
1736 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth) {
1739 Color us = pos.side_to_move();
1740 Thread* thisThread = pos.this_thread();
1741 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
1742 Piece moved_piece = pos.moved_piece(bestMove);
1743 PieceType captured = type_of(pos.piece_on(to_sq(bestMove)));
1745 bonus1 = stat_bonus(depth + 1);
1746 bonus2 = bestValue > beta + PawnValueMg ? bonus1 // larger bonus
1747 : std::min(bonus1, stat_bonus(depth)); // smaller bonus
1749 if (!pos.capture_or_promotion(bestMove))
1751 // Increase stats for the best move in case it was a quiet move
1752 update_quiet_stats(pos, ss, bestMove, bonus2, depth);
1754 // Decrease stats for all non-best quiet moves
1755 for (int i = 0; i < quietCount; ++i)
1757 thisThread->mainHistory[us][from_to(quietsSearched[i])] << -bonus2;
1758 update_continuation_histories(ss, pos.moved_piece(quietsSearched[i]), to_sq(quietsSearched[i]), -bonus2);
1762 // Increase stats for the best move in case it was a capture move
1763 captureHistory[moved_piece][to_sq(bestMove)][captured] << bonus1;
1765 // Extra penalty for a quiet early move that was not a TT move or
1766 // main killer move in previous ply when it gets refuted.
1767 if ( ((ss-1)->moveCount == 1 + (ss-1)->ttHit || ((ss-1)->currentMove == (ss-1)->killers[0]))
1768 && !pos.captured_piece())
1769 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -bonus1);
1771 // Decrease stats for all non-best capture moves
1772 for (int i = 0; i < captureCount; ++i)
1774 moved_piece = pos.moved_piece(capturesSearched[i]);
1775 captured = type_of(pos.piece_on(to_sq(capturesSearched[i])));
1776 captureHistory[moved_piece][to_sq(capturesSearched[i])][captured] << -bonus1;
1781 // update_continuation_histories() updates histories of the move pairs formed
1782 // by moves at ply -1, -2, -4, and -6 with current move.
1784 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1786 for (int i : {1, 2, 4, 6})
1788 // Only update first 2 continuation histories if we are in check
1789 if (ss->inCheck && i > 2)
1791 if (is_ok((ss-i)->currentMove))
1792 (*(ss-i)->continuationHistory)[pc][to] << bonus;
1797 // update_quiet_stats() updates move sorting heuristics
1799 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus, int depth) {
1802 if (ss->killers[0] != move)
1804 ss->killers[1] = ss->killers[0];
1805 ss->killers[0] = move;
1808 Color us = pos.side_to_move();
1809 Thread* thisThread = pos.this_thread();
1810 thisThread->mainHistory[us][from_to(move)] << bonus;
1811 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1813 // Penalty for reversed move in case of moved piece not being a pawn
1814 if (type_of(pos.moved_piece(move)) != PAWN)
1815 thisThread->mainHistory[us][from_to(reverse_move(move))] << -bonus;
1817 // Update countermove history
1818 if (is_ok((ss-1)->currentMove))
1820 Square prevSq = to_sq((ss-1)->currentMove);
1821 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1824 // Update low ply history
1825 if (depth > 11 && ss->ply < MAX_LPH)
1826 thisThread->lowPlyHistory[ss->ply][from_to(move)] << stat_bonus(depth - 7);
1829 // When playing with strength handicap, choose best move among a set of RootMoves
1830 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1832 Move Skill::pick_best(size_t multiPV) {
1834 const RootMoves& rootMoves = Threads.main()->rootMoves;
1835 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1837 // RootMoves are already sorted by score in descending order
1838 Value topScore = rootMoves[0].score;
1839 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1840 int weakness = 120 - 2 * level;
1841 int maxScore = -VALUE_INFINITE;
1843 // Choose best move. For each move score we add two terms, both dependent on
1844 // weakness. One is deterministic and bigger for weaker levels, and one is
1845 // random. Then we choose the move with the resulting highest score.
1846 for (size_t i = 0; i < multiPV; ++i)
1848 // This is our magic formula
1849 int push = ( weakness * int(topScore - rootMoves[i].score)
1850 + delta * (rng.rand<unsigned>() % weakness)) / 128;
1852 if (rootMoves[i].score + push >= maxScore)
1854 maxScore = rootMoves[i].score + push;
1855 best = rootMoves[i].pv[0];
1865 /// MainThread::check_time() is used to print debug info and, more importantly,
1866 /// to detect when we are out of available time and thus stop the search.
1868 void MainThread::check_time() {
1873 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1874 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1876 static TimePoint lastInfoTime = now();
1878 TimePoint elapsed = Time.elapsed();
1879 TimePoint tick = Limits.startTime + elapsed;
1881 if (tick - lastInfoTime >= 1000)
1883 lastInfoTime = tick;
1887 // We should not stop pondering until told so by the GUI
1891 if ( (Limits.use_time_management() && (elapsed > Time.maximum() - 10 || stopOnPonderhit))
1892 || (Limits.movetime && elapsed >= Limits.movetime)
1893 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1894 Threads.stop = true;
1898 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1899 /// that all (if any) unsearched PV lines are sent using a previous search score.
1901 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1903 std::stringstream ss;
1904 TimePoint elapsed = Time.elapsed() + 1;
1905 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1906 size_t pvIdx = pos.this_thread()->pvIdx;
1907 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1908 uint64_t nodesSearched = Threads.nodes_searched();
1909 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1911 for (size_t i = 0; i < multiPV; ++i)
1913 bool updated = rootMoves[i].score != -VALUE_INFINITE;
1915 if (depth == 1 && !updated && i > 0)
1918 Depth d = updated ? depth : std::max(1, depth - 1);
1919 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1921 if (v == -VALUE_INFINITE)
1924 bool tb = TB::RootInTB && abs(v) < VALUE_MATE_IN_MAX_PLY;
1925 v = tb ? rootMoves[i].tbScore : v;
1927 if (ss.rdbuf()->in_avail()) // Not at first line
1932 << " seldepth " << rootMoves[i].selDepth
1933 << " multipv " << i + 1
1934 << " score " << UCI::value(v);
1936 if (Options["UCI_ShowWDL"])
1937 ss << UCI::wdl(v, pos.game_ply());
1939 if (!tb && i == pvIdx)
1940 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1942 ss << " nodes " << nodesSearched
1943 << " nps " << nodesSearched * 1000 / elapsed;
1945 if (elapsed > 1000) // Earlier makes little sense
1946 ss << " hashfull " << TT.hashfull();
1948 ss << " tbhits " << tbHits
1949 << " time " << elapsed
1952 for (Move m : rootMoves[i].pv)
1953 ss << " " << UCI::move(m, pos.is_chess960());
1960 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1961 /// before exiting the search, for instance, in case we stop the search during a
1962 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1963 /// otherwise in case of 'ponder on' we have nothing to think on.
1965 bool RootMove::extract_ponder_from_tt(Position& pos) {
1968 ASSERT_ALIGNED(&st, Eval::NNUE::kCacheLineSize);
1972 assert(pv.size() == 1);
1974 if (pv[0] == MOVE_NONE)
1977 pos.do_move(pv[0], st);
1978 TTEntry* tte = TT.probe(pos.key(), ttHit);
1982 Move m = tte->move(); // Local copy to be SMP safe
1983 if (MoveList<LEGAL>(pos).contains(m))
1987 pos.undo_move(pv[0]);
1988 return pv.size() > 1;
1991 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1994 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1995 ProbeDepth = int(Options["SyzygyProbeDepth"]);
1996 Cardinality = int(Options["SyzygyProbeLimit"]);
1997 bool dtz_available = true;
1999 // Tables with fewer pieces than SyzygyProbeLimit are searched with
2000 // ProbeDepth == DEPTH_ZERO
2001 if (Cardinality > MaxCardinality)
2003 Cardinality = MaxCardinality;
2007 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
2009 // Rank moves using DTZ tables
2010 RootInTB = root_probe(pos, rootMoves);
2014 // DTZ tables are missing; try to rank moves using WDL tables
2015 dtz_available = false;
2016 RootInTB = root_probe_wdl(pos, rootMoves);
2022 // Sort moves according to TB rank
2023 std::stable_sort(rootMoves.begin(), rootMoves.end(),
2024 [](const RootMove &a, const RootMove &b) { return a.tbRank > b.tbRank; } );
2026 // Probe during search only if DTZ is not available and we are winning
2027 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
2032 // Clean up if root_probe() and root_probe_wdl() have failed
2033 for (auto& m : rootMoves)