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 // Sizes and phases of the skip-blocks, used for distributing search depths across the threads
65 constexpr int SkipSize[] = { 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4 };
66 constexpr int SkipPhase[] = { 0, 1, 0, 1, 2, 3, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 6, 7 };
68 // Razor and futility margins
69 constexpr int RazorMargin = 600;
70 Value futility_margin(Depth d, bool improving) {
71 return Value((175 - 50 * improving) * d / ONE_PLY);
74 // Futility and reductions lookup tables, initialized at startup
75 int FutilityMoveCounts[2][16]; // [improving][depth]
76 int Reductions[2][2][64][64]; // [pv][improving][depth][moveNumber]
78 template <bool PvNode> Depth reduction(bool i, Depth d, int mn) {
79 return Reductions[PvNode][i][std::min(d / ONE_PLY, 63)][std::min(mn, 63)] * ONE_PLY;
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 ? 0 : 29 * d * d + 138 * d - 134;
88 // Add a small random component to draw evaluations to keep search dynamic
89 // and to avoid 3fold-blindness.
90 Value value_draw(Depth depth, Thread* thisThread) {
91 return depth < 4 ? VALUE_DRAW
92 : VALUE_DRAW + Value(2 * (thisThread->nodes.load(std::memory_order_relaxed) % 2) - 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 / ONE_PLY == 1 + level; }
100 Move pick_best(size_t multiPV);
103 Move best = MOVE_NONE;
106 template <NodeType NT>
107 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
109 template <NodeType NT>
110 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = DEPTH_ZERO);
112 Value value_to_tt(Value v, int ply);
113 Value value_from_tt(Value v, int ply);
114 void update_pv(Move* pv, Move move, Move* childPv);
115 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
116 void update_quiet_stats(const Position& pos, Stack* ss, Move move, Move* quiets, int quietCount, int bonus);
117 void update_capture_stats(const Position& pos, Move move, Move* captures, int captureCount, int bonus);
119 inline bool gives_check(const Position& pos, Move move) {
120 Color us = pos.side_to_move();
121 return type_of(move) == NORMAL && !(pos.blockers_for_king(~us) & pos.pieces(us))
122 ? pos.check_squares(type_of(pos.moved_piece(move))) & to_sq(move)
123 : pos.gives_check(move);
126 // perft() is our utility to verify move generation. All the leaf nodes up
127 // to the given depth are generated and counted, and the sum is returned.
129 uint64_t perft(Position& pos, Depth depth) {
132 uint64_t cnt, nodes = 0;
133 const bool leaf = (depth == 2 * ONE_PLY);
135 for (const auto& m : MoveList<LEGAL>(pos))
137 if (Root && depth <= ONE_PLY)
142 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - ONE_PLY);
147 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
155 /// Search::init() is called at startup to initialize various lookup tables
157 void Search::init() {
159 for (int imp = 0; imp <= 1; ++imp)
160 for (int d = 1; d < 64; ++d)
161 for (int mc = 1; mc < 64; ++mc)
163 double r = log(d) * log(mc) / 1.95;
165 Reductions[NonPV][imp][d][mc] = int(std::round(r));
166 Reductions[PV][imp][d][mc] = std::max(Reductions[NonPV][imp][d][mc] - 1, 0);
168 // Increase reduction for non-PV nodes when eval is not improving
170 Reductions[NonPV][imp][d][mc]++;
173 for (int d = 0; d < 16; ++d)
175 FutilityMoveCounts[0][d] = int(2.4 + 0.74 * pow(d, 1.78));
176 FutilityMoveCounts[1][d] = int(5.0 + 1.00 * pow(d, 2.00));
181 /// Search::clear() resets search state to its initial value
183 void Search::clear() {
185 Threads.main()->wait_for_search_finished();
187 Time.availableNodes = 0;
190 Tablebases::init(Options["SyzygyPath"]); // Free up mapped files
194 /// MainThread::search() is called by the main thread when the program receives
195 /// the UCI 'go' command. It searches from the root position and outputs the "bestmove".
197 void MainThread::search() {
201 nodes = perft<true>(rootPos, Limits.perft * ONE_PLY);
202 sync_cout << "\nNodes searched: " << nodes << "\n" << sync_endl;
206 Color us = rootPos.side_to_move();
207 Time.init(Limits, us, rootPos.game_ply());
210 if (rootMoves.empty())
212 rootMoves.emplace_back(MOVE_NONE);
213 sync_cout << "info depth 0 score "
214 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
219 for (Thread* th : Threads)
221 th->start_searching();
223 Thread::search(); // Let's start searching!
226 // When we reach the maximum depth, we can arrive here without a raise of
227 // Threads.stop. However, if we are pondering or in an infinite search,
228 // the UCI protocol states that we shouldn't print the best move before the
229 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
230 // until the GUI sends one of those commands.
232 while (!Threads.stop && (ponder || Limits.infinite))
233 {} // Busy wait for a stop or a ponder reset
235 // Stop the threads if not already stopped (also raise the stop if
236 // "ponderhit" just reset Threads.ponder).
239 // Wait until all threads have finished
240 for (Thread* th : Threads)
242 th->wait_for_search_finished();
244 // When playing in 'nodes as time' mode, subtract the searched nodes from
245 // the available ones before exiting.
247 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
249 // Check if there are threads with a better score than main thread
250 Thread* bestThread = this;
251 if ( Options["MultiPV"] == 1
253 && !Skill(Options["Skill Level"]).enabled()
254 && rootMoves[0].pv[0] != MOVE_NONE)
256 std::map<Move, int64_t> votes;
257 Value minScore = this->rootMoves[0].score;
259 // Find out minimum score and reset votes for moves which can be voted
260 for (Thread* th: Threads)
262 minScore = std::min(minScore, th->rootMoves[0].score);
263 votes[th->rootMoves[0].pv[0]] = 0;
266 // Vote according to score and depth
267 auto square = [](int64_t x) { return x * x; };
268 for (Thread* th : Threads)
269 votes[th->rootMoves[0].pv[0]] += 200 + (square(th->rootMoves[0].score - minScore + 1)
270 * int64_t(th->completedDepth));
272 // Select best thread
273 int64_t bestVote = votes[this->rootMoves[0].pv[0]];
274 for (Thread* th : Threads)
276 if (votes[th->rootMoves[0].pv[0]] > bestVote)
278 bestVote = votes[th->rootMoves[0].pv[0]];
284 previousScore = bestThread->rootMoves[0].score;
286 // Send again PV info if we have a new best thread
287 if (bestThread != this)
288 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth, -VALUE_INFINITE, VALUE_INFINITE) << sync_endl;
290 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
292 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
293 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
295 std::cout << sync_endl;
299 /// Thread::search() is the main iterative deepening loop. It calls search()
300 /// repeatedly with increasing depth until the allocated thinking time has been
301 /// consumed, the user stops the search, or the maximum search depth is reached.
303 void Thread::search() {
305 // To allow access to (ss-5) up to (ss+2), the stack must be oversized.
306 // The former is needed to allow update_continuation_histories(ss-1, ...),
307 // which accesses its argument at ss-4, also near the root.
308 // The latter is needed for statScores and killer initialization.
309 Stack stack[MAX_PLY+8], *ss = stack+5;
311 Value bestValue, alpha, beta, delta;
312 Move lastBestMove = MOVE_NONE;
313 Depth lastBestMoveDepth = DEPTH_ZERO;
314 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
315 double timeReduction = 1.0;
316 Color us = rootPos.side_to_move();
319 std::memset(ss-5, 0, 8 * sizeof(Stack));
320 for (int i = 5; i > 0; i--)
321 (ss-i)->continuationHistory = &this->continuationHistory[NO_PIECE][0]; // Use as sentinel
324 bestValue = delta = alpha = -VALUE_INFINITE;
325 beta = VALUE_INFINITE;
328 mainThread->bestMoveChanges = 0, failedLow = false;
330 size_t multiPV = Options["MultiPV"];
331 Skill skill(Options["Skill Level"]);
333 // When playing with strength handicap enable MultiPV search that we will
334 // use behind the scenes to retrieve a set of possible moves.
336 multiPV = std::max(multiPV, (size_t)4);
338 multiPV = std::min(multiPV, rootMoves.size());
340 int ct = int(Options["Contempt"]) * PawnValueEg / 100; // From centipawns
342 // In analysis mode, adjust contempt in accordance with user preference
343 if (Limits.infinite || Options["UCI_AnalyseMode"])
344 ct = Options["Analysis Contempt"] == "Off" ? 0
345 : Options["Analysis Contempt"] == "Both" ? ct
346 : Options["Analysis Contempt"] == "White" && us == BLACK ? -ct
347 : Options["Analysis Contempt"] == "Black" && us == WHITE ? -ct
350 // In evaluate.cpp the evaluation is from the white point of view
351 contempt = (us == WHITE ? make_score(ct, ct / 2)
352 : -make_score(ct, ct / 2));
354 // Iterative deepening loop until requested to stop or the target depth is reached
355 while ( (rootDepth += ONE_PLY) < DEPTH_MAX
357 && !(Limits.depth && mainThread && rootDepth / ONE_PLY > Limits.depth))
359 // Distribute search depths across the helper threads
362 int i = (idx - 1) % 20;
363 if (((rootDepth / ONE_PLY + SkipPhase[i]) / SkipSize[i]) % 2)
364 continue; // Retry with an incremented rootDepth
367 // Age out PV variability metric
369 mainThread->bestMoveChanges *= 0.517, failedLow = false;
371 // Save the last iteration's scores before first PV line is searched and
372 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
373 for (RootMove& rm : rootMoves)
374 rm.previousScore = rm.score;
379 // MultiPV loop. We perform a full root search for each PV line
380 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
385 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
386 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
390 // Reset UCI info selDepth for each depth and each PV line
393 // Reset aspiration window starting size
394 if (rootDepth >= 5 * ONE_PLY)
396 Value previousScore = rootMoves[pvIdx].previousScore;
398 alpha = std::max(previousScore - delta,-VALUE_INFINITE);
399 beta = std::min(previousScore + delta, VALUE_INFINITE);
401 // Adjust contempt based on root move's previousScore (dynamic contempt)
402 int dct = ct + 88 * previousScore / (abs(previousScore) + 200);
404 contempt = (us == WHITE ? make_score(dct, dct / 2)
405 : -make_score(dct, dct / 2));
408 // Start with a small aspiration window and, in the case of a fail
409 // high/low, re-search with a bigger window until we don't fail
411 int failedHighCnt = 0;
414 Depth adjustedDepth = std::max(ONE_PLY, rootDepth - failedHighCnt * ONE_PLY);
415 bestValue = ::search<PV>(rootPos, ss, alpha, beta, adjustedDepth, false);
417 // Bring the best move to the front. It is critical that sorting
418 // is done with a stable algorithm because all the values but the
419 // first and eventually the new best one are set to -VALUE_INFINITE
420 // and we want to keep the same order for all the moves except the
421 // new PV that goes to the front. Note that in case of MultiPV
422 // search the already searched PV lines are preserved.
423 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
425 // If search has been stopped, we break immediately. Sorting is
426 // safe because RootMoves is still valid, although it refers to
427 // the previous iteration.
431 // When failing high/low give some update (without cluttering
432 // the UI) before a re-search.
435 && (bestValue <= alpha || bestValue >= beta)
436 && Time.elapsed() > 3000)
437 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
439 // In case of failing low/high increase aspiration window and
440 // re-search, otherwise exit the loop.
441 if (bestValue <= alpha)
443 beta = (alpha + beta) / 2;
444 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
450 mainThread->stopOnPonderhit = false;
453 else if (bestValue >= beta)
455 beta = std::min(bestValue + delta, VALUE_INFINITE);
462 delta += delta / 4 + 5;
464 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
467 // Sort the PV lines searched so far and update the GUI
468 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
471 && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
472 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
476 completedDepth = rootDepth;
478 if (rootMoves[0].pv[0] != lastBestMove) {
479 lastBestMove = rootMoves[0].pv[0];
480 lastBestMoveDepth = rootDepth;
483 // Have we found a "mate in x"?
485 && bestValue >= VALUE_MATE_IN_MAX_PLY
486 && VALUE_MATE - bestValue <= 2 * Limits.mate)
492 // If skill level is enabled and time is up, pick a sub-optimal best move
493 if (skill.enabled() && skill.time_to_pick(rootDepth))
494 skill.pick_best(multiPV);
496 // Do we have time for the next iteration? Can we stop searching now?
497 if ( Limits.use_time_management()
499 && !mainThread->stopOnPonderhit)
501 double fallingEval = (306 + 119 * failedLow + 6 * (mainThread->previousScore - bestValue)) / 581.0;
502 fallingEval = std::max(0.5, std::min(1.5, fallingEval));
504 // If the bestMove is stable over several iterations, reduce time accordingly
505 timeReduction = lastBestMoveDepth + 10 * ONE_PLY < completedDepth ? 1.95 : 1.0;
507 // Use part of the gained time from a previous stable move for the current move
508 double bestMoveInstability = 1.0 + mainThread->bestMoveChanges;
509 bestMoveInstability *= std::pow(mainThread->previousTimeReduction, 0.528) / timeReduction;
511 // Stop the search if we have only one legal move, or if available time elapsed
512 if ( rootMoves.size() == 1
513 || Time.elapsed() > Time.optimum() * bestMoveInstability * fallingEval)
515 // If we are allowed to ponder do not stop the search now but
516 // keep pondering until the GUI sends "ponderhit" or "stop".
517 if (mainThread->ponder)
518 mainThread->stopOnPonderhit = true;
528 mainThread->previousTimeReduction = timeReduction;
530 // If skill level is enabled, swap best PV line with the sub-optimal one
532 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
533 skill.best ? skill.best : skill.pick_best(multiPV)));
539 // search<>() is the main search function for both PV and non-PV nodes
541 template <NodeType NT>
542 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
544 constexpr bool PvNode = NT == PV;
545 const bool rootNode = PvNode && ss->ply == 0;
547 // Check if we have an upcoming move which draws by repetition, or
548 // if the opponent had an alternative move earlier to this position.
549 if ( pos.rule50_count() >= 3
550 && alpha < VALUE_DRAW
552 && pos.has_game_cycle(ss->ply))
554 alpha = value_draw(depth, pos.this_thread());
559 // Dive into quiescence search when the depth reaches zero
561 return qsearch<NT>(pos, ss, alpha, beta);
563 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
564 assert(PvNode || (alpha == beta - 1));
565 assert(DEPTH_ZERO < depth && depth < DEPTH_MAX);
566 assert(!(PvNode && cutNode));
567 assert(depth / ONE_PLY * ONE_PLY == depth);
569 Move pv[MAX_PLY+1], capturesSearched[32], quietsSearched[64];
573 Move ttMove, move, excludedMove, bestMove;
574 Depth extension, newDepth;
575 Value bestValue, value, ttValue, eval, maxValue, pureStaticEval;
576 bool ttHit, pvHit, inCheck, givesCheck, improving;
577 bool captureOrPromotion, doFullDepthSearch, moveCountPruning, skipQuiets, ttCapture;
579 int moveCount, captureCount, quietCount;
581 // Step 1. Initialize node
582 Thread* thisThread = pos.this_thread();
583 inCheck = pos.checkers();
584 Color us = pos.side_to_move();
585 moveCount = captureCount = quietCount = ss->moveCount = 0;
586 bestValue = -VALUE_INFINITE;
587 maxValue = VALUE_INFINITE;
589 // Check for the available remaining time
590 if (thisThread == Threads.main())
591 static_cast<MainThread*>(thisThread)->check_time();
593 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
594 if (PvNode && thisThread->selDepth < ss->ply + 1)
595 thisThread->selDepth = ss->ply + 1;
599 // Step 2. Check for aborted search and immediate draw
600 if ( Threads.stop.load(std::memory_order_relaxed)
601 || pos.is_draw(ss->ply)
602 || ss->ply >= MAX_PLY)
603 return (ss->ply >= MAX_PLY && !inCheck) ? evaluate(pos)
604 : value_draw(depth, pos.this_thread());
606 // Step 3. Mate distance pruning. Even if we mate at the next move our score
607 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
608 // a shorter mate was found upward in the tree then there is no need to search
609 // because we will never beat the current alpha. Same logic but with reversed
610 // signs applies also in the opposite condition of being mated instead of giving
611 // mate. In this case return a fail-high score.
612 alpha = std::max(mated_in(ss->ply), alpha);
613 beta = std::min(mate_in(ss->ply+1), beta);
618 assert(0 <= ss->ply && ss->ply < MAX_PLY);
620 (ss+1)->ply = ss->ply + 1;
621 ss->currentMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
622 ss->continuationHistory = &thisThread->continuationHistory[NO_PIECE][0];
623 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
624 Square prevSq = to_sq((ss-1)->currentMove);
626 // Initialize statScore to zero for the grandchildren of the current position.
627 // So statScore is shared between all grandchildren and only the first grandchild
628 // starts with statScore = 0. Later grandchildren start with the last calculated
629 // statScore of the previous grandchild. This influences the reduction rules in
630 // LMR which are based on the statScore of parent position.
631 (ss+2)->statScore = 0;
633 // Step 4. Transposition table lookup. We don't want the score of a partial
634 // search to overwrite a previous full search TT value, so we use a different
635 // position key in case of an excluded move.
636 excludedMove = ss->excludedMove;
637 posKey = pos.key() ^ Key(excludedMove << 16); // Isn't a very good hash
638 tte = TT.probe(posKey, ttHit);
639 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
640 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
641 : ttHit ? tte->move() : MOVE_NONE;
642 pvHit = (ttHit && tte->pv_hit()) || (PvNode && depth > 4 * ONE_PLY);
644 // At non-PV nodes we check for an early TT cutoff
647 && tte->depth() >= depth
648 && ttValue != VALUE_NONE // Possible in case of TT access race
649 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
650 : (tte->bound() & BOUND_UPPER)))
652 // If ttMove is quiet, update move sorting heuristics on TT hit
657 if (!pos.capture_or_promotion(ttMove))
658 update_quiet_stats(pos, ss, ttMove, nullptr, 0, stat_bonus(depth));
660 // Extra penalty for a quiet TT or main killer move in previous ply when it gets refuted
661 if ( ((ss-1)->moveCount == 1 || (ss-1)->currentMove == (ss-1)->killers[0])
662 && !pos.captured_piece())
663 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + ONE_PLY));
665 // Penalty for a quiet ttMove that fails low
666 else if (!pos.capture_or_promotion(ttMove))
668 int penalty = -stat_bonus(depth);
669 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
670 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
676 // Step 5. Tablebases probe
677 if (!rootNode && TB::Cardinality)
679 int piecesCount = pos.count<ALL_PIECES>();
681 if ( piecesCount <= TB::Cardinality
682 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
683 && pos.rule50_count() == 0
684 && !pos.can_castle(ANY_CASTLING))
687 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
689 // Force check of time on the next occasion
690 if (thisThread == Threads.main())
691 static_cast<MainThread*>(thisThread)->callsCnt = 0;
693 if (err != TB::ProbeState::FAIL)
695 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
697 int drawScore = TB::UseRule50 ? 1 : 0;
699 value = wdl < -drawScore ? -VALUE_MATE + MAX_PLY + ss->ply + 1
700 : wdl > drawScore ? VALUE_MATE - MAX_PLY - ss->ply - 1
701 : VALUE_DRAW + 2 * wdl * drawScore;
703 Bound b = wdl < -drawScore ? BOUND_UPPER
704 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
706 if ( b == BOUND_EXACT
707 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
709 tte->save(posKey, value_to_tt(value, ss->ply), pvHit, b,
710 std::min(DEPTH_MAX - ONE_PLY, depth + 6 * ONE_PLY),
711 MOVE_NONE, VALUE_NONE);
718 if (b == BOUND_LOWER)
719 bestValue = value, alpha = std::max(alpha, bestValue);
727 // Step 6. Static evaluation of the position
730 ss->staticEval = eval = pureStaticEval = VALUE_NONE;
732 goto moves_loop; // Skip early pruning when in check
736 // Never assume anything on values stored in TT
737 ss->staticEval = eval = pureStaticEval = tte->eval();
738 if (eval == VALUE_NONE)
739 ss->staticEval = eval = pureStaticEval = evaluate(pos);
741 // Can ttValue be used as a better position evaluation?
742 if ( ttValue != VALUE_NONE
743 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
748 if ((ss-1)->currentMove != MOVE_NULL)
750 int bonus = -(ss-1)->statScore / 512;
752 pureStaticEval = evaluate(pos);
753 ss->staticEval = eval = pureStaticEval + bonus;
756 ss->staticEval = eval = pureStaticEval = -(ss-1)->staticEval + 2 * Eval::Tempo;
758 tte->save(posKey, VALUE_NONE, pvHit, BOUND_NONE, DEPTH_NONE, MOVE_NONE, pureStaticEval);
761 // Step 7. Razoring (~2 Elo)
762 if ( !rootNode // The required rootNode PV handling is not available in qsearch
763 && depth < 2 * ONE_PLY
764 && eval <= alpha - RazorMargin)
765 return qsearch<NT>(pos, ss, alpha, beta);
767 improving = ss->staticEval >= (ss-2)->staticEval
768 || (ss-2)->staticEval == VALUE_NONE;
770 // Step 8. Futility pruning: child node (~30 Elo)
772 && depth < 7 * ONE_PLY
773 && eval - futility_margin(depth, improving) >= beta
774 && eval < VALUE_KNOWN_WIN) // Do not return unproven wins
777 // Step 9. Null move search with verification search (~40 Elo)
779 && (ss-1)->currentMove != MOVE_NULL
780 && (ss-1)->statScore < 23200
782 && pureStaticEval >= beta - 36 * depth / ONE_PLY + 225
784 && pos.non_pawn_material(us)
785 && (ss->ply >= thisThread->nmpMinPly || us != thisThread->nmpColor))
787 assert(eval - beta >= 0);
789 // Null move dynamic reduction based on depth and value
790 Depth R = ((823 + 67 * depth / ONE_PLY) / 256 + std::min(int(eval - beta) / 200, 3)) * ONE_PLY;
792 ss->currentMove = MOVE_NULL;
793 ss->continuationHistory = &thisThread->continuationHistory[NO_PIECE][0];
795 pos.do_null_move(st);
797 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
799 pos.undo_null_move();
801 if (nullValue >= beta)
803 // Do not return unproven mate scores
804 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
807 if (thisThread->nmpMinPly || (abs(beta) < VALUE_KNOWN_WIN && depth < 12 * ONE_PLY))
810 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
812 // Do verification search at high depths, with null move pruning disabled
813 // for us, until ply exceeds nmpMinPly.
814 thisThread->nmpMinPly = ss->ply + 3 * (depth-R) / 4;
815 thisThread->nmpColor = us;
817 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
819 thisThread->nmpMinPly = 0;
826 // Step 10. ProbCut (~10 Elo)
827 // If we have a good enough capture and a reduced search returns a value
828 // much above beta, we can (almost) safely prune the previous move.
830 && depth >= 5 * ONE_PLY
831 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
833 Value raisedBeta = std::min(beta + 216 - 48 * improving, VALUE_INFINITE);
834 MovePicker mp(pos, ttMove, raisedBeta - ss->staticEval, &thisThread->captureHistory);
835 int probCutCount = 0;
837 while ( (move = mp.next_move()) != MOVE_NONE
839 if (move != excludedMove && pos.legal(move))
843 ss->currentMove = move;
844 ss->continuationHistory = &thisThread->continuationHistory[pos.moved_piece(move)][to_sq(move)];
846 assert(depth >= 5 * ONE_PLY);
848 pos.do_move(move, st);
850 // Perform a preliminary qsearch to verify that the move holds
851 value = -qsearch<NonPV>(pos, ss+1, -raisedBeta, -raisedBeta+1);
853 // If the qsearch held perform the regular search
854 if (value >= raisedBeta)
855 value = -search<NonPV>(pos, ss+1, -raisedBeta, -raisedBeta+1, depth - 4 * ONE_PLY, !cutNode);
859 if (value >= raisedBeta)
864 // Step 11. Internal iterative deepening (~2 Elo)
865 if ( depth >= 8 * ONE_PLY
868 search<NT>(pos, ss, alpha, beta, depth - 7 * ONE_PLY, cutNode);
870 tte = TT.probe(posKey, ttHit);
871 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
872 ttMove = ttHit ? tte->move() : MOVE_NONE;
875 moves_loop: // When in check, search starts from here
877 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory, nullptr, (ss-4)->continuationHistory };
878 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
880 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
881 &thisThread->captureHistory,
885 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
888 ttCapture = ttMove && pos.capture_or_promotion(ttMove);
890 // Step 12. Loop through all pseudo-legal moves until no moves remain
891 // or a beta cutoff occurs.
892 while ((move = mp.next_move(skipQuiets)) != MOVE_NONE)
896 if (move == excludedMove)
899 // At root obey the "searchmoves" option and skip moves not listed in Root
900 // Move List. As a consequence any illegal move is also skipped. In MultiPV
901 // mode we also skip PV moves which have been already searched and those
902 // of lower "TB rank" if we are in a TB root position.
903 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
904 thisThread->rootMoves.begin() + thisThread->pvLast, move))
907 ss->moveCount = ++moveCount;
909 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
910 sync_cout << "info depth " << depth / ONE_PLY
911 << " currmove " << UCI::move(move, pos.is_chess960())
912 << " currmovenumber " << moveCount + thisThread->pvIdx << sync_endl;
914 (ss+1)->pv = nullptr;
916 extension = DEPTH_ZERO;
917 captureOrPromotion = pos.capture_or_promotion(move);
918 movedPiece = pos.moved_piece(move);
919 givesCheck = gives_check(pos, move);
921 moveCountPruning = depth < 16 * ONE_PLY
922 && moveCount >= FutilityMoveCounts[improving][depth / ONE_PLY];
924 // Step 13. Extensions (~70 Elo)
926 // Singular extension search (~60 Elo). If all moves but one fail low on a
927 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
928 // then that move is singular and should be extended. To verify this we do
929 // a reduced search on all the other moves but the ttMove and if the
930 // result is lower than ttValue minus a margin then we will extend the ttMove.
931 if ( depth >= 8 * ONE_PLY
934 && !excludedMove // Avoid recursive singular search
935 && ttValue != VALUE_NONE
936 && (tte->bound() & BOUND_LOWER)
937 && tte->depth() >= depth - 3 * ONE_PLY
940 Value singularBeta = std::max(ttValue - 2 * depth / ONE_PLY, -VALUE_MATE);
941 ss->excludedMove = move;
942 value = search<NonPV>(pos, ss, singularBeta - 1, singularBeta, depth / 2, cutNode);
943 ss->excludedMove = MOVE_NONE;
945 if (value < singularBeta)
949 // Our ttMove is assumed to fail high, and now we failed high also on a reduced
950 // search without the ttMove. So we assume this expected Cut-node is not singular,
951 // that is multiple moves fail high, and we can prune the whole subtree by returning
952 // the hard beta bound.
953 else if (cutNode && singularBeta > beta)
957 // Check extension (~2 Elo)
959 && (pos.blockers_for_king(~us) & from_sq(move) || pos.see_ge(move)))
962 // Castling extension
963 else if (type_of(move) == CASTLING)
966 // Calculate new depth for this move
967 newDepth = depth - ONE_PLY + extension;
969 // Step 14. Pruning at shallow depth (~170 Elo)
971 && pos.non_pawn_material(us)
972 && bestValue > VALUE_MATED_IN_MAX_PLY)
974 if ( !captureOrPromotion
976 && !pos.advanced_pawn_push(move))
978 // Move count based pruning (~30 Elo)
979 if (moveCountPruning)
985 // Reduced depth of the next LMR search
986 int lmrDepth = std::max(newDepth - reduction<PvNode>(improving, depth, moveCount), DEPTH_ZERO) / ONE_PLY;
988 // Countermoves based pruning (~20 Elo)
989 if ( lmrDepth < 3 + ((ss-1)->statScore > 0 || (ss-1)->moveCount == 1)
990 && (*contHist[0])[movedPiece][to_sq(move)] < CounterMovePruneThreshold
991 && (*contHist[1])[movedPiece][to_sq(move)] < CounterMovePruneThreshold)
994 // Futility pruning: parent node (~2 Elo)
997 && ss->staticEval + 256 + 200 * lmrDepth <= alpha)
1000 // Prune moves with negative SEE (~10 Elo)
1001 if (!pos.see_ge(move, Value(-29 * lmrDepth * lmrDepth)))
1004 else if ( !extension // (~20 Elo)
1005 && !pos.see_ge(move, -PawnValueEg * (depth / ONE_PLY)))
1009 // Speculative prefetch as early as possible
1010 prefetch(TT.first_entry(pos.key_after(move)));
1012 // Check for legality just before making the move
1013 if (!rootNode && !pos.legal(move))
1015 ss->moveCount = --moveCount;
1019 // Update the current move (this must be done after singular extension search)
1020 ss->currentMove = move;
1021 ss->continuationHistory = &thisThread->continuationHistory[movedPiece][to_sq(move)];
1023 // Step 15. Make the move
1024 pos.do_move(move, st, givesCheck);
1026 // Step 16. Reduced depth search (LMR). If the move fails high it will be
1027 // re-searched at full depth.
1028 if ( depth >= 3 * ONE_PLY
1030 && (!captureOrPromotion || moveCountPruning))
1032 Depth r = reduction<PvNode>(improving, depth, moveCount);
1034 // Decrease reduction if position is or has been on the PV
1038 // Decrease reduction if opponent's move count is high (~10 Elo)
1039 if ((ss-1)->moveCount > 15)
1042 if (!captureOrPromotion)
1044 // Increase reduction if ttMove is a capture (~0 Elo)
1048 // Increase reduction for cut nodes (~5 Elo)
1052 // Decrease reduction for moves that escape a capture. Filter out
1053 // castling moves, because they are coded as "king captures rook" and
1054 // hence break make_move(). (~5 Elo)
1055 else if ( type_of(move) == NORMAL
1056 && !pos.see_ge(make_move(to_sq(move), from_sq(move))))
1059 ss->statScore = thisThread->mainHistory[us][from_to(move)]
1060 + (*contHist[0])[movedPiece][to_sq(move)]
1061 + (*contHist[1])[movedPiece][to_sq(move)]
1062 + (*contHist[3])[movedPiece][to_sq(move)]
1065 // Decrease/increase reduction by comparing opponent's stat score (~10 Elo)
1066 if (ss->statScore >= 0 && (ss-1)->statScore < 0)
1069 else if ((ss-1)->statScore >= 0 && ss->statScore < 0)
1072 // Decrease/increase reduction for moves with a good/bad history (~30 Elo)
1073 r -= ss->statScore / 20000 * ONE_PLY;
1076 Depth d = std::max(newDepth - std::max(r, DEPTH_ZERO), ONE_PLY);
1078 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1080 doFullDepthSearch = (value > alpha && d != newDepth);
1083 doFullDepthSearch = !PvNode || moveCount > 1;
1085 // Step 17. Full depth search when LMR is skipped or fails high
1086 if (doFullDepthSearch)
1087 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1089 // For PV nodes only, do a full PV search on the first move or after a fail
1090 // high (in the latter case search only if value < beta), otherwise let the
1091 // parent node fail low with value <= alpha and try another move.
1092 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1095 (ss+1)->pv[0] = MOVE_NONE;
1097 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, false);
1100 // Step 18. Undo move
1101 pos.undo_move(move);
1103 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1105 // Step 19. Check for a new best move
1106 // Finished searching the move. If a stop occurred, the return value of
1107 // the search cannot be trusted, and we return immediately without
1108 // updating best move, PV and TT.
1109 if (Threads.stop.load(std::memory_order_relaxed))
1114 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1115 thisThread->rootMoves.end(), move);
1117 // PV move or new best move?
1118 if (moveCount == 1 || value > alpha)
1121 rm.selDepth = thisThread->selDepth;
1126 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1127 rm.pv.push_back(*m);
1129 // We record how often the best move has been changed in each
1130 // iteration. This information is used for time management: When
1131 // the best move changes frequently, we allocate some more time.
1132 if (moveCount > 1 && thisThread == Threads.main())
1133 ++static_cast<MainThread*>(thisThread)->bestMoveChanges;
1136 // All other moves but the PV are set to the lowest value: this
1137 // is not a problem when sorting because the sort is stable and the
1138 // move position in the list is preserved - just the PV is pushed up.
1139 rm.score = -VALUE_INFINITE;
1142 if (value > bestValue)
1150 if (PvNode && !rootNode) // Update pv even in fail-high case
1151 update_pv(ss->pv, move, (ss+1)->pv);
1153 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1157 assert(value >= beta); // Fail high
1164 if (move != bestMove)
1166 if (captureOrPromotion && captureCount < 32)
1167 capturesSearched[captureCount++] = move;
1169 else if (!captureOrPromotion && quietCount < 64)
1170 quietsSearched[quietCount++] = move;
1174 // The following condition would detect a stop only after move loop has been
1175 // completed. But in this case bestValue is valid because we have fully
1176 // searched our subtree, and we can anyhow save the result in TT.
1182 // Step 20. Check for mate and stalemate
1183 // All legal moves have been searched and if there are no legal moves, it
1184 // must be a mate or a stalemate. If we are in a singular extension search then
1185 // return a fail low score.
1187 assert(moveCount || !inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1190 bestValue = excludedMove ? alpha
1191 : inCheck ? mated_in(ss->ply) : VALUE_DRAW;
1194 // Quiet best move: update move sorting heuristics
1195 if (!pos.capture_or_promotion(bestMove))
1196 update_quiet_stats(pos, ss, bestMove, quietsSearched, quietCount,
1197 stat_bonus(depth + (bestValue > beta + PawnValueMg ? ONE_PLY : DEPTH_ZERO)));
1199 update_capture_stats(pos, bestMove, capturesSearched, captureCount, stat_bonus(depth + ONE_PLY));
1201 // Extra penalty for a quiet TT or main killer move in previous ply when it gets refuted
1202 if ( ((ss-1)->moveCount == 1 || ((ss-1)->currentMove == (ss-1)->killers[0]))
1203 && !pos.captured_piece())
1204 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + ONE_PLY));
1207 // Bonus for prior countermove that caused the fail low
1208 else if ( (depth >= 3 * ONE_PLY || PvNode)
1209 && !pos.captured_piece())
1210 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth));
1213 bestValue = std::min(bestValue, maxValue);
1216 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1217 bestValue >= beta ? BOUND_LOWER :
1218 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1219 depth, bestMove, pureStaticEval);
1221 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1227 // qsearch() is the quiescence search function, which is called by the main
1228 // search function with depth zero, or recursively with depth less than ONE_PLY.
1229 template <NodeType NT>
1230 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1232 constexpr bool PvNode = NT == PV;
1234 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1235 assert(PvNode || (alpha == beta - 1));
1236 assert(depth <= DEPTH_ZERO);
1237 assert(depth / ONE_PLY * ONE_PLY == depth);
1243 Move ttMove, move, bestMove;
1245 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1246 bool ttHit, pvHit, inCheck, givesCheck, evasionPrunable;
1251 oldAlpha = alpha; // To flag BOUND_EXACT when eval above alpha and no available moves
1253 ss->pv[0] = MOVE_NONE;
1256 Thread* thisThread = pos.this_thread();
1257 (ss+1)->ply = ss->ply + 1;
1258 ss->currentMove = bestMove = MOVE_NONE;
1259 ss->continuationHistory = &thisThread->continuationHistory[NO_PIECE][0];
1260 inCheck = pos.checkers();
1263 // Check for an immediate draw or maximum ply reached
1264 if ( pos.is_draw(ss->ply)
1265 || ss->ply >= MAX_PLY)
1266 return (ss->ply >= MAX_PLY && !inCheck) ? evaluate(pos) : VALUE_DRAW;
1268 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1270 // Decide whether or not to include checks: this fixes also the type of
1271 // TT entry depth that we are going to use. Note that in qsearch we use
1272 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1273 ttDepth = inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1274 : DEPTH_QS_NO_CHECKS;
1275 // Transposition table lookup
1277 tte = TT.probe(posKey, ttHit);
1278 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
1279 ttMove = ttHit ? tte->move() : MOVE_NONE;
1280 pvHit = ttHit && tte->pv_hit();
1284 && tte->depth() >= ttDepth
1285 && ttValue != VALUE_NONE // Only in case of TT access race
1286 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1287 : (tte->bound() & BOUND_UPPER)))
1290 // Evaluate the position statically
1293 ss->staticEval = VALUE_NONE;
1294 bestValue = futilityBase = -VALUE_INFINITE;
1300 // Never assume anything on values stored in TT
1301 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1302 ss->staticEval = bestValue = evaluate(pos);
1304 // Can ttValue be used as a better position evaluation?
1305 if ( ttValue != VALUE_NONE
1306 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1307 bestValue = ttValue;
1310 ss->staticEval = bestValue =
1311 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1312 : -(ss-1)->staticEval + 2 * Eval::Tempo;
1314 // Stand pat. Return immediately if static value is at least beta
1315 if (bestValue >= beta)
1318 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit, BOUND_LOWER,
1319 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1324 if (PvNode && bestValue > alpha)
1327 futilityBase = bestValue + 128;
1330 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory, nullptr, (ss-4)->continuationHistory };
1332 // Initialize a MovePicker object for the current position, and prepare
1333 // to search the moves. Because the depth is <= 0 here, only captures,
1334 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1336 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
1337 &thisThread->captureHistory,
1339 to_sq((ss-1)->currentMove));
1341 // Loop through the moves until no moves remain or a beta cutoff occurs
1342 while ((move = mp.next_move()) != MOVE_NONE)
1344 assert(is_ok(move));
1346 givesCheck = gives_check(pos, move);
1353 && futilityBase > -VALUE_KNOWN_WIN
1354 && !pos.advanced_pawn_push(move))
1356 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1358 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1360 if (futilityValue <= alpha)
1362 bestValue = std::max(bestValue, futilityValue);
1366 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1368 bestValue = std::max(bestValue, futilityBase);
1373 // Detect non-capture evasions that are candidates to be pruned
1374 evasionPrunable = inCheck
1375 && (depth != DEPTH_ZERO || moveCount > 2)
1376 && bestValue > VALUE_MATED_IN_MAX_PLY
1377 && !pos.capture(move);
1379 // Don't search moves with negative SEE values
1380 if ( (!inCheck || evasionPrunable)
1381 && !pos.see_ge(move))
1384 // Speculative prefetch as early as possible
1385 prefetch(TT.first_entry(pos.key_after(move)));
1387 // Check for legality just before making the move
1388 if (!pos.legal(move))
1394 ss->currentMove = move;
1395 ss->continuationHistory = &thisThread->continuationHistory[pos.moved_piece(move)][to_sq(move)];
1397 // Make and search the move
1398 pos.do_move(move, st, givesCheck);
1399 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1400 pos.undo_move(move);
1402 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1404 // Check for a new best move
1405 if (value > bestValue)
1413 if (PvNode) // Update pv even in fail-high case
1414 update_pv(ss->pv, move, (ss+1)->pv);
1416 if (PvNode && value < beta) // Update alpha here!
1424 // All legal moves have been searched. A special case: If we're in check
1425 // and no legal moves were found, it is checkmate.
1426 if (inCheck && bestValue == -VALUE_INFINITE)
1427 return mated_in(ss->ply); // Plies to mate from the root
1429 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1430 bestValue >= beta ? BOUND_LOWER :
1431 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1432 ttDepth, bestMove, ss->staticEval);
1434 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1440 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1441 // "plies to mate from the current position". Non-mate scores are unchanged.
1442 // The function is called before storing a value in the transposition table.
1444 Value value_to_tt(Value v, int ply) {
1446 assert(v != VALUE_NONE);
1448 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1449 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1453 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1454 // from the transposition table (which refers to the plies to mate/be mated
1455 // from current position) to "plies to mate/be mated from the root".
1457 Value value_from_tt(Value v, int ply) {
1459 return v == VALUE_NONE ? VALUE_NONE
1460 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1461 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1465 // update_pv() adds current move and appends child pv[]
1467 void update_pv(Move* pv, Move move, Move* childPv) {
1469 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1475 // update_continuation_histories() updates histories of the move pairs formed
1476 // by moves at ply -1, -2, and -4 with current move.
1478 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1480 for (int i : {1, 2, 4})
1481 if (is_ok((ss-i)->currentMove))
1482 (*(ss-i)->continuationHistory)[pc][to] << bonus;
1486 // update_capture_stats() updates move sorting heuristics when a new capture best move is found
1488 void update_capture_stats(const Position& pos, Move move,
1489 Move* captures, int captureCount, int bonus) {
1491 CapturePieceToHistory& captureHistory = pos.this_thread()->captureHistory;
1492 Piece moved_piece = pos.moved_piece(move);
1493 PieceType captured = type_of(pos.piece_on(to_sq(move)));
1495 if (pos.capture_or_promotion(move))
1496 captureHistory[moved_piece][to_sq(move)][captured] << bonus;
1498 // Decrease all the other played capture moves
1499 for (int i = 0; i < captureCount; ++i)
1501 moved_piece = pos.moved_piece(captures[i]);
1502 captured = type_of(pos.piece_on(to_sq(captures[i])));
1503 captureHistory[moved_piece][to_sq(captures[i])][captured] << -bonus;
1508 // update_quiet_stats() updates move sorting heuristics when a new quiet best move is found
1510 void update_quiet_stats(const Position& pos, Stack* ss, Move move,
1511 Move* quiets, int quietCount, int bonus) {
1513 if (ss->killers[0] != move)
1515 ss->killers[1] = ss->killers[0];
1516 ss->killers[0] = move;
1519 Color us = pos.side_to_move();
1520 Thread* thisThread = pos.this_thread();
1521 thisThread->mainHistory[us][from_to(move)] << bonus;
1522 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1524 if (is_ok((ss-1)->currentMove))
1526 Square prevSq = to_sq((ss-1)->currentMove);
1527 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1530 // Decrease all the other played quiet moves
1531 for (int i = 0; i < quietCount; ++i)
1533 thisThread->mainHistory[us][from_to(quiets[i])] << -bonus;
1534 update_continuation_histories(ss, pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
1538 // When playing with strength handicap, choose best move among a set of RootMoves
1539 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1541 Move Skill::pick_best(size_t multiPV) {
1543 const RootMoves& rootMoves = Threads.main()->rootMoves;
1544 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1546 // RootMoves are already sorted by score in descending order
1547 Value topScore = rootMoves[0].score;
1548 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1549 int weakness = 120 - 2 * level;
1550 int maxScore = -VALUE_INFINITE;
1552 // Choose best move. For each move score we add two terms, both dependent on
1553 // weakness. One is deterministic and bigger for weaker levels, and one is
1554 // random. Then we choose the move with the resulting highest score.
1555 for (size_t i = 0; i < multiPV; ++i)
1557 // This is our magic formula
1558 int push = ( weakness * int(topScore - rootMoves[i].score)
1559 + delta * (rng.rand<unsigned>() % weakness)) / 128;
1561 if (rootMoves[i].score + push >= maxScore)
1563 maxScore = rootMoves[i].score + push;
1564 best = rootMoves[i].pv[0];
1573 /// MainThread::check_time() is used to print debug info and, more importantly,
1574 /// to detect when we are out of available time and thus stop the search.
1576 void MainThread::check_time() {
1581 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1582 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1584 static TimePoint lastInfoTime = now();
1586 TimePoint elapsed = Time.elapsed();
1587 TimePoint tick = Limits.startTime + elapsed;
1589 if (tick - lastInfoTime >= 1000)
1591 lastInfoTime = tick;
1595 // We should not stop pondering until told so by the GUI
1599 if ( (Limits.use_time_management() && (elapsed > Time.maximum() - 10 || stopOnPonderhit))
1600 || (Limits.movetime && elapsed >= Limits.movetime)
1601 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1602 Threads.stop = true;
1606 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1607 /// that all (if any) unsearched PV lines are sent using a previous search score.
1609 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1611 std::stringstream ss;
1612 TimePoint elapsed = Time.elapsed() + 1;
1613 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1614 size_t pvIdx = pos.this_thread()->pvIdx;
1615 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1616 uint64_t nodesSearched = Threads.nodes_searched();
1617 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1619 for (size_t i = 0; i < multiPV; ++i)
1621 bool updated = (i <= pvIdx && rootMoves[i].score != -VALUE_INFINITE);
1623 if (depth == ONE_PLY && !updated)
1626 Depth d = updated ? depth : depth - ONE_PLY;
1627 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1629 bool tb = TB::RootInTB && abs(v) < VALUE_MATE - MAX_PLY;
1630 v = tb ? rootMoves[i].tbScore : v;
1632 if (ss.rdbuf()->in_avail()) // Not at first line
1636 << " depth " << d / ONE_PLY
1637 << " seldepth " << rootMoves[i].selDepth
1638 << " multipv " << i + 1
1639 << " score " << UCI::value(v);
1641 if (!tb && i == pvIdx)
1642 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1644 ss << " nodes " << nodesSearched
1645 << " nps " << nodesSearched * 1000 / elapsed;
1647 if (elapsed > 1000) // Earlier makes little sense
1648 ss << " hashfull " << TT.hashfull();
1650 ss << " tbhits " << tbHits
1651 << " time " << elapsed
1654 for (Move m : rootMoves[i].pv)
1655 ss << " " << UCI::move(m, pos.is_chess960());
1662 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1663 /// before exiting the search, for instance, in case we stop the search during a
1664 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1665 /// otherwise in case of 'ponder on' we have nothing to think on.
1667 bool RootMove::extract_ponder_from_tt(Position& pos) {
1672 assert(pv.size() == 1);
1674 if (pv[0] == MOVE_NONE)
1677 pos.do_move(pv[0], st);
1678 TTEntry* tte = TT.probe(pos.key(), ttHit);
1682 Move m = tte->move(); // Local copy to be SMP safe
1683 if (MoveList<LEGAL>(pos).contains(m))
1687 pos.undo_move(pv[0]);
1688 return pv.size() > 1;
1691 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1694 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1695 ProbeDepth = int(Options["SyzygyProbeDepth"]) * ONE_PLY;
1696 Cardinality = int(Options["SyzygyProbeLimit"]);
1697 bool dtz_available = true;
1699 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1700 // ProbeDepth == DEPTH_ZERO
1701 if (Cardinality > MaxCardinality)
1703 Cardinality = MaxCardinality;
1704 ProbeDepth = DEPTH_ZERO;
1707 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1709 // Rank moves using DTZ tables
1710 RootInTB = root_probe(pos, rootMoves);
1714 // DTZ tables are missing; try to rank moves using WDL tables
1715 dtz_available = false;
1716 RootInTB = root_probe_wdl(pos, rootMoves);
1722 // Sort moves according to TB rank
1723 std::sort(rootMoves.begin(), rootMoves.end(),
1724 [](const RootMove &a, const RootMove &b) { return a.tbRank > b.tbRank; } );
1726 // Probe during search only if DTZ is not available and we are winning
1727 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
1732 // Assign the same rank to all moves
1733 for (auto& m : rootMoves)