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-2019 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 // Razor and futility margins
65 constexpr int RazorMargin = 661;
66 Value futility_margin(Depth d, bool improving) {
67 return Value(198 * (d / ONE_PLY - 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 / ONE_PLY] * Reductions[mn];
75 return ((r + 520) / 1024 + (!i && r > 999)) * ONE_PLY;
78 constexpr int futility_move_count(bool improving, int depth) {
79 return (5 + depth * depth) * (1 + improving) / 2;
82 // History and stats update bonus, based on depth
83 int stat_bonus(Depth depth) {
84 int d = depth / ONE_PLY;
85 return d > 17 ? -8 : 22 * d * d + 151 * d - 140;
88 // Add a small random component to draw evaluations to avoid 3fold-blindness
89 Value value_draw(Depth depth, Thread* thisThread) {
90 return depth < 4 * ONE_PLY ? VALUE_DRAW
91 : VALUE_DRAW + Value(2 * (thisThread->nodes & 1) - 1);
94 // Skill structure is used to implement strength limit
96 explicit Skill(int l) : level(l) {}
97 bool enabled() const { return level < 20; }
98 bool time_to_pick(Depth depth) const { return depth / ONE_PLY == 1 + level; }
99 Move pick_best(size_t multiPV);
102 Move best = MOVE_NONE;
105 // Breadcrumbs are used to mark nodes as being searched by a given thread
107 std::atomic<Thread*> thread;
108 std::atomic<Key> key;
110 std::array<Breadcrumb, 1024> breadcrumbs;
112 // ThreadHolding structure keeps track of which thread left breadcrumbs at the given
113 // node for potential reductions. A free node will be marked upon entering the moves
114 // loop by the constructor, and unmarked upon leaving that loop by the destructor.
115 struct ThreadHolding {
116 explicit ThreadHolding(Thread* thisThread, Key posKey, int ply) {
117 location = ply < 8 ? &breadcrumbs[posKey & (breadcrumbs.size() - 1)] : nullptr;
122 // See if another already marked this location, if not, mark it ourselves
123 Thread* tmp = (*location).thread.load(std::memory_order_relaxed);
126 (*location).thread.store(thisThread, std::memory_order_relaxed);
127 (*location).key.store(posKey, std::memory_order_relaxed);
130 else if ( tmp != thisThread
131 && (*location).key.load(std::memory_order_relaxed) == posKey)
137 if (owning) // Free the marked location
138 (*location).thread.store(nullptr, std::memory_order_relaxed);
141 bool marked() { return otherThread; }
144 Breadcrumb* location;
145 bool otherThread, owning;
148 template <NodeType NT>
149 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
151 template <NodeType NT>
152 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = DEPTH_ZERO);
154 Value value_to_tt(Value v, int ply);
155 Value value_from_tt(Value v, int ply);
156 void update_pv(Move* pv, Move move, Move* childPv);
157 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
158 void update_quiet_stats(const Position& pos, Stack* ss, Move move, Move* quiets, int quietCount, int bonus);
159 void update_capture_stats(const Position& pos, Move move, Move* captures, int captureCount, int bonus);
161 // perft() is our utility to verify move generation. All the leaf nodes up
162 // to the given depth are generated and counted, and the sum is returned.
164 uint64_t perft(Position& pos, Depth depth) {
167 uint64_t cnt, nodes = 0;
168 const bool leaf = (depth == 2 * ONE_PLY);
170 for (const auto& m : MoveList<LEGAL>(pos))
172 if (Root && depth <= ONE_PLY)
177 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - ONE_PLY);
182 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
190 /// Search::init() is called at startup to initialize various lookup tables
192 void Search::init() {
194 for (int i = 1; i < MAX_MOVES; ++i)
195 Reductions[i] = int(23.4 * std::log(i));
199 /// Search::clear() resets search state to its initial value
201 void Search::clear() {
203 Threads.main()->wait_for_search_finished();
205 Time.availableNodes = 0;
208 Tablebases::init(Options["SyzygyPath"]); // Free mapped files
212 /// MainThread::search() is started when the program receives the UCI 'go'
213 /// command. It searches from the root position and outputs the "bestmove".
215 void MainThread::search() {
219 nodes = perft<true>(rootPos, Limits.perft * ONE_PLY);
220 sync_cout << "\nNodes searched: " << nodes << "\n" << sync_endl;
224 Color us = rootPos.side_to_move();
225 Time.init(Limits, us, rootPos.game_ply());
228 if (rootMoves.empty())
230 rootMoves.emplace_back(MOVE_NONE);
231 sync_cout << "info depth 0 score "
232 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
237 for (Thread* th : Threads)
239 th->bestMoveChanges = 0;
241 th->start_searching();
244 Thread::search(); // Let's start searching!
247 // When we reach the maximum depth, we can arrive here without a raise of
248 // Threads.stop. However, if we are pondering or in an infinite search,
249 // the UCI protocol states that we shouldn't print the best move before the
250 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
251 // until the GUI sends one of those commands.
253 while (!Threads.stop && (ponder || Limits.infinite))
254 {} // Busy wait for a stop or a ponder reset
256 // Stop the threads if not already stopped (also raise the stop if
257 // "ponderhit" just reset Threads.ponder).
260 // Wait until all threads have finished
261 for (Thread* th : Threads)
263 th->wait_for_search_finished();
265 // When playing in 'nodes as time' mode, subtract the searched nodes from
266 // the available ones before exiting.
268 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
270 Thread* bestThread = this;
272 // Check if there are threads with a better score than main thread
273 if ( Options["MultiPV"] == 1
275 && !(Skill(Options["Skill Level"]).enabled() || Options["UCI_LimitStrength"])
276 && rootMoves[0].pv[0] != MOVE_NONE)
278 std::map<Move, int64_t> votes;
279 Value minScore = this->rootMoves[0].score;
281 // Find out minimum score
282 for (Thread* th: Threads)
283 minScore = std::min(minScore, th->rootMoves[0].score);
285 // Vote according to score and depth, and select the best thread
286 for (Thread* th : Threads)
288 votes[th->rootMoves[0].pv[0]] +=
289 (th->rootMoves[0].score - minScore + 14) * int(th->completedDepth);
291 if (bestThread->rootMoves[0].score >= VALUE_MATE_IN_MAX_PLY)
293 // Make sure we pick the shortest mate
294 if (th->rootMoves[0].score > bestThread->rootMoves[0].score)
297 else if ( th->rootMoves[0].score >= VALUE_MATE_IN_MAX_PLY
298 || votes[th->rootMoves[0].pv[0]] > votes[bestThread->rootMoves[0].pv[0]])
303 previousScore = bestThread->rootMoves[0].score;
305 // Send again PV info if we have a new best thread
306 if (bestThread != this)
307 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth, -VALUE_INFINITE, VALUE_INFINITE) << sync_endl;
309 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
311 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
312 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
314 std::cout << sync_endl;
318 /// Thread::search() is the main iterative deepening loop. It calls search()
319 /// repeatedly with increasing depth until the allocated thinking time has been
320 /// consumed, the user stops the search, or the maximum search depth is reached.
322 void Thread::search() {
324 // To allow access to (ss-7) up to (ss+2), the stack must be oversized.
325 // The former is needed to allow update_continuation_histories(ss-1, ...),
326 // which accesses its argument at ss-6, also near the root.
327 // The latter is needed for statScores and killer initialization.
328 Stack stack[MAX_PLY+10], *ss = stack+7;
330 Value bestValue, alpha, beta, delta;
331 Move lastBestMove = MOVE_NONE;
332 Depth lastBestMoveDepth = DEPTH_ZERO;
333 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
334 double timeReduction = 1, totBestMoveChanges = 0;
335 Color us = rootPos.side_to_move();
337 std::memset(ss-7, 0, 10 * sizeof(Stack));
338 for (int i = 7; i > 0; i--)
339 (ss-i)->continuationHistory = &this->continuationHistory[NO_PIECE][0]; // Use as sentinel
342 bestValue = delta = alpha = -VALUE_INFINITE;
343 beta = VALUE_INFINITE;
345 size_t multiPV = Options["MultiPV"];
347 // Pick integer skill levels, but non-deterministically round up or down
348 // such that the average integer skill corresponds to the input floating point one.
349 // UCI_Elo is converted to a suitable fractional skill level, using anchoring
350 // to CCRL Elo (goldfish 1.13 = 2000) and a fit through Ordo derived Elo
351 // for match (TC 60+0.6) results spanning a wide range of k values.
353 double floatLevel = Options["UCI_LimitStrength"] ?
354 clamp(std::pow((Options["UCI_Elo"] - 1346.6) / 143.4, 1 / 0.806), 0.0, 20.0) :
355 double(Options["Skill Level"]);
356 int intLevel = int(floatLevel) +
357 ((floatLevel - int(floatLevel)) * 1024 > rng.rand<unsigned>() % 1024 ? 1 : 0);
358 Skill skill(intLevel);
360 // When playing with strength handicap enable MultiPV search that we will
361 // use behind the scenes to retrieve a set of possible moves.
363 multiPV = std::max(multiPV, (size_t)4);
365 multiPV = std::min(multiPV, rootMoves.size());
367 int ct = int(Options["Contempt"]) * PawnValueEg / 100; // From centipawns
369 // In analysis mode, adjust contempt in accordance with user preference
370 if (Limits.infinite || Options["UCI_AnalyseMode"])
371 ct = Options["Analysis Contempt"] == "Off" ? 0
372 : Options["Analysis Contempt"] == "Both" ? ct
373 : Options["Analysis Contempt"] == "White" && us == BLACK ? -ct
374 : Options["Analysis Contempt"] == "Black" && us == WHITE ? -ct
377 // Evaluation score is from the white point of view
378 contempt = (us == WHITE ? make_score(ct, ct / 2)
379 : -make_score(ct, ct / 2));
381 // Iterative deepening loop until requested to stop or the target depth is reached
382 while ( (rootDepth += ONE_PLY) < DEPTH_MAX
384 && !(Limits.depth && mainThread && rootDepth / ONE_PLY > Limits.depth))
386 // Age out PV variability metric
388 totBestMoveChanges /= 2;
390 // Save the last iteration's scores before first PV line is searched and
391 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
392 for (RootMove& rm : rootMoves)
393 rm.previousScore = rm.score;
398 // MultiPV loop. We perform a full root search for each PV line
399 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
404 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
405 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
409 // Reset UCI info selDepth for each depth and each PV line
412 // Reset aspiration window starting size
413 if (rootDepth >= 4 * ONE_PLY)
415 Value previousScore = rootMoves[pvIdx].previousScore;
417 alpha = std::max(previousScore - delta,-VALUE_INFINITE);
418 beta = std::min(previousScore + delta, VALUE_INFINITE);
420 // Adjust contempt based on root move's previousScore (dynamic contempt)
421 int dct = ct + 86 * previousScore / (abs(previousScore) + 176);
423 contempt = (us == WHITE ? make_score(dct, dct / 2)
424 : -make_score(dct, dct / 2));
427 // Start with a small aspiration window and, in the case of a fail
428 // high/low, re-search with a bigger window until we don't fail
430 int failedHighCnt = 0;
433 Depth adjustedDepth = std::max(ONE_PLY, rootDepth - failedHighCnt * ONE_PLY);
434 bestValue = ::search<PV>(rootPos, ss, alpha, beta, adjustedDepth, false);
436 // Bring the best move to the front. It is critical that sorting
437 // is done with a stable algorithm because all the values but the
438 // first and eventually the new best one are set to -VALUE_INFINITE
439 // and we want to keep the same order for all the moves except the
440 // new PV that goes to the front. Note that in case of MultiPV
441 // search the already searched PV lines are preserved.
442 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
444 // If search has been stopped, we break immediately. Sorting is
445 // safe because RootMoves is still valid, although it refers to
446 // the previous iteration.
450 // When failing high/low give some update (without cluttering
451 // the UI) before a re-search.
454 && (bestValue <= alpha || bestValue >= beta)
455 && Time.elapsed() > 3000)
456 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
458 // In case of failing low/high increase aspiration window and
459 // re-search, otherwise exit the loop.
460 if (bestValue <= alpha)
462 beta = (alpha + beta) / 2;
463 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
467 mainThread->stopOnPonderhit = false;
469 else if (bestValue >= beta)
471 beta = std::min(bestValue + delta, VALUE_INFINITE);
476 ++rootMoves[pvIdx].bestMoveCount;
480 delta += delta / 4 + 5;
482 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
485 // Sort the PV lines searched so far and update the GUI
486 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
489 && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
490 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
494 completedDepth = rootDepth;
496 if (rootMoves[0].pv[0] != lastBestMove) {
497 lastBestMove = rootMoves[0].pv[0];
498 lastBestMoveDepth = rootDepth;
501 // Have we found a "mate in x"?
503 && bestValue >= VALUE_MATE_IN_MAX_PLY
504 && VALUE_MATE - bestValue <= 2 * Limits.mate)
510 // If skill level is enabled and time is up, pick a sub-optimal best move
511 if (skill.enabled() && skill.time_to_pick(rootDepth))
512 skill.pick_best(multiPV);
514 // Do we have time for the next iteration? Can we stop searching now?
515 if ( Limits.use_time_management()
517 && !mainThread->stopOnPonderhit)
519 double fallingEval = (354 + 10 * (mainThread->previousScore - bestValue)) / 692.0;
520 fallingEval = clamp(fallingEval, 0.5, 1.5);
522 // If the bestMove is stable over several iterations, reduce time accordingly
523 timeReduction = lastBestMoveDepth + 9 * ONE_PLY < completedDepth ? 1.97 : 0.98;
524 double reduction = (1.36 + mainThread->previousTimeReduction) / (2.29 * timeReduction);
526 // Use part of the gained time from a previous stable move for the current move
527 for (Thread* th : Threads)
529 totBestMoveChanges += th->bestMoveChanges;
530 th->bestMoveChanges = 0;
532 double bestMoveInstability = 1 + totBestMoveChanges / Threads.size();
534 // Stop the search if we have only one legal move, or if available time elapsed
535 if ( rootMoves.size() == 1
536 || Time.elapsed() > Time.optimum() * fallingEval * reduction * bestMoveInstability)
538 // If we are allowed to ponder do not stop the search now but
539 // keep pondering until the GUI sends "ponderhit" or "stop".
540 if (mainThread->ponder)
541 mainThread->stopOnPonderhit = true;
551 mainThread->previousTimeReduction = timeReduction;
553 // If skill level is enabled, swap best PV line with the sub-optimal one
555 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
556 skill.best ? skill.best : skill.pick_best(multiPV)));
562 // search<>() is the main search function for both PV and non-PV nodes
564 template <NodeType NT>
565 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
567 constexpr bool PvNode = NT == PV;
568 const bool rootNode = PvNode && ss->ply == 0;
570 // Check if we have an upcoming move which draws by repetition, or
571 // if the opponent had an alternative move earlier to this position.
572 if ( pos.rule50_count() >= 3
573 && alpha < VALUE_DRAW
575 && pos.has_game_cycle(ss->ply))
577 alpha = value_draw(depth, pos.this_thread());
582 // Dive into quiescence search when the depth reaches zero
584 return qsearch<NT>(pos, ss, alpha, beta);
586 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
587 assert(PvNode || (alpha == beta - 1));
588 assert(DEPTH_ZERO < depth && depth < DEPTH_MAX);
589 assert(!(PvNode && cutNode));
590 assert(depth / ONE_PLY * ONE_PLY == depth);
592 Move pv[MAX_PLY+1], capturesSearched[32], quietsSearched[64];
596 Move ttMove, move, excludedMove, bestMove;
597 Depth extension, newDepth;
598 Value bestValue, value, ttValue, eval, maxValue;
599 bool ttHit, ttPv, inCheck, givesCheck, improving, doLMR;
600 bool captureOrPromotion, doFullDepthSearch, moveCountPruning, ttCapture;
602 int moveCount, captureCount, quietCount, singularLMR;
604 // Step 1. Initialize node
605 Thread* thisThread = pos.this_thread();
606 inCheck = pos.checkers();
607 Color us = pos.side_to_move();
608 moveCount = captureCount = quietCount = singularLMR = ss->moveCount = 0;
609 bestValue = -VALUE_INFINITE;
610 maxValue = VALUE_INFINITE;
612 // Check for the available remaining time
613 if (thisThread == Threads.main())
614 static_cast<MainThread*>(thisThread)->check_time();
616 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
617 if (PvNode && thisThread->selDepth < ss->ply + 1)
618 thisThread->selDepth = ss->ply + 1;
622 // Step 2. Check for aborted search and immediate draw
623 if ( Threads.stop.load(std::memory_order_relaxed)
624 || pos.is_draw(ss->ply)
625 || ss->ply >= MAX_PLY)
626 return (ss->ply >= MAX_PLY && !inCheck) ? evaluate(pos)
627 : value_draw(depth, pos.this_thread());
629 // Step 3. Mate distance pruning. Even if we mate at the next move our score
630 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
631 // a shorter mate was found upward in the tree then there is no need to search
632 // because we will never beat the current alpha. Same logic but with reversed
633 // signs applies also in the opposite condition of being mated instead of giving
634 // mate. In this case return a fail-high score.
635 alpha = std::max(mated_in(ss->ply), alpha);
636 beta = std::min(mate_in(ss->ply+1), beta);
641 assert(0 <= ss->ply && ss->ply < MAX_PLY);
643 (ss+1)->ply = ss->ply + 1;
644 (ss+1)->excludedMove = bestMove = MOVE_NONE;
645 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
646 Square prevSq = to_sq((ss-1)->currentMove);
648 // Initialize statScore to zero for the grandchildren of the current position.
649 // So statScore is shared between all grandchildren and only the first grandchild
650 // starts with statScore = 0. Later grandchildren start with the last calculated
651 // statScore of the previous grandchild. This influences the reduction rules in
652 // LMR which are based on the statScore of parent position.
654 (ss+4)->statScore = 0;
656 (ss+2)->statScore = 0;
658 // Step 4. Transposition table lookup. We don't want the score of a partial
659 // search to overwrite a previous full search TT value, so we use a different
660 // position key in case of an excluded move.
661 excludedMove = ss->excludedMove;
662 posKey = pos.key() ^ Key(excludedMove << 16); // Isn't a very good hash
663 tte = TT.probe(posKey, ttHit);
664 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
665 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
666 : ttHit ? tte->move() : MOVE_NONE;
667 ttPv = PvNode || (ttHit && tte->is_pv());
669 // At non-PV nodes we check for an early TT cutoff
672 && tte->depth() >= depth
673 && ttValue != VALUE_NONE // Possible in case of TT access race
674 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
675 : (tte->bound() & BOUND_UPPER)))
677 // If ttMove is quiet, update move sorting heuristics on TT hit
682 if (!pos.capture_or_promotion(ttMove))
683 update_quiet_stats(pos, ss, ttMove, nullptr, 0, stat_bonus(depth));
685 // Extra penalty for early quiet moves of the previous ply
686 if ((ss-1)->moveCount <= 2 && !pos.captured_piece())
687 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + ONE_PLY));
689 // Penalty for a quiet ttMove that fails low
690 else if (!pos.capture_or_promotion(ttMove))
692 int penalty = -stat_bonus(depth);
693 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
694 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
700 // Step 5. Tablebases probe
701 if (!rootNode && TB::Cardinality)
703 int piecesCount = pos.count<ALL_PIECES>();
705 if ( piecesCount <= TB::Cardinality
706 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
707 && pos.rule50_count() == 0
708 && !pos.can_castle(ANY_CASTLING))
711 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
713 // Force check of time on the next occasion
714 if (thisThread == Threads.main())
715 static_cast<MainThread*>(thisThread)->callsCnt = 0;
717 if (err != TB::ProbeState::FAIL)
719 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
721 int drawScore = TB::UseRule50 ? 1 : 0;
723 value = wdl < -drawScore ? -VALUE_MATE + MAX_PLY + ss->ply + 1
724 : wdl > drawScore ? VALUE_MATE - MAX_PLY - ss->ply - 1
725 : VALUE_DRAW + 2 * wdl * drawScore;
727 Bound b = wdl < -drawScore ? BOUND_UPPER
728 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
730 if ( b == BOUND_EXACT
731 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
733 tte->save(posKey, value_to_tt(value, ss->ply), ttPv, b,
734 std::min(DEPTH_MAX - ONE_PLY, depth + 6 * ONE_PLY),
735 MOVE_NONE, VALUE_NONE);
742 if (b == BOUND_LOWER)
743 bestValue = value, alpha = std::max(alpha, bestValue);
751 // Step 6. Static evaluation of the position
754 ss->staticEval = eval = VALUE_NONE;
756 goto moves_loop; // Skip early pruning when in check
760 // Never assume anything about values stored in TT
761 ss->staticEval = eval = tte->eval();
762 if (eval == VALUE_NONE)
763 ss->staticEval = eval = evaluate(pos);
765 // Can ttValue be used as a better position evaluation?
766 if ( ttValue != VALUE_NONE
767 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
772 if ((ss-1)->currentMove != MOVE_NULL)
774 int bonus = -(ss-1)->statScore / 512;
776 ss->staticEval = eval = evaluate(pos) + bonus;
779 ss->staticEval = eval = -(ss-1)->staticEval + 2 * Eval::Tempo;
781 tte->save(posKey, VALUE_NONE, ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, eval);
784 // Step 7. Razoring (~2 Elo)
785 if ( !rootNode // The required rootNode PV handling is not available in qsearch
786 && depth < 2 * ONE_PLY
787 && eval <= alpha - RazorMargin)
788 return qsearch<NT>(pos, ss, alpha, beta);
790 improving = ss->staticEval >= (ss-2)->staticEval
791 || (ss-2)->staticEval == VALUE_NONE;
793 // Step 8. Futility pruning: child node (~30 Elo)
795 && depth < 7 * ONE_PLY
796 && eval - futility_margin(depth, improving) >= beta
797 && eval < VALUE_KNOWN_WIN) // Do not return unproven wins
800 // Step 9. Null move search with verification search (~40 Elo)
802 && (ss-1)->currentMove != MOVE_NULL
803 && (ss-1)->statScore < 22661
805 && eval >= ss->staticEval
806 && ss->staticEval >= beta - 33 * depth / ONE_PLY + 299 - improving * 30
808 && pos.non_pawn_material(us)
809 && (ss->ply >= thisThread->nmpMinPly || us != thisThread->nmpColor))
811 assert(eval - beta >= 0);
813 // Null move dynamic reduction based on depth and value
814 Depth R = ((835 + 70 * depth / ONE_PLY) / 256 + std::min(int(eval - beta) / 185, 3)) * ONE_PLY;
816 ss->currentMove = MOVE_NULL;
817 ss->continuationHistory = &thisThread->continuationHistory[NO_PIECE][0];
819 pos.do_null_move(st);
821 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
823 pos.undo_null_move();
825 if (nullValue >= beta)
827 // Do not return unproven mate scores
828 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
831 if (thisThread->nmpMinPly || (abs(beta) < VALUE_KNOWN_WIN && depth < 13 * ONE_PLY))
834 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
836 // Do verification search at high depths, with null move pruning disabled
837 // for us, until ply exceeds nmpMinPly.
838 thisThread->nmpMinPly = ss->ply + 3 * (depth-R) / (4 * ONE_PLY);
839 thisThread->nmpColor = us;
841 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
843 thisThread->nmpMinPly = 0;
850 // Step 10. ProbCut (~10 Elo)
851 // If we have a good enough capture and a reduced search returns a value
852 // much above beta, we can (almost) safely prune the previous move.
854 && depth >= 5 * ONE_PLY
855 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
857 Value raisedBeta = std::min(beta + 191 - 46 * improving, VALUE_INFINITE);
858 MovePicker mp(pos, ttMove, raisedBeta - ss->staticEval, &thisThread->captureHistory);
859 int probCutCount = 0;
861 while ( (move = mp.next_move()) != MOVE_NONE
862 && probCutCount < 2 + 2 * cutNode)
863 if (move != excludedMove && pos.legal(move))
867 ss->currentMove = move;
868 ss->continuationHistory = &thisThread->continuationHistory[pos.moved_piece(move)][to_sq(move)];
870 assert(depth >= 5 * ONE_PLY);
872 pos.do_move(move, st);
874 // Perform a preliminary qsearch to verify that the move holds
875 value = -qsearch<NonPV>(pos, ss+1, -raisedBeta, -raisedBeta+1);
877 // If the qsearch held, perform the regular search
878 if (value >= raisedBeta)
879 value = -search<NonPV>(pos, ss+1, -raisedBeta, -raisedBeta+1, depth - 4 * ONE_PLY, !cutNode);
883 if (value >= raisedBeta)
888 // Step 11. Internal iterative deepening (~2 Elo)
889 if (depth >= 7 * ONE_PLY && !ttMove)
891 search<NT>(pos, ss, alpha, beta, depth - 7 * ONE_PLY, cutNode);
893 tte = TT.probe(posKey, ttHit);
894 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
895 ttMove = ttHit ? tte->move() : MOVE_NONE;
898 moves_loop: // When in check, search starts from here
900 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
901 nullptr, (ss-4)->continuationHistory,
902 nullptr, (ss-6)->continuationHistory };
904 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
906 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
907 &thisThread->captureHistory,
912 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
913 moveCountPruning = false;
914 ttCapture = ttMove && pos.capture_or_promotion(ttMove);
916 // Mark this node as being searched
917 ThreadHolding th(thisThread, posKey, ss->ply);
919 // Step 12. Loop through all pseudo-legal moves until no moves remain
920 // or a beta cutoff occurs.
921 while ((move = mp.next_move(moveCountPruning)) != MOVE_NONE)
925 if (move == excludedMove)
928 // At root obey the "searchmoves" option and skip moves not listed in Root
929 // Move List. As a consequence any illegal move is also skipped. In MultiPV
930 // mode we also skip PV moves which have been already searched and those
931 // of lower "TB rank" if we are in a TB root position.
932 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
933 thisThread->rootMoves.begin() + thisThread->pvLast, move))
936 ss->moveCount = ++moveCount;
938 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
939 sync_cout << "info depth " << depth / ONE_PLY
940 << " currmove " << UCI::move(move, pos.is_chess960())
941 << " currmovenumber " << moveCount + thisThread->pvIdx << sync_endl;
943 (ss+1)->pv = nullptr;
945 extension = DEPTH_ZERO;
946 captureOrPromotion = pos.capture_or_promotion(move);
947 movedPiece = pos.moved_piece(move);
948 givesCheck = pos.gives_check(move);
950 // Step 13. Extensions (~70 Elo)
952 // Singular extension search (~60 Elo). If all moves but one fail low on a
953 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
954 // then that move is singular and should be extended. To verify this we do
955 // a reduced search on all the other moves but the ttMove and if the
956 // result is lower than ttValue minus a margin then we will extend the ttMove.
957 if ( depth >= 6 * ONE_PLY
960 && !excludedMove // Avoid recursive singular search
961 /* && ttValue != VALUE_NONE Already implicit in the next condition */
962 && abs(ttValue) < VALUE_KNOWN_WIN
963 && (tte->bound() & BOUND_LOWER)
964 && tte->depth() >= depth - 3 * ONE_PLY
967 Value singularBeta = ttValue - 2 * depth / ONE_PLY;
968 Depth halfDepth = depth / (2 * ONE_PLY) * ONE_PLY; // ONE_PLY invariant
969 ss->excludedMove = move;
970 value = search<NonPV>(pos, ss, singularBeta - 1, singularBeta, halfDepth, cutNode);
971 ss->excludedMove = MOVE_NONE;
973 if (value < singularBeta)
978 if (value < singularBeta - std::min(4 * depth / ONE_PLY, 36))
983 // Our ttMove is assumed to fail high, and now we failed high also on a reduced
984 // search without the ttMove. So we assume this expected Cut-node is not singular,
985 // that multiple moves fail high, and we can prune the whole subtree by returning
987 else if ( eval >= beta
988 && singularBeta >= beta)
992 // Check extension (~2 Elo)
994 && (pos.is_discovery_check_on_king(~us, move) || pos.see_ge(move)))
997 // Castling extension
998 else if (type_of(move) == CASTLING)
1001 // Shuffle extension
1003 && pos.rule50_count() > 18
1004 && depth < 3 * ONE_PLY
1005 && ++thisThread->shuffleExts < thisThread->nodes.load(std::memory_order_relaxed) / 4) // To avoid too many extensions
1006 extension = ONE_PLY;
1008 // Passed pawn extension
1009 else if ( move == ss->killers[0]
1010 && pos.advanced_pawn_push(move)
1011 && pos.pawn_passed(us, to_sq(move)))
1012 extension = ONE_PLY;
1014 // Calculate new depth for this move
1015 newDepth = depth - ONE_PLY + extension;
1017 // Step 14. Pruning at shallow depth (~170 Elo)
1019 && pos.non_pawn_material(us)
1020 && bestValue > VALUE_MATED_IN_MAX_PLY)
1022 // Skip quiet moves if movecount exceeds our FutilityMoveCount threshold
1023 moveCountPruning = moveCount >= futility_move_count(improving, depth / ONE_PLY);
1025 if ( !captureOrPromotion
1027 && (!pos.advanced_pawn_push(move) || pos.non_pawn_material(~us) > BishopValueMg))
1029 // Move count based pruning
1030 if (moveCountPruning)
1033 // Reduced depth of the next LMR search
1034 int lmrDepth = std::max(newDepth - reduction(improving, depth, moveCount), DEPTH_ZERO);
1035 lmrDepth /= ONE_PLY;
1037 // Countermoves based pruning (~20 Elo)
1038 if ( lmrDepth < 4 + ((ss-1)->statScore > 0 || (ss-1)->moveCount == 1)
1039 && (*contHist[0])[movedPiece][to_sq(move)] < CounterMovePruneThreshold
1040 && (*contHist[1])[movedPiece][to_sq(move)] < CounterMovePruneThreshold)
1043 // Futility pruning: parent node (~2 Elo)
1046 && ss->staticEval + 250 + 211 * lmrDepth <= alpha)
1049 // Prune moves with negative SEE (~10 Elo)
1050 if (!pos.see_ge(move, Value(-(31 - std::min(lmrDepth, 18)) * lmrDepth * lmrDepth)))
1053 else if ( (!givesCheck || !extension)
1054 && !pos.see_ge(move, Value(-199) * (depth / ONE_PLY))) // (~20 Elo)
1058 // Speculative prefetch as early as possible
1059 prefetch(TT.first_entry(pos.key_after(move)));
1061 // Check for legality just before making the move
1062 if (!rootNode && !pos.legal(move))
1064 ss->moveCount = --moveCount;
1068 // Update the current move (this must be done after singular extension search)
1069 ss->currentMove = move;
1070 ss->continuationHistory = &thisThread->continuationHistory[movedPiece][to_sq(move)];
1072 // Step 15. Make the move
1073 pos.do_move(move, st, givesCheck);
1075 // Step 16. Reduced depth search (LMR). If the move fails high it will be
1076 // re-searched at full depth.
1077 if ( depth >= 3 * ONE_PLY
1078 && moveCount > 1 + 2 * rootNode
1079 && (!rootNode || thisThread->best_move_count(move) == 0)
1080 && ( !captureOrPromotion
1082 || ss->staticEval + PieceValue[EG][pos.captured_piece()] <= alpha
1085 Depth r = reduction(improving, depth, moveCount);
1087 // Reduction if other threads are searching this position.
1091 // Decrease reduction if position is or has been on the PV
1095 // Decrease reduction if opponent's move count is high (~10 Elo)
1096 if ((ss-1)->moveCount > 15)
1099 // Decrease reduction if move has been singularly extended
1100 r -= singularLMR * ONE_PLY;
1102 if (!captureOrPromotion)
1104 // Increase reduction if ttMove is a capture (~0 Elo)
1108 // Increase reduction for cut nodes (~5 Elo)
1112 // Decrease reduction for moves that escape a capture. Filter out
1113 // castling moves, because they are coded as "king captures rook" and
1114 // hence break make_move(). (~5 Elo)
1115 else if ( type_of(move) == NORMAL
1116 && !pos.see_ge(make_move(to_sq(move), from_sq(move))))
1119 ss->statScore = thisThread->mainHistory[us][from_to(move)]
1120 + (*contHist[0])[movedPiece][to_sq(move)]
1121 + (*contHist[1])[movedPiece][to_sq(move)]
1122 + (*contHist[3])[movedPiece][to_sq(move)]
1125 // Reset statScore to zero if negative and most stats shows >= 0
1126 if ( ss->statScore < 0
1127 && (*contHist[0])[movedPiece][to_sq(move)] >= 0
1128 && (*contHist[1])[movedPiece][to_sq(move)] >= 0
1129 && thisThread->mainHistory[us][from_to(move)] >= 0)
1132 // Decrease/increase reduction by comparing opponent's stat score (~10 Elo)
1133 if (ss->statScore >= -99 && (ss-1)->statScore < -116)
1136 else if ((ss-1)->statScore >= -117 && ss->statScore < -144)
1139 // Decrease/increase reduction for moves with a good/bad history (~30 Elo)
1140 r -= ss->statScore / 16384 * ONE_PLY;
1143 Depth d = clamp(newDepth - r, ONE_PLY, newDepth);
1145 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1147 doFullDepthSearch = (value > alpha && d != newDepth), doLMR = true;
1150 doFullDepthSearch = !PvNode || moveCount > 1, doLMR = false;
1152 // Step 17. Full depth search when LMR is skipped or fails high
1153 if (doFullDepthSearch)
1155 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1157 if (doLMR && !captureOrPromotion)
1159 int bonus = value > alpha ? stat_bonus(newDepth)
1160 : -stat_bonus(newDepth);
1162 if (move == ss->killers[0])
1165 update_continuation_histories(ss, movedPiece, to_sq(move), bonus);
1169 // For PV nodes only, do a full PV search on the first move or after a fail
1170 // high (in the latter case search only if value < beta), otherwise let the
1171 // parent node fail low with value <= alpha and try another move.
1172 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1175 (ss+1)->pv[0] = MOVE_NONE;
1177 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, false);
1180 // Step 18. Undo move
1181 pos.undo_move(move);
1183 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1185 // Step 19. Check for a new best move
1186 // Finished searching the move. If a stop occurred, the return value of
1187 // the search cannot be trusted, and we return immediately without
1188 // updating best move, PV and TT.
1189 if (Threads.stop.load(std::memory_order_relaxed))
1194 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1195 thisThread->rootMoves.end(), move);
1197 // PV move or new best move?
1198 if (moveCount == 1 || value > alpha)
1201 rm.selDepth = thisThread->selDepth;
1206 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1207 rm.pv.push_back(*m);
1209 // We record how often the best move has been changed in each
1210 // iteration. This information is used for time management: When
1211 // the best move changes frequently, we allocate some more time.
1213 ++thisThread->bestMoveChanges;
1216 // All other moves but the PV are set to the lowest value: this
1217 // is not a problem when sorting because the sort is stable and the
1218 // move position in the list is preserved - just the PV is pushed up.
1219 rm.score = -VALUE_INFINITE;
1222 if (value > bestValue)
1230 if (PvNode && !rootNode) // Update pv even in fail-high case
1231 update_pv(ss->pv, move, (ss+1)->pv);
1233 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1237 assert(value >= beta); // Fail high
1244 if (move != bestMove)
1246 if (captureOrPromotion && captureCount < 32)
1247 capturesSearched[captureCount++] = move;
1249 else if (!captureOrPromotion && quietCount < 64)
1250 quietsSearched[quietCount++] = move;
1254 // The following condition would detect a stop only after move loop has been
1255 // completed. But in this case bestValue is valid because we have fully
1256 // searched our subtree, and we can anyhow save the result in TT.
1262 // Step 20. Check for mate and stalemate
1263 // All legal moves have been searched and if there are no legal moves, it
1264 // must be a mate or a stalemate. If we are in a singular extension search then
1265 // return a fail low score.
1267 assert(moveCount || !inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1270 bestValue = excludedMove ? alpha
1271 : inCheck ? mated_in(ss->ply) : VALUE_DRAW;
1274 // Quiet best move: update move sorting heuristics
1275 if (!pos.capture_or_promotion(bestMove))
1276 update_quiet_stats(pos, ss, bestMove, quietsSearched, quietCount,
1277 stat_bonus(depth + (bestValue > beta + PawnValueMg ? ONE_PLY : DEPTH_ZERO)));
1279 update_capture_stats(pos, bestMove, capturesSearched, captureCount, stat_bonus(depth + ONE_PLY));
1281 // Extra penalty for a quiet TT or main killer move in previous ply when it gets refuted
1282 if ( ((ss-1)->moveCount == 1 || ((ss-1)->currentMove == (ss-1)->killers[0]))
1283 && !pos.captured_piece())
1284 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + ONE_PLY));
1287 // Bonus for prior countermove that caused the fail low
1288 else if ( (depth >= 3 * ONE_PLY || PvNode)
1289 && !pos.captured_piece())
1290 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth));
1293 bestValue = std::min(bestValue, maxValue);
1296 tte->save(posKey, value_to_tt(bestValue, ss->ply), ttPv,
1297 bestValue >= beta ? BOUND_LOWER :
1298 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1299 depth, bestMove, ss->staticEval);
1301 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1307 // qsearch() is the quiescence search function, which is called by the main search
1308 // function with zero depth, or recursively with further decreasing depth per call.
1309 template <NodeType NT>
1310 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1312 constexpr bool PvNode = NT == PV;
1314 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1315 assert(PvNode || (alpha == beta - 1));
1316 assert(depth <= DEPTH_ZERO);
1317 assert(depth / ONE_PLY * ONE_PLY == depth);
1323 Move ttMove, move, bestMove;
1325 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1326 bool ttHit, pvHit, inCheck, givesCheck, evasionPrunable;
1331 oldAlpha = alpha; // To flag BOUND_EXACT when eval above alpha and no available moves
1333 ss->pv[0] = MOVE_NONE;
1336 Thread* thisThread = pos.this_thread();
1337 (ss+1)->ply = ss->ply + 1;
1338 bestMove = MOVE_NONE;
1339 inCheck = pos.checkers();
1342 // Check for an immediate draw or maximum ply reached
1343 if ( pos.is_draw(ss->ply)
1344 || ss->ply >= MAX_PLY)
1345 return (ss->ply >= MAX_PLY && !inCheck) ? evaluate(pos) : VALUE_DRAW;
1347 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1349 // Decide whether or not to include checks: this fixes also the type of
1350 // TT entry depth that we are going to use. Note that in qsearch we use
1351 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1352 ttDepth = inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1353 : DEPTH_QS_NO_CHECKS;
1354 // Transposition table lookup
1356 tte = TT.probe(posKey, ttHit);
1357 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
1358 ttMove = ttHit ? tte->move() : MOVE_NONE;
1359 pvHit = ttHit && tte->is_pv();
1363 && tte->depth() >= ttDepth
1364 && ttValue != VALUE_NONE // Only in case of TT access race
1365 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1366 : (tte->bound() & BOUND_UPPER)))
1369 // Evaluate the position statically
1372 ss->staticEval = VALUE_NONE;
1373 bestValue = futilityBase = -VALUE_INFINITE;
1379 // Never assume anything about values stored in TT
1380 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1381 ss->staticEval = bestValue = evaluate(pos);
1383 // Can ttValue be used as a better position evaluation?
1384 if ( ttValue != VALUE_NONE
1385 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1386 bestValue = ttValue;
1389 ss->staticEval = bestValue =
1390 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1391 : -(ss-1)->staticEval + 2 * Eval::Tempo;
1393 // Stand pat. Return immediately if static value is at least beta
1394 if (bestValue >= beta)
1397 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit, BOUND_LOWER,
1398 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1403 if (PvNode && bestValue > alpha)
1406 futilityBase = bestValue + 153;
1409 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
1410 nullptr, (ss-4)->continuationHistory,
1411 nullptr, (ss-6)->continuationHistory };
1413 // Initialize a MovePicker object for the current position, and prepare
1414 // to search the moves. Because the depth is <= 0 here, only captures,
1415 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1417 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
1418 &thisThread->captureHistory,
1420 to_sq((ss-1)->currentMove));
1422 // Loop through the moves until no moves remain or a beta cutoff occurs
1423 while ((move = mp.next_move()) != MOVE_NONE)
1425 assert(is_ok(move));
1427 givesCheck = pos.gives_check(move);
1434 && futilityBase > -VALUE_KNOWN_WIN
1435 && !pos.advanced_pawn_push(move))
1437 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1439 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1441 if (futilityValue <= alpha)
1443 bestValue = std::max(bestValue, futilityValue);
1447 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1449 bestValue = std::max(bestValue, futilityBase);
1454 // Detect non-capture evasions that are candidates to be pruned
1455 evasionPrunable = inCheck
1456 && (depth != DEPTH_ZERO || moveCount > 2)
1457 && bestValue > VALUE_MATED_IN_MAX_PLY
1458 && !pos.capture(move);
1460 // Don't search moves with negative SEE values
1461 if ( (!inCheck || evasionPrunable)
1462 && (!givesCheck || !(pos.blockers_for_king(~pos.side_to_move()) & from_sq(move)))
1463 && !pos.see_ge(move))
1466 // Speculative prefetch as early as possible
1467 prefetch(TT.first_entry(pos.key_after(move)));
1469 // Check for legality just before making the move
1470 if (!pos.legal(move))
1476 ss->currentMove = move;
1477 ss->continuationHistory = &thisThread->continuationHistory[pos.moved_piece(move)][to_sq(move)];
1479 // Make and search the move
1480 pos.do_move(move, st, givesCheck);
1481 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1482 pos.undo_move(move);
1484 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1486 // Check for a new best move
1487 if (value > bestValue)
1495 if (PvNode) // Update pv even in fail-high case
1496 update_pv(ss->pv, move, (ss+1)->pv);
1498 if (PvNode && value < beta) // Update alpha here!
1506 // All legal moves have been searched. A special case: If we're in check
1507 // and no legal moves were found, it is checkmate.
1508 if (inCheck && bestValue == -VALUE_INFINITE)
1509 return mated_in(ss->ply); // Plies to mate from the root
1511 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1512 bestValue >= beta ? BOUND_LOWER :
1513 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1514 ttDepth, bestMove, ss->staticEval);
1516 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1522 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1523 // "plies to mate from the current position". Non-mate scores are unchanged.
1524 // The function is called before storing a value in the transposition table.
1526 Value value_to_tt(Value v, int ply) {
1528 assert(v != VALUE_NONE);
1530 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1531 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1535 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1536 // from the transposition table (which refers to the plies to mate/be mated
1537 // from current position) to "plies to mate/be mated from the root".
1539 Value value_from_tt(Value v, int ply) {
1541 return v == VALUE_NONE ? VALUE_NONE
1542 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1543 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1547 // update_pv() adds current move and appends child pv[]
1549 void update_pv(Move* pv, Move move, Move* childPv) {
1551 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1557 // update_continuation_histories() updates histories of the move pairs formed
1558 // by moves at ply -1, -2, and -4 with current move.
1560 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1562 for (int i : {1, 2, 4, 6})
1563 if (is_ok((ss-i)->currentMove))
1564 (*(ss-i)->continuationHistory)[pc][to] << bonus;
1568 // update_capture_stats() updates move sorting heuristics when a new capture best move is found
1570 void update_capture_stats(const Position& pos, Move move,
1571 Move* captures, int captureCount, int bonus) {
1573 CapturePieceToHistory& captureHistory = pos.this_thread()->captureHistory;
1574 Piece moved_piece = pos.moved_piece(move);
1575 PieceType captured = type_of(pos.piece_on(to_sq(move)));
1577 if (pos.capture_or_promotion(move))
1578 captureHistory[moved_piece][to_sq(move)][captured] << bonus;
1580 // Decrease all the other played capture moves
1581 for (int i = 0; i < captureCount; ++i)
1583 moved_piece = pos.moved_piece(captures[i]);
1584 captured = type_of(pos.piece_on(to_sq(captures[i])));
1585 captureHistory[moved_piece][to_sq(captures[i])][captured] << -bonus;
1590 // update_quiet_stats() updates move sorting heuristics when a new quiet best move is found
1592 void update_quiet_stats(const Position& pos, Stack* ss, Move move,
1593 Move* quiets, int quietCount, int bonus) {
1595 if (ss->killers[0] != move)
1597 ss->killers[1] = ss->killers[0];
1598 ss->killers[0] = move;
1601 Color us = pos.side_to_move();
1602 Thread* thisThread = pos.this_thread();
1603 thisThread->mainHistory[us][from_to(move)] << bonus;
1604 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1606 if (is_ok((ss-1)->currentMove))
1608 Square prevSq = to_sq((ss-1)->currentMove);
1609 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1612 // Decrease all the other played quiet moves
1613 for (int i = 0; i < quietCount; ++i)
1615 thisThread->mainHistory[us][from_to(quiets[i])] << -bonus;
1616 update_continuation_histories(ss, pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
1620 // When playing with strength handicap, choose best move among a set of RootMoves
1621 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1623 Move Skill::pick_best(size_t multiPV) {
1625 const RootMoves& rootMoves = Threads.main()->rootMoves;
1626 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1628 // RootMoves are already sorted by score in descending order
1629 Value topScore = rootMoves[0].score;
1630 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1631 int weakness = 120 - 2 * level;
1632 int maxScore = -VALUE_INFINITE;
1634 // Choose best move. For each move score we add two terms, both dependent on
1635 // weakness. One is deterministic and bigger for weaker levels, and one is
1636 // random. Then we choose the move with the resulting highest score.
1637 for (size_t i = 0; i < multiPV; ++i)
1639 // This is our magic formula
1640 int push = ( weakness * int(topScore - rootMoves[i].score)
1641 + delta * (rng.rand<unsigned>() % weakness)) / 128;
1643 if (rootMoves[i].score + push >= maxScore)
1645 maxScore = rootMoves[i].score + push;
1646 best = rootMoves[i].pv[0];
1655 /// MainThread::check_time() is used to print debug info and, more importantly,
1656 /// to detect when we are out of available time and thus stop the search.
1658 void MainThread::check_time() {
1663 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1664 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1666 static TimePoint lastInfoTime = now();
1668 TimePoint elapsed = Time.elapsed();
1669 TimePoint tick = Limits.startTime + elapsed;
1671 if (tick - lastInfoTime >= 1000)
1673 lastInfoTime = tick;
1677 // We should not stop pondering until told so by the GUI
1681 if ( (Limits.use_time_management() && (elapsed > Time.maximum() - 10 || stopOnPonderhit))
1682 || (Limits.movetime && elapsed >= Limits.movetime)
1683 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1684 Threads.stop = true;
1688 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1689 /// that all (if any) unsearched PV lines are sent using a previous search score.
1691 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1693 std::stringstream ss;
1694 TimePoint elapsed = Time.elapsed() + 1;
1695 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1696 size_t pvIdx = pos.this_thread()->pvIdx;
1697 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1698 uint64_t nodesSearched = Threads.nodes_searched();
1699 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1701 for (size_t i = 0; i < multiPV; ++i)
1703 bool updated = (i <= pvIdx && rootMoves[i].score != -VALUE_INFINITE);
1705 if (depth == ONE_PLY && !updated)
1708 Depth d = updated ? depth : depth - ONE_PLY;
1709 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1711 bool tb = TB::RootInTB && abs(v) < VALUE_MATE - MAX_PLY;
1712 v = tb ? rootMoves[i].tbScore : v;
1714 if (ss.rdbuf()->in_avail()) // Not at first line
1718 << " depth " << d / ONE_PLY
1719 << " seldepth " << rootMoves[i].selDepth
1720 << " multipv " << i + 1
1721 << " score " << UCI::value(v);
1723 if (!tb && i == pvIdx)
1724 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1726 ss << " nodes " << nodesSearched
1727 << " nps " << nodesSearched * 1000 / elapsed;
1729 if (elapsed > 1000) // Earlier makes little sense
1730 ss << " hashfull " << TT.hashfull();
1732 ss << " tbhits " << tbHits
1733 << " time " << elapsed
1736 for (Move m : rootMoves[i].pv)
1737 ss << " " << UCI::move(m, pos.is_chess960());
1744 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1745 /// before exiting the search, for instance, in case we stop the search during a
1746 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1747 /// otherwise in case of 'ponder on' we have nothing to think on.
1749 bool RootMove::extract_ponder_from_tt(Position& pos) {
1754 assert(pv.size() == 1);
1756 if (pv[0] == MOVE_NONE)
1759 pos.do_move(pv[0], st);
1760 TTEntry* tte = TT.probe(pos.key(), ttHit);
1764 Move m = tte->move(); // Local copy to be SMP safe
1765 if (MoveList<LEGAL>(pos).contains(m))
1769 pos.undo_move(pv[0]);
1770 return pv.size() > 1;
1773 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1776 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1777 ProbeDepth = int(Options["SyzygyProbeDepth"]) * ONE_PLY;
1778 Cardinality = int(Options["SyzygyProbeLimit"]);
1779 bool dtz_available = true;
1781 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1782 // ProbeDepth == DEPTH_ZERO
1783 if (Cardinality > MaxCardinality)
1785 Cardinality = MaxCardinality;
1786 ProbeDepth = DEPTH_ZERO;
1789 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1791 // Rank moves using DTZ tables
1792 RootInTB = root_probe(pos, rootMoves);
1796 // DTZ tables are missing; try to rank moves using WDL tables
1797 dtz_available = false;
1798 RootInTB = root_probe_wdl(pos, rootMoves);
1804 // Sort moves according to TB rank
1805 std::sort(rootMoves.begin(), rootMoves.end(),
1806 [](const RootMove &a, const RootMove &b) { return a.tbRank > b.tbRank; } );
1808 // Probe during search only if DTZ is not available and we are winning
1809 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
1814 // Clean up if root_probe() and root_probe_wdl() have failed
1815 for (auto& m : rootMoves)