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-2012 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
37 #include "ucioption.h"
41 volatile SignalsType Signals;
43 std::vector<RootMove> RootMoves;
46 Time::point SearchTime;
47 StateStackPtr SetupStates;
52 using namespace Search;
56 // Set to true to force running with one thread. Used for debugging
57 const bool FakeSplit = false;
59 // This is the minimum interval in msec between two check_time() calls
60 const int TimerResolution = 5;
62 // Different node types, used as template parameter
63 enum NodeType { Root, PV, NonPV, SplitPointRoot, SplitPointPV, SplitPointNonPV };
65 // Dynamic razoring margin based on depth
66 inline Value razor_margin(Depth d) { return Value(512 + 16 * int(d)); }
68 // Futility lookup tables (initialized at startup) and their access functions
69 Value FutilityMargins[16][64]; // [depth][moveNumber]
70 int FutilityMoveCounts[32]; // [depth]
72 inline Value futility_margin(Depth d, int mn) {
74 return d < 7 * ONE_PLY ? FutilityMargins[std::max(int(d), 1)][std::min(mn, 63)]
78 // Reduction lookup tables (initialized at startup) and their access function
79 int8_t Reductions[2][64][64]; // [pv][depth][moveNumber]
81 template <bool PvNode> inline Depth reduction(Depth d, int mn) {
83 return (Depth) Reductions[PvNode][std::min(int(d) / ONE_PLY, 63)][std::min(mn, 63)];
89 Value DrawValue[COLOR_NB];
92 template <NodeType NT>
93 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
95 template <NodeType NT, bool InCheck>
96 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
98 void id_loop(Position& pos);
99 Value value_to_tt(Value v, int ply);
100 Value value_from_tt(Value v, int ply);
101 bool check_is_dangerous(Position& pos, Move move, Value futilityBase, Value beta);
102 bool allows_move(const Position& pos, Move first, Move second);
103 bool prevents_move(const Position& pos, Move first, Move second);
104 string uci_pv(const Position& pos, int depth, Value alpha, Value beta);
107 Skill(int l) : level(l), best(MOVE_NONE) {}
109 if (enabled()) // Swap best PV line with the sub-optimal one
110 std::swap(RootMoves[0], *std::find(RootMoves.begin(),
111 RootMoves.end(), best ? best : pick_move()));
114 bool enabled() const { return level < 20; }
115 bool time_to_pick(int depth) const { return depth == 1 + level; }
125 /// Search::init() is called during startup to initialize various lookup tables
127 void Search::init() {
129 int d; // depth (ONE_PLY == 2)
130 int hd; // half depth (ONE_PLY == 1)
133 // Init reductions array
134 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
136 double pvRed = log(double(hd)) * log(double(mc)) / 3.0;
137 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
138 Reductions[1][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
139 Reductions[0][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
142 // Init futility margins array
143 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
144 FutilityMargins[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
146 // Init futility move count array
147 for (d = 0; d < 32; d++)
148 FutilityMoveCounts[d] = int(3.001 + 0.25 * pow(double(d), 2.0));
152 /// Search::perft() is our utility to verify move generation. All the leaf nodes
153 /// up to the given depth are generated and counted and the sum returned.
155 size_t Search::perft(Position& pos, Depth depth) {
157 // At the last ply just return the number of legal moves (leaf nodes)
158 if (depth == ONE_PLY)
159 return MoveList<LEGAL>(pos).size();
165 for (MoveList<LEGAL> ml(pos); !ml.end(); ++ml)
167 pos.do_move(ml.move(), st, ci, pos.move_gives_check(ml.move(), ci));
168 cnt += perft(pos, depth - ONE_PLY);
169 pos.undo_move(ml.move());
176 /// Search::think() is the external interface to Stockfish's search, and is
177 /// called by the main thread when the program receives the UCI 'go' command. It
178 /// searches from RootPos and at the end prints the "bestmove" to output.
180 void Search::think() {
182 static PolyglotBook book; // Defined static to initialize the PRNG only once
184 RootColor = RootPos.side_to_move();
185 TimeMgr.init(Limits, RootPos.startpos_ply_counter(), RootColor);
187 if (RootMoves.empty())
189 RootMoves.push_back(MOVE_NONE);
190 sync_cout << "info depth 0 score "
191 << score_to_uci(RootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
197 if (Options["OwnBook"] && !Limits.infinite && !Limits.mate)
199 Move bookMove = book.probe(RootPos, Options["Book File"], Options["Best Book Move"]);
201 if (bookMove && std::count(RootMoves.begin(), RootMoves.end(), bookMove))
203 std::swap(RootMoves[0], *std::find(RootMoves.begin(), RootMoves.end(), bookMove));
208 if (Options["Contempt Factor"] && !Options["UCI_AnalyseMode"])
210 int cf = Options["Contempt Factor"] * PawnValueMg / 100; // From centipawns
211 cf = cf * Material::game_phase(RootPos) / PHASE_MIDGAME; // Scale down with phase
212 DrawValue[ RootColor] = VALUE_DRAW - Value(cf);
213 DrawValue[~RootColor] = VALUE_DRAW + Value(cf);
216 DrawValue[WHITE] = DrawValue[BLACK] = VALUE_DRAW;
218 if (Options["Use Search Log"])
220 Log log(Options["Search Log Filename"]);
221 log << "\nSearching: " << RootPos.fen()
222 << "\ninfinite: " << Limits.infinite
223 << " ponder: " << Limits.ponder
224 << " time: " << Limits.time[RootColor]
225 << " increment: " << Limits.inc[RootColor]
226 << " moves to go: " << Limits.movestogo
230 // Reset the threads, still sleeping: will be wake up at split time
231 for (size_t i = 0; i < Threads.size(); i++)
232 Threads[i].maxPly = 0;
234 Threads.sleepWhileIdle = Options["Use Sleeping Threads"];
236 // Set best timer interval to avoid lagging under time pressure. Timer is
237 // used to check for remaining available thinking time.
238 Threads.timer_thread()->msec =
239 Limits.use_time_management() ? std::min(100, std::max(TimeMgr.available_time() / 16, TimerResolution)) :
240 Limits.nodes ? 2 * TimerResolution
243 Threads.timer_thread()->notify_one(); // Wake up the recurring timer
245 id_loop(RootPos); // Let's start searching !
247 Threads.timer_thread()->msec = 0; // Stop the timer
248 Threads.sleepWhileIdle = true; // Send idle threads to sleep
250 if (Options["Use Search Log"])
252 Time::point elapsed = Time::now() - SearchTime + 1;
254 Log log(Options["Search Log Filename"]);
255 log << "Nodes: " << RootPos.nodes_searched()
256 << "\nNodes/second: " << RootPos.nodes_searched() * 1000 / elapsed
257 << "\nBest move: " << move_to_san(RootPos, RootMoves[0].pv[0]);
260 RootPos.do_move(RootMoves[0].pv[0], st);
261 log << "\nPonder move: " << move_to_san(RootPos, RootMoves[0].pv[1]) << std::endl;
262 RootPos.undo_move(RootMoves[0].pv[0]);
267 // When we reach max depth we arrive here even without Signals.stop is raised,
268 // but if we are pondering or in infinite search, according to UCI protocol,
269 // we shouldn't print the best move before the GUI sends a "stop" or "ponderhit"
270 // command. We simply wait here until GUI sends one of those commands (that
271 // raise Signals.stop).
272 if (!Signals.stop && (Limits.ponder || Limits.infinite))
274 Signals.stopOnPonderhit = true;
275 RootPos.this_thread()->wait_for(Signals.stop);
278 // Best move could be MOVE_NONE when searching on a stalemate position
279 sync_cout << "bestmove " << move_to_uci(RootMoves[0].pv[0], RootPos.is_chess960())
280 << " ponder " << move_to_uci(RootMoves[0].pv[1], RootPos.is_chess960())
287 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
288 // with increasing depth until the allocated thinking time has been consumed,
289 // user stops the search, or the maximum search depth is reached.
291 void id_loop(Position& pos) {
293 Stack ss[MAX_PLY_PLUS_2];
294 int depth, prevBestMoveChanges;
295 Value bestValue, alpha, beta, delta;
296 bool bestMoveNeverChanged = true;
298 memset(ss, 0, 4 * sizeof(Stack));
299 depth = BestMoveChanges = 0;
300 bestValue = delta = -VALUE_INFINITE;
301 ss->currentMove = MOVE_NULL; // Hack to skip update gains
305 PVSize = Options["MultiPV"];
306 Skill skill(Options["Skill Level"]);
308 // Do we have to play with skill handicap? In this case enable MultiPV search
309 // that we will use behind the scenes to retrieve a set of possible moves.
310 if (skill.enabled() && PVSize < 4)
313 PVSize = std::min(PVSize, RootMoves.size());
315 // Iterative deepening loop until requested to stop or target depth reached
316 while (++depth <= MAX_PLY && !Signals.stop && (!Limits.depth || depth <= Limits.depth))
318 // Save last iteration's scores before first PV line is searched and all
319 // the move scores but the (new) PV are set to -VALUE_INFINITE.
320 for (size_t i = 0; i < RootMoves.size(); i++)
321 RootMoves[i].prevScore = RootMoves[i].score;
323 prevBestMoveChanges = BestMoveChanges; // Only sensible when PVSize == 1
326 // MultiPV loop. We perform a full root search for each PV line
327 for (PVIdx = 0; PVIdx < PVSize; PVIdx++)
329 // Set aspiration window default width
330 if (depth >= 5 && abs(RootMoves[PVIdx].prevScore) < VALUE_KNOWN_WIN)
333 alpha = RootMoves[PVIdx].prevScore - delta;
334 beta = RootMoves[PVIdx].prevScore + delta;
338 alpha = -VALUE_INFINITE;
339 beta = VALUE_INFINITE;
342 // Start with a small aspiration window and, in case of fail high/low,
343 // research with bigger window until not failing high/low anymore.
346 // Search starts from ss+1 to allow referencing (ss-1). This is
347 // needed by update gains and ss copy when splitting at Root.
348 bestValue = search<Root>(pos, ss+1, alpha, beta, depth * ONE_PLY);
350 // Bring to front the best move. It is critical that sorting is
351 // done with a stable algorithm because all the values but the first
352 // and eventually the new best one are set to -VALUE_INFINITE and
353 // we want to keep the same order for all the moves but the new
354 // PV that goes to the front. Note that in case of MultiPV search
355 // the already searched PV lines are preserved.
356 sort<RootMove>(RootMoves.begin() + PVIdx, RootMoves.end());
358 // Write PV back to transposition table in case the relevant
359 // entries have been overwritten during the search.
360 for (size_t i = 0; i <= PVIdx; i++)
361 RootMoves[i].insert_pv_in_tt(pos);
363 // If search has been stopped return immediately. Sorting and
364 // writing PV back to TT is safe becuase RootMoves is still
365 // valid, although refers to previous iteration.
369 // In case of failing high/low increase aspiration window and
370 // research, otherwise exit the loop.
371 if (bestValue > alpha && bestValue < beta)
374 // Give some update (without cluttering the UI) before to research
375 if (Time::now() - SearchTime > 3000)
376 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
378 if (abs(bestValue) >= VALUE_KNOWN_WIN)
380 alpha = -VALUE_INFINITE;
381 beta = VALUE_INFINITE;
383 else if (bestValue >= beta)
390 Signals.failedLowAtRoot = true;
391 Signals.stopOnPonderhit = false;
397 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
400 // Sort the PV lines searched so far and update the GUI
401 sort<RootMove>(RootMoves.begin(), RootMoves.begin() + PVIdx + 1);
402 if (PVIdx + 1 == PVSize || Time::now() - SearchTime > 3000)
403 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
406 // Do we need to pick now the sub-optimal best move ?
407 if (skill.enabled() && skill.time_to_pick(depth))
410 if (Options["Use Search Log"])
412 Log log(Options["Search Log Filename"]);
413 log << pretty_pv(pos, depth, bestValue, Time::now() - SearchTime, &RootMoves[0].pv[0])
417 // Filter out startup noise when monitoring best move stability
418 if (depth > 2 && BestMoveChanges)
419 bestMoveNeverChanged = false;
421 // Do we have found a "mate in x"?
423 && bestValue >= VALUE_MATE_IN_MAX_PLY
424 && VALUE_MATE - bestValue <= 2 * Limits.mate)
427 // Do we have time for the next iteration? Can we stop searching now?
428 if (Limits.use_time_management() && !Signals.stopOnPonderhit)
430 bool stop = false; // Local variable, not the volatile Signals.stop
432 // Take in account some extra time if the best move has changed
433 if (depth > 4 && depth < 50 && PVSize == 1)
434 TimeMgr.pv_instability(BestMoveChanges, prevBestMoveChanges);
436 // Stop search if most of available time is already consumed. We
437 // probably don't have enough time to search the first move at the
438 // next iteration anyway.
439 if (Time::now() - SearchTime > (TimeMgr.available_time() * 62) / 100)
442 // Stop search early if one move seems to be much better than others
446 && ( (bestMoveNeverChanged && pos.captured_piece_type())
447 || Time::now() - SearchTime > (TimeMgr.available_time() * 40) / 100))
449 Value rBeta = bestValue - 2 * PawnValueMg;
450 (ss+1)->excludedMove = RootMoves[0].pv[0];
451 (ss+1)->skipNullMove = true;
452 Value v = search<NonPV>(pos, ss+1, rBeta - 1, rBeta, (depth - 3) * ONE_PLY);
453 (ss+1)->skipNullMove = false;
454 (ss+1)->excludedMove = MOVE_NONE;
462 // If we are allowed to ponder do not stop the search now but
463 // keep pondering until GUI sends "ponderhit" or "stop".
465 Signals.stopOnPonderhit = true;
474 // search<>() is the main search function for both PV and non-PV nodes and for
475 // normal and SplitPoint nodes. When called just after a split point the search
476 // is simpler because we have already probed the hash table, done a null move
477 // search, and searched the first move before splitting, we don't have to repeat
478 // all this work again. We also don't need to store anything to the hash table
479 // here: This is taken care of after we return from the split point.
481 template <NodeType NT>
482 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
484 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV || NT == SplitPointRoot);
485 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV || NT == SplitPointRoot);
486 const bool RootNode = (NT == Root || NT == SplitPointRoot);
488 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
489 assert(PvNode || (alpha == beta - 1));
490 assert(depth > DEPTH_ZERO);
492 Move movesSearched[64];
497 Move ttMove, move, excludedMove, bestMove, threatMove;
499 Value bestValue, value, ttValue;
500 Value eval, nullValue, futilityValue;
501 bool inCheck, givesCheck, pvMove, singularExtensionNode;
502 bool captureOrPromotion, dangerous, doFullDepthSearch, threatExtension;
503 int moveCount, playedMoveCount;
505 // Step 1. Initialize node
506 Thread* thisThread = pos.this_thread();
507 moveCount = playedMoveCount = 0;
508 threatExtension = false;
509 inCheck = pos.checkers();
514 bestMove = sp->bestMove;
515 threatMove = sp->threatMove;
516 bestValue = sp->bestValue;
518 ttMove = excludedMove = MOVE_NONE;
519 ttValue = VALUE_NONE;
521 assert(sp->bestValue > -VALUE_INFINITE && sp->moveCount > 0);
523 goto split_point_start;
526 bestValue = -VALUE_INFINITE;
527 ss->currentMove = threatMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
528 ss->ply = (ss-1)->ply + 1;
529 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
530 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
532 // Used to send selDepth info to GUI
533 if (PvNode && thisThread->maxPly < ss->ply)
534 thisThread->maxPly = ss->ply;
538 // Step 2. Check for aborted search and immediate draw
539 if (Signals.stop || pos.is_draw<true, PvNode>() || ss->ply > MAX_PLY)
540 return DrawValue[pos.side_to_move()];
542 // Step 3. Mate distance pruning. Even if we mate at the next move our score
543 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
544 // a shorter mate was found upward in the tree then there is no need to search
545 // further, we will never beat current alpha. Same logic but with reversed signs
546 // applies also in the opposite condition of being mated instead of giving mate,
547 // in this case return a fail-high score.
548 alpha = std::max(mated_in(ss->ply), alpha);
549 beta = std::min(mate_in(ss->ply+1), beta);
554 // Step 4. Transposition table lookup
555 // We don't want the score of a partial search to overwrite a previous full search
556 // TT value, so we use a different position key in case of an excluded move.
557 excludedMove = ss->excludedMove;
558 posKey = excludedMove ? pos.exclusion_key() : pos.key();
559 tte = TT.probe(posKey);
560 ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
561 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
563 // At PV nodes we check for exact scores, while at non-PV nodes we check for
564 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
565 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
566 // we should also update RootMoveList to avoid bogus output.
569 && tte->depth() >= depth
570 && ttValue != VALUE_NONE // Only in case of TT access race
571 && ( PvNode ? tte->type() == BOUND_EXACT
572 : ttValue >= beta ? (tte->type() & BOUND_LOWER)
573 : (tte->type() & BOUND_UPPER)))
576 ss->currentMove = ttMove; // Can be MOVE_NONE
580 && !pos.is_capture_or_promotion(ttMove)
581 && ttMove != ss->killers[0])
583 ss->killers[1] = ss->killers[0];
584 ss->killers[0] = ttMove;
589 // Step 5. Evaluate the position statically and update parent's gain statistics
591 ss->staticEval = ss->evalMargin = eval = VALUE_NONE;
595 // Never assume anything on values stored in TT
596 if ( (ss->staticEval = eval = tte->static_value()) == VALUE_NONE
597 ||(ss->evalMargin = tte->static_value_margin()) == VALUE_NONE)
598 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
600 // Can ttValue be used as a better position evaluation?
601 if (ttValue != VALUE_NONE)
602 if ( ((tte->type() & BOUND_LOWER) && ttValue > eval)
603 || ((tte->type() & BOUND_UPPER) && ttValue < eval))
608 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
609 TT.store(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE,
610 ss->staticEval, ss->evalMargin);
613 // Update gain for the parent non-capture move given the static position
614 // evaluation before and after the move.
615 if ( (move = (ss-1)->currentMove) != MOVE_NULL
616 && (ss-1)->staticEval != VALUE_NONE
617 && ss->staticEval != VALUE_NONE
618 && !pos.captured_piece_type()
619 && type_of(move) == NORMAL)
621 Square to = to_sq(move);
622 H.update_gain(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
625 // Step 6. Razoring (is omitted in PV nodes)
627 && depth < 4 * ONE_PLY
629 && eval + razor_margin(depth) < beta
630 && ttMove == MOVE_NONE
631 && abs(beta) < VALUE_MATE_IN_MAX_PLY
632 && !pos.pawn_on_7th(pos.side_to_move()))
634 Value rbeta = beta - razor_margin(depth);
635 Value v = qsearch<NonPV, false>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
637 // Logically we should return (v + razor_margin(depth)), but
638 // surprisingly this did slightly weaker in tests.
642 // Step 7. Static null move pruning (is omitted in PV nodes)
643 // We're betting that the opponent doesn't have a move that will reduce
644 // the score by more than futility_margin(depth) if we do a null move.
647 && depth < 4 * ONE_PLY
649 && eval - FutilityMargins[depth][0] >= beta
650 && abs(beta) < VALUE_MATE_IN_MAX_PLY
651 && pos.non_pawn_material(pos.side_to_move()))
652 return eval - FutilityMargins[depth][0];
654 // Step 8. Null move search with verification search (is omitted in PV nodes)
660 && abs(beta) < VALUE_MATE_IN_MAX_PLY
661 && pos.non_pawn_material(pos.side_to_move()))
663 ss->currentMove = MOVE_NULL;
665 // Null move dynamic reduction based on depth
666 Depth R = 3 * ONE_PLY + depth / 4;
668 // Null move dynamic reduction based on value
669 if (eval - PawnValueMg > beta)
672 pos.do_null_move<true>(st);
673 (ss+1)->skipNullMove = true;
674 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
675 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R);
676 (ss+1)->skipNullMove = false;
677 pos.do_null_move<false>(st);
679 if (nullValue >= beta)
681 // Do not return unproven mate scores
682 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
685 if (depth < 6 * ONE_PLY)
688 // Do verification search at high depths
689 ss->skipNullMove = true;
690 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R);
691 ss->skipNullMove = false;
698 // The null move failed low, which means that we may be faced with
699 // some kind of threat. If the previous move was reduced, check if
700 // the move that refuted the null move was somehow connected to the
701 // move which was reduced. If a connection is found extend moves that
702 // defend against threat.
703 threatMove = (ss+1)->currentMove;
705 if ( depth < 5 * ONE_PLY
707 && threatMove != MOVE_NONE
708 && allows_move(pos, (ss-1)->currentMove, threatMove))
709 threatExtension = true;
713 // Step 9. ProbCut (is omitted in PV nodes)
714 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
715 // and a reduced search returns a value much above beta, we can (almost) safely
716 // prune the previous move.
718 && depth >= 5 * ONE_PLY
721 && excludedMove == MOVE_NONE
722 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
724 Value rbeta = beta + 200;
725 Depth rdepth = depth - ONE_PLY - 3 * ONE_PLY;
727 assert(rdepth >= ONE_PLY);
728 assert((ss-1)->currentMove != MOVE_NONE);
729 assert((ss-1)->currentMove != MOVE_NULL);
731 MovePicker mp(pos, ttMove, H, pos.captured_piece_type());
734 while ((move = mp.next_move<false>()) != MOVE_NONE)
735 if (pos.pl_move_is_legal(move, ci.pinned))
737 ss->currentMove = move;
738 pos.do_move(move, st, ci, pos.move_gives_check(move, ci));
739 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth);
746 // Step 10. Internal iterative deepening
747 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
748 && ttMove == MOVE_NONE
749 && (PvNode || (!inCheck && ss->staticEval + Value(256) >= beta)))
751 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
753 ss->skipNullMove = true;
754 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d);
755 ss->skipNullMove = false;
757 tte = TT.probe(posKey);
758 ttMove = tte ? tte->move() : MOVE_NONE;
761 split_point_start: // At split points actual search starts from here
763 MovePicker mp(pos, ttMove, depth, H, ss, PvNode ? -VALUE_INFINITE : beta);
765 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
766 singularExtensionNode = !RootNode
768 && depth >= (PvNode ? 6 * ONE_PLY : 8 * ONE_PLY)
769 && ttMove != MOVE_NONE
770 && !excludedMove // Recursive singular search is not allowed
771 && (tte->type() & BOUND_LOWER)
772 && tte->depth() >= depth - 3 * ONE_PLY;
774 // Step 11. Loop through moves
775 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
776 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
780 if (move == excludedMove)
783 // At root obey the "searchmoves" option and skip moves not listed in Root
784 // Move List, as a consequence any illegal move is also skipped. In MultiPV
785 // mode we also skip PV moves which have been already searched.
786 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
791 // Shared counter cannot be decremented later if move turns out to be illegal
792 if (!pos.pl_move_is_legal(move, ci.pinned))
795 moveCount = ++sp->moveCount;
803 Signals.firstRootMove = (moveCount == 1);
805 if (thisThread == Threads.main_thread() && Time::now() - SearchTime > 3000)
806 sync_cout << "info depth " << depth / ONE_PLY
807 << " currmove " << move_to_uci(move, pos.is_chess960())
808 << " currmovenumber " << moveCount + PVIdx << sync_endl;
812 captureOrPromotion = pos.is_capture_or_promotion(move);
813 givesCheck = pos.move_gives_check(move, ci);
814 dangerous = givesCheck
815 || pos.is_passed_pawn_push(move)
816 || type_of(move) == CASTLE
817 || ( captureOrPromotion // Entering a pawn endgame?
818 && type_of(pos.piece_on(to_sq(move))) != PAWN
819 && type_of(move) == NORMAL
820 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
821 - PieceValue[MG][pos.piece_on(to_sq(move))] == VALUE_ZERO));
823 // Step 12. Extend checks and, in PV nodes, also dangerous moves
824 if (PvNode && dangerous)
827 else if (threatExtension && prevents_move(pos, move, threatMove))
830 else if (givesCheck && pos.see_sign(move) >= 0)
833 // Singular extension search. If all moves but one fail low on a search of
834 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
835 // is singular and should be extended. To verify this we do a reduced search
836 // on all the other moves but the ttMove, if result is lower than ttValue minus
837 // a margin then we extend ttMove.
838 if ( singularExtensionNode
841 && pos.pl_move_is_legal(move, ci.pinned)
842 && abs(ttValue) < VALUE_KNOWN_WIN)
844 assert(ttValue != VALUE_NONE);
846 Value rBeta = ttValue - int(depth);
847 ss->excludedMove = move;
848 ss->skipNullMove = true;
849 value = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2);
850 ss->skipNullMove = false;
851 ss->excludedMove = MOVE_NONE;
854 ext = rBeta >= beta ? ONE_PLY + ONE_PLY / 2 : ONE_PLY;
857 // Update current move (this must be done after singular extension search)
858 newDepth = depth - ONE_PLY + ext;
860 // Step 13. Futility pruning (is omitted in PV nodes)
862 && !captureOrPromotion
866 && (bestValue > VALUE_MATED_IN_MAX_PLY || ( bestValue == -VALUE_INFINITE
867 && alpha > VALUE_MATED_IN_MAX_PLY)))
869 // Move count based pruning
870 if ( depth < 16 * ONE_PLY
871 && moveCount >= FutilityMoveCounts[depth]
872 && (!threatMove || !prevents_move(pos, move, threatMove)))
880 // Value based pruning
881 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
882 // but fixing this made program slightly weaker.
883 Depth predictedDepth = newDepth - reduction<PvNode>(depth, moveCount);
884 futilityValue = ss->staticEval + ss->evalMargin + futility_margin(predictedDepth, moveCount)
885 + H.gain(pos.piece_moved(move), to_sq(move));
887 if (futilityValue < beta)
895 // Prune moves with negative SEE at low depths
896 if ( predictedDepth < 2 * ONE_PLY
897 && pos.see_sign(move) < 0)
906 // Check for legality only before to do the move
907 if (!RootNode && !SpNode && !pos.pl_move_is_legal(move, ci.pinned))
913 pvMove = PvNode && moveCount == 1;
914 ss->currentMove = move;
915 if (!SpNode && !captureOrPromotion && playedMoveCount < 64)
916 movesSearched[playedMoveCount++] = move;
918 // Step 14. Make the move
919 pos.do_move(move, st, ci, givesCheck);
921 // Step 15. Reduced depth search (LMR). If the move fails high will be
922 // re-searched at full depth.
923 if ( depth > 3 * ONE_PLY
925 && !captureOrPromotion
927 && ss->killers[0] != move
928 && ss->killers[1] != move)
930 ss->reduction = reduction<PvNode>(depth, moveCount);
931 Depth d = std::max(newDepth - ss->reduction, ONE_PLY);
932 alpha = SpNode ? sp->alpha : alpha;
934 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d);
936 doFullDepthSearch = (value > alpha && ss->reduction != DEPTH_ZERO);
937 ss->reduction = DEPTH_ZERO;
940 doFullDepthSearch = !pvMove;
942 // Step 16. Full depth search, when LMR is skipped or fails high
943 if (doFullDepthSearch)
945 alpha = SpNode ? sp->alpha : alpha;
946 value = newDepth < ONE_PLY ?
947 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
948 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
949 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth);
952 // Only for PV nodes do a full PV search on the first move or after a fail
953 // high, in the latter case search only if value < beta, otherwise let the
954 // parent node to fail low with value <= alpha and to try another move.
955 if (PvNode && (pvMove || (value > alpha && (RootNode || value < beta))))
956 value = newDepth < ONE_PLY ?
957 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
958 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
959 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
960 // Step 17. Undo move
963 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
965 // Step 18. Check for new best move
969 bestValue = sp->bestValue;
973 // Finished searching the move. If Signals.stop is true, the search
974 // was aborted because the user interrupted the search or because we
975 // ran out of time. In this case, the return value of the search cannot
976 // be trusted, and we don't update the best move and/or PV.
977 if (Signals.stop || thisThread->cutoff_occurred())
978 return value; // To avoid returning VALUE_INFINITE
982 RootMove& rm = *std::find(RootMoves.begin(), RootMoves.end(), move);
984 // PV move or new best move ?
985 if (pvMove || value > alpha)
988 rm.extract_pv_from_tt(pos);
990 // We record how often the best move has been changed in each
991 // iteration. This information is used for time management: When
992 // the best move changes frequently, we allocate some more time.
997 // All other moves but the PV are set to the lowest value, this
998 // is not a problem when sorting becuase sort is stable and move
999 // position in the list is preserved, just the PV is pushed up.
1000 rm.score = -VALUE_INFINITE;
1003 if (value > bestValue)
1005 bestValue = SpNode ? sp->bestValue = value : value;
1009 bestMove = SpNode ? sp->bestMove = move : move;
1011 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1012 alpha = SpNode ? sp->alpha = value : value;
1015 assert(value >= beta); // Fail high
1025 // Step 19. Check for splitting the search
1027 && depth >= Threads.min_split_depth()
1028 && Threads.available_slave_exists(thisThread))
1030 assert(bestValue < beta);
1032 bestValue = Threads.split<FakeSplit>(pos, ss, alpha, beta, bestValue, &bestMove,
1033 depth, threatMove, moveCount, mp, NT);
1034 if (bestValue >= beta)
1042 // Step 20. Check for mate and stalemate
1043 // All legal moves have been searched and if there are no legal moves, it
1044 // must be mate or stalemate. Note that we can have a false positive in
1045 // case of Signals.stop or thread.cutoff_occurred() are set, but this is
1046 // harmless because return value is discarded anyhow in the parent nodes.
1047 // If we are in a singular extension search then return a fail low score.
1048 // A split node has at least one move, the one tried before to be splitted.
1050 return excludedMove ? alpha
1051 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1053 // If we have pruned all the moves without searching return a fail-low score
1054 if (bestValue == -VALUE_INFINITE)
1056 assert(!playedMoveCount);
1061 if (bestValue >= beta) // Failed high
1063 TT.store(posKey, value_to_tt(bestValue, ss->ply), BOUND_LOWER, depth,
1064 bestMove, ss->staticEval, ss->evalMargin);
1066 if (!pos.is_capture_or_promotion(bestMove) && !inCheck)
1068 if (bestMove != ss->killers[0])
1070 ss->killers[1] = ss->killers[0];
1071 ss->killers[0] = bestMove;
1074 // Increase history value of the cut-off move
1075 Value bonus = Value(int(depth) * int(depth));
1076 H.add(pos.piece_moved(bestMove), to_sq(bestMove), bonus);
1078 // Decrease history of all the other played non-capture moves
1079 for (int i = 0; i < playedMoveCount - 1; i++)
1081 Move m = movesSearched[i];
1082 H.add(pos.piece_moved(m), to_sq(m), -bonus);
1086 else // Failed low or PV search
1087 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1088 PvNode && bestMove != MOVE_NONE ? BOUND_EXACT : BOUND_UPPER,
1089 depth, bestMove, ss->staticEval, ss->evalMargin);
1091 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1097 // qsearch() is the quiescence search function, which is called by the main
1098 // search function when the remaining depth is zero (or, to be more precise,
1099 // less than ONE_PLY).
1101 template <NodeType NT, bool InCheck>
1102 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1104 const bool PvNode = (NT == PV);
1106 assert(NT == PV || NT == NonPV);
1107 assert(InCheck == !!pos.checkers());
1108 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1109 assert(PvNode || (alpha == beta - 1));
1110 assert(depth <= DEPTH_ZERO);
1115 Move ttMove, move, bestMove;
1116 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1117 bool givesCheck, enoughMaterial, evasionPrunable;
1120 // To flag BOUND_EXACT a node with eval above alpha and no available moves
1124 ss->currentMove = bestMove = MOVE_NONE;
1125 ss->ply = (ss-1)->ply + 1;
1127 // Check for an instant draw or maximum ply reached
1128 if (pos.is_draw<false, false>() || ss->ply > MAX_PLY)
1129 return DrawValue[pos.side_to_move()];
1131 // Transposition table lookup. At PV nodes, we don't use the TT for
1132 // pruning, but only for move ordering.
1134 tte = TT.probe(posKey);
1135 ttMove = tte ? tte->move() : MOVE_NONE;
1136 ttValue = tte ? value_from_tt(tte->value(),ss->ply) : VALUE_NONE;
1138 // Decide whether or not to include checks, this fixes also the type of
1139 // TT entry depth that we are going to use. Note that in qsearch we use
1140 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1141 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1142 : DEPTH_QS_NO_CHECKS;
1144 && tte->depth() >= ttDepth
1145 && ttValue != VALUE_NONE // Only in case of TT access race
1146 && ( PvNode ? tte->type() == BOUND_EXACT
1147 : ttValue >= beta ? (tte->type() & BOUND_LOWER)
1148 : (tte->type() & BOUND_UPPER)))
1150 ss->currentMove = ttMove; // Can be MOVE_NONE
1154 // Evaluate the position statically
1157 ss->staticEval = ss->evalMargin = VALUE_NONE;
1158 bestValue = futilityBase = -VALUE_INFINITE;
1159 enoughMaterial = false;
1165 // Never assume anything on values stored in TT
1166 if ( (ss->staticEval = bestValue = tte->static_value()) == VALUE_NONE
1167 ||(ss->evalMargin = tte->static_value_margin()) == VALUE_NONE)
1168 ss->staticEval = bestValue = evaluate(pos, ss->evalMargin);
1171 ss->staticEval = bestValue = evaluate(pos, ss->evalMargin);
1173 // Stand pat. Return immediately if static value is at least beta
1174 if (bestValue >= beta)
1177 TT.store(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1178 DEPTH_NONE, MOVE_NONE, ss->staticEval, ss->evalMargin);
1183 if (PvNode && bestValue > alpha)
1186 futilityBase = ss->staticEval + ss->evalMargin + Value(128);
1187 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMg;
1190 // Initialize a MovePicker object for the current position, and prepare
1191 // to search the moves. Because the depth is <= 0 here, only captures,
1192 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1194 MovePicker mp(pos, ttMove, depth, H, to_sq((ss-1)->currentMove));
1197 // Loop through the moves until no moves remain or a beta cutoff occurs
1198 while ((move = mp.next_move<false>()) != MOVE_NONE)
1200 assert(is_ok(move));
1202 givesCheck = pos.move_gives_check(move, ci);
1210 && type_of(move) != PROMOTION
1211 && !pos.is_passed_pawn_push(move))
1213 futilityValue = futilityBase
1214 + PieceValue[EG][pos.piece_on(to_sq(move))]
1215 + (type_of(move) == ENPASSANT ? PawnValueEg : VALUE_ZERO);
1217 if (futilityValue < beta)
1219 bestValue = std::max(bestValue, futilityValue);
1223 // Prune moves with negative or equal SEE
1224 if ( futilityBase < beta
1225 && depth < DEPTH_ZERO
1226 && pos.see(move) <= 0)
1228 bestValue = std::max(bestValue, futilityBase);
1233 // Detect non-capture evasions that are candidate to be pruned
1234 evasionPrunable = !PvNode
1236 && bestValue > VALUE_MATED_IN_MAX_PLY
1237 && !pos.is_capture(move)
1238 && !pos.can_castle(pos.side_to_move());
1240 // Don't search moves with negative SEE values
1242 && (!InCheck || evasionPrunable)
1244 && type_of(move) != PROMOTION
1245 && pos.see_sign(move) < 0)
1248 // Don't search useless checks
1253 && !pos.is_capture_or_promotion(move)
1254 && ss->staticEval + PawnValueMg / 4 < beta
1255 && !check_is_dangerous(pos, move, futilityBase, beta))
1258 // Check for legality only before to do the move
1259 if (!pos.pl_move_is_legal(move, ci.pinned))
1262 ss->currentMove = move;
1264 // Make and search the move
1265 pos.do_move(move, st, ci, givesCheck);
1266 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1267 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1268 pos.undo_move(move);
1270 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1272 // Check for new best move
1273 if (value > bestValue)
1279 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1286 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1287 ttDepth, move, ss->staticEval, ss->evalMargin);
1295 // All legal moves have been searched. A special case: If we're in check
1296 // and no legal moves were found, it is checkmate.
1297 if (InCheck && bestValue == -VALUE_INFINITE)
1298 return mated_in(ss->ply); // Plies to mate from the root
1300 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1301 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1302 ttDepth, bestMove, ss->staticEval, ss->evalMargin);
1304 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1310 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1311 // "plies to mate from the current position". Non-mate scores are unchanged.
1312 // The function is called before storing a value to the transposition table.
1314 Value value_to_tt(Value v, int ply) {
1316 assert(v != VALUE_NONE);
1318 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1319 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1323 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1324 // from the transposition table (where refers to the plies to mate/be mated
1325 // from current position) to "plies to mate/be mated from the root".
1327 Value value_from_tt(Value v, int ply) {
1329 return v == VALUE_NONE ? VALUE_NONE
1330 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1331 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1335 // check_is_dangerous() tests if a checking move can be pruned in qsearch()
1337 bool check_is_dangerous(Position& pos, Move move, Value futilityBase, Value beta)
1339 Piece pc = pos.piece_moved(move);
1340 Square from = from_sq(move);
1341 Square to = to_sq(move);
1342 Color them = ~pos.side_to_move();
1343 Square ksq = pos.king_square(them);
1344 Bitboard enemies = pos.pieces(them);
1345 Bitboard kingAtt = pos.attacks_from<KING>(ksq);
1346 Bitboard occ = pos.pieces() ^ from ^ ksq;
1347 Bitboard oldAtt = pos.attacks_from(pc, from, occ);
1348 Bitboard newAtt = pos.attacks_from(pc, to, occ);
1350 // Checks which give opponent's king at most one escape square are dangerous
1351 if (!more_than_one(kingAtt & ~(enemies | newAtt | to)))
1354 // Queen contact check is very dangerous
1355 if (type_of(pc) == QUEEN && (kingAtt & to))
1358 // Creating new double threats with checks is dangerous
1359 Bitboard b = (enemies ^ ksq) & newAtt & ~oldAtt;
1362 // Note that here we generate illegal "double move"!
1363 if (futilityBase + PieceValue[EG][pos.piece_on(pop_lsb(&b))] >= beta)
1371 // allows_move() tests whether the move at previous ply (first) somehow makes a
1372 // second move possible, for instance if the moving piece is the same in both
1373 // moves. Normally the second move is the threat move (the best move returned
1374 // from a null search that fails low).
1376 bool allows_move(const Position& pos, Move first, Move second) {
1378 assert(is_ok(first));
1379 assert(is_ok(second));
1380 assert(color_of(pos.piece_on(from_sq(second))) == ~pos.side_to_move());
1381 assert(color_of(pos.piece_on(to_sq(first))) == ~pos.side_to_move());
1383 Square m1from = from_sq(first);
1384 Square m2from = from_sq(second);
1385 Square m1to = to_sq(first);
1386 Square m2to = to_sq(second);
1388 // The piece is the same or second's destination was vacated by the first move
1389 if (m1to == m2from || m2to == m1from)
1392 // Second one moves through the square vacated by first one
1393 if (between_bb(m2from, m2to) & m1from)
1396 // Second's destination is defended by the first move's piece
1397 Bitboard m1att = pos.attacks_from(pos.piece_on(m1to), m1to, pos.pieces() ^ m2from);
1401 // Second move gives a discovered check through the first's checking piece
1402 if (m1att & pos.king_square(pos.side_to_move()))
1404 assert(between_bb(m1to, pos.king_square(pos.side_to_move())) & m2from);
1412 // prevents_move() tests whether a move (first) is able to defend against an
1413 // opponent's move (second). In this case will not be pruned. Normally the
1414 // second move is the threat move (the best move returned from a null search
1417 bool prevents_move(const Position& pos, Move first, Move second) {
1419 assert(is_ok(first));
1420 assert(is_ok(second));
1422 Square m1from = from_sq(first);
1423 Square m2from = from_sq(second);
1424 Square m1to = to_sq(first);
1425 Square m2to = to_sq(second);
1427 // Don't prune moves of the threatened piece
1431 // If the threatened piece has value less than or equal to the value of the
1432 // threat piece, don't prune moves which defend it.
1433 if ( pos.is_capture(second)
1434 && ( PieceValue[MG][pos.piece_on(m2from)] >= PieceValue[MG][pos.piece_on(m2to)]
1435 || type_of(pos.piece_on(m2from)) == KING))
1437 // Update occupancy as if the piece and the threat are moving
1438 Bitboard occ = pos.pieces() ^ m1from ^ m1to ^ m2from;
1439 Piece piece = pos.piece_on(m1from);
1441 // The moved piece attacks the square 'tto' ?
1442 if (pos.attacks_from(piece, m1to, occ) & m2to)
1445 // Scan for possible X-ray attackers behind the moved piece
1446 Bitboard xray = (attacks_bb< ROOK>(m2to, occ) & pos.pieces(color_of(piece), QUEEN, ROOK))
1447 | (attacks_bb<BISHOP>(m2to, occ) & pos.pieces(color_of(piece), QUEEN, BISHOP));
1449 // Verify attackers are triggered by our move and not already existing
1450 if (xray && (xray ^ (xray & pos.attacks_from<QUEEN>(m2to))))
1454 // Don't prune safe moves which block the threat path
1455 if ((between_bb(m2from, m2to) & m1to) && pos.see_sign(first) >= 0)
1462 // When playing with strength handicap choose best move among the MultiPV set
1463 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1465 Move Skill::pick_move() {
1469 // PRNG sequence should be not deterministic
1470 for (int i = Time::now() % 50; i > 0; i--)
1471 rk.rand<unsigned>();
1473 // RootMoves are already sorted by score in descending order
1474 int variance = std::min(RootMoves[0].score - RootMoves[PVSize - 1].score, PawnValueMg);
1475 int weakness = 120 - 2 * level;
1476 int max_s = -VALUE_INFINITE;
1479 // Choose best move. For each move score we add two terms both dependent on
1480 // weakness, one deterministic and bigger for weaker moves, and one random,
1481 // then we choose the move with the resulting highest score.
1482 for (size_t i = 0; i < PVSize; i++)
1484 int s = RootMoves[i].score;
1486 // Don't allow crazy blunders even at very low skills
1487 if (i > 0 && RootMoves[i-1].score > s + 2 * PawnValueMg)
1490 // This is our magic formula
1491 s += ( weakness * int(RootMoves[0].score - s)
1492 + variance * (rk.rand<unsigned>() % weakness)) / 128;
1497 best = RootMoves[i].pv[0];
1504 // uci_pv() formats PV information according to UCI protocol. UCI requires
1505 // to send all the PV lines also if are still to be searched and so refer to
1506 // the previous search score.
1508 string uci_pv(const Position& pos, int depth, Value alpha, Value beta) {
1510 std::stringstream s;
1511 Time::point elaspsed = Time::now() - SearchTime + 1;
1512 size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
1515 for (size_t i = 0; i < Threads.size(); i++)
1516 if (Threads[i].maxPly > selDepth)
1517 selDepth = Threads[i].maxPly;
1519 for (size_t i = 0; i < uciPVSize; i++)
1521 bool updated = (i <= PVIdx);
1523 if (depth == 1 && !updated)
1526 int d = updated ? depth : depth - 1;
1527 Value v = updated ? RootMoves[i].score : RootMoves[i].prevScore;
1529 if (s.rdbuf()->in_avail()) // Not at first line
1532 s << "info depth " << d
1533 << " seldepth " << selDepth
1534 << " score " << (i == PVIdx ? score_to_uci(v, alpha, beta) : score_to_uci(v))
1535 << " nodes " << pos.nodes_searched()
1536 << " nps " << pos.nodes_searched() * 1000 / elaspsed
1537 << " time " << elaspsed
1538 << " multipv " << i + 1
1541 for (size_t j = 0; RootMoves[i].pv[j] != MOVE_NONE; j++)
1542 s << " " << move_to_uci(RootMoves[i].pv[j], pos.is_chess960());
1551 /// RootMove::extract_pv_from_tt() builds a PV by adding moves from the TT table.
1552 /// We consider also failing high nodes and not only BOUND_EXACT nodes so to
1553 /// allow to always have a ponder move even when we fail high at root, and a
1554 /// long PV to print that is important for position analysis.
1556 void RootMove::extract_pv_from_tt(Position& pos) {
1558 StateInfo state[MAX_PLY_PLUS_2], *st = state;
1568 assert(MoveList<LEGAL>(pos).contains(pv[ply]));
1570 pos.do_move(pv[ply++], *st++);
1571 tte = TT.probe(pos.key());
1574 && pos.is_pseudo_legal(m = tte->move()) // Local copy, TT could change
1575 && pos.pl_move_is_legal(m, pos.pinned_pieces())
1577 && (!pos.is_draw<true, true>() || ply < 2));
1579 pv.push_back(MOVE_NONE); // Must be zero-terminating
1581 while (ply) pos.undo_move(pv[--ply]);
1585 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1586 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1587 /// first, even if the old TT entries have been overwritten.
1589 void RootMove::insert_pv_in_tt(Position& pos) {
1591 StateInfo state[MAX_PLY_PLUS_2], *st = state;
1596 tte = TT.probe(pos.key());
1598 if (!tte || tte->move() != pv[ply]) // Don't overwrite correct entries
1599 TT.store(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[ply], VALUE_NONE, VALUE_NONE);
1601 assert(MoveList<LEGAL>(pos).contains(pv[ply]));
1603 pos.do_move(pv[ply++], *st++);
1605 } while (pv[ply] != MOVE_NONE);
1607 while (ply) pos.undo_move(pv[--ply]);
1611 /// Thread::idle_loop() is where the thread is parked when it has no work to do
1613 void Thread::idle_loop() {
1615 // Pointer 'sp_master', if non-NULL, points to the active SplitPoint
1616 // object for which the thread is the master.
1617 const SplitPoint* sp_master = splitPointsCnt ? curSplitPoint : NULL;
1619 assert(!sp_master || (sp_master->master == this && is_searching));
1621 // If this thread is the master of a split point and all slaves have
1622 // finished their work at this split point, return from the idle loop.
1623 while (!sp_master || sp_master->slavesMask)
1625 // If we are not searching, wait for a condition to be signaled
1626 // instead of wasting CPU time polling for work.
1627 while (do_exit || (!is_searching && Threads.sleepWhileIdle))
1635 // Grab the lock to avoid races with Thread::wake_up()
1638 // If we are master and all slaves have finished don't go to sleep
1639 if (sp_master && !sp_master->slavesMask)
1645 // Do sleep after retesting sleep conditions under lock protection, in
1646 // particular we need to avoid a deadlock in case a master thread has,
1647 // in the meanwhile, allocated us and sent the wake_up() call before we
1648 // had the chance to grab the lock.
1649 if (!is_searching && Threads.sleepWhileIdle)
1650 sleepCondition.wait(mutex);
1655 // If this thread has been assigned work, launch a search
1660 Threads.mutex.lock();
1662 assert(is_searching);
1663 SplitPoint* sp = curSplitPoint;
1665 Threads.mutex.unlock();
1667 Stack ss[MAX_PLY_PLUS_2];
1668 Position pos(*sp->pos, this);
1670 memcpy(ss, sp->ss - 1, 4 * sizeof(Stack));
1675 assert(sp->activePositions[idx] == NULL);
1677 sp->activePositions[idx] = &pos;
1679 if (sp->nodeType == Root)
1680 search<SplitPointRoot>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1681 else if (sp->nodeType == PV)
1682 search<SplitPointPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1683 else if (sp->nodeType == NonPV)
1684 search<SplitPointNonPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1688 assert(is_searching);
1690 is_searching = false;
1691 sp->activePositions[idx] = NULL;
1692 sp->slavesMask &= ~(1ULL << idx);
1693 sp->nodes += pos.nodes_searched();
1695 // Wake up master thread so to allow it to return from the idle loop in
1696 // case we are the last slave of the split point.
1697 if ( Threads.sleepWhileIdle
1698 && this != sp->master
1701 assert(!sp->master->is_searching);
1702 sp->master->notify_one();
1705 // After releasing the lock we cannot access anymore any SplitPoint
1706 // related data in a safe way becuase it could have been released under
1707 // our feet by the sp master. Also accessing other Thread objects is
1708 // unsafe because if we are exiting there is a chance are already freed.
1715 /// check_time() is called by the timer thread when the timer triggers. It is
1716 /// used to print debug info and, more important, to detect when we are out of
1717 /// available time and so stop the search.
1721 static Time::point lastInfoTime = Time::now();
1722 int64_t nodes = 0; // Workaround silly 'uninitialized' gcc warning
1724 if (Time::now() - lastInfoTime >= 1000)
1726 lastInfoTime = Time::now();
1735 Threads.mutex.lock();
1737 nodes = RootPos.nodes_searched();
1739 // Loop across all split points and sum accumulated SplitPoint nodes plus
1740 // all the currently active slaves positions.
1741 for (size_t i = 0; i < Threads.size(); i++)
1742 for (int j = 0; j < Threads[i].splitPointsCnt; j++)
1744 SplitPoint& sp = Threads[i].splitPoints[j];
1749 Bitboard sm = sp.slavesMask;
1752 Position* pos = sp.activePositions[pop_lsb(&sm)];
1753 nodes += pos ? pos->nodes_searched() : 0;
1759 Threads.mutex.unlock();
1762 Time::point elapsed = Time::now() - SearchTime;
1763 bool stillAtFirstMove = Signals.firstRootMove
1764 && !Signals.failedLowAtRoot
1765 && elapsed > TimeMgr.available_time();
1767 bool noMoreTime = elapsed > TimeMgr.maximum_time() - 2 * TimerResolution
1768 || stillAtFirstMove;
1770 if ( (Limits.use_time_management() && noMoreTime)
1771 || (Limits.movetime && elapsed >= Limits.movetime)
1772 || (Limits.nodes && nodes >= Limits.nodes))
1773 Signals.stop = true;