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-2018 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[] = {0, 590, 604};
70 Value futility_margin(Depth d, bool improving) {
71 return Value((175 - 50 * improving) * d / ONE_PLY);
74 // Margin for pruning capturing moves: almost linear in depth
75 constexpr int CapturePruneMargin[] = { 0,
76 1 * PawnValueEg * 1055 / 1000,
77 2 * PawnValueEg * 1042 / 1000,
78 3 * PawnValueEg * 963 / 1000,
79 4 * PawnValueEg * 1038 / 1000,
80 5 * PawnValueEg * 950 / 1000,
81 6 * PawnValueEg * 930 / 1000
84 // Futility and reductions lookup tables, initialized at startup
85 int FutilityMoveCounts[2][16]; // [improving][depth]
86 int Reductions[2][2][64][64]; // [pv][improving][depth][moveNumber]
88 template <bool PvNode> Depth reduction(bool i, Depth d, int mn) {
89 return Reductions[PvNode][i][std::min(d / ONE_PLY, 63)][std::min(mn, 63)] * ONE_PLY;
92 // History and stats update bonus, based on depth
93 int stat_bonus(Depth depth) {
94 int d = depth / ONE_PLY;
95 return d > 17 ? 0 : 32 * d * d + 64 * d - 64;
98 // Skill structure is used to implement strength limit
100 explicit Skill(int l) : level(l) {}
101 bool enabled() const { return level < 20; }
102 bool time_to_pick(Depth depth) const { return depth / ONE_PLY == 1 + level; }
103 Move pick_best(size_t multiPV);
106 Move best = MOVE_NONE;
109 template <NodeType NT>
110 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
112 template <NodeType NT>
113 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth = DEPTH_ZERO);
115 Value value_to_tt(Value v, int ply);
116 Value value_from_tt(Value v, int ply);
117 void update_pv(Move* pv, Move move, Move* childPv);
118 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus);
119 void update_quiet_stats(const Position& pos, Stack* ss, Move move, Move* quiets, int quietsCnt, int bonus);
120 void update_capture_stats(const Position& pos, Move move, Move* captures, int captureCnt, int bonus);
122 inline bool gives_check(const Position& pos, Move move) {
123 Color us = pos.side_to_move();
124 return type_of(move) == NORMAL && !(pos.blockers_for_king(~us) & pos.pieces(us))
125 ? pos.check_squares(type_of(pos.moved_piece(move))) & to_sq(move)
126 : pos.gives_check(move);
129 // perft() is our utility to verify move generation. All the leaf nodes up
130 // to the given depth are generated and counted, and the sum is returned.
132 uint64_t perft(Position& pos, Depth depth) {
135 uint64_t cnt, nodes = 0;
136 const bool leaf = (depth == 2 * ONE_PLY);
138 for (const auto& m : MoveList<LEGAL>(pos))
140 if (Root && depth <= ONE_PLY)
145 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - ONE_PLY);
150 sync_cout << UCI::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
158 /// Search::init() is called at startup to initialize various lookup tables
160 void Search::init() {
162 for (int imp = 0; imp <= 1; ++imp)
163 for (int d = 1; d < 64; ++d)
164 for (int mc = 1; mc < 64; ++mc)
166 double r = log(d) * log(mc) / 1.95;
168 Reductions[NonPV][imp][d][mc] = int(std::round(r));
169 Reductions[PV][imp][d][mc] = std::max(Reductions[NonPV][imp][d][mc] - 1, 0);
171 // Increase reduction for non-PV nodes when eval is not improving
173 Reductions[NonPV][imp][d][mc]++;
176 for (int d = 0; d < 16; ++d)
178 FutilityMoveCounts[0][d] = int(2.4 + 0.74 * pow(d, 1.78));
179 FutilityMoveCounts[1][d] = int(5.0 + 1.00 * pow(d, 2.00));
184 /// Search::clear() resets search state to its initial value
186 void Search::clear() {
188 Threads.main()->wait_for_search_finished();
190 Time.availableNodes = 0;
196 /// MainThread::search() is called by the main thread when the program receives
197 /// the UCI 'go' command. It searches from the root position and outputs the "bestmove".
199 void MainThread::search() {
203 nodes = perft<true>(rootPos, Limits.perft * ONE_PLY);
204 sync_cout << "\nNodes searched: " << nodes << "\n" << sync_endl;
208 Color us = rootPos.side_to_move();
209 Time.init(Limits, us, rootPos.game_ply());
212 if (rootMoves.empty())
214 rootMoves.emplace_back(MOVE_NONE);
215 sync_cout << "info depth 0 score "
216 << UCI::value(rootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
221 for (Thread* th : Threads)
223 th->start_searching();
225 Thread::search(); // Let's start searching!
228 // When we reach the maximum depth, we can arrive here without a raise of
229 // Threads.stop. However, if we are pondering or in an infinite search,
230 // the UCI protocol states that we shouldn't print the best move before the
231 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
232 // until the GUI sends one of those commands (which also raises Threads.stop).
233 Threads.stopOnPonderhit = true;
235 while (!Threads.stop && (Threads.ponder || Limits.infinite))
236 {} // Busy wait for a stop or a ponder reset
238 // Stop the threads if not already stopped (also raise the stop if
239 // "ponderhit" just reset Threads.ponder).
242 // Wait until all threads have finished
243 for (Thread* th : Threads)
245 th->wait_for_search_finished();
247 // When playing in 'nodes as time' mode, subtract the searched nodes from
248 // the available ones before exiting.
250 Time.availableNodes += Limits.inc[us] - Threads.nodes_searched();
252 // Check if there are threads with a better score than main thread
253 Thread* bestThread = this;
254 if ( Options["MultiPV"] == 1
256 && !Skill(Options["Skill Level"]).enabled()
257 && rootMoves[0].pv[0] != MOVE_NONE)
259 for (Thread* th : Threads)
261 Depth depthDiff = th->completedDepth - bestThread->completedDepth;
262 Value scoreDiff = th->rootMoves[0].score - bestThread->rootMoves[0].score;
264 // Select the thread with the best score, always if it is a mate
266 && (depthDiff >= 0 || th->rootMoves[0].score >= VALUE_MATE_IN_MAX_PLY))
271 previousScore = bestThread->rootMoves[0].score;
273 // Send again PV info if we have a new best thread
274 if (bestThread != this)
275 sync_cout << UCI::pv(bestThread->rootPos, bestThread->completedDepth, -VALUE_INFINITE, VALUE_INFINITE) << sync_endl;
277 sync_cout << "bestmove " << UCI::move(bestThread->rootMoves[0].pv[0], rootPos.is_chess960());
279 if (bestThread->rootMoves[0].pv.size() > 1 || bestThread->rootMoves[0].extract_ponder_from_tt(rootPos))
280 std::cout << " ponder " << UCI::move(bestThread->rootMoves[0].pv[1], rootPos.is_chess960());
282 std::cout << sync_endl;
286 /// Thread::search() is the main iterative deepening loop. It calls search()
287 /// repeatedly with increasing depth until the allocated thinking time has been
288 /// consumed, the user stops the search, or the maximum search depth is reached.
290 void Thread::search() {
292 Stack stack[MAX_PLY+7], *ss = stack+4; // To reference from (ss-4) to (ss+2)
293 Value bestValue, alpha, beta, delta;
294 Move lastBestMove = MOVE_NONE;
295 Depth lastBestMoveDepth = DEPTH_ZERO;
296 MainThread* mainThread = (this == Threads.main() ? Threads.main() : nullptr);
297 double timeReduction = 1.0;
298 Color us = rootPos.side_to_move();
300 std::memset(ss-4, 0, 7 * sizeof(Stack));
301 for (int i = 4; i > 0; i--)
302 (ss-i)->contHistory = this->contHistory[NO_PIECE][0].get(); // Use as sentinel
304 bestValue = delta = alpha = -VALUE_INFINITE;
305 beta = VALUE_INFINITE;
308 mainThread->bestMoveChanges = 0, mainThread->failedLow = false;
310 size_t multiPV = Options["MultiPV"];
311 Skill skill(Options["Skill Level"]);
313 // When playing with strength handicap enable MultiPV search that we will
314 // use behind the scenes to retrieve a set of possible moves.
316 multiPV = std::max(multiPV, (size_t)4);
318 multiPV = std::min(multiPV, rootMoves.size());
320 int ct = int(Options["Contempt"]) * PawnValueEg / 100; // From centipawns
322 // In analysis mode, adjust contempt in accordance with user preference
323 if (Limits.infinite || Options["UCI_AnalyseMode"])
324 ct = Options["Analysis Contempt"] == "Off" ? 0
325 : Options["Analysis Contempt"] == "Both" ? ct
326 : Options["Analysis Contempt"] == "White" && us == BLACK ? -ct
327 : Options["Analysis Contempt"] == "Black" && us == WHITE ? -ct
330 // In evaluate.cpp the evaluation is from the white point of view
331 contempt = (us == WHITE ? make_score(ct, ct / 2)
332 : -make_score(ct, ct / 2));
334 // Iterative deepening loop until requested to stop or the target depth is reached
335 while ( (rootDepth += ONE_PLY) < DEPTH_MAX
337 && !(Limits.depth && mainThread && rootDepth / ONE_PLY > Limits.depth))
339 // Distribute search depths across the helper threads
342 int i = (idx - 1) % 20;
343 if (((rootDepth / ONE_PLY + rootPos.game_ply() + SkipPhase[i]) / SkipSize[i]) % 2)
344 continue; // Retry with an incremented rootDepth
347 // Age out PV variability metric
349 mainThread->bestMoveChanges *= 0.517, mainThread->failedLow = false;
351 // Save the last iteration's scores before first PV line is searched and
352 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
353 for (RootMove& rm : rootMoves)
354 rm.previousScore = rm.score;
359 // MultiPV loop. We perform a full root search for each PV line
360 for (PVIdx = 0; PVIdx < multiPV && !Threads.stop; ++PVIdx)
365 for (PVLast++; PVLast < rootMoves.size(); PVLast++)
366 if (rootMoves[PVLast].TBRank != rootMoves[PVFirst].TBRank)
370 // Reset UCI info selDepth for each depth and each PV line
373 // Reset aspiration window starting size
374 if (rootDepth >= 5 * ONE_PLY)
376 Value previousScore = rootMoves[PVIdx].previousScore;
378 alpha = std::max(previousScore - delta,-VALUE_INFINITE);
379 beta = std::min(previousScore + delta, VALUE_INFINITE);
381 // Adjust contempt based on root move's previousScore (dynamic contempt)
382 int dct = ct + 88 * previousScore / (abs(previousScore) + 200);
384 contempt = (us == WHITE ? make_score(dct, dct / 2)
385 : -make_score(dct, dct / 2));
388 // Start with a small aspiration window and, in the case of a fail
389 // high/low, re-search with a bigger window until we don't fail
393 bestValue = ::search<PV>(rootPos, ss, alpha, beta, rootDepth, false);
395 // Bring the best move to the front. It is critical that sorting
396 // is done with a stable algorithm because all the values but the
397 // first and eventually the new best one are set to -VALUE_INFINITE
398 // and we want to keep the same order for all the moves except the
399 // new PV that goes to the front. Note that in case of MultiPV
400 // search the already searched PV lines are preserved.
401 std::stable_sort(rootMoves.begin() + PVIdx, rootMoves.begin() + PVLast);
403 // If search has been stopped, we break immediately. Sorting is
404 // safe because RootMoves is still valid, although it refers to
405 // the previous iteration.
409 // When failing high/low give some update (without cluttering
410 // the UI) before a re-search.
413 && (bestValue <= alpha || bestValue >= beta)
414 && Time.elapsed() > 3000)
415 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
417 // In case of failing low/high increase aspiration window and
418 // re-search, otherwise exit the loop.
419 if (bestValue <= alpha)
421 beta = (alpha + beta) / 2;
422 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
426 mainThread->failedLow = true;
427 Threads.stopOnPonderhit = false;
430 else if (bestValue >= beta)
431 beta = std::min(bestValue + delta, VALUE_INFINITE);
435 delta += delta / 4 + 5;
437 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
440 // Sort the PV lines searched so far and update the GUI
441 std::stable_sort(rootMoves.begin() + PVFirst, rootMoves.begin() + PVIdx + 1);
444 && (Threads.stop || PVIdx + 1 == multiPV || Time.elapsed() > 3000))
445 sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
449 completedDepth = rootDepth;
451 if (rootMoves[0].pv[0] != lastBestMove) {
452 lastBestMove = rootMoves[0].pv[0];
453 lastBestMoveDepth = rootDepth;
456 // Have we found a "mate in x"?
458 && bestValue >= VALUE_MATE_IN_MAX_PLY
459 && VALUE_MATE - bestValue <= 2 * Limits.mate)
465 // If skill level is enabled and time is up, pick a sub-optimal best move
466 if (skill.enabled() && skill.time_to_pick(rootDepth))
467 skill.pick_best(multiPV);
469 // Do we have time for the next iteration? Can we stop searching now?
470 if ( Limits.use_time_management()
472 && !Threads.stopOnPonderhit)
474 const int F[] = { mainThread->failedLow,
475 bestValue - mainThread->previousScore };
477 int improvingFactor = std::max(246, std::min(832, 306 + 119 * F[0] - 6 * F[1]));
479 // If the bestMove is stable over several iterations, reduce time accordingly
481 for (int i : {3, 4, 5})
482 if (lastBestMoveDepth * i < completedDepth)
483 timeReduction *= 1.25;
485 // Use part of the gained time from a previous stable move for the current move
486 double bestMoveInstability = 1.0 + mainThread->bestMoveChanges;
487 bestMoveInstability *= std::pow(mainThread->previousTimeReduction, 0.528) / timeReduction;
489 // Stop the search if we have only one legal move, or if available time elapsed
490 if ( rootMoves.size() == 1
491 || Time.elapsed() > Time.optimum() * bestMoveInstability * improvingFactor / 581)
493 // If we are allowed to ponder do not stop the search now but
494 // keep pondering until the GUI sends "ponderhit" or "stop".
496 Threads.stopOnPonderhit = true;
506 mainThread->previousTimeReduction = timeReduction;
508 // If skill level is enabled, swap best PV line with the sub-optimal one
510 std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
511 skill.best ? skill.best : skill.pick_best(multiPV)));
517 // search<>() is the main search function for both PV and non-PV nodes
519 template <NodeType NT>
520 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
522 // Use quiescence search when needed
524 return qsearch<NT>(pos, ss, alpha, beta);
526 constexpr bool PvNode = NT == PV;
527 const bool rootNode = PvNode && ss->ply == 0;
529 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
530 assert(PvNode || (alpha == beta - 1));
531 assert(DEPTH_ZERO < depth && depth < DEPTH_MAX);
532 assert(!(PvNode && cutNode));
533 assert(depth / ONE_PLY * ONE_PLY == depth);
535 Move pv[MAX_PLY+1], capturesSearched[32], quietsSearched[64];
539 Move ttMove, move, excludedMove, bestMove;
540 Depth extension, newDepth;
541 Value bestValue, value, ttValue, eval, maxValue;
542 bool ttHit, inCheck, givesCheck, improving;
543 bool captureOrPromotion, doFullDepthSearch, moveCountPruning, skipQuiets, ttCapture, pvExact;
545 int moveCount, captureCount, quietCount;
547 // Step 1. Initialize node
548 Thread* thisThread = pos.this_thread();
549 inCheck = pos.checkers();
550 moveCount = captureCount = quietCount = ss->moveCount = 0;
551 bestValue = -VALUE_INFINITE;
552 maxValue = VALUE_INFINITE;
554 // Check for the available remaining time
555 if (thisThread == Threads.main())
556 static_cast<MainThread*>(thisThread)->check_time();
558 // Used to send selDepth info to GUI (selDepth counts from 1, ply from 0)
559 if (PvNode && thisThread->selDepth < ss->ply + 1)
560 thisThread->selDepth = ss->ply + 1;
564 // Step 2. Check for aborted search and immediate draw
565 if ( Threads.stop.load(std::memory_order_relaxed)
566 || pos.is_draw(ss->ply)
567 || ss->ply >= MAX_PLY)
568 return (ss->ply >= MAX_PLY && !inCheck) ? evaluate(pos) : VALUE_DRAW;
570 // Step 3. Mate distance pruning. Even if we mate at the next move our score
571 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
572 // a shorter mate was found upward in the tree then there is no need to search
573 // because we will never beat the current alpha. Same logic but with reversed
574 // signs applies also in the opposite condition of being mated instead of giving
575 // mate. In this case return a fail-high score.
576 alpha = std::max(mated_in(ss->ply), alpha);
577 beta = std::min(mate_in(ss->ply+1), beta);
582 assert(0 <= ss->ply && ss->ply < MAX_PLY);
584 (ss+1)->ply = ss->ply + 1;
585 ss->currentMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
586 ss->contHistory = thisThread->contHistory[NO_PIECE][0].get();
587 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
588 Square prevSq = to_sq((ss-1)->currentMove);
590 // Initialize statScore to zero for the grandchildren of the current position.
591 // So statScore is shared between all grandchildren and only the first grandchild
592 // starts with statScore = 0. Later grandchildren start with the last calculated
593 // statScore of the previous grandchild. This influences the reduction rules in
594 // LMR which are based on the statScore of parent position.
595 (ss+2)->statScore = 0;
597 // Step 4. Transposition table lookup. We don't want the score of a partial
598 // search to overwrite a previous full search TT value, so we use a different
599 // position key in case of an excluded move.
600 excludedMove = ss->excludedMove;
601 posKey = pos.key() ^ Key(excludedMove << 16); // Isn't a very good hash
602 tte = TT.probe(posKey, ttHit);
603 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
604 ttMove = rootNode ? thisThread->rootMoves[thisThread->PVIdx].pv[0]
605 : ttHit ? tte->move() : MOVE_NONE;
607 // At non-PV nodes we check for an early TT cutoff
610 && tte->depth() >= depth
611 && ttValue != VALUE_NONE // Possible in case of TT access race
612 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
613 : (tte->bound() & BOUND_UPPER)))
615 // If ttMove is quiet, update move sorting heuristics on TT hit
620 if (!pos.capture_or_promotion(ttMove))
621 update_quiet_stats(pos, ss, ttMove, nullptr, 0, stat_bonus(depth));
623 // Extra penalty for a quiet TT move in previous ply when it gets refuted
624 if ((ss-1)->moveCount == 1 && !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[pos.side_to_move()][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 if (err != TB::ProbeState::FAIL)
653 thisThread->tbHits.fetch_add(1, std::memory_order_relaxed);
655 int drawScore = TB::UseRule50 ? 1 : 0;
657 value = wdl < -drawScore ? -VALUE_MATE + MAX_PLY + ss->ply + 1
658 : wdl > drawScore ? VALUE_MATE - MAX_PLY - ss->ply - 1
659 : VALUE_DRAW + 2 * wdl * drawScore;
661 Bound b = wdl < -drawScore ? BOUND_UPPER
662 : wdl > drawScore ? BOUND_LOWER : BOUND_EXACT;
664 if ( b == BOUND_EXACT
665 || (b == BOUND_LOWER ? value >= beta : value <= alpha))
667 tte->save(posKey, value_to_tt(value, ss->ply), b,
668 std::min(DEPTH_MAX - ONE_PLY, depth + 6 * ONE_PLY),
669 MOVE_NONE, VALUE_NONE, TT.generation());
676 if (b == BOUND_LOWER)
677 bestValue = value, alpha = std::max(alpha, bestValue);
685 // Step 6. Static evaluation of the position
688 ss->staticEval = eval = VALUE_NONE;
690 goto moves_loop; // Skip early pruning when in check
694 // Never assume anything on values stored in TT
695 if ((ss->staticEval = eval = tte->eval()) == VALUE_NONE)
696 eval = ss->staticEval = evaluate(pos);
698 // Can ttValue be used as a better position evaluation?
699 if ( ttValue != VALUE_NONE
700 && (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER)))
705 ss->staticEval = eval =
706 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
707 : -(ss-1)->staticEval + 2 * Eval::Tempo;
709 tte->save(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE,
710 ss->staticEval, TT.generation());
713 // Step 7. Razoring (~2 Elo)
715 && depth < 3 * ONE_PLY
716 && eval <= alpha - RazorMargin[depth / ONE_PLY])
718 Value ralpha = alpha - (depth >= 2 * ONE_PLY) * RazorMargin[depth / ONE_PLY];
719 Value v = qsearch<NonPV>(pos, ss, ralpha, ralpha+1);
720 if (depth < 2 * ONE_PLY || v <= ralpha)
724 improving = ss->staticEval >= (ss-2)->staticEval
725 || (ss-2)->staticEval == VALUE_NONE;
727 // Step 8. Futility pruning: child node (~30 Elo)
729 && depth < 7 * ONE_PLY
730 && eval - futility_margin(depth, improving) >= beta
731 && eval < VALUE_KNOWN_WIN) // Do not return unproven wins
734 // Step 9. Null move search with verification search (~40 Elo)
736 && (ss-1)->currentMove != MOVE_NULL
737 && (ss-1)->statScore < 30000
739 && ss->staticEval >= beta - 36 * depth / ONE_PLY + 225
741 && pos.non_pawn_material(pos.side_to_move())
742 && (ss->ply >= thisThread->nmp_ply || ss->ply % 2 != thisThread->nmp_odd))
744 assert(eval - beta >= 0);
746 // Null move dynamic reduction based on depth and value
747 Depth R = ((823 + 67 * depth / ONE_PLY) / 256 + std::min((eval - beta) / PawnValueMg, 3)) * ONE_PLY;
749 ss->currentMove = MOVE_NULL;
750 ss->contHistory = thisThread->contHistory[NO_PIECE][0].get();
752 pos.do_null_move(st);
754 Value nullValue = -search<NonPV>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
756 pos.undo_null_move();
758 if (nullValue >= beta)
760 // Do not return unproven mate scores
761 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
764 if (abs(beta) < VALUE_KNOWN_WIN && (depth < 12 * ONE_PLY || thisThread->nmp_ply))
767 // Do verification search at high depths. Disable null move pruning
768 // for side to move for the first part of the remaining search tree.
769 thisThread->nmp_ply = ss->ply + 3 * (depth-R) / 4;
770 thisThread->nmp_odd = ss->ply % 2;
772 Value v = search<NonPV>(pos, ss, beta-1, beta, depth-R, false);
774 thisThread->nmp_odd = thisThread->nmp_ply = 0;
781 // Step 10. ProbCut (~10 Elo)
782 // If we have a good enough capture and a reduced search returns a value
783 // much above beta, we can (almost) safely prune the previous move.
785 && depth >= 5 * ONE_PLY
786 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
788 Value rbeta = std::min(beta + 216 - 48 * improving, VALUE_INFINITE);
789 MovePicker mp(pos, ttMove, rbeta - ss->staticEval, &thisThread->captureHistory);
790 int probCutCount = 0;
792 while ( (move = mp.next_move()) != MOVE_NONE
798 ss->currentMove = move;
799 ss->contHistory = thisThread->contHistory[pos.moved_piece(move)][to_sq(move)].get();
801 assert(depth >= 5 * ONE_PLY);
803 pos.do_move(move, st);
805 // Perform a preliminary qsearch to verify that the move holds
806 value = -qsearch<NonPV>(pos, ss+1, -rbeta, -rbeta+1);
808 // If the qsearch held perform the regular search
810 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, depth - 4 * ONE_PLY, !cutNode);
819 // Step 11. Internal iterative deepening (~2 Elo)
820 if ( depth >= 8 * ONE_PLY
823 Depth d = 3 * depth / 4 - 2 * ONE_PLY;
824 search<NT>(pos, ss, alpha, beta, d, cutNode);
826 tte = TT.probe(posKey, ttHit);
827 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
828 ttMove = ttHit ? tte->move() : MOVE_NONE;
831 moves_loop: // When in check, search starts from here
833 const PieceToHistory* contHist[] = { (ss-1)->contHistory, (ss-2)->contHistory, nullptr, (ss-4)->contHistory };
834 Move countermove = thisThread->counterMoves[pos.piece_on(prevSq)][prevSq];
836 MovePicker mp(pos, ttMove, depth, &thisThread->mainHistory,
837 &thisThread->captureHistory,
841 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
845 pvExact = PvNode && ttHit && tte->bound() == BOUND_EXACT;
847 // Step 12. Loop through all pseudo-legal moves until no moves remain
848 // or a beta cutoff occurs.
849 while ((move = mp.next_move(skipQuiets)) != MOVE_NONE)
853 if (move == excludedMove)
856 // At root obey the "searchmoves" option and skip moves not listed in Root
857 // Move List. As a consequence any illegal move is also skipped. In MultiPV
858 // mode we also skip PV moves which have been already searched and those
859 // of lower "TB rank" if we are in a TB root position.
860 if (rootNode && !std::count(thisThread->rootMoves.begin() + thisThread->PVIdx,
861 thisThread->rootMoves.begin() + thisThread->PVLast, move))
864 ss->moveCount = ++moveCount;
866 if (rootNode && thisThread == Threads.main() && Time.elapsed() > 3000)
867 sync_cout << "info depth " << depth / ONE_PLY
868 << " currmove " << UCI::move(move, pos.is_chess960())
869 << " currmovenumber " << moveCount + thisThread->PVIdx << sync_endl;
871 (ss+1)->pv = nullptr;
873 extension = DEPTH_ZERO;
874 captureOrPromotion = pos.capture_or_promotion(move);
875 movedPiece = pos.moved_piece(move);
876 givesCheck = gives_check(pos, move);
878 moveCountPruning = depth < 16 * ONE_PLY
879 && moveCount >= FutilityMoveCounts[improving][depth / ONE_PLY];
881 // Step 13. Extensions (~70 Elo)
883 // Singular extension search (~60 Elo). If all moves but one fail low on a
884 // search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
885 // then that move is singular and should be extended. To verify this we do
886 // a reduced search on on all the other moves but the ttMove and if the
887 // result is lower than ttValue minus a margin then we will extend the ttMove.
888 if ( depth >= 8 * ONE_PLY
891 && !excludedMove // Recursive singular search is not allowed
892 && ttValue != VALUE_NONE
893 && (tte->bound() & BOUND_LOWER)
894 && tte->depth() >= depth - 3 * ONE_PLY
897 Value rBeta = std::max(ttValue - 2 * depth / ONE_PLY, -VALUE_MATE);
898 ss->excludedMove = move;
899 value = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2, cutNode);
900 ss->excludedMove = MOVE_NONE;
905 else if ( givesCheck // Check extension (~2 Elo)
910 // Calculate new depth for this move
911 newDepth = depth - ONE_PLY + extension;
913 // Step 14. Pruning at shallow depth (~170 Elo)
915 && pos.non_pawn_material(pos.side_to_move())
916 && bestValue > VALUE_MATED_IN_MAX_PLY)
918 if ( !captureOrPromotion
920 && (!pos.advanced_pawn_push(move) || pos.non_pawn_material() >= Value(5000)))
922 // Move count based pruning (~30 Elo)
923 if (moveCountPruning)
929 // Reduced depth of the next LMR search
930 int lmrDepth = std::max(newDepth - reduction<PvNode>(improving, depth, moveCount), DEPTH_ZERO) / ONE_PLY;
932 // Countermoves based pruning (~20 Elo)
934 && (*contHist[0])[movedPiece][to_sq(move)] < CounterMovePruneThreshold
935 && (*contHist[1])[movedPiece][to_sq(move)] < CounterMovePruneThreshold)
938 // Futility pruning: parent node (~2 Elo)
941 && ss->staticEval + 256 + 200 * lmrDepth <= alpha)
944 // Prune moves with negative SEE (~10 Elo)
946 && !pos.see_ge(move, Value(-35 * lmrDepth * lmrDepth)))
949 else if ( depth < 7 * ONE_PLY // (~20 Elo)
951 && !pos.see_ge(move, -Value(CapturePruneMargin[depth / ONE_PLY])))
955 // Speculative prefetch as early as possible
956 prefetch(TT.first_entry(pos.key_after(move)));
958 // Check for legality just before making the move
959 if (!rootNode && !pos.legal(move))
961 ss->moveCount = --moveCount;
965 if (move == ttMove && captureOrPromotion)
968 // Update the current move (this must be done after singular extension search)
969 ss->currentMove = move;
970 ss->contHistory = thisThread->contHistory[movedPiece][to_sq(move)].get();
972 // Step 15. Make the move
973 pos.do_move(move, st, givesCheck);
975 // Step 16. Reduced depth search (LMR). If the move fails high it will be
976 // re-searched at full depth.
977 if ( depth >= 3 * ONE_PLY
979 && (!captureOrPromotion || moveCountPruning))
981 Depth r = reduction<PvNode>(improving, depth, moveCount);
983 if (captureOrPromotion) // (~5 Elo)
984 r -= r ? ONE_PLY : DEPTH_ZERO;
987 // Decrease reduction if opponent's move count is high (~5 Elo)
988 if ((ss-1)->moveCount > 15)
991 // Decrease reduction for exact PV nodes (~0 Elo)
995 // Increase reduction if ttMove is a capture (~0 Elo)
999 // Increase reduction for cut nodes (~5 Elo)
1003 // Decrease reduction for moves that escape a capture. Filter out
1004 // castling moves, because they are coded as "king captures rook" and
1005 // hence break make_move(). (~5 Elo)
1006 else if ( type_of(move) == NORMAL
1007 && !pos.see_ge(make_move(to_sq(move), from_sq(move))))
1010 ss->statScore = thisThread->mainHistory[~pos.side_to_move()][from_to(move)]
1011 + (*contHist[0])[movedPiece][to_sq(move)]
1012 + (*contHist[1])[movedPiece][to_sq(move)]
1013 + (*contHist[3])[movedPiece][to_sq(move)]
1016 // Decrease/increase reduction by comparing opponent's stat score (~10 Elo)
1017 if (ss->statScore >= 0 && (ss-1)->statScore < 0)
1020 else if ((ss-1)->statScore >= 0 && ss->statScore < 0)
1023 // Decrease/increase reduction for moves with a good/bad history (~30 Elo)
1024 r = std::max(DEPTH_ZERO, (r / ONE_PLY - ss->statScore / 20000) * ONE_PLY);
1027 Depth d = std::max(newDepth - r, ONE_PLY);
1029 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
1031 doFullDepthSearch = (value > alpha && d != newDepth);
1034 doFullDepthSearch = !PvNode || moveCount > 1;
1036 // Step 17. Full depth search when LMR is skipped or fails high
1037 if (doFullDepthSearch)
1038 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
1040 // For PV nodes only, do a full PV search on the first move or after a fail
1041 // high (in the latter case search only if value < beta), otherwise let the
1042 // parent node fail low with value <= alpha and try another move.
1043 if (PvNode && (moveCount == 1 || (value > alpha && (rootNode || value < beta))))
1046 (ss+1)->pv[0] = MOVE_NONE;
1048 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, false);
1051 // Step 18. Undo move
1052 pos.undo_move(move);
1054 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1056 // Step 19. Check for a new best move
1057 // Finished searching the move. If a stop occurred, the return value of
1058 // the search cannot be trusted, and we return immediately without
1059 // updating best move, PV and TT.
1060 if (Threads.stop.load(std::memory_order_relaxed))
1065 RootMove& rm = *std::find(thisThread->rootMoves.begin(),
1066 thisThread->rootMoves.end(), move);
1068 // PV move or new best move?
1069 if (moveCount == 1 || value > alpha)
1072 rm.selDepth = thisThread->selDepth;
1077 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1078 rm.pv.push_back(*m);
1080 // We record how often the best move has been changed in each
1081 // iteration. This information is used for time management: When
1082 // the best move changes frequently, we allocate some more time.
1083 if (moveCount > 1 && thisThread == Threads.main())
1084 ++static_cast<MainThread*>(thisThread)->bestMoveChanges;
1087 // All other moves but the PV are set to the lowest value: this
1088 // is not a problem when sorting because the sort is stable and the
1089 // move position in the list is preserved - just the PV is pushed up.
1090 rm.score = -VALUE_INFINITE;
1093 if (value > bestValue)
1101 if (PvNode && !rootNode) // Update pv even in fail-high case
1102 update_pv(ss->pv, move, (ss+1)->pv);
1104 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1108 assert(value >= beta); // Fail high
1109 ss->statScore = std::max(ss->statScore, 0);
1115 if (move != bestMove)
1117 if (captureOrPromotion && captureCount < 32)
1118 capturesSearched[captureCount++] = move;
1120 else if (!captureOrPromotion && quietCount < 64)
1121 quietsSearched[quietCount++] = move;
1125 // The following condition would detect a stop only after move loop has been
1126 // completed. But in this case bestValue is valid because we have fully
1127 // searched our subtree, and we can anyhow save the result in TT.
1133 // Step 20. Check for mate and stalemate
1134 // All legal moves have been searched and if there are no legal moves, it
1135 // must be a mate or a stalemate. If we are in a singular extension search then
1136 // return a fail low score.
1138 assert(moveCount || !inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
1141 bestValue = excludedMove ? alpha
1142 : inCheck ? mated_in(ss->ply) : VALUE_DRAW;
1145 // Quiet best move: update move sorting heuristics
1146 if (!pos.capture_or_promotion(bestMove))
1147 update_quiet_stats(pos, ss, bestMove, quietsSearched, quietCount, stat_bonus(depth));
1149 update_capture_stats(pos, bestMove, capturesSearched, captureCount, stat_bonus(depth));
1151 // Extra penalty for a quiet TT move in previous ply when it gets refuted
1152 if ((ss-1)->moveCount == 1 && !pos.captured_piece())
1153 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, -stat_bonus(depth + ONE_PLY));
1155 // Bonus for prior countermove that caused the fail low
1156 else if ( depth >= 3 * ONE_PLY
1157 && !pos.captured_piece()
1158 && is_ok((ss-1)->currentMove))
1159 update_continuation_histories(ss-1, pos.piece_on(prevSq), prevSq, stat_bonus(depth));
1162 bestValue = std::min(bestValue, maxValue);
1165 tte->save(posKey, value_to_tt(bestValue, ss->ply),
1166 bestValue >= beta ? BOUND_LOWER :
1167 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1168 depth, bestMove, ss->staticEval, TT.generation());
1170 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1176 // qsearch() is the quiescence search function, which is called by the main
1177 // search function with depth zero, or recursively with depth less than ONE_PLY.
1178 template <NodeType NT>
1179 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1181 constexpr bool PvNode = NT == PV;
1183 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1184 assert(PvNode || (alpha == beta - 1));
1185 assert(depth <= DEPTH_ZERO);
1186 assert(depth / ONE_PLY * ONE_PLY == depth);
1192 Move ttMove, move, bestMove;
1194 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1195 bool ttHit, inCheck, givesCheck, evasionPrunable;
1200 oldAlpha = alpha; // To flag BOUND_EXACT when eval above alpha and no available moves
1202 ss->pv[0] = MOVE_NONE;
1205 (ss+1)->ply = ss->ply + 1;
1206 ss->currentMove = bestMove = MOVE_NONE;
1207 inCheck = pos.checkers();
1210 // Check for an immediate draw or maximum ply reached
1211 if ( pos.is_draw(ss->ply)
1212 || ss->ply >= MAX_PLY)
1213 return (ss->ply >= MAX_PLY && !inCheck) ? evaluate(pos) : VALUE_DRAW;
1215 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1217 // Decide whether or not to include checks: this fixes also the type of
1218 // TT entry depth that we are going to use. Note that in qsearch we use
1219 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1220 ttDepth = inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1221 : DEPTH_QS_NO_CHECKS;
1222 // Transposition table lookup
1224 tte = TT.probe(posKey, ttHit);
1225 ttValue = ttHit ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
1226 ttMove = ttHit ? tte->move() : MOVE_NONE;
1230 && tte->depth() >= ttDepth
1231 && ttValue != VALUE_NONE // Only in case of TT access race
1232 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1233 : (tte->bound() & BOUND_UPPER)))
1236 // Evaluate the position statically
1239 ss->staticEval = VALUE_NONE;
1240 bestValue = futilityBase = -VALUE_INFINITE;
1246 // Never assume anything on values stored in TT
1247 if ((ss->staticEval = bestValue = tte->eval()) == VALUE_NONE)
1248 ss->staticEval = bestValue = evaluate(pos);
1250 // Can ttValue be used as a better position evaluation?
1251 if ( ttValue != VALUE_NONE
1252 && (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER)))
1253 bestValue = ttValue;
1256 ss->staticEval = bestValue =
1257 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
1258 : -(ss-1)->staticEval + 2 * Eval::Tempo;
1260 // Stand pat. Return immediately if static value is at least beta
1261 if (bestValue >= beta)
1264 tte->save(posKey, value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1265 DEPTH_NONE, MOVE_NONE, ss->staticEval, TT.generation());
1270 if (PvNode && bestValue > alpha)
1273 futilityBase = bestValue + 128;
1276 // Initialize a MovePicker object for the current position, and prepare
1277 // to search the moves. Because the depth is <= 0 here, only captures,
1278 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1280 MovePicker mp(pos, ttMove, depth, &pos.this_thread()->mainHistory,
1281 &pos.this_thread()->captureHistory,
1282 to_sq((ss-1)->currentMove));
1284 // Loop through the moves until no moves remain or a beta cutoff occurs
1285 while ((move = mp.next_move()) != MOVE_NONE)
1287 assert(is_ok(move));
1289 givesCheck = gives_check(pos, move);
1296 && futilityBase > -VALUE_KNOWN_WIN
1297 && !pos.advanced_pawn_push(move))
1299 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1301 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1303 if (futilityValue <= alpha)
1305 bestValue = std::max(bestValue, futilityValue);
1309 if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
1311 bestValue = std::max(bestValue, futilityBase);
1316 // Detect non-capture evasions that are candidates to be pruned
1317 evasionPrunable = inCheck
1318 && (depth != DEPTH_ZERO || moveCount > 2)
1319 && bestValue > VALUE_MATED_IN_MAX_PLY
1320 && !pos.capture(move);
1322 // Don't search moves with negative SEE values
1323 if ( (!inCheck || evasionPrunable)
1324 && !pos.see_ge(move))
1327 // Speculative prefetch as early as possible
1328 prefetch(TT.first_entry(pos.key_after(move)));
1330 // Check for legality just before making the move
1331 if (!pos.legal(move))
1337 ss->currentMove = move;
1339 // Make and search the move
1340 pos.do_move(move, st, givesCheck);
1341 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1342 pos.undo_move(move);
1344 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1346 // Check for a new best move
1347 if (value > bestValue)
1353 if (PvNode) // Update pv even in fail-high case
1354 update_pv(ss->pv, move, (ss+1)->pv);
1356 if (PvNode && value < beta) // Update alpha here!
1363 tte->save(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1364 ttDepth, move, ss->staticEval, TT.generation());
1372 // All legal moves have been searched. A special case: If we're in check
1373 // and no legal moves were found, it is checkmate.
1374 if (inCheck && bestValue == -VALUE_INFINITE)
1375 return mated_in(ss->ply); // Plies to mate from the root
1377 tte->save(posKey, value_to_tt(bestValue, ss->ply),
1378 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1379 ttDepth, bestMove, ss->staticEval, TT.generation());
1381 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1387 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1388 // "plies to mate from the current position". Non-mate scores are unchanged.
1389 // The function is called before storing a value in the transposition table.
1391 Value value_to_tt(Value v, int ply) {
1393 assert(v != VALUE_NONE);
1395 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1396 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1400 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1401 // from the transposition table (which refers to the plies to mate/be mated
1402 // from current position) to "plies to mate/be mated from the root".
1404 Value value_from_tt(Value v, int ply) {
1406 return v == VALUE_NONE ? VALUE_NONE
1407 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1408 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1412 // update_pv() adds current move and appends child pv[]
1414 void update_pv(Move* pv, Move move, Move* childPv) {
1416 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1422 // update_continuation_histories() updates histories of the move pairs formed
1423 // by moves at ply -1, -2, and -4 with current move.
1425 void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
1427 for (int i : {1, 2, 4})
1428 if (is_ok((ss-i)->currentMove))
1429 (*(ss-i)->contHistory)[pc][to] << bonus;
1433 // update_capture_stats() updates move sorting heuristics when a new capture best move is found
1435 void update_capture_stats(const Position& pos, Move move,
1436 Move* captures, int captureCnt, int bonus) {
1438 CapturePieceToHistory& captureHistory = pos.this_thread()->captureHistory;
1439 Piece moved_piece = pos.moved_piece(move);
1440 PieceType captured = type_of(pos.piece_on(to_sq(move)));
1441 captureHistory[moved_piece][to_sq(move)][captured] << bonus;
1443 // Decrease all the other played capture moves
1444 for (int i = 0; i < captureCnt; ++i)
1446 moved_piece = pos.moved_piece(captures[i]);
1447 captured = type_of(pos.piece_on(to_sq(captures[i])));
1448 captureHistory[moved_piece][to_sq(captures[i])][captured] << -bonus;
1453 // update_quiet_stats() updates move sorting heuristics when a new quiet best move is found
1455 void update_quiet_stats(const Position& pos, Stack* ss, Move move,
1456 Move* quiets, int quietsCnt, int bonus) {
1458 if (ss->killers[0] != move)
1460 ss->killers[1] = ss->killers[0];
1461 ss->killers[0] = move;
1464 Color us = pos.side_to_move();
1465 Thread* thisThread = pos.this_thread();
1466 thisThread->mainHistory[us][from_to(move)] << bonus;
1467 update_continuation_histories(ss, pos.moved_piece(move), to_sq(move), bonus);
1469 if (is_ok((ss-1)->currentMove))
1471 Square prevSq = to_sq((ss-1)->currentMove);
1472 thisThread->counterMoves[pos.piece_on(prevSq)][prevSq] = move;
1475 // Decrease all the other played quiet moves
1476 for (int i = 0; i < quietsCnt; ++i)
1478 thisThread->mainHistory[us][from_to(quiets[i])] << -bonus;
1479 update_continuation_histories(ss, pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
1483 // When playing with strength handicap, choose best move among a set of RootMoves
1484 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1486 Move Skill::pick_best(size_t multiPV) {
1488 const RootMoves& rootMoves = Threads.main()->rootMoves;
1489 static PRNG rng(now()); // PRNG sequence should be non-deterministic
1491 // RootMoves are already sorted by score in descending order
1492 Value topScore = rootMoves[0].score;
1493 int delta = std::min(topScore - rootMoves[multiPV - 1].score, PawnValueMg);
1494 int weakness = 120 - 2 * level;
1495 int maxScore = -VALUE_INFINITE;
1497 // Choose best move. For each move score we add two terms, both dependent on
1498 // weakness. One is deterministic and bigger for weaker levels, and one is
1499 // random. Then we choose the move with the resulting highest score.
1500 for (size_t i = 0; i < multiPV; ++i)
1502 // This is our magic formula
1503 int push = ( weakness * int(topScore - rootMoves[i].score)
1504 + delta * (rng.rand<unsigned>() % weakness)) / 128;
1506 if (rootMoves[i].score + push >= maxScore)
1508 maxScore = rootMoves[i].score + push;
1509 best = rootMoves[i].pv[0];
1518 /// MainThread::check_time() is used to print debug info and, more importantly,
1519 /// to detect when we are out of available time and thus stop the search.
1521 void MainThread::check_time() {
1526 // When using nodes, ensure checking rate is not lower than 0.1% of nodes
1527 callsCnt = Limits.nodes ? std::min(1024, int(Limits.nodes / 1024)) : 1024;
1529 static TimePoint lastInfoTime = now();
1531 TimePoint elapsed = Time.elapsed();
1532 TimePoint tick = Limits.startTime + elapsed;
1534 if (tick - lastInfoTime >= 1000)
1536 lastInfoTime = tick;
1540 // We should not stop pondering until told so by the GUI
1544 if ( (Limits.use_time_management() && elapsed > Time.maximum() - 10)
1545 || (Limits.movetime && elapsed >= Limits.movetime)
1546 || (Limits.nodes && Threads.nodes_searched() >= (uint64_t)Limits.nodes))
1547 Threads.stop = true;
1551 /// UCI::pv() formats PV information according to the UCI protocol. UCI requires
1552 /// that all (if any) unsearched PV lines are sent using a previous search score.
1554 string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1556 std::stringstream ss;
1557 TimePoint elapsed = Time.elapsed() + 1;
1558 const RootMoves& rootMoves = pos.this_thread()->rootMoves;
1559 size_t PVIdx = pos.this_thread()->PVIdx;
1560 size_t multiPV = std::min((size_t)Options["MultiPV"], rootMoves.size());
1561 uint64_t nodesSearched = Threads.nodes_searched();
1562 uint64_t tbHits = Threads.tb_hits() + (TB::RootInTB ? rootMoves.size() : 0);
1564 for (size_t i = 0; i < multiPV; ++i)
1566 bool updated = (i <= PVIdx && rootMoves[i].score != -VALUE_INFINITE);
1568 if (depth == ONE_PLY && !updated)
1571 Depth d = updated ? depth : depth - ONE_PLY;
1572 Value v = updated ? rootMoves[i].score : rootMoves[i].previousScore;
1574 bool tb = TB::RootInTB && abs(v) < VALUE_MATE - MAX_PLY;
1575 v = tb ? rootMoves[i].TBScore : v;
1577 if (ss.rdbuf()->in_avail()) // Not at first line
1581 << " depth " << d / ONE_PLY
1582 << " seldepth " << rootMoves[i].selDepth
1583 << " multipv " << i + 1
1584 << " score " << UCI::value(v);
1586 if (!tb && i == PVIdx)
1587 ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1589 ss << " nodes " << nodesSearched
1590 << " nps " << nodesSearched * 1000 / elapsed;
1592 if (elapsed > 1000) // Earlier makes little sense
1593 ss << " hashfull " << TT.hashfull();
1595 ss << " tbhits " << tbHits
1596 << " time " << elapsed
1599 for (Move m : rootMoves[i].pv)
1600 ss << " " << UCI::move(m, pos.is_chess960());
1607 /// RootMove::extract_ponder_from_tt() is called in case we have no ponder move
1608 /// before exiting the search, for instance, in case we stop the search during a
1609 /// fail high at root. We try hard to have a ponder move to return to the GUI,
1610 /// otherwise in case of 'ponder on' we have nothing to think on.
1612 bool RootMove::extract_ponder_from_tt(Position& pos) {
1617 assert(pv.size() == 1);
1622 pos.do_move(pv[0], st);
1623 TTEntry* tte = TT.probe(pos.key(), ttHit);
1627 Move m = tte->move(); // Local copy to be SMP safe
1628 if (MoveList<LEGAL>(pos).contains(m))
1632 pos.undo_move(pv[0]);
1633 return pv.size() > 1;
1636 void Tablebases::rank_root_moves(Position& pos, Search::RootMoves& rootMoves) {
1639 UseRule50 = bool(Options["Syzygy50MoveRule"]);
1640 ProbeDepth = int(Options["SyzygyProbeDepth"]) * ONE_PLY;
1641 Cardinality = int(Options["SyzygyProbeLimit"]);
1642 bool dtz_available = true;
1644 // Tables with fewer pieces than SyzygyProbeLimit are searched with
1645 // ProbeDepth == DEPTH_ZERO
1646 if (Cardinality > MaxCardinality)
1648 Cardinality = MaxCardinality;
1649 ProbeDepth = DEPTH_ZERO;
1652 if (Cardinality >= popcount(pos.pieces()) && !pos.can_castle(ANY_CASTLING))
1654 // Rank moves using DTZ tables
1655 RootInTB = root_probe(pos, rootMoves);
1659 // DTZ tables are missing; try to rank moves using WDL tables
1660 dtz_available = false;
1661 RootInTB = root_probe_wdl(pos, rootMoves);
1667 // Sort moves according to TB rank
1668 std::sort(rootMoves.begin(), rootMoves.end(),
1669 [](const RootMove &a, const RootMove &b) { return a.TBRank > b.TBRank; } );
1671 // Probe during search only if DTZ is not available and we are winning
1672 if (dtz_available || rootMoves[0].TBScore <= VALUE_DRAW)
1677 // Assign the same rank to all moves
1678 for (auto& m : rootMoves)