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 = 600;
66 Value futility_margin(Depth d, bool improving) {
67 return Value((175 - 50 * improving) * d / ONE_PLY);
70 // Reductions lookup table, initialized at startup
71 int Reductions[64]; // [depth or moveNumber]
73 template <bool PvNode> Depth reduction(bool i, Depth d, int mn) {
74 int r = Reductions[std::min(d / ONE_PLY, 63)] * Reductions[std::min(mn, 63)] / 1024;
75 return ((r + 512) / 1024 + (!i && r > 1024) - PvNode) * 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 ? 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 // perft() is our utility to verify move generation. All the leaf nodes up
120 // to the given depth are generated and counted, and the sum is returned.
122 uint64_t perft(Position& pos, Depth depth) {
125 uint64_t cnt, nodes = 0;
126 const bool leaf = (depth == 2 * ONE_PLY);
128 for (const auto& m : MoveList<LEGAL>(pos))
130 if (Root && depth <= ONE_PLY)
135 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - ONE_PLY);
140 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
148 /// Search::init() is called at startup to initialize various lookup tables
150 void Search::init() {
152 for (int i = 1; i < 64; ++i)
153 Reductions[i] = int(1024 * std::log(i) / std::sqrt(1.95));
157 /// Search::clear() resets search state to its initial value
159 void Search::clear() {
161 Threads.main()->wait_for_search_finished();
163 Time.availableNodes = 0;
166 Tablebases::init(Options["SyzygyPath"]); // Free up mapped files
170 /// MainThread::search() is called by the main thread when the program receives
171 /// the UCI 'go' command. It searches from the root position and outputs the "bestmove".
173 void MainThread::search() {
177 nodes = perft<true>(rootPos, Limits.perft * ONE_PLY);
178 sync_cout << "\nNodes searched: " << nodes << "\n" << sync_endl;
182 Color us = rootPos.side_to_move();
183 Time.init(Limits, us, rootPos.game_ply());
186 if (rootMoves.empty())
188 rootMoves.emplace_back(MOVE_NONE);
189 sync_cout << "info depth 0 score "
190 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
195 for (Thread* th : Threads)
197 th->start_searching();
199 Thread::search(); // Let's start searching!
202 // When we reach the maximum depth, we can arrive here without a raise of
203 // Threads.stop. However, if we are pondering or in an infinite search,
204 // the UCI protocol states that we shouldn't print the best move before the
205 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
206 // until the GUI sends one of those commands.
208 while (!Threads.stop && (ponder || Limits.infinite))
209 {} // Busy wait for a stop or a ponder reset
211 // Stop the threads if not already stopped (also raise the stop if
212 // "ponderhit" just reset Threads.ponder).
215 // Wait until all threads have finished
216 for (Thread* th : Threads)
218 th->wait_for_search_finished();
220 // When playing in 'nodes as time' mode, subtract the searched nodes from
221 // the available ones before exiting.
223 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
225 // Check if there are threads with a better score than main thread
226 Thread* bestThread = this;
227 if ( Options["MultiPV"] == 1
229 && !Skill(Options["Skill Level"]).enabled()
230 && rootMoves[0].pv[0] != MOVE_NONE)
232 std::map<Move, int64_t> votes;
233 Value minScore = this->rootMoves[0].score;
235 // Find out minimum score and reset votes for moves which can be voted
236 for (Thread* th: Threads)
237 minScore = std::min(minScore, th->rootMoves[0].score);
239 // Vote according to score and depth
240 for (Thread* th : Threads)
242 int64_t s = th->rootMoves[0].score - minScore + 1;
243 votes[th->rootMoves[0].pv[0]] += 200 + s * s * int(th->completedDepth);
246 // Select best thread
247 auto bestVote = votes[this->rootMoves[0].pv[0]];
248 for (Thread* th : Threads)
249 if (votes[th->rootMoves[0].pv[0]] > bestVote)
251 bestVote = votes[th->rootMoves[0].pv[0]];
256 previousScore = bestThread->rootMoves[0].score;
258 // Send again PV info if we have a new best thread
259 if (bestThread != this)
260 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth, -VALUE_INFINITE, VALUE_INFINITE) << sync_endl;
262 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
264 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
265 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
267 std::cout << sync_endl;
271 /// Thread::search() is the main iterative deepening loop. It calls search()
272 /// repeatedly with increasing depth until the allocated thinking time has been
273 /// consumed, the user stops the search, or the maximum search depth is reached.
275 void Thread::search() {
277 // To allow access to (ss-5) up to (ss+2), the stack must be oversized.
278 // The former is needed to allow update_continuation_histories(ss-1, ...),
279 // which accesses its argument at ss-4, also near the root.
280 // The latter is needed for statScores and killer initialization.
281 Stack stack[MAX_PLY+10], *ss = stack+7;
283 Value bestValue, alpha, beta, delta;
284 Move lastBestMove = MOVE_NONE;
285 Depth lastBestMoveDepth = DEPTH_ZERO;
286 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
287 double timeReduction = 1.0;
288 Color us = rootPos.side_to_move();
290 std::memset(ss-7, 0, 10 * sizeof(Stack));
291 for (int i = 7; i > 0; i--)
292 (ss-i)->continuationHistory = &this->continuationHistory[NO_PIECE][0]; // Use as sentinel
295 bestValue = delta = alpha = -VALUE_INFINITE;
296 beta = VALUE_INFINITE;
299 mainThread->bestMoveChanges = 0;
301 size_t multiPV = Options["MultiPV"];
302 Skill skill(Options["Skill Level"]);
304 // When playing with strength handicap enable MultiPV search that we will
305 // use behind the scenes to retrieve a set of possible moves.
307 multiPV = std::max(multiPV, (size_t)4);
309 multiPV = std::min(multiPV, rootMoves.size());
311 int ct = int(Options["Contempt"]) * PawnValueEg / 100; // From centipawns
313 // In analysis mode, adjust contempt in accordance with user preference
314 if (Limits.infinite || Options["UCI_AnalyseMode"])
315 ct = Options["Analysis Contempt"] == "Off" ? 0
316 : Options["Analysis Contempt"] == "Both" ? ct
317 : Options["Analysis Contempt"] == "White" && us == BLACK ? -ct
318 : Options["Analysis Contempt"] == "Black" && us == WHITE ? -ct
321 // In evaluate.cpp the evaluation is from the white point of view
322 contempt = (us == WHITE ? make_score(ct, ct / 2)
323 : -make_score(ct, ct / 2));
325 // Iterative deepening loop until requested to stop or the target depth is reached
326 while ( (rootDepth += ONE_PLY) < DEPTH_MAX
328 && !(Limits.depth && mainThread && rootDepth / ONE_PLY > Limits.depth))
330 // Age out PV variability metric
332 mainThread->bestMoveChanges *= 0.517;
334 // Save the last iteration's scores before first PV line is searched and
335 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
336 for (RootMove& rm : rootMoves)
337 rm.previousScore = rm.score;
342 // MultiPV loop. We perform a full root search for each PV line
343 for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
348 for (pvLast++; pvLast < rootMoves.size(); pvLast++)
349 if (rootMoves[pvLast].tbRank != rootMoves[pvFirst].tbRank)
353 // Reset UCI info selDepth for each depth and each PV line
356 // Reset aspiration window starting size
357 if (rootDepth >= 5 * ONE_PLY)
359 Value previousScore = rootMoves[pvIdx].previousScore;
361 alpha = std::max(previousScore - delta,-VALUE_INFINITE);
362 beta = std::min(previousScore + delta, VALUE_INFINITE);
364 // Adjust contempt based on root move's previousScore (dynamic contempt)
365 int dct = ct + 88 * previousScore / (abs(previousScore) + 200);
367 contempt = (us == WHITE ? make_score(dct, dct / 2)
368 : -make_score(dct, dct / 2));
371 // Start with a small aspiration window and, in the case of a fail
372 // high/low, re-search with a bigger window until we don't fail
374 int failedHighCnt = 0;
377 Depth adjustedDepth = std::max(ONE_PLY, rootDepth - failedHighCnt * ONE_PLY);
378 bestValue = ::search<PV>(rootPos, ss, alpha, beta, adjustedDepth, false);
380 // Bring the best move to the front. It is critical that sorting
381 // is done with a stable algorithm because all the values but the
382 // first and eventually the new best one are set to -VALUE_INFINITE
383 // and we want to keep the same order for all the moves except the
384 // new PV that goes to the front. Note that in case of MultiPV
385 // search the already searched PV lines are preserved.
386 std::stable_sort(rootMoves.begin() + pvIdx, rootMoves.begin() + pvLast);
388 // If search has been stopped, we break immediately. Sorting is
389 // safe because RootMoves is still valid, although it refers to
390 // the previous iteration.
394 // When failing high/low give some update (without cluttering
395 // the UI) before a re-search.
398 && (bestValue <= alpha || bestValue >= beta)
399 && Time.elapsed() > 3000)
400 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
402 // In case of failing low/high increase aspiration window and
403 // re-search, otherwise exit the loop.
404 if (bestValue <= alpha)
406 beta = (alpha + beta) / 2;
407 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
412 mainThread->stopOnPonderhit = false;
415 else if (bestValue >= beta)
417 beta = std::min(bestValue + delta, VALUE_INFINITE);
424 delta += delta / 4 + 5;
426 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
429 // Sort the PV lines searched so far and update the GUI
430 std::stable_sort(rootMoves.begin() + pvFirst, rootMoves.begin() + pvIdx + 1);
433 && (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
434 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
438 completedDepth = rootDepth;
440 if (rootMoves[0].pv[0] != lastBestMove) {
441 lastBestMove = rootMoves[0].pv[0];
442 lastBestMoveDepth = rootDepth;
445 // Have we found a "mate in x"?
447 && bestValue >= VALUE_MATE_IN_MAX_PLY
448 && VALUE_MATE - bestValue <= 2 * Limits.mate)
454 // If skill level is enabled and time is up, pick a sub-optimal best move
455 if (skill.enabled() && skill.time_to_pick(rootDepth))
456 skill.pick_best(multiPV);
458 // Do we have time for the next iteration? Can we stop searching now?
459 if ( Limits.use_time_management()
461 && !mainThread->stopOnPonderhit)
463 double fallingEval = (306 + 9 * (mainThread->previousScore - bestValue)) / 581.0;
464 fallingEval = std::max(0.5, std::min(1.5, fallingEval));
466 // If the bestMove is stable over several iterations, reduce time accordingly
467 timeReduction = lastBestMoveDepth + 10 * ONE_PLY < completedDepth ? 1.95 : 1.0;
468 double reduction = std::pow(mainThread->previousTimeReduction, 0.528) / timeReduction;
470 // Use part of the gained time from a previous stable move for the current move
471 double bestMoveInstability = 1.0 + mainThread->bestMoveChanges;
473 // Stop the search if we have only one legal move, or if available time elapsed
474 if ( rootMoves.size() == 1
475 || Time.elapsed() > Time.optimum() * fallingEval * reduction * bestMoveInstability)
477 // If we are allowed to ponder do not stop the search now but
478 // keep pondering until the GUI sends "ponderhit" or "stop".
479 if (mainThread->ponder)
480 mainThread->stopOnPonderhit = true;
490 mainThread->previousTimeReduction = timeReduction;
492 // If skill level is enabled, swap best PV line with the sub-optimal one
494 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
495 skill.best ? skill.best : skill.pick_best(multiPV)));
501 // search<>() is the main search function for both PV and non-PV nodes
503 template <NodeType NT>
504 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
506 constexpr bool PvNode = NT == PV;
507 const bool rootNode = PvNode && ss->ply == 0;
509 // Check if we have an upcoming move which draws by repetition, or
510 // if the opponent had an alternative move earlier to this position.
511 if ( pos.rule50_count() >= 3
512 && alpha < VALUE_DRAW
514 && pos.has_game_cycle(ss->ply))
516 alpha = value_draw(depth, pos.this_thread());
521 // Dive into quiescence search when the depth reaches zero
523 return qsearch<NT>(pos, ss, alpha, beta);
525 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
526 assert(PvNode || (alpha == beta - 1));
527 assert(DEPTH_ZERO < depth && depth < DEPTH_MAX);
528 assert(!(PvNode && cutNode));
529 assert(depth / ONE_PLY * ONE_PLY == depth);
531 Move pv[MAX_PLY+1], capturesSearched[32], quietsSearched[64];
535 Move ttMove, move, excludedMove, bestMove;
536 Depth extension, newDepth;
537 Value bestValue, value, ttValue, eval, maxValue, pureStaticEval;
538 bool ttHit, ttPv, inCheck, givesCheck, improving;
539 bool captureOrPromotion, doFullDepthSearch, moveCountPruning, ttCapture;
541 int moveCount, captureCount, quietCount;
543 // Step 1. Initialize node
544 Thread* thisThread = pos.this_thread();
545 inCheck = pos.checkers();
546 Color us = pos.side_to_move();
547 moveCount = captureCount = quietCount = ss->moveCount = 0;
548 bestValue = -VALUE_INFINITE;
549 maxValue = VALUE_INFINITE;
551 // Check for the available remaining time
552 if (thisThread == Threads.main())
553 static_cast<MainThread*>(thisThread)->check_time();
555 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
556 if (PvNode && thisThread->selDepth < ss->ply + 1)
557 thisThread->selDepth = ss->ply + 1;
561 // Step 2. Check for aborted search and immediate draw
562 if ( Threads.stop.load(std::memory_order_relaxed)
563 || pos.is_draw(ss->ply)
564 || ss->ply >= MAX_PLY)
565 return (ss->ply >= MAX_PLY && !inCheck) ? evaluate(pos)
566 : value_draw(depth, pos.this_thread());
568 // Step 3. Mate distance pruning. Even if we mate at the next move our score
569 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
570 // a shorter mate was found upward in the tree then there is no need to search
571 // because we will never beat the current alpha. Same logic but with reversed
572 // signs applies also in the opposite condition of being mated instead of giving
573 // mate. In this case return a fail-high score.
574 alpha = std::max(mated_in(ss->ply), alpha);
575 beta = std::min(mate_in(ss->ply+1), beta);
580 assert(0 <= ss->ply && ss->ply < MAX_PLY);
582 (ss+1)->ply = ss->ply + 1;
583 ss->currentMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
584 ss->continuationHistory = &thisThread->continuationHistory[NO_PIECE][0];
585 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
586 Square prevSq = to_sq((ss-1)->currentMove);
588 // Initialize statScore to zero for the grandchildren of the current position.
589 // So statScore is shared between all grandchildren and only the first grandchild
590 // starts with statScore = 0. Later grandchildren start with the last calculated
591 // statScore of the previous grandchild. This influences the reduction rules in
592 // LMR which are based on the statScore of parent position.
593 (ss+2)->statScore = 0;
595 // Step 4. Transposition table lookup. We don't want the score of a partial
596 // search to overwrite a previous full search TT value, so we use a different
597 // position key in case of an excluded move.
598 excludedMove = ss->excludedMove;
599 posKey = pos.key() ^ Key(excludedMove << 16); // Isn't a very good hash
600 tte = TT.probe(posKey, ttHit);
601 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
602 ttMove = rootNode ? thisThread->rootMoves[thisThread->pvIdx].pv[0]
603 : ttHit ? tte->move() : MOVE_NONE;
604 ttPv = (ttHit && tte->is_pv()) || (PvNode && depth > 4 * ONE_PLY);
606 // At non-PV nodes we check for an early TT cutoff
609 && tte->depth() >= depth
610 && ttValue != VALUE_NONE // Possible in case of TT access race
611 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
612 : (tte->bound() & BOUND_UPPER)))
614 // If ttMove is quiet, update move sorting heuristics on TT hit
619 if (!pos.capture_or_promotion(ttMove))
620 update_quiet_stats(pos, ss, ttMove, nullptr, 0, stat_bonus(depth));
622 // Extra penalty for a quiet TT or main killer move in previous ply when it gets refuted
623 if ( ((ss-1)->moveCount == 1 || (ss-1)->currentMove == (ss-1)->killers[0])
624 && !pos.captured_piece())
625 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + ONE_PLY));
627 // Penalty for a quiet ttMove that fails low
628 else if (!pos.capture_or_promotion(ttMove))
630 int penalty = -stat_bonus(depth);
631 thisThread->mainHistory[us][from_to(ttMove)] << penalty;
632 update_continuation_histories(ss, pos.moved_piece(ttMove), to_sq(ttMove), penalty);
638 // Step 5. Tablebases probe
639 if (!rootNode && TB::Cardinality)
641 int piecesCount = pos.count<ALL_PIECES>();
643 if ( piecesCount <= TB::Cardinality
644 && (piecesCount < TB::Cardinality || depth >= TB::ProbeDepth)
645 && pos.rule50_count() == 0
646 && !pos.can_castle(ANY_CASTLING))
649 TB::WDLScore wdl = Tablebases::probe_wdl(pos, &err);
651 // Force check of time on the next occasion
652 if (thisThread == Threads.main())
653 static_cast<MainThread*>(thisThread)->callsCnt = 0;
655 if (err != TB::ProbeState::FAIL)
657 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
659 int drawScore = TB::UseRule50 ? 1 : 0;
661 value = wdl < -drawScore ? -VALUE_MATE + MAX_PLY + ss->ply + 1
662 : wdl > drawScore ? VALUE_MATE - MAX_PLY - ss->ply - 1
663 : VALUE_DRAW + 2 * wdl * drawScore;
665 Bound b = wdl < -drawScore ? BOUND_UPPER
666 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
668 if ( b == BOUND_EXACT
669 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
671 tte->save(posKey, value_to_tt(value, ss->ply), ttPv, b,
672 std::min(DEPTH_MAX - ONE_PLY, depth + 6 * ONE_PLY),
673 MOVE_NONE, VALUE_NONE);
680 if (b == BOUND_LOWER)
681 bestValue = value, alpha = std::max(alpha, bestValue);
689 // Step 6. Static evaluation of the position
692 ss->staticEval = eval = pureStaticEval = VALUE_NONE;
694 goto moves_loop; // Skip early pruning when in check
698 // Never assume anything on values stored in TT
699 ss->staticEval = eval = pureStaticEval = tte->eval();
700 if (eval == VALUE_NONE)
701 ss->staticEval = eval = pureStaticEval = evaluate(pos);
703 // Can ttValue be used as a better position evaluation?
704 if ( ttValue != VALUE_NONE
705 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
710 if ((ss-1)->currentMove != MOVE_NULL)
712 int bonus = -(ss-1)->statScore / 512;
714 pureStaticEval = evaluate(pos);
715 ss->staticEval = eval = pureStaticEval + bonus;
718 ss->staticEval = eval = pureStaticEval = -(ss-1)->staticEval + 2 * Eval::Tempo;
720 tte->save(posKey, VALUE_NONE, ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, pureStaticEval);
723 // Step 7. Razoring (~2 Elo)
724 if ( !rootNode // The required rootNode PV handling is not available in qsearch
725 && depth < 2 * ONE_PLY
726 && eval <= alpha - RazorMargin)
727 return qsearch<NT>(pos, ss, alpha, beta);
729 improving = ss->staticEval >= (ss-2)->staticEval
730 || (ss-2)->staticEval == VALUE_NONE;
732 // Step 8. Futility pruning: child node (~30 Elo)
734 && depth < 7 * ONE_PLY
735 && eval - futility_margin(depth, improving) >= beta
736 && eval < VALUE_KNOWN_WIN) // Do not return unproven wins
739 // Step 9. Null move search with verification search (~40 Elo)
741 && (ss-1)->currentMove != MOVE_NULL
742 && (ss-1)->statScore < 23200
744 && pureStaticEval >= beta - 36 * depth / ONE_PLY + 225
746 && pos.non_pawn_material(us)
747 && (ss->ply >= thisThread->nmpMinPly || us != thisThread->nmpColor))
749 assert(eval - beta >= 0);
751 // Null move dynamic reduction based on depth and value
752 Depth R = ((823 + 67 * depth / ONE_PLY) / 256 + std::min(int(eval - beta) / 200, 3)) * ONE_PLY;
754 ss->currentMove = MOVE_NULL;
755 ss->continuationHistory = &thisThread->continuationHistory[NO_PIECE][0];
757 pos.do_null_move(st);
759 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
761 pos.undo_null_move();
763 if (nullValue >= beta)
765 // Do not return unproven mate scores
766 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
769 if (thisThread->nmpMinPly || (abs(beta) < VALUE_KNOWN_WIN && depth < 12 * ONE_PLY))
772 assert(!thisThread->nmpMinPly); // Recursive verification is not allowed
774 // Do verification search at high depths, with null move pruning disabled
775 // for us, until ply exceeds nmpMinPly.
776 thisThread->nmpMinPly = ss->ply + 3 * (depth-R) / 4;
777 thisThread->nmpColor = us;
779 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
781 thisThread->nmpMinPly = 0;
788 // Step 10. ProbCut (~10 Elo)
789 // If we have a good enough capture and a reduced search returns a value
790 // much above beta, we can (almost) safely prune the previous move.
792 && depth >= 5 * ONE_PLY
793 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
795 Value raisedBeta = std::min(beta + 216 - 48 * improving, VALUE_INFINITE);
796 MovePicker mp(pos, ttMove, raisedBeta - ss->staticEval, &thisThread->captureHistory);
797 int probCutCount = 0;
799 while ( (move = mp.next_move()) != MOVE_NONE
800 && probCutCount < 2 + 2 * cutNode)
801 if (move != excludedMove && pos.legal(move))
805 ss->currentMove = move;
806 ss->continuationHistory = &thisThread->continuationHistory[pos.moved_piece(move)][to_sq(move)];
808 assert(depth >= 5 * ONE_PLY);
810 pos.do_move(move, st);
812 // Perform a preliminary qsearch to verify that the move holds
813 value = -qsearch<NonPV>(pos, ss+1, -raisedBeta, -raisedBeta+1);
815 // If the qsearch held, perform the regular search
816 if (value >= raisedBeta)
817 value = -search<NonPV>(pos, ss+1, -raisedBeta, -raisedBeta+1, depth - 4 * ONE_PLY, !cutNode);
821 if (value >= raisedBeta)
826 // Step 11. Internal iterative deepening (~2 Elo)
827 if ( depth >= 8 * ONE_PLY
830 search<NT>(pos, ss, alpha, beta, depth - 7 * ONE_PLY, cutNode);
832 tte = TT.probe(posKey, ttHit);
833 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
834 ttMove = ttHit ? tte->move() : MOVE_NONE;
837 moves_loop: // When in check, search starts from here
839 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
840 nullptr, (ss-4)->continuationHistory,
841 nullptr, (ss-6)->continuationHistory };
842 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
844 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
845 &thisThread->captureHistory,
849 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
851 moveCountPruning = false;
852 ttCapture = ttMove && pos.capture_or_promotion(ttMove);
854 // Step 12. Loop through all pseudo-legal moves until no moves remain
855 // or a beta cutoff occurs.
856 while ((move = mp.next_move(moveCountPruning)) != MOVE_NONE)
860 if (move == excludedMove)
863 // At root obey the "searchmoves" option and skip moves not listed in Root
864 // Move List. As a consequence any illegal move is also skipped. In MultiPV
865 // mode we also skip PV moves which have been already searched and those
866 // of lower "TB rank" if we are in a TB root position.
867 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->pvIdx,
868 thisThread->rootMoves.begin() + thisThread->pvLast, move))
871 ss->moveCount = ++moveCount;
873 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
874 sync_cout << "info depth " << depth / ONE_PLY
875 << " currmove " << UCI::move(move, pos.is_chess960())
876 << " currmovenumber " << moveCount + thisThread->pvIdx << sync_endl;
878 (ss+1)->pv = nullptr;
880 extension = DEPTH_ZERO;
881 captureOrPromotion = pos.capture_or_promotion(move);
882 movedPiece = pos.moved_piece(move);
883 givesCheck = pos.gives_check(move);
885 // Step 13. Extensions (~70 Elo)
887 // Singular extension search (~60 Elo). If all moves but one fail low on a
888 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
889 // then that move is singular and should be extended. To verify this we do
890 // a reduced search on all the other moves but the ttMove and if the
891 // result is lower than ttValue minus a margin then we will extend the ttMove.
892 if ( depth >= 8 * ONE_PLY
895 && !excludedMove // Avoid recursive singular search
896 /* && ttValue != VALUE_NONE Already implicit in the next condition */
897 && abs(ttValue) < VALUE_KNOWN_WIN
898 && (tte->bound() & BOUND_LOWER)
899 && tte->depth() >= depth - 3 * ONE_PLY
902 Value singularBeta = ttValue - 2 * depth / ONE_PLY;
903 ss->excludedMove = move;
904 value = search<NonPV>(pos, ss, singularBeta - 1, singularBeta, depth / 2, cutNode);
905 ss->excludedMove = MOVE_NONE;
907 if (value < singularBeta)
911 // Our ttMove is assumed to fail high, and now we failed high also on a reduced
912 // search without the ttMove. So we assume this expected Cut-node is not singular,
913 // that is multiple moves fail high, and we can prune the whole subtree by returning
914 // the hard beta bound.
915 else if (cutNode && singularBeta > beta)
919 // Check extension (~2 Elo)
921 && (pos.blockers_for_king(~us) & from_sq(move) || pos.see_ge(move)))
924 // Castling extension
925 else if (type_of(move) == CASTLING)
928 // Calculate new depth for this move
929 newDepth = depth - ONE_PLY + extension;
931 // Step 14. Pruning at shallow depth (~170 Elo)
933 && pos.non_pawn_material(us)
934 && bestValue > VALUE_MATED_IN_MAX_PLY)
936 // Skip quiet moves if movecount exceeds our FutilityMoveCount threshold
937 moveCountPruning = moveCount >= futility_move_count(improving,depth / ONE_PLY);
939 if ( !captureOrPromotion
941 && !pos.advanced_pawn_push(move))
943 // Move count based pruning (~30 Elo)
944 if (moveCountPruning)
947 // Reduced depth of the next LMR search
948 int lmrDepth = std::max(newDepth - reduction<PvNode>(improving, depth, moveCount), DEPTH_ZERO) / ONE_PLY;
950 // Countermoves based pruning (~20 Elo)
951 if ( lmrDepth < 3 + ((ss-1)->statScore > 0 || (ss-1)->moveCount == 1)
952 && (*contHist[0])[movedPiece][to_sq(move)] < CounterMovePruneThreshold
953 && (*contHist[1])[movedPiece][to_sq(move)] < CounterMovePruneThreshold)
956 // Futility pruning: parent node (~2 Elo)
959 && ss->staticEval + 256 + 200 * lmrDepth <= alpha)
962 // Prune moves with negative SEE (~10 Elo)
963 if (!pos.see_ge(move, Value(-29 * lmrDepth * lmrDepth)))
966 else if (!pos.see_ge(move, -PawnValueEg * (depth / ONE_PLY))) // (~20 Elo)
970 // Speculative prefetch as early as possible
971 prefetch(TT.first_entry(pos.key_after(move)));
973 // Check for legality just before making the move
974 if (!rootNode && !pos.legal(move))
976 ss->moveCount = --moveCount;
980 // Update the current move (this must be done after singular extension search)
981 ss->currentMove = move;
982 ss->continuationHistory = &thisThread->continuationHistory[movedPiece][to_sq(move)];
984 // Step 15. Make the move
985 pos.do_move(move, st, givesCheck);
987 // Step 16. Reduced depth search (LMR). If the move fails high it will be
988 // re-searched at full depth.
989 if ( depth >= 3 * ONE_PLY
991 && (!captureOrPromotion || moveCountPruning))
993 Depth r = reduction<PvNode>(improving, depth, moveCount);
995 // Decrease reduction if position is or has been on the PV
999 // Decrease reduction if opponent's move count is high (~10 Elo)
1000 if ((ss-1)->moveCount > 15)
1003 if (!captureOrPromotion)
1005 // Increase reduction if ttMove is a capture (~0 Elo)
1009 // Increase reduction for cut nodes (~5 Elo)
1013 // Decrease reduction for moves that escape a capture. Filter out
1014 // castling moves, because they are coded as "king captures rook" and
1015 // hence break make_move(). (~5 Elo)
1016 else if ( type_of(move) == NORMAL
1017 && !pos.see_ge(make_move(to_sq(move), from_sq(move))))
1020 ss->statScore = thisThread->mainHistory[us][from_to(move)]
1021 + (*contHist[0])[movedPiece][to_sq(move)]
1022 + (*contHist[1])[movedPiece][to_sq(move)]
1023 + (*contHist[3])[movedPiece][to_sq(move)]
1026 // Decrease/increase reduction by comparing opponent's stat score (~10 Elo)
1027 if (ss->statScore >= 0 && (ss-1)->statScore < 0)
1030 else if ((ss-1)->statScore >= 0 && ss->statScore < 0)
1033 // Decrease/increase reduction for moves with a good/bad history (~30 Elo)
1034 r -= ss->statScore / 20000 * ONE_PLY;
1037 Depth d = std::max(newDepth - std::max(r, DEPTH_ZERO), ONE_PLY);
1039 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1041 doFullDepthSearch = (value > alpha && d != newDepth);
1044 doFullDepthSearch = !PvNode || moveCount > 1;
1046 // Step 17. Full depth search when LMR is skipped or fails high
1047 if (doFullDepthSearch)
1048 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1050 // For PV nodes only, do a full PV search on the first move or after a fail
1051 // high (in the latter case search only if value < beta), otherwise let the
1052 // parent node fail low with value <= alpha and try another move.
1053 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1056 (ss+1)->pv[0] = MOVE_NONE;
1058 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, false);
1061 // Step 18. Undo move
1062 pos.undo_move(move);
1064 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1066 // Step 19. Check for a new best move
1067 // Finished searching the move. If a stop occurred, the return value of
1068 // the search cannot be trusted, and we return immediately without
1069 // updating best move, PV and TT.
1070 if (Threads.stop.load(std::memory_order_relaxed))
1075 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1076 thisThread->rootMoves.end(), move);
1078 // PV move or new best move?
1079 if (moveCount == 1 || value > alpha)
1082 rm.selDepth = thisThread->selDepth;
1087 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1088 rm.pv.push_back(*m);
1090 // We record how often the best move has been changed in each
1091 // iteration. This information is used for time management: When
1092 // the best move changes frequently, we allocate some more time.
1093 if (moveCount > 1 && thisThread == Threads.main())
1094 ++static_cast<MainThread*>(thisThread)->bestMoveChanges;
1097 // All other moves but the PV are set to the lowest value: this
1098 // is not a problem when sorting because the sort is stable and the
1099 // move position in the list is preserved - just the PV is pushed up.
1100 rm.score = -VALUE_INFINITE;
1103 if (value > bestValue)
1111 if (PvNode && !rootNode) // Update pv even in fail-high case
1112 update_pv(ss->pv, move, (ss+1)->pv);
1114 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1118 assert(value >= beta); // Fail high
1125 if (move != bestMove)
1127 if (captureOrPromotion && captureCount < 32)
1128 capturesSearched[captureCount++] = move;
1130 else if (!captureOrPromotion && quietCount < 64)
1131 quietsSearched[quietCount++] = move;
1135 // The following condition would detect a stop only after move loop has been
1136 // completed. But in this case bestValue is valid because we have fully
1137 // searched our subtree, and we can anyhow save the result in TT.
1143 // Step 20. Check for mate and stalemate
1144 // All legal moves have been searched and if there are no legal moves, it
1145 // must be a mate or a stalemate. If we are in a singular extension search then
1146 // return a fail low score.
1148 assert(moveCount || !inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1151 bestValue = excludedMove ? alpha
1152 : inCheck ? mated_in(ss->ply) : VALUE_DRAW;
1155 // Quiet best move: update move sorting heuristics
1156 if (!pos.capture_or_promotion(bestMove))
1157 update_quiet_stats(pos, ss, bestMove, quietsSearched, quietCount,
1158 stat_bonus(depth + (bestValue > beta + PawnValueMg ? ONE_PLY : DEPTH_ZERO)));
1160 update_capture_stats(pos, bestMove, capturesSearched, captureCount, stat_bonus(depth + ONE_PLY));
1162 // Extra penalty for a quiet TT or main killer move in previous ply when it gets refuted
1163 if ( ((ss-1)->moveCount == 1 || ((ss-1)->currentMove == (ss-1)->killers[0]))
1164 && !pos.captured_piece())
1165 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + ONE_PLY));
1168 // Bonus for prior countermove that caused the fail low
1169 else if ( (depth >= 3 * ONE_PLY || PvNode)
1170 && !pos.captured_piece())
1171 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth));
1174 bestValue = std::min(bestValue, maxValue);
1177 tte->save(posKey, value_to_tt(bestValue, ss->ply), ttPv,
1178 bestValue >= beta ? BOUND_LOWER :
1179 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1180 depth, bestMove, pureStaticEval);
1182 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1188 // qsearch() is the quiescence search function, which is called by the main
1189 // search function with depth zero, or recursively with depth less than ONE_PLY.
1190 template <NodeType NT>
1191 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1193 constexpr bool PvNode = NT == PV;
1195 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1196 assert(PvNode || (alpha == beta - 1));
1197 assert(depth <= DEPTH_ZERO);
1198 assert(depth / ONE_PLY * ONE_PLY == depth);
1204 Move ttMove, move, bestMove;
1206 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1207 bool ttHit, pvHit, inCheck, givesCheck, evasionPrunable;
1212 oldAlpha = alpha; // To flag BOUND_EXACT when eval above alpha and no available moves
1214 ss->pv[0] = MOVE_NONE;
1217 Thread* thisThread = pos.this_thread();
1218 (ss+1)->ply = ss->ply + 1;
1219 ss->currentMove = bestMove = MOVE_NONE;
1220 ss->continuationHistory = &thisThread->continuationHistory[NO_PIECE][0];
1221 inCheck = pos.checkers();
1224 // Check for an immediate draw or maximum ply reached
1225 if ( pos.is_draw(ss->ply)
1226 || ss->ply >= MAX_PLY)
1227 return (ss->ply >= MAX_PLY && !inCheck) ? evaluate(pos) : VALUE_DRAW;
1229 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1231 // Decide whether or not to include checks: this fixes also the type of
1232 // TT entry depth that we are going to use. Note that in qsearch we use
1233 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1234 ttDepth = inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1235 : DEPTH_QS_NO_CHECKS;
1236 // Transposition table lookup
1238 tte = TT.probe(posKey, ttHit);
1239 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
1240 ttMove = ttHit ? tte->move() : MOVE_NONE;
1241 pvHit = ttHit && tte->is_pv();
1245 && tte->depth() >= ttDepth
1246 && ttValue != VALUE_NONE // Only in case of TT access race
1247 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1248 : (tte->bound() & BOUND_UPPER)))
1251 // Evaluate the position statically
1254 ss->staticEval = VALUE_NONE;
1255 bestValue = futilityBase = -VALUE_INFINITE;
1261 // Never assume anything on values stored in TT
1262 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1263 ss->staticEval = bestValue = evaluate(pos);
1265 // Can ttValue be used as a better position evaluation?
1266 if ( ttValue != VALUE_NONE
1267 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1268 bestValue = ttValue;
1271 ss->staticEval = bestValue =
1272 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1273 : -(ss-1)->staticEval + 2 * Eval::Tempo;
1275 // Stand pat. Return immediately if static value is at least beta
1276 if (bestValue >= beta)
1279 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit, BOUND_LOWER,
1280 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1285 if (PvNode && bestValue > alpha)
1288 futilityBase = bestValue + 128;
1291 const PieceToHistory* contHist[] = { (ss-1)->continuationHistory, (ss-2)->continuationHistory,
1292 nullptr, (ss-4)->continuationHistory,
1293 nullptr, (ss-6)->continuationHistory };
1295 // Initialize a MovePicker object for the current position, and prepare
1296 // to search the moves. Because the depth is <= 0 here, only captures,
1297 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1299 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
1300 &thisThread->captureHistory,
1302 to_sq((ss-1)->currentMove));
1304 // Loop through the moves until no moves remain or a beta cutoff occurs
1305 while ((move = mp.next_move()) != MOVE_NONE)
1307 assert(is_ok(move));
1309 givesCheck = pos.gives_check(move);
1316 && futilityBase > -VALUE_KNOWN_WIN
1317 && !pos.advanced_pawn_push(move))
1319 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1321 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1323 if (futilityValue <= alpha)
1325 bestValue = std::max(bestValue, futilityValue);
1329 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1331 bestValue = std::max(bestValue, futilityBase);
1336 // Detect non-capture evasions that are candidates to be pruned
1337 evasionPrunable = inCheck
1338 && (depth != DEPTH_ZERO || moveCount > 2)
1339 && bestValue > VALUE_MATED_IN_MAX_PLY
1340 && !pos.capture(move);
1342 // Don't search moves with negative SEE values
1343 if ( (!inCheck || evasionPrunable)
1344 && !pos.see_ge(move))
1347 // Speculative prefetch as early as possible
1348 prefetch(TT.first_entry(pos.key_after(move)));
1350 // Check for legality just before making the move
1351 if (!pos.legal(move))
1357 ss->currentMove = move;
1358 ss->continuationHistory = &thisThread->continuationHistory[pos.moved_piece(move)][to_sq(move)];
1360 // Make and search the move
1361 pos.do_move(move, st, givesCheck);
1362 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1363 pos.undo_move(move);
1365 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1367 // Check for a new best move
1368 if (value > bestValue)
1376 if (PvNode) // Update pv even in fail-high case
1377 update_pv(ss->pv, move, (ss+1)->pv);
1379 if (PvNode && value < beta) // Update alpha here!
1387 // All legal moves have been searched. A special case: If we're in check
1388 // and no legal moves were found, it is checkmate.
1389 if (inCheck && bestValue == -VALUE_INFINITE)
1390 return mated_in(ss->ply); // Plies to mate from the root
1392 tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit,
1393 bestValue >= beta ? BOUND_LOWER :
1394 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1395 ttDepth, bestMove, ss->staticEval);
1397 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1403 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1404 // "plies to mate from the current position". Non-mate scores are unchanged.
1405 // The function is called before storing a value in the transposition table.
1407 Value value_to_tt(Value v, int ply) {
1409 assert(v != VALUE_NONE);
1411 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1412 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1416 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1417 // from the transposition table (which refers to the plies to mate/be mated
1418 // from current position) to "plies to mate/be mated from the root".
1420 Value value_from_tt(Value v, int ply) {
1422 return v == VALUE_NONE ? VALUE_NONE
1423 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1424 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1428 // update_pv() adds current move and appends child pv[]
1430 void update_pv(Move* pv, Move move, Move* childPv) {
1432 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1438 // update_continuation_histories() updates histories of the move pairs formed
1439 // by moves at ply -1, -2, and -4 with current move.
1441 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1443 for (int i : {1, 2, 4, 6})
1444 if (is_ok((ss-i)->currentMove))
1445 (*(ss-i)->continuationHistory)[pc][to] << bonus;
1449 // update_capture_stats() updates move sorting heuristics when a new capture best move is found
1451 void update_capture_stats(const Position& pos, Move move,
1452 Move* captures, int captureCount, int bonus) {
1454 CapturePieceToHistory& captureHistory = pos.this_thread()->captureHistory;
1455 Piece moved_piece = pos.moved_piece(move);
1456 PieceType captured = type_of(pos.piece_on(to_sq(move)));
1458 if (pos.capture_or_promotion(move))
1459 captureHistory[moved_piece][to_sq(move)][captured] << bonus;
1461 // Decrease all the other played capture moves
1462 for (int i = 0; i < captureCount; ++i)
1464 moved_piece = pos.moved_piece(captures[i]);
1465 captured = type_of(pos.piece_on(to_sq(captures[i])));
1466 captureHistory[moved_piece][to_sq(captures[i])][captured] << -bonus;
1471 // update_quiet_stats() updates move sorting heuristics when a new quiet best move is found
1473 void update_quiet_stats(const Position& pos, Stack* ss, Move move,
1474 Move* quiets, int quietCount, int bonus) {
1476 if (ss->killers[0] != move)
1478 ss->killers[1] = ss->killers[0];
1479 ss->killers[0] = move;
1482 Color us = pos.side_to_move();
1483 Thread* thisThread = pos.this_thread();
1484 thisThread->mainHistory[us][from_to(move)] << bonus;
1485 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1487 if (is_ok((ss-1)->currentMove))
1489 Square prevSq = to_sq((ss-1)->currentMove);
1490 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1493 // Decrease all the other played quiet moves
1494 for (int i = 0; i < quietCount; ++i)
1496 thisThread->mainHistory[us][from_to(quiets[i])] << -bonus;
1497 update_continuation_histories(ss, pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
1501 // When playing with strength handicap, choose best move among a set of RootMoves
1502 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1504 Move Skill::pick_best(size_t multiPV) {
1506 const RootMoves& rootMoves = Threads.main()->rootMoves;
1507 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1509 // RootMoves are already sorted by score in descending order
1510 Value topScore = rootMoves[0].score;
1511 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1512 int weakness = 120 - 2 * level;
1513 int maxScore = -VALUE_INFINITE;
1515 // Choose best move. For each move score we add two terms, both dependent on
1516 // weakness. One is deterministic and bigger for weaker levels, and one is
1517 // random. Then we choose the move with the resulting highest score.
1518 for (size_t i = 0; i < multiPV; ++i)
1520 // This is our magic formula
1521 int push = ( weakness * int(topScore - rootMoves[i].score)
1522 + delta * (rng.rand<unsigned>() % weakness)) / 128;
1524 if (rootMoves[i].score + push >= maxScore)
1526 maxScore = rootMoves[i].score + push;
1527 best = rootMoves[i].pv[0];
1536 /// MainThread::check_time() is used to print debug info and, more importantly,
1537 /// to detect when we are out of available time and thus stop the search.
1539 void MainThread::check_time() {
1544 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1545 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1547 static TimePoint lastInfoTime = now();
1549 TimePoint elapsed = Time.elapsed();
1550 TimePoint tick = Limits.startTime + elapsed;
1552 if (tick - lastInfoTime >= 1000)
1554 lastInfoTime = tick;
1558 // We should not stop pondering until told so by the GUI
1562 if ( (Limits.use_time_management() && (elapsed > Time.maximum() - 10 || stopOnPonderhit))
1563 || (Limits.movetime && elapsed >= Limits.movetime)
1564 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1565 Threads.stop = true;
1569 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1570 /// that all (if any) unsearched PV lines are sent using a previous search score.
1572 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1574 std::stringstream ss;
1575 TimePoint elapsed = Time.elapsed() + 1;
1576 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1577 size_t pvIdx = pos.this_thread()->pvIdx;
1578 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1579 uint64_t nodesSearched = Threads.nodes_searched();
1580 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1582 for (size_t i = 0; i < multiPV; ++i)
1584 bool updated = (i <= pvIdx && rootMoves[i].score != -VALUE_INFINITE);
1586 if (depth == ONE_PLY && !updated)
1589 Depth d = updated ? depth : depth - ONE_PLY;
1590 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1592 bool tb = TB::RootInTB && abs(v) < VALUE_MATE - MAX_PLY;
1593 v = tb ? rootMoves[i].tbScore : v;
1595 if (ss.rdbuf()->in_avail()) // Not at first line
1599 << " depth " << d / ONE_PLY
1600 << " seldepth " << rootMoves[i].selDepth
1601 << " multipv " << i + 1
1602 << " score " << UCI::value(v);
1604 if (!tb && i == pvIdx)
1605 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1607 ss << " nodes " << nodesSearched
1608 << " nps " << nodesSearched * 1000 / elapsed;
1610 if (elapsed > 1000) // Earlier makes little sense
1611 ss << " hashfull " << TT.hashfull();
1613 ss << " tbhits " << tbHits
1614 << " time " << elapsed
1617 for (Move m : rootMoves[i].pv)
1618 ss << " " << UCI::move(m, pos.is_chess960());
1625 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1626 /// before exiting the search, for instance, in case we stop the search during a
1627 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1628 /// otherwise in case of 'ponder on' we have nothing to think on.
1630 bool RootMove::extract_ponder_from_tt(Position& pos) {
1635 assert(pv.size() == 1);
1637 if (pv[0] == MOVE_NONE)
1640 pos.do_move(pv[0], st);
1641 TTEntry* tte = TT.probe(pos.key(), ttHit);
1645 Move m = tte->move(); // Local copy to be SMP safe
1646 if (MoveList<LEGAL>(pos).contains(m))
1650 pos.undo_move(pv[0]);
1651 return pv.size() > 1;
1654 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1657 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1658 ProbeDepth = int(Options["SyzygyProbeDepth"]) * ONE_PLY;
1659 Cardinality = int(Options["SyzygyProbeLimit"]);
1660 bool dtz_available = true;
1662 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1663 // ProbeDepth == DEPTH_ZERO
1664 if (Cardinality > MaxCardinality)
1666 Cardinality = MaxCardinality;
1667 ProbeDepth = DEPTH_ZERO;
1670 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1672 // Rank moves using DTZ tables
1673 RootInTB = root_probe(pos, rootMoves);
1677 // DTZ tables are missing; try to rank moves using WDL tables
1678 dtz_available = false;
1679 RootInTB = root_probe_wdl(pos, rootMoves);
1685 // Sort moves according to TB rank
1686 std::sort(rootMoves.begin(), rootMoves.end(),
1687 [](const RootMove &a, const RootMove &b) { return a.tbRank > b.tbRank; } );
1689 // Probe during search only if DTZ is not available and we are winning
1690 if (dtz_available || rootMoves[0].tbScore <= VALUE_DRAW)
1695 // Assign the same rank to all moves
1696 for (auto& m : rootMoves)