2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
5 Copyright (C) 2015-2020 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
7 Stockfish is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
12 Stockfish is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>.
24 #include <cstring> // For std::memset
38 #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;
67 // Razor and futility margins
68 constexpr int RazorMargin = 531;
69 Value futility_margin(Depth d, bool improving) {
70 return Value(217 * (d - improving));
73 // Reductions lookup table, initialized at startup
74 int Reductions[MAX_MOVES]; // [depth or moveNumber]
76 Depth reduction(bool i, Depth d, int mn) {
77 int r = Reductions[d] * Reductions[mn];
78 return (r + 511) / 1024 + (!i && r > 1007);
81 constexpr int futility_move_count(bool improving, Depth depth) {
82 return (4 + depth * depth) / (2 - improving);
85 // History and stats update bonus, based on depth
86 int stat_bonus(Depth d) {
87 return d > 15 ? -8 : 19 * d * d + 155 * d - 132;
90 // Add a small random component to draw evaluations to avoid 3fold-blindness
91 Value value_draw(Thread* thisThread) {
92 return VALUE_DRAW + Value(2 * (thisThread->nodes & 1) - 1);
95 // Skill structure is used to implement strength limit
97 explicit Skill(int l) : level(l) {}
98 bool enabled() const { return level < 20; }
99 bool time_to_pick(Depth depth) const { return depth == 1 + level; }
100 Move pick_best(size_t multiPV);
103 Move best = MOVE_NONE;
106 // Breadcrumbs are used to mark nodes as being searched by a given thread
108 std::atomic<Thread*> thread;
109 std::atomic<Key> key;
111 std::array<Breadcrumb, 1024> breadcrumbs;
113 // ThreadHolding structure keeps track of which thread left breadcrumbs at the given
114 // node for potential reductions. A free node will be marked upon entering the moves
115 // loop by the constructor, and unmarked upon leaving that loop by the destructor.
116 struct ThreadHolding {
117 explicit ThreadHolding(Thread* thisThread, Key posKey, int ply) {
118 location = ply < 8 ? &breadcrumbs[posKey & (breadcrumbs.size() - 1)] : nullptr;
123 // See if another already marked this location, if not, mark it ourselves
124 Thread* tmp = (*location).thread.load(std::memory_order_relaxed);
127 (*location).thread.store(thisThread, std::memory_order_relaxed);
128 (*location).key.store(posKey, std::memory_order_relaxed);
131 else if ( tmp != thisThread
132 && (*location).key.load(std::memory_order_relaxed) == posKey)
138 if (owning) // Free the marked location
139 (*location).thread.store(nullptr, std::memory_order_relaxed);
142 bool marked() { return otherThread; }
145 Breadcrumb* location;
146 bool otherThread, owning;
149 template <NodeType NT>
150 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
152 template <NodeType NT>
153 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = 0);
155 Value value_to_tt(Value v, int ply);
156 Value value_from_tt(Value v, int ply, int r50c);
157 void update_pv(Move* pv, Move move, Move* childPv);
158 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
159 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus, int depth);
160 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
161 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth);
163 // perft() is our utility to verify move generation. All the leaf nodes up
164 // to the given depth are generated and counted, and the sum is returned.
166 uint64_t perft(Position& pos, Depth depth) {
169 uint64_t cnt, nodes = 0;
170 const bool leaf = (depth == 2);
172 for (const auto& m : MoveList<LEGAL>(pos))
174 if (Root && depth <= 1)
179 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - 1);
184 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
192 /// Search::init() is called at startup to initialize various lookup tables
194 void Search::init() {
196 for (int i = 1; i < MAX_MOVES; ++i)
197 Reductions[i] = int((24.8 + std::log(Threads.size()) / 2) * std::log(i));
201 /// Search::clear() resets search state to its initial value
203 void Search::clear() {
205 Threads.main()->wait_for_search_finished();
207 Time.availableNodes = 0;
210 Tablebases::init(Options["SyzygyPath"]); // Free mapped files
214 /// MainThread::search() is started when the program receives the UCI 'go'
215 /// command. It searches from the root position and outputs the "bestmove".
217 void MainThread::search() {
221 nodes = perft<true>(rootPos, Limits.perft);
222 sync_cout << "\nNodes searched: " << nodes << "\n" << sync_endl;
226 Color us = rootPos.side_to_move();
227 Time.init(Limits, us, rootPos.game_ply());
230 if (rootMoves.empty())
232 rootMoves.emplace_back(MOVE_NONE);
233 sync_cout << "info depth 0 score "
234 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
239 for (Thread* th : Threads)
241 th->bestMoveChanges = 0;
243 th->start_searching();
246 Thread::search(); // Let's start searching!
249 // When we reach the maximum depth, we can arrive here without a raise of
250 // Threads.stop. However, if we are pondering or in an infinite search,
251 // the UCI protocol states that we shouldn't print the best move before the
252 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
253 // until the GUI sends one of those commands.
255 while (!Threads.stop && (ponder || Limits.infinite))
256 {} // Busy wait for a stop or a ponder reset
258 // Stop the threads if not already stopped (also raise the stop if
259 // "ponderhit" just reset Threads.ponder).
262 // Wait until all threads have finished
263 for (Thread* th : Threads)
265 th->wait_for_search_finished();
267 // When playing in 'nodes as time' mode, subtract the searched nodes from
268 // the available ones before exiting.
270 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
272 Thread* bestThread = this;
274 // Check if there are threads with a better score than main thread
275 if ( Options["MultiPV"] == 1
277 && !(Skill(Options["Skill Level"]).enabled() || Options["UCI_LimitStrength"])
278 && rootMoves[0].pv[0] != MOVE_NONE)
280 std::map<Move, int64_t> votes;
281 Value minScore = this->rootMoves[0].score;
283 // Find out minimum score
284 for (Thread* th: Threads)
285 minScore = std::min(minScore, th->rootMoves[0].score);
287 // Vote according to score and depth, and select the best thread
288 for (Thread* th : Threads)
290 votes[th->rootMoves[0].pv[0]] +=
291 (th->rootMoves[0].score - minScore + 14) * int(th->completedDepth);
293 if (bestThread->rootMoves[0].score >= VALUE_TB_WIN_IN_MAX_PLY)
295 // Make sure we pick the shortest mate
296 if (th->rootMoves[0].score > bestThread->rootMoves[0].score)
299 else if ( th->rootMoves[0].score >= VALUE_TB_WIN_IN_MAX_PLY
300 || votes[th->rootMoves[0].pv[0]] > votes[bestThread->rootMoves[0].pv[0]])
305 previousScore = bestThread->rootMoves[0].score;
307 // Send again PV info if we have a new best thread
308 if (bestThread != this)
309 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth, -VALUE_INFINITE, VALUE_INFINITE) << sync_endl;
311 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
313 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
314 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
316 std::cout << sync_endl;
320 /// Thread::search() is the main iterative deepening loop. It calls search()
321 /// repeatedly with increasing depth until the allocated thinking time has been
322 /// consumed, the user stops the search, or the maximum search depth is reached.
324 void Thread::search() {
326 // To allow access to (ss-7) up to (ss+2), the stack must be oversized.
327 // The former is needed to allow update_continuation_histories(ss-1, ...),
328 // which accesses its argument at ss-6, also near the root.
329 // The latter is needed for statScores and killer initialization.
330 Stack stack[MAX_PLY+10], *ss = stack+7;
332 Value bestValue, alpha, beta, delta;
333 Move lastBestMove = MOVE_NONE;
334 Depth lastBestMoveDepth = 0;
335 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
336 double timeReduction = 1, totBestMoveChanges = 0;
337 Color us = rootPos.side_to_move();
340 std::memset(ss-7, 0, 10 * sizeof(Stack));
341 for (int i = 7; i > 0; i--)
342 (ss-i)->continuationHistory = &this->continuationHistory[0][0][NO_PIECE][0]; // Use as a sentinel
346 bestValue = delta = alpha = -VALUE_INFINITE;
347 beta = VALUE_INFINITE;
351 if (mainThread->previousScore == VALUE_INFINITE)
352 for (int i=0; i<4; ++i)
353 mainThread->iterValue[i] = VALUE_ZERO;
355 for (int i=0; i<4; ++i)
356 mainThread->iterValue[i] = mainThread->previousScore;
359 size_t multiPV = Options["MultiPV"];
361 // Pick integer skill levels, but non-deterministically round up or down
362 // such that the average integer skill corresponds to the input floating point one.
363 // UCI_Elo is converted to a suitable fractional skill level, using anchoring
364 // to CCRL Elo (goldfish 1.13 = 2000) and a fit through Ordo derived Elo
365 // for match (TC 60+0.6) results spanning a wide range of k values.
367 double floatLevel = Options["UCI_LimitStrength"] ?
368 Utility::clamp(std::pow((Options["UCI_Elo"] - 1346.6) / 143.4, 1 / 0.806), 0.0, 20.0) :
369 double(Options["Skill Level"]);
370 int intLevel = int(floatLevel) +
371 ((floatLevel - int(floatLevel)) * 1024 > rng.rand<unsigned>() % 1024 ? 1 : 0);
372 Skill skill(intLevel);
374 // When playing with strength handicap enable MultiPV search that we will
375 // use behind the scenes to retrieve a set of possible moves.
377 multiPV = std::max(multiPV, (size_t)4);
379 multiPV = std::min(multiPV, rootMoves.size());
380 ttHitAverage = ttHitAverageWindow * ttHitAverageResolution / 2;
382 int ct = int(Options["Contempt"]) * PawnValueEg / 100; // From centipawns
384 // In analysis mode, adjust contempt in accordance with user preference
385 if (Limits.infinite || Options["UCI_AnalyseMode"])
386 ct = Options["Analysis Contempt"] == "Off" ? 0
387 : Options["Analysis Contempt"] == "Both" ? ct
388 : Options["Analysis Contempt"] == "White" && us == BLACK ? -ct
389 : Options["Analysis Contempt"] == "Black" && us == WHITE ? -ct
392 // Evaluation score is from the white point of view
393 contempt = (us == WHITE ? make_score(ct, ct / 2)
394 : -make_score(ct, ct / 2));
396 int searchAgainCounter = 0;
398 // Iterative deepening loop until requested to stop or the target depth is reached
399 while ( ++rootDepth < MAX_PLY
401 && !(Limits.depth && mainThread && rootDepth > Limits.depth))
403 // Age out PV variability metric
405 totBestMoveChanges /= 2;
407 // Save the last iteration's scores before first PV line is searched and
408 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
409 for (RootMove& rm : rootMoves)
410 rm.previousScore = rm.score;
415 if (!Threads.increaseDepth)
416 searchAgainCounter++;
418 // MultiPV loop. We perform a full root search for each PV line
419 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
424 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
425 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
429 // Reset UCI info selDepth for each depth and each PV line
432 // Reset aspiration window starting size
435 Value previousScore = rootMoves[pvIdx].previousScore;
436 delta = Value(21 + abs(previousScore) / 256);
437 alpha = std::max(previousScore - delta,-VALUE_INFINITE);
438 beta = std::min(previousScore + delta, VALUE_INFINITE);
440 // Adjust contempt based on root move's previousScore (dynamic contempt)
441 int dct = ct + (102 - ct / 2) * previousScore / (abs(previousScore) + 157);
443 contempt = (us == WHITE ? make_score(dct, dct / 2)
444 : -make_score(dct, dct / 2));
447 // Start with a small aspiration window and, in the case of a fail
448 // high/low, re-search with a bigger window until we don't fail
450 int failedHighCnt = 0;
453 Depth adjustedDepth = std::max(1, rootDepth - failedHighCnt - searchAgainCounter);
454 bestValue = ::search<PV>(rootPos, ss, alpha, beta, adjustedDepth, false);
456 // Bring the best move to the front. It is critical that sorting
457 // is done with a stable algorithm because all the values but the
458 // first and eventually the new best one are set to -VALUE_INFINITE
459 // and we want to keep the same order for all the moves except the
460 // new PV that goes to the front. Note that in case of MultiPV
461 // search the already searched PV lines are preserved.
462 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
464 // If search has been stopped, we break immediately. Sorting is
465 // safe because RootMoves is still valid, although it refers to
466 // the previous iteration.
470 // When failing high/low give some update (without cluttering
471 // the UI) before a re-search.
474 && (bestValue <= alpha || bestValue >= beta)
475 && Time.elapsed() > 3000)
476 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
478 // In case of failing low/high increase aspiration window and
479 // re-search, otherwise exit the loop.
480 if (bestValue <= alpha)
482 beta = (alpha + beta) / 2;
483 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
487 mainThread->stopOnPonderhit = false;
489 else if (bestValue >= beta)
491 beta = std::min(bestValue + delta, VALUE_INFINITE);
496 ++rootMoves[pvIdx].bestMoveCount;
500 delta += delta / 4 + 5;
502 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
505 // Sort the PV lines searched so far and update the GUI
506 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
509 && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
510 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
514 completedDepth = rootDepth;
516 if (rootMoves[0].pv[0] != lastBestMove) {
517 lastBestMove = rootMoves[0].pv[0];
518 lastBestMoveDepth = rootDepth;
521 // Have we found a "mate in x"?
523 && bestValue >= VALUE_MATE_IN_MAX_PLY
524 && VALUE_MATE - bestValue <= 2 * Limits.mate)
530 // If skill level is enabled and time is up, pick a sub-optimal best move
531 if (skill.enabled() && skill.time_to_pick(rootDepth))
532 skill.pick_best(multiPV);
534 // Do we have time for the next iteration? Can we stop searching now?
535 if ( Limits.use_time_management()
537 && !mainThread->stopOnPonderhit)
539 double fallingEval = (332 + 6 * (mainThread->previousScore - bestValue)
540 + 6 * (mainThread->iterValue[iterIdx] - bestValue)) / 704.0;
541 fallingEval = Utility::clamp(fallingEval, 0.5, 1.5);
543 // If the bestMove is stable over several iterations, reduce time accordingly
544 timeReduction = lastBestMoveDepth + 9 < completedDepth ? 1.94 : 0.91;
545 double reduction = (1.41 + mainThread->previousTimeReduction) / (2.27 * timeReduction);
547 // Use part of the gained time from a previous stable move for the current move
548 for (Thread* th : Threads)
550 totBestMoveChanges += th->bestMoveChanges;
551 th->bestMoveChanges = 0;
553 double bestMoveInstability = 1 + totBestMoveChanges / Threads.size();
555 // Stop the search if we have only one legal move, or if available time elapsed
556 if ( rootMoves.size() == 1
557 || Time.elapsed() > Time.optimum() * fallingEval * reduction * bestMoveInstability)
559 // If we are allowed to ponder do not stop the search now but
560 // keep pondering until the GUI sends "ponderhit" or "stop".
561 if (mainThread->ponder)
562 mainThread->stopOnPonderhit = true;
566 else if ( Threads.increaseDepth
567 && !mainThread->ponder
568 && Time.elapsed() > Time.optimum() * fallingEval * reduction * bestMoveInstability * 0.6)
569 Threads.increaseDepth = false;
571 Threads.increaseDepth = true;
574 mainThread->iterValue[iterIdx] = bestValue;
575 iterIdx = (iterIdx + 1) & 3;
581 mainThread->previousTimeReduction = timeReduction;
583 // If skill level is enabled, swap best PV line with the sub-optimal one
585 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
586 skill.best ? skill.best : skill.pick_best(multiPV)));
592 // search<>() is the main search function for both PV and non-PV nodes
594 template <NodeType NT>
595 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
597 constexpr bool PvNode = NT == PV;
598 const bool rootNode = PvNode && ss->ply == 0;
600 // Check if we have an upcoming move which draws by repetition, or
601 // if the opponent had an alternative move earlier to this position.
602 if ( pos.rule50_count() >= 3
603 && alpha < VALUE_DRAW
605 && pos.has_game_cycle(ss->ply))
607 alpha = value_draw(pos.this_thread());
612 // Dive into quiescence search when the depth reaches zero
614 return qsearch<NT>(pos, ss, alpha, beta);
616 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
617 assert(PvNode || (alpha == beta - 1));
618 assert(0 < depth && depth < MAX_PLY);
619 assert(!(PvNode && cutNode));
621 Move pv[MAX_PLY+1], capturesSearched[32], quietsSearched[64];
625 Move ttMove, move, excludedMove, bestMove;
626 Depth extension, newDepth;
627 Value bestValue, value, ttValue, eval, maxValue;
628 bool ttHit, ttPv, inCheck, givesCheck, improving, didLMR, priorCapture;
629 bool captureOrPromotion, doFullDepthSearch, moveCountPruning, ttCapture, singularLMR;
631 int moveCount, captureCount, quietCount;
633 // Step 1. Initialize node
634 Thread* thisThread = pos.this_thread();
635 inCheck = pos.checkers();
636 priorCapture = pos.captured_piece();
637 Color us = pos.side_to_move();
638 moveCount = captureCount = quietCount = ss->moveCount = 0;
639 bestValue = -VALUE_INFINITE;
640 maxValue = VALUE_INFINITE;
642 // Check for the available remaining time
643 if (thisThread == Threads.main())
644 static_cast<MainThread*>(thisThread)->check_time();
646 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
647 if (PvNode && thisThread->selDepth < ss->ply + 1)
648 thisThread->selDepth = ss->ply + 1;
652 // Step 2. Check for aborted search and immediate draw
653 if ( Threads.stop.load(std::memory_order_relaxed)
654 || pos.is_draw(ss->ply)
655 || ss->ply >= MAX_PLY)
656 return (ss->ply >= MAX_PLY && !inCheck) ? evaluate(pos)
657 : value_draw(pos.this_thread());
659 // Step 3. Mate distance pruning. Even if we mate at the next move our score
660 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
661 // a shorter mate was found upward in the tree then there is no need to search
662 // because we will never beat the current alpha. Same logic but with reversed
663 // signs applies also in the opposite condition of being mated instead of giving
664 // mate. In this case return a fail-high score.
665 alpha = std::max(mated_in(ss->ply), alpha);
666 beta = std::min(mate_in(ss->ply+1), beta);
671 assert(0 <= ss->ply && ss->ply < MAX_PLY);
673 (ss+1)->ply = ss->ply + 1;
674 (ss+1)->excludedMove = bestMove = MOVE_NONE;
675 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
676 Square prevSq = to_sq((ss-1)->currentMove);
678 // Initialize statScore to zero for the grandchildren of the current position.
679 // So statScore is shared between all grandchildren and only the first grandchild
680 // starts with statScore = 0. Later grandchildren start with the last calculated
681 // statScore of the previous grandchild. This influences the reduction rules in
682 // LMR which are based on the statScore of parent position.
684 (ss+4)->statScore = 0;
686 (ss+2)->statScore = 0;
688 // Step 4. Transposition table lookup. We don't want the score of a partial
689 // search to overwrite a previous full search TT value, so we use a different
690 // position key in case of an excluded move.
691 excludedMove = ss->excludedMove;
692 posKey = pos.key() ^ Key(excludedMove << 16); // Isn't a very good hash
693 tte = TT.probe(posKey, ttHit);
694 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
695 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
696 : ttHit ? tte->move() : MOVE_NONE;
697 ttPv = PvNode || (ttHit && tte->is_pv());
699 if (ttPv && depth > 12 && ss->ply - 1 < MAX_LPH && !pos.captured_piece() && is_ok((ss-1)->currentMove))
700 thisThread->lowPlyHistory[ss->ply - 1][from_to((ss-1)->currentMove)] << stat_bonus(depth - 5);
702 // thisThread->ttHitAverage can be used to approximate the running average of ttHit
703 thisThread->ttHitAverage = (ttHitAverageWindow - 1) * thisThread->ttHitAverage / ttHitAverageWindow
704 + ttHitAverageResolution * ttHit;
706 // At non-PV nodes we check for an early TT cutoff
709 && tte->depth() >= depth
710 && ttValue != VALUE_NONE // Possible in case of TT access race
711 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
712 : (tte->bound() & BOUND_UPPER)))
714 // If ttMove is quiet, update move sorting heuristics on TT hit
719 if (!pos.capture_or_promotion(ttMove))
720 update_quiet_stats(pos, ss, ttMove, stat_bonus(depth), depth);
722 // Extra penalty for early quiet moves of the previous ply
723 if ((ss-1)->moveCount <= 2 && !priorCapture)
724 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + 1));
726 // Penalty for a quiet ttMove that fails low
727 else if (!pos.capture_or_promotion(ttMove))
729 int penalty = -stat_bonus(depth);
730 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
731 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
735 if (pos.rule50_count() < 90)
739 // Step 5. Tablebases probe
740 if (!rootNode && TB::Cardinality)
742 int piecesCount = pos.count<ALL_PIECES>();
744 if ( piecesCount <= TB::Cardinality
745 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
746 && pos.rule50_count() == 0
747 && !pos.can_castle(ANY_CASTLING))
750 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
752 // Force check of time on the next occasion
753 if (thisThread == Threads.main())
754 static_cast<MainThread*>(thisThread)->callsCnt = 0;
756 if (err != TB::ProbeState::FAIL)
758 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
760 int drawScore = TB::UseRule50 ? 1 : 0;
762 // use the range VALUE_MATE_IN_MAX_PLY to VALUE_TB_WIN_IN_MAX_PLY to score
763 value = wdl < -drawScore ? VALUE_MATED_IN_MAX_PLY + ss->ply + 1
764 : wdl > drawScore ? VALUE_MATE_IN_MAX_PLY - ss->ply - 1
765 : VALUE_DRAW + 2 * wdl * drawScore;
767 Bound b = wdl < -drawScore ? BOUND_UPPER
768 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
770 if ( b == BOUND_EXACT
771 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
773 tte->save(posKey, value_to_tt(value, ss->ply), ttPv, b,
774 std::min(MAX_PLY - 1, depth + 6),
775 MOVE_NONE, VALUE_NONE);
782 if (b == BOUND_LOWER)
783 bestValue = value, alpha = std::max(alpha, bestValue);
791 // Step 6. Static evaluation of the position
794 ss->staticEval = eval = VALUE_NONE;
796 goto moves_loop; // Skip early pruning when in check
800 // Never assume anything about values stored in TT
801 ss->staticEval = eval = tte->eval();
802 if (eval == VALUE_NONE)
803 ss->staticEval = eval = evaluate(pos);
805 if (eval == VALUE_DRAW)
806 eval = value_draw(thisThread);
808 // Can ttValue be used as a better position evaluation?
809 if ( ttValue != VALUE_NONE
810 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
815 if ((ss-1)->currentMove != MOVE_NULL)
817 int bonus = -(ss-1)->statScore / 512;
819 ss->staticEval = eval = evaluate(pos) + bonus;
822 ss->staticEval = eval = -(ss-1)->staticEval + 2 * Tempo;
824 tte->save(posKey, VALUE_NONE, ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, eval);
827 // Step 7. Razoring (~1 Elo)
828 if ( !rootNode // The required rootNode PV handling is not available in qsearch
830 && eval <= alpha - RazorMargin)
831 return qsearch<NT>(pos, ss, alpha, beta);
833 improving = (ss-2)->staticEval == VALUE_NONE ? (ss->staticEval > (ss-4)->staticEval
834 || (ss-4)->staticEval == VALUE_NONE) : ss->staticEval > (ss-2)->staticEval;
836 // Step 8. Futility pruning: child node (~50 Elo)
839 && eval - futility_margin(depth, improving) >= beta
840 && eval < VALUE_KNOWN_WIN) // Do not return unproven wins
843 // Step 9. Null move search with verification search (~40 Elo)
845 && (ss-1)->currentMove != MOVE_NULL
846 && (ss-1)->statScore < 23397
848 && eval >= ss->staticEval
849 && ss->staticEval >= beta - 32 * depth - 30 * improving + 120 * ttPv + 292
851 && pos.non_pawn_material(us)
852 && (ss->ply >= thisThread->nmpMinPly || us != thisThread->nmpColor))
854 assert(eval - beta >= 0);
856 // Null move dynamic reduction based on depth and value
857 Depth R = (854 + 68 * depth) / 258 + std::min(int(eval - beta) / 192, 3);
859 ss->currentMove = MOVE_NULL;
860 ss->continuationHistory = &thisThread->continuationHistory[0][0][NO_PIECE][0];
862 pos.do_null_move(st);
864 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
866 pos.undo_null_move();
868 if (nullValue >= beta)
870 // Do not return unproven mate scores
871 if (nullValue >= VALUE_TB_WIN_IN_MAX_PLY)
874 if (thisThread->nmpMinPly || (abs(beta) < VALUE_KNOWN_WIN && depth < 13))
877 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
879 // Do verification search at high depths, with null move pruning disabled
880 // for us, until ply exceeds nmpMinPly.
881 thisThread->nmpMinPly = ss->ply + 3 * (depth-R) / 4;
882 thisThread->nmpColor = us;
884 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
886 thisThread->nmpMinPly = 0;
893 // Step 10. ProbCut (~10 Elo)
894 // If we have a good enough capture and a reduced search returns a value
895 // much above beta, we can (almost) safely prune the previous move.
898 && abs(beta) < VALUE_TB_WIN_IN_MAX_PLY)
900 Value raisedBeta = std::min(beta + 189 - 45 * improving, VALUE_INFINITE);
901 MovePicker mp(pos, ttMove, raisedBeta - ss->staticEval, &thisThread->captureHistory);
902 int probCutCount = 0;
904 while ( (move = mp.next_move()) != MOVE_NONE
905 && probCutCount < 2 + 2 * cutNode)
906 if (move != excludedMove && pos.legal(move))
908 assert(pos.capture_or_promotion(move));
911 captureOrPromotion = true;
914 ss->currentMove = move;
915 ss->continuationHistory = &thisThread->continuationHistory[inCheck]
917 [pos.moved_piece(move)]
920 pos.do_move(move, st);
922 // Perform a preliminary qsearch to verify that the move holds
923 value = -qsearch<NonPV>(pos, ss+1, -raisedBeta, -raisedBeta+1);
925 // If the qsearch held, perform the regular search
926 if (value >= raisedBeta)
927 value = -search<NonPV>(pos, ss+1, -raisedBeta, -raisedBeta+1, depth - 4, !cutNode);
931 if (value >= raisedBeta)
936 // Step 11. Internal iterative deepening (~1 Elo)
937 if (depth >= 7 && !ttMove)
939 search<NT>(pos, ss, alpha, beta, depth - 7, cutNode);
941 tte = TT.probe(posKey, ttHit);
942 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
943 ttMove = ttHit ? tte->move() : MOVE_NONE;
946 moves_loop: // When in check, search starts from here
948 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
949 nullptr , (ss-4)->continuationHistory,
950 nullptr , (ss-6)->continuationHistory };
952 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
954 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
955 &thisThread->lowPlyHistory,
956 &thisThread->captureHistory,
960 depth > 12 ? ss->ply : MAX_PLY);
963 singularLMR = moveCountPruning = false;
964 ttCapture = ttMove && pos.capture_or_promotion(ttMove);
966 // Mark this node as being searched
967 ThreadHolding th(thisThread, posKey, ss->ply);
969 // Step 12. Loop through all pseudo-legal moves until no moves remain
970 // or a beta cutoff occurs.
971 while ((move = mp.next_move(moveCountPruning)) != MOVE_NONE)
975 if (move == excludedMove)
978 // At root obey the "searchmoves" option and skip moves not listed in Root
979 // Move List. As a consequence any illegal move is also skipped. In MultiPV
980 // mode we also skip PV moves which have been already searched and those
981 // of lower "TB rank" if we are in a TB root position.
982 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
983 thisThread->rootMoves.begin() + thisThread->pvLast, move))
986 ss->moveCount = ++moveCount;
988 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
989 sync_cout << "info depth " << depth
990 << " currmove " << UCI::move(move, pos.is_chess960())
991 << " currmovenumber " << moveCount + thisThread->pvIdx << sync_endl;
993 (ss+1)->pv = nullptr;
996 captureOrPromotion = pos.capture_or_promotion(move);
997 movedPiece = pos.moved_piece(move);
998 givesCheck = pos.gives_check(move);
1000 // Calculate new depth for this move
1001 newDepth = depth - 1;
1003 // Step 13. Pruning at shallow depth (~200 Elo)
1005 && pos.non_pawn_material(us)
1006 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY)
1008 // Skip quiet moves if movecount exceeds our FutilityMoveCount threshold
1009 moveCountPruning = moveCount >= futility_move_count(improving, depth);
1011 if ( !captureOrPromotion
1014 // Reduced depth of the next LMR search
1015 int lmrDepth = std::max(newDepth - reduction(improving, depth, moveCount), 0);
1017 // Countermoves based pruning (~20 Elo)
1018 if ( lmrDepth < 4 + ((ss-1)->statScore > 0 || (ss-1)->moveCount == 1)
1019 && (*contHist[0])[movedPiece][to_sq(move)] < CounterMovePruneThreshold
1020 && (*contHist[1])[movedPiece][to_sq(move)] < CounterMovePruneThreshold)
1023 // Futility pruning: parent node (~5 Elo)
1026 && ss->staticEval + 235 + 172 * lmrDepth <= alpha
1027 && thisThread->mainHistory[us][from_to(move)]
1028 + (*contHist[0])[movedPiece][to_sq(move)]
1029 + (*contHist[1])[movedPiece][to_sq(move)]
1030 + (*contHist[3])[movedPiece][to_sq(move)] < 25000)
1033 // Prune moves with negative SEE (~20 Elo)
1034 if (!pos.see_ge(move, Value(-(32 - std::min(lmrDepth, 18)) * lmrDepth * lmrDepth)))
1037 else if (!pos.see_ge(move, Value(-194) * depth)) // (~25 Elo)
1041 // Step 14. Extensions (~75 Elo)
1043 // Singular extension search (~70 Elo). If all moves but one fail low on a
1044 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
1045 // then that move is singular and should be extended. To verify this we do
1046 // a reduced search on all the other moves but the ttMove and if the
1047 // result is lower than ttValue minus a margin then we will extend the ttMove.
1051 && !excludedMove // Avoid recursive singular search
1052 /* && ttValue != VALUE_NONE Already implicit in the next condition */
1053 && abs(ttValue) < VALUE_KNOWN_WIN
1054 && (tte->bound() & BOUND_LOWER)
1055 && tte->depth() >= depth - 3
1058 Value singularBeta = ttValue - (((ttPv && !PvNode) + 4) * depth) / 2;
1059 Depth halfDepth = depth / 2;
1060 ss->excludedMove = move;
1061 value = search<NonPV>(pos, ss, singularBeta - 1, singularBeta, halfDepth, cutNode);
1062 ss->excludedMove = MOVE_NONE;
1064 if (value < singularBeta)
1070 // Multi-cut pruning
1071 // Our ttMove is assumed to fail high, and now we failed high also on a reduced
1072 // search without the ttMove. So we assume this expected Cut-node is not singular,
1073 // that multiple moves fail high, and we can prune the whole subtree by returning
1075 else if (singularBeta >= beta)
1076 return singularBeta;
1079 // Check extension (~2 Elo)
1080 else if ( givesCheck
1081 && (pos.is_discovery_check_on_king(~us, move) || pos.see_ge(move)))
1084 // Passed pawn extension
1085 else if ( move == ss->killers[0]
1086 && pos.advanced_pawn_push(move)
1087 && pos.pawn_passed(us, to_sq(move)))
1090 // Last captures extension
1091 else if ( PieceValue[EG][pos.captured_piece()] > PawnValueEg
1092 && pos.non_pawn_material() <= 2 * RookValueMg)
1095 // Castling extension
1096 if (type_of(move) == CASTLING)
1099 // Add extension to new depth
1100 newDepth += extension;
1102 // Speculative prefetch as early as possible
1103 prefetch(TT.first_entry(pos.key_after(move)));
1105 // Check for legality just before making the move
1106 if (!rootNode && !pos.legal(move))
1108 ss->moveCount = --moveCount;
1112 // Update the current move (this must be done after singular extension search)
1113 ss->currentMove = move;
1114 ss->continuationHistory = &thisThread->continuationHistory[inCheck]
1115 [captureOrPromotion]
1119 // Step 15. Make the move
1120 pos.do_move(move, st, givesCheck);
1122 // Step 16. Reduced depth search (LMR, ~200 Elo). If the move fails high it will be
1123 // re-searched at full depth.
1125 && moveCount > 1 + 2 * rootNode
1126 && (!rootNode || thisThread->best_move_count(move) == 0)
1127 && ( !captureOrPromotion
1129 || ss->staticEval + PieceValue[EG][pos.captured_piece()] <= alpha
1131 || thisThread->ttHitAverage < 375 * ttHitAverageResolution * ttHitAverageWindow / 1024))
1133 Depth r = reduction(improving, depth, moveCount);
1135 // Decrease reduction if the ttHit running average is large
1136 if (thisThread->ttHitAverage > 500 * ttHitAverageResolution * ttHitAverageWindow / 1024)
1139 // Reduction if other threads are searching this position.
1143 // Decrease reduction if position is or has been on the PV (~10 Elo)
1147 // Decrease reduction if opponent's move count is high (~5 Elo)
1148 if ((ss-1)->moveCount > 14)
1151 // Decrease reduction if ttMove has been singularly extended (~3 Elo)
1155 if (!captureOrPromotion)
1157 // Increase reduction if ttMove is a capture (~5 Elo)
1161 // Increase reduction for cut nodes (~10 Elo)
1165 // Decrease reduction for moves that escape a capture. Filter out
1166 // castling moves, because they are coded as "king captures rook" and
1167 // hence break make_move(). (~2 Elo)
1168 else if ( type_of(move) == NORMAL
1169 && !pos.see_ge(reverse_move(move)))
1172 ss->statScore = thisThread->mainHistory[us][from_to(move)]
1173 + (*contHist[0])[movedPiece][to_sq(move)]
1174 + (*contHist[1])[movedPiece][to_sq(move)]
1175 + (*contHist[3])[movedPiece][to_sq(move)]
1178 // Reset statScore to zero if negative and most stats shows >= 0
1179 if ( ss->statScore < 0
1180 && (*contHist[0])[movedPiece][to_sq(move)] >= 0
1181 && (*contHist[1])[movedPiece][to_sq(move)] >= 0
1182 && thisThread->mainHistory[us][from_to(move)] >= 0)
1185 // Decrease/increase reduction by comparing opponent's stat score (~10 Elo)
1186 if (ss->statScore >= -102 && (ss-1)->statScore < -114)
1189 else if ((ss-1)->statScore >= -116 && ss->statScore < -154)
1192 // Decrease/increase reduction for moves with a good/bad history (~30 Elo)
1193 r -= ss->statScore / 16384;
1196 // Increase reduction for captures/promotions if late move and at low depth
1197 else if (depth < 8 && moveCount > 2)
1200 Depth d = Utility::clamp(newDepth - r, 1, newDepth);
1202 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1204 doFullDepthSearch = (value > alpha && d != newDepth), didLMR = true;
1207 doFullDepthSearch = !PvNode || moveCount > 1, didLMR = false;
1209 // Step 17. Full depth search when LMR is skipped or fails high
1210 if (doFullDepthSearch)
1212 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1214 if (didLMR && !captureOrPromotion)
1216 int bonus = value > alpha ? stat_bonus(newDepth)
1217 : -stat_bonus(newDepth);
1219 if (move == ss->killers[0])
1222 update_continuation_histories(ss, movedPiece, to_sq(move), bonus);
1226 // For PV nodes only, do a full PV search on the first move or after a fail
1227 // high (in the latter case search only if value < beta), otherwise let the
1228 // parent node fail low with value <= alpha and try another move.
1229 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1232 (ss+1)->pv[0] = MOVE_NONE;
1234 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, false);
1237 // Step 18. Undo move
1238 pos.undo_move(move);
1240 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1242 // Step 19. Check for a new best move
1243 // Finished searching the move. If a stop occurred, the return value of
1244 // the search cannot be trusted, and we return immediately without
1245 // updating best move, PV and TT.
1246 if (Threads.stop.load(std::memory_order_relaxed))
1251 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1252 thisThread->rootMoves.end(), move);
1254 // PV move or new best move?
1255 if (moveCount == 1 || value > alpha)
1258 rm.selDepth = thisThread->selDepth;
1263 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1264 rm.pv.push_back(*m);
1266 // We record how often the best move has been changed in each
1267 // iteration. This information is used for time management: When
1268 // the best move changes frequently, we allocate some more time.
1270 ++thisThread->bestMoveChanges;
1273 // All other moves but the PV are set to the lowest value: this
1274 // is not a problem when sorting because the sort is stable and the
1275 // move position in the list is preserved - just the PV is pushed up.
1276 rm.score = -VALUE_INFINITE;
1279 if (value > bestValue)
1287 if (PvNode && !rootNode) // Update pv even in fail-high case
1288 update_pv(ss->pv, move, (ss+1)->pv);
1290 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1294 assert(value >= beta); // Fail high
1301 if (move != bestMove)
1303 if (captureOrPromotion && captureCount < 32)
1304 capturesSearched[captureCount++] = move;
1306 else if (!captureOrPromotion && quietCount < 64)
1307 quietsSearched[quietCount++] = move;
1311 // The following condition would detect a stop only after move loop has been
1312 // completed. But in this case bestValue is valid because we have fully
1313 // searched our subtree, and we can anyhow save the result in TT.
1319 // Step 20. Check for mate and stalemate
1320 // All legal moves have been searched and if there are no legal moves, it
1321 // must be a mate or a stalemate. If we are in a singular extension search then
1322 // return a fail low score.
1324 assert(moveCount || !inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1327 bestValue = excludedMove ? alpha
1328 : inCheck ? mated_in(ss->ply) : VALUE_DRAW;
1331 update_all_stats(pos, ss, bestMove, bestValue, beta, prevSq,
1332 quietsSearched, quietCount, capturesSearched, captureCount, depth);
1334 // Bonus for prior countermove that caused the fail low
1335 else if ( (depth >= 3 || PvNode)
1337 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth));
1340 bestValue = std::min(bestValue, maxValue);
1342 if (!excludedMove && !(rootNode && thisThread->pvIdx))
1343 tte->save(posKey, value_to_tt(bestValue, ss->ply), ttPv,
1344 bestValue >= beta ? BOUND_LOWER :
1345 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1346 depth, bestMove, ss->staticEval);
1348 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1354 // qsearch() is the quiescence search function, which is called by the main search
1355 // function with zero depth, or recursively with further decreasing depth per call.
1356 template <NodeType NT>
1357 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1359 constexpr bool PvNode = NT == PV;
1361 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1362 assert(PvNode || (alpha == beta - 1));
1369 Move ttMove, move, bestMove;
1371 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1372 bool ttHit, pvHit, inCheck, givesCheck, captureOrPromotion, evasionPrunable;
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 (ss+1)->ply = ss->ply + 1;
1384 bestMove = MOVE_NONE;
1385 inCheck = pos.checkers();
1388 // Check for an immediate draw or maximum ply reached
1389 if ( pos.is_draw(ss->ply)
1390 || ss->ply >= MAX_PLY)
1391 return (ss->ply >= MAX_PLY && !inCheck) ? evaluate(pos) : VALUE_DRAW;
1393 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1395 // Decide whether or not to include checks: this fixes also the type of
1396 // TT entry depth that we are going to use. Note that in qsearch we use
1397 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1398 ttDepth = inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1399 : DEPTH_QS_NO_CHECKS;
1400 // Transposition table lookup
1402 tte = TT.probe(posKey, ttHit);
1403 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;
1404 ttMove = ttHit ? tte->move() : MOVE_NONE;
1405 pvHit = ttHit && tte->is_pv();
1409 && tte->depth() >= ttDepth
1410 && ttValue != VALUE_NONE // Only in case of TT access race
1411 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1412 : (tte->bound() & BOUND_UPPER)))
1415 // Evaluate the position statically
1418 ss->staticEval = VALUE_NONE;
1419 bestValue = futilityBase = -VALUE_INFINITE;
1425 // Never assume anything about values stored in TT
1426 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1427 ss->staticEval = bestValue = evaluate(pos);
1429 // Can ttValue be used as a better position evaluation?
1430 if ( ttValue != VALUE_NONE
1431 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1432 bestValue = ttValue;
1435 ss->staticEval = bestValue =
1436 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1437 : -(ss-1)->staticEval + 2 * Tempo;
1439 // Stand pat. Return immediately if static value is at least beta
1440 if (bestValue >= beta)
1443 tte->save(posKey, value_to_tt(bestValue, ss->ply), false, BOUND_LOWER,
1444 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1449 if (PvNode && bestValue > alpha)
1452 futilityBase = bestValue + 154;
1455 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
1456 nullptr , (ss-4)->continuationHistory,
1457 nullptr , (ss-6)->continuationHistory };
1459 // Initialize a MovePicker object for the current position, and prepare
1460 // to search the moves. Because the depth is <= 0 here, only captures,
1461 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1463 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
1464 &thisThread->captureHistory,
1466 to_sq((ss-1)->currentMove));
1468 // Loop through the moves until no moves remain or a beta cutoff occurs
1469 while ((move = mp.next_move()) != MOVE_NONE)
1471 assert(is_ok(move));
1473 givesCheck = pos.gives_check(move);
1474 captureOrPromotion = pos.capture_or_promotion(move);
1481 && futilityBase > -VALUE_KNOWN_WIN
1482 && !pos.advanced_pawn_push(move))
1484 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1486 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1488 if (futilityValue <= alpha)
1490 bestValue = std::max(bestValue, futilityValue);
1494 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1496 bestValue = std::max(bestValue, futilityBase);
1501 // Detect non-capture evasions that are candidates to be pruned
1502 evasionPrunable = inCheck
1503 && (depth != 0 || moveCount > 2)
1504 && bestValue > VALUE_TB_LOSS_IN_MAX_PLY
1505 && !pos.capture(move);
1507 // Don't search moves with negative SEE values
1508 if ( (!inCheck || evasionPrunable) && !pos.see_ge(move))
1511 // Speculative prefetch as early as possible
1512 prefetch(TT.first_entry(pos.key_after(move)));
1514 // Check for legality just before making the move
1515 if (!pos.legal(move))
1521 ss->currentMove = move;
1522 ss->continuationHistory = &thisThread->continuationHistory[inCheck]
1523 [captureOrPromotion]
1524 [pos.moved_piece(move)]
1527 // Make and search the move
1528 pos.do_move(move, st, givesCheck);
1529 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth - 1);
1530 pos.undo_move(move);
1532 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1534 // Check for a new best move
1535 if (value > bestValue)
1543 if (PvNode) // Update pv even in fail-high case
1544 update_pv(ss->pv, move, (ss+1)->pv);
1546 if (PvNode && value < beta) // Update alpha here!
1554 // All legal moves have been searched. A special case: If we're in check
1555 // and no legal moves were found, it is checkmate.
1556 if (inCheck && bestValue == -VALUE_INFINITE)
1557 return mated_in(ss->ply); // Plies to mate from the root
1559 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1560 bestValue >= beta ? BOUND_LOWER :
1561 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1562 ttDepth, bestMove, ss->staticEval);
1564 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1570 // value_to_tt() adjusts a mate or TB score from "plies to mate from the root" to
1571 // "plies to mate from the current position". standard scores are unchanged.
1572 // The function is called before storing a value in the transposition table.
1574 Value value_to_tt(Value v, int ply) {
1576 assert(v != VALUE_NONE);
1578 return v >= VALUE_TB_WIN_IN_MAX_PLY ? v + ply
1579 : v <= VALUE_TB_LOSS_IN_MAX_PLY ? v - ply : v;
1583 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate or TB score
1584 // from the transposition table (which refers to the plies to mate/be mated
1585 // from current position) to "plies to mate/be mated (TB win/loss) from the root".
1586 // However, for mate scores, to avoid potentially false mate scores related to the 50 moves rule,
1587 // and the graph history interaction, return an optimal TB score instead.
1589 Value value_from_tt(Value v, int ply, int r50c) {
1591 if (v == VALUE_NONE)
1594 if (v >= VALUE_TB_WIN_IN_MAX_PLY) // TB win or better
1596 if (v >= VALUE_MATE_IN_MAX_PLY && VALUE_MATE - v > 99 - r50c)
1597 return VALUE_MATE_IN_MAX_PLY - 1; // do not return a potentially false mate score
1602 if (v <= VALUE_TB_LOSS_IN_MAX_PLY) // TB loss or worse
1604 if (v <= VALUE_MATED_IN_MAX_PLY && VALUE_MATE + v > 99 - r50c)
1605 return VALUE_MATED_IN_MAX_PLY + 1; // do not return a potentially false mate score
1614 // update_pv() adds current move and appends child pv[]
1616 void update_pv(Move* pv, Move move, Move* childPv) {
1618 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1624 // update_all_stats() updates stats at the end of search() when a bestMove is found
1626 void update_all_stats(const Position& pos, Stack* ss, Move bestMove, Value bestValue, Value beta, Square prevSq,
1627 Move* quietsSearched, int quietCount, Move* capturesSearched, int captureCount, Depth depth) {
1630 Color us = pos.side_to_move();
1631 Thread* thisThread = pos.this_thread();
1632 CapturePieceToHistory& captureHistory = thisThread->captureHistory;
1633 Piece moved_piece = pos.moved_piece(bestMove);
1634 PieceType captured = type_of(pos.piece_on(to_sq(bestMove)));
1636 bonus1 = stat_bonus(depth + 1);
1637 bonus2 = bestValue > beta + PawnValueMg ? bonus1 // larger bonus
1638 : stat_bonus(depth); // smaller bonus
1640 if (!pos.capture_or_promotion(bestMove))
1642 update_quiet_stats(pos, ss, bestMove, bonus2, depth);
1644 // Decrease all the non-best quiet moves
1645 for (int i = 0; i < quietCount; ++i)
1647 thisThread->mainHistory[us][from_to(quietsSearched[i])] << -bonus2;
1648 update_continuation_histories(ss, pos.moved_piece(quietsSearched[i]), to_sq(quietsSearched[i]), -bonus2);
1652 captureHistory[moved_piece][to_sq(bestMove)][captured] << bonus1;
1654 // Extra penalty for a quiet TT or main killer move in previous ply when it gets refuted
1655 if ( ((ss-1)->moveCount == 1 || ((ss-1)->currentMove == (ss-1)->killers[0]))
1656 && !pos.captured_piece())
1657 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -bonus1);
1659 // Decrease all the non-best capture moves
1660 for (int i = 0; i < captureCount; ++i)
1662 moved_piece = pos.moved_piece(capturesSearched[i]);
1663 captured = type_of(pos.piece_on(to_sq(capturesSearched[i])));
1664 captureHistory[moved_piece][to_sq(capturesSearched[i])][captured] << -bonus1;
1669 // update_continuation_histories() updates histories of the move pairs formed
1670 // by moves at ply -1, -2, -4, and -6 with current move.
1672 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1674 for (int i : {1, 2, 4, 6})
1675 if (is_ok((ss-i)->currentMove))
1676 (*(ss-i)->continuationHistory)[pc][to] << bonus;
1680 // update_quiet_stats() updates move sorting heuristics
1682 void update_quiet_stats(const Position& pos, Stack* ss, Move move, int bonus, int depth) {
1684 if (ss->killers[0] != move)
1686 ss->killers[1] = ss->killers[0];
1687 ss->killers[0] = move;
1690 Color us = pos.side_to_move();
1691 Thread* thisThread = pos.this_thread();
1692 thisThread->mainHistory[us][from_to(move)] << bonus;
1693 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1695 if (type_of(pos.moved_piece(move)) != PAWN)
1696 thisThread->mainHistory[us][from_to(reverse_move(move))] << -bonus;
1698 if (is_ok((ss-1)->currentMove))
1700 Square prevSq = to_sq((ss-1)->currentMove);
1701 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1704 if (depth > 12 && ss->ply < MAX_LPH)
1705 thisThread->lowPlyHistory[ss->ply][from_to(move)] << stat_bonus(depth - 7);
1708 // When playing with strength handicap, choose best move among a set of RootMoves
1709 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1711 Move Skill::pick_best(size_t multiPV) {
1713 const RootMoves& rootMoves = Threads.main()->rootMoves;
1714 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1716 // RootMoves are already sorted by score in descending order
1717 Value topScore = rootMoves[0].score;
1718 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1719 int weakness = 120 - 2 * level;
1720 int maxScore = -VALUE_INFINITE;
1722 // Choose best move. For each move score we add two terms, both dependent on
1723 // weakness. One is deterministic and bigger for weaker levels, and one is
1724 // random. Then we choose the move with the resulting highest score.
1725 for (size_t i = 0; i < multiPV; ++i)
1727 // This is our magic formula
1728 int push = ( weakness * int(topScore - rootMoves[i].score)
1729 + delta * (rng.rand<unsigned>() % weakness)) / 128;
1731 if (rootMoves[i].score + push >= maxScore)
1733 maxScore = rootMoves[i].score + push;
1734 best = rootMoves[i].pv[0];
1743 /// MainThread::check_time() is used to print debug info and, more importantly,
1744 /// to detect when we are out of available time and thus stop the search.
1746 void MainThread::check_time() {
1751 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1752 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1754 static TimePoint lastInfoTime = now();
1756 TimePoint elapsed = Time.elapsed();
1757 TimePoint tick = Limits.startTime + elapsed;
1759 if (tick - lastInfoTime >= 1000)
1761 lastInfoTime = tick;
1765 // We should not stop pondering until told so by the GUI
1769 if ( (Limits.use_time_management() && (elapsed > Time.maximum() - 10 || stopOnPonderhit))
1770 || (Limits.movetime && elapsed >= Limits.movetime)
1771 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1772 Threads.stop = true;
1776 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1777 /// that all (if any) unsearched PV lines are sent using a previous search score.
1779 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1781 std::stringstream ss;
1782 TimePoint elapsed = Time.elapsed() + 1;
1783 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1784 size_t pvIdx = pos.this_thread()->pvIdx;
1785 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1786 uint64_t nodesSearched = Threads.nodes_searched();
1787 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1789 for (size_t i = 0; i < multiPV; ++i)
1791 bool updated = rootMoves[i].score != -VALUE_INFINITE;
1793 if (depth == 1 && !updated)
1796 Depth d = updated ? depth : depth - 1;
1797 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1799 bool tb = TB::RootInTB && abs(v) < VALUE_MATE_IN_MAX_PLY;
1800 v = tb ? rootMoves[i].tbScore : v;
1802 if (ss.rdbuf()->in_avail()) // Not at first line
1807 << " seldepth " << rootMoves[i].selDepth
1808 << " multipv " << i + 1
1809 << " score " << UCI::value(v);
1811 if (!tb && i == pvIdx)
1812 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1814 ss << " nodes " << nodesSearched
1815 << " nps " << nodesSearched * 1000 / elapsed;
1817 if (elapsed > 1000) // Earlier makes little sense
1818 ss << " hashfull " << TT.hashfull();
1820 ss << " tbhits " << tbHits
1821 << " time " << elapsed
1824 for (Move m : rootMoves[i].pv)
1825 ss << " " << UCI::move(m, pos.is_chess960());
1832 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1833 /// before exiting the search, for instance, in case we stop the search during a
1834 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1835 /// otherwise in case of 'ponder on' we have nothing to think on.
1837 bool RootMove::extract_ponder_from_tt(Position& pos) {
1842 assert(pv.size() == 1);
1844 if (pv[0] == MOVE_NONE)
1847 pos.do_move(pv[0], st);
1848 TTEntry* tte = TT.probe(pos.key(), ttHit);
1852 Move m = tte->move(); // Local copy to be SMP safe
1853 if (MoveList<LEGAL>(pos).contains(m))
1857 pos.undo_move(pv[0]);
1858 return pv.size() > 1;
1861 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1864 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1865 ProbeDepth = int(Options["SyzygyProbeDepth"]);
1866 Cardinality = int(Options["SyzygyProbeLimit"]);
1867 bool dtz_available = true;
1869 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1870 // ProbeDepth == DEPTH_ZERO
1871 if (Cardinality > MaxCardinality)
1873 Cardinality = MaxCardinality;
1877 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1879 // Rank moves using DTZ tables
1880 RootInTB = root_probe(pos, rootMoves);
1884 // DTZ tables are missing; try to rank moves using WDL tables
1885 dtz_available = false;
1886 RootInTB = root_probe_wdl(pos, rootMoves);
1892 // Sort moves according to TB rank
1893 std::sort(rootMoves.begin(), rootMoves.end(),
1894 [](const RootMove &a, const RootMove &b) { return a.tbRank > b.tbRank; } );
1896 // Probe during search only if DTZ is not available and we are winning
1897 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
1902 // Clean up if root_probe() and root_probe_wdl() have failed
1903 for (auto& m : rootMoves)