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-2013 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/>.
36 #include "ucioption.h"
40 volatile SignalsType Signals;
42 std::vector<RootMove> RootMoves;
45 Time::point SearchTime;
46 StateStackPtr SetupStates;
51 using namespace Search;
55 // Set to true to force running with one thread. Used for debugging
56 const bool FakeSplit = false;
58 // This is the minimum interval in msec between two check_time() calls
59 const int TimerResolution = 5;
61 // Different node types, used as template parameter
62 enum NodeType { Root, PV, NonPV, SplitPointRoot, SplitPointPV, SplitPointNonPV };
64 // Dynamic razoring margin based on depth
65 inline Value razor_margin(Depth d) { return Value(512 + 16 * int(d)); }
67 // Futility lookup tables (initialized at startup) and their access functions
68 Value FutilityMargins[16][64]; // [depth][moveNumber]
69 int FutilityMoveCounts[32]; // [depth]
71 inline Value futility_margin(Depth d, int mn) {
73 return d < 7 * ONE_PLY ? FutilityMargins[std::max(int(d), 1)][std::min(mn, 63)]
77 // Reduction lookup tables (initialized at startup) and their access function
78 int8_t Reductions[2][64][64]; // [pv][depth][moveNumber]
80 template <bool PvNode> inline Depth reduction(Depth d, int mn) {
82 return (Depth) Reductions[PvNode][std::min(int(d) / ONE_PLY, 63)][std::min(mn, 63)];
88 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(const Position& pos, Move move, Value futilityBase, Value beta);
102 bool allows(const Position& pos, Move first, Move second);
103 bool refutes(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.game_ply(), 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->msec =
239 Limits.use_time_management() ? std::min(100, std::max(TimeMgr.available_time() / 16, TimerResolution)) :
240 Limits.nodes ? 2 * TimerResolution
243 Threads.timer->notify_one(); // Wake up the recurring timer
245 id_loop(RootPos); // Let's start searching !
247 Threads.timer->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;
297 memset(ss, 0, 4 * sizeof(Stack));
298 depth = BestMoveChanges = 0;
299 bestValue = delta = -VALUE_INFINITE;
300 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 std::stable_sort(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 std::stable_sort(RootMoves.begin(), RootMoves.begin() + PVIdx + 1);
403 if (PVIdx + 1 == PVSize || Time::now() - SearchTime > 3000)
404 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
407 // Do we need to pick now the sub-optimal best move ?
408 if (skill.enabled() && skill.time_to_pick(depth))
411 if (Options["Use Search Log"])
413 Log log(Options["Search Log Filename"]);
414 log << pretty_pv(pos, depth, bestValue, Time::now() - SearchTime, &RootMoves[0].pv[0])
418 // Do we have found a "mate in x"?
420 && bestValue >= VALUE_MATE_IN_MAX_PLY
421 && VALUE_MATE - bestValue <= 2 * Limits.mate)
424 // Do we have time for the next iteration? Can we stop searching now?
425 if (Limits.use_time_management() && !Signals.stopOnPonderhit)
427 bool stop = false; // Local variable, not the volatile Signals.stop
429 // Take in account some extra time if the best move has changed
430 if (depth > 4 && depth < 50 && PVSize == 1)
431 TimeMgr.pv_instability(BestMoveChanges, prevBestMoveChanges);
433 // Stop search if most of available time is already consumed. We
434 // probably don't have enough time to search the first move at the
435 // next iteration anyway.
436 if (Time::now() - SearchTime > (TimeMgr.available_time() * 62) / 100)
439 // Stop search early if one move seems to be much better than others
443 && ( RootMoves.size() == 1
444 || Time::now() - SearchTime > (TimeMgr.available_time() * 20) / 100))
446 Value rBeta = bestValue - 2 * PawnValueMg;
447 (ss+1)->excludedMove = RootMoves[0].pv[0];
448 (ss+1)->skipNullMove = true;
449 Value v = search<NonPV>(pos, ss+1, rBeta - 1, rBeta, (depth - 3) * ONE_PLY);
450 (ss+1)->skipNullMove = false;
451 (ss+1)->excludedMove = MOVE_NONE;
459 // If we are allowed to ponder do not stop the search now but
460 // keep pondering until GUI sends "ponderhit" or "stop".
462 Signals.stopOnPonderhit = true;
471 // search<>() is the main search function for both PV and non-PV nodes and for
472 // normal and SplitPoint nodes. When called just after a split point the search
473 // is simpler because we have already probed the hash table, done a null move
474 // search, and searched the first move before splitting, we don't have to repeat
475 // all this work again. We also don't need to store anything to the hash table
476 // here: This is taken care of after we return from the split point.
478 template <NodeType NT>
479 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
481 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV || NT == SplitPointRoot);
482 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV || NT == SplitPointRoot);
483 const bool RootNode = (NT == Root || NT == SplitPointRoot);
485 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
486 assert(PvNode || (alpha == beta - 1));
487 assert(depth > DEPTH_ZERO);
489 Move movesSearched[64];
492 SplitPoint* splitPoint;
494 Move ttMove, move, excludedMove, bestMove, threatMove;
496 Value bestValue, value, ttValue;
497 Value eval, nullValue, futilityValue;
498 bool inCheck, givesCheck, pvMove, singularExtensionNode;
499 bool captureOrPromotion, dangerous, doFullDepthSearch;
500 int moveCount, playedMoveCount;
502 // Step 1. Initialize node
503 Thread* thisThread = pos.this_thread();
504 moveCount = playedMoveCount = 0;
505 inCheck = pos.checkers();
509 splitPoint = ss->splitPoint;
510 bestMove = splitPoint->bestMove;
511 threatMove = splitPoint->threatMove;
512 bestValue = splitPoint->bestValue;
514 ttMove = excludedMove = MOVE_NONE;
515 ttValue = VALUE_NONE;
517 assert(splitPoint->bestValue > -VALUE_INFINITE && splitPoint->moveCount > 0);
519 goto split_point_start;
522 bestValue = -VALUE_INFINITE;
523 ss->currentMove = threatMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
524 ss->ply = (ss-1)->ply + 1;
525 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
526 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
528 // Used to send selDepth info to GUI
529 if (PvNode && thisThread->maxPly < ss->ply)
530 thisThread->maxPly = ss->ply;
534 // Step 2. Check for aborted search and immediate draw
535 if (Signals.stop || pos.is_draw<false>() || ss->ply > MAX_PLY)
536 return DrawValue[pos.side_to_move()];
538 // Step 3. Mate distance pruning. Even if we mate at the next move our score
539 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
540 // a shorter mate was found upward in the tree then there is no need to search
541 // further, we will never beat current alpha. Same logic but with reversed signs
542 // applies also in the opposite condition of being mated instead of giving mate,
543 // in this case return a fail-high score.
544 alpha = std::max(mated_in(ss->ply), alpha);
545 beta = std::min(mate_in(ss->ply+1), beta);
550 // Step 4. Transposition table lookup
551 // We don't want the score of a partial search to overwrite a previous full search
552 // TT value, so we use a different position key in case of an excluded move.
553 excludedMove = ss->excludedMove;
554 posKey = excludedMove ? pos.exclusion_key() : pos.key();
555 tte = TT.probe(posKey);
556 ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
557 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
559 // At PV nodes we check for exact scores, while at non-PV nodes we check for
560 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
561 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
562 // we should also update RootMoveList to avoid bogus output.
565 && tte->depth() >= depth
566 && ttValue != VALUE_NONE // Only in case of TT access race
567 && ( PvNode ? tte->type() == BOUND_EXACT
568 : ttValue >= beta ? (tte->type() & BOUND_LOWER)
569 : (tte->type() & BOUND_UPPER)))
572 ss->currentMove = ttMove; // Can be MOVE_NONE
576 && !pos.is_capture_or_promotion(ttMove)
577 && ttMove != ss->killers[0])
579 ss->killers[1] = ss->killers[0];
580 ss->killers[0] = ttMove;
585 // Step 5. Evaluate the position statically and update parent's gain statistics
587 ss->staticEval = ss->evalMargin = eval = VALUE_NONE;
591 // Never assume anything on values stored in TT
592 if ( (ss->staticEval = eval = tte->eval_value()) == VALUE_NONE
593 ||(ss->evalMargin = tte->eval_margin()) == VALUE_NONE)
594 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
596 // Can ttValue be used as a better position evaluation?
597 if (ttValue != VALUE_NONE)
598 if ( ((tte->type() & BOUND_LOWER) && ttValue > eval)
599 || ((tte->type() & BOUND_UPPER) && ttValue < eval))
604 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
605 TT.store(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE,
606 ss->staticEval, ss->evalMargin);
609 // Update gain for the parent non-capture move given the static position
610 // evaluation before and after the move.
611 if ( (move = (ss-1)->currentMove) != MOVE_NULL
612 && (ss-1)->staticEval != VALUE_NONE
613 && ss->staticEval != VALUE_NONE
614 && !pos.captured_piece_type()
615 && type_of(move) == NORMAL)
617 Square to = to_sq(move);
618 Gain.update(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
621 // Step 6. Razoring (is omitted in PV nodes)
623 && depth < 4 * ONE_PLY
625 && eval + razor_margin(depth) < beta
626 && ttMove == MOVE_NONE
627 && abs(beta) < VALUE_MATE_IN_MAX_PLY
628 && !pos.pawn_on_7th(pos.side_to_move()))
630 Value rbeta = beta - razor_margin(depth);
631 Value v = qsearch<NonPV, false>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
633 // Logically we should return (v + razor_margin(depth)), but
634 // surprisingly this did slightly weaker in tests.
638 // Step 7. Static null move pruning (is omitted in PV nodes)
639 // We're betting that the opponent doesn't have a move that will reduce
640 // the score by more than futility_margin(depth) if we do a null move.
643 && depth < 4 * ONE_PLY
645 && eval - FutilityMargins[depth][0] >= beta
646 && abs(beta) < VALUE_MATE_IN_MAX_PLY
647 && pos.non_pawn_material(pos.side_to_move()))
648 return eval - FutilityMargins[depth][0];
650 // Step 8. Null move search with verification search (is omitted in PV nodes)
656 && abs(beta) < VALUE_MATE_IN_MAX_PLY
657 && pos.non_pawn_material(pos.side_to_move()))
659 ss->currentMove = MOVE_NULL;
661 // Null move dynamic reduction based on depth
662 Depth R = 3 * ONE_PLY + depth / 4;
664 // Null move dynamic reduction based on value
665 if (eval - PawnValueMg > beta)
668 pos.do_null_move(st);
669 (ss+1)->skipNullMove = true;
670 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
671 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R);
672 (ss+1)->skipNullMove = false;
673 pos.undo_null_move();
675 if (nullValue >= beta)
677 // Do not return unproven mate scores
678 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
681 if (depth < 6 * ONE_PLY)
684 // Do verification search at high depths
685 ss->skipNullMove = true;
686 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R);
687 ss->skipNullMove = false;
694 // The null move failed low, which means that we may be faced with
695 // some kind of threat. If the previous move was reduced, check if
696 // the move that refuted the null move was somehow connected to the
697 // move which was reduced. If a connection is found, return a fail
698 // low score (which will cause the reduced move to fail high in the
699 // parent node, which will trigger a re-search with full depth).
700 threatMove = (ss+1)->currentMove;
702 if ( depth < 5 * ONE_PLY
704 && threatMove != MOVE_NONE
705 && allows(pos, (ss-1)->currentMove, threatMove))
710 // Step 9. ProbCut (is omitted in PV nodes)
711 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
712 // and a reduced search returns a value much above beta, we can (almost) safely
713 // prune the previous move.
715 && depth >= 5 * ONE_PLY
718 && excludedMove == MOVE_NONE
719 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
721 Value rbeta = beta + 200;
722 Depth rdepth = depth - ONE_PLY - 3 * ONE_PLY;
724 assert(rdepth >= ONE_PLY);
725 assert((ss-1)->currentMove != MOVE_NONE);
726 assert((ss-1)->currentMove != MOVE_NULL);
728 MovePicker mp(pos, ttMove, Hist, pos.captured_piece_type());
731 while ((move = mp.next_move<false>()) != MOVE_NONE)
732 if (pos.pl_move_is_legal(move, ci.pinned))
734 ss->currentMove = move;
735 pos.do_move(move, st, ci, pos.move_gives_check(move, ci));
736 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth);
743 // Step 10. Internal iterative deepening
744 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
745 && ttMove == MOVE_NONE
746 && (PvNode || (!inCheck && ss->staticEval + Value(256) >= beta)))
748 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
750 ss->skipNullMove = true;
751 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d);
752 ss->skipNullMove = false;
754 tte = TT.probe(posKey);
755 ttMove = tte ? tte->move() : MOVE_NONE;
758 split_point_start: // At split points actual search starts from here
760 MovePicker mp(pos, ttMove, depth, Hist, ss, PvNode ? -VALUE_INFINITE : beta);
762 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
763 singularExtensionNode = !RootNode
765 && depth >= (PvNode ? 6 * ONE_PLY : 8 * ONE_PLY)
766 && ttMove != MOVE_NONE
767 && !excludedMove // Recursive singular search is not allowed
768 && (tte->type() & BOUND_LOWER)
769 && tte->depth() >= depth - 3 * ONE_PLY;
771 // Step 11. Loop through moves
772 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
773 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
777 if (move == excludedMove)
780 // At root obey the "searchmoves" option and skip moves not listed in Root
781 // Move List, as a consequence any illegal move is also skipped. In MultiPV
782 // mode we also skip PV moves which have been already searched.
783 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
788 // Shared counter cannot be decremented later if move turns out to be illegal
789 if (!pos.pl_move_is_legal(move, ci.pinned))
792 moveCount = ++splitPoint->moveCount;
793 splitPoint->mutex.unlock();
800 Signals.firstRootMove = (moveCount == 1);
802 if (thisThread == Threads.main_thread() && Time::now() - SearchTime > 3000)
803 sync_cout << "info depth " << depth / ONE_PLY
804 << " currmove " << move_to_uci(move, pos.is_chess960())
805 << " currmovenumber " << moveCount + PVIdx << sync_endl;
809 captureOrPromotion = pos.is_capture_or_promotion(move);
810 givesCheck = pos.move_gives_check(move, ci);
811 dangerous = givesCheck
812 || pos.is_passed_pawn_push(move)
813 || type_of(move) == CASTLE
814 || ( captureOrPromotion // Entering a pawn endgame?
815 && type_of(pos.piece_on(to_sq(move))) != PAWN
816 && type_of(move) == NORMAL
817 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
818 - PieceValue[MG][pos.piece_on(to_sq(move))] == VALUE_ZERO));
820 // Step 12. Extend checks and, in PV nodes, also dangerous moves
821 if (PvNode && dangerous)
824 else if (givesCheck && pos.see_sign(move) >= 0)
827 // Singular extension search. If all moves but one fail low on a search of
828 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
829 // is singular and should be extended. To verify this we do a reduced search
830 // on all the other moves but the ttMove, if result is lower than ttValue minus
831 // a margin then we extend ttMove.
832 if ( singularExtensionNode
835 && pos.pl_move_is_legal(move, ci.pinned)
836 && abs(ttValue) < VALUE_KNOWN_WIN)
838 assert(ttValue != VALUE_NONE);
840 Value rBeta = ttValue - int(depth);
841 ss->excludedMove = move;
842 ss->skipNullMove = true;
843 value = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2);
844 ss->skipNullMove = false;
845 ss->excludedMove = MOVE_NONE;
851 // Update current move (this must be done after singular extension search)
852 newDepth = depth - ONE_PLY + ext;
854 // Step 13. Futility pruning (is omitted in PV nodes)
856 && !captureOrPromotion
861 // Move count based pruning
862 if ( depth < 16 * ONE_PLY
863 && moveCount >= FutilityMoveCounts[depth]
864 && (!threatMove || !refutes(pos, move, threatMove)))
867 splitPoint->mutex.lock();
872 // Value based pruning
873 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
874 // but fixing this made program slightly weaker.
875 Depth predictedDepth = newDepth - reduction<PvNode>(depth, moveCount);
876 futilityValue = ss->staticEval + ss->evalMargin + futility_margin(predictedDepth, moveCount)
877 + Gain[pos.piece_moved(move)][to_sq(move)];
879 if (futilityValue < beta)
882 splitPoint->mutex.lock();
887 // Prune moves with negative SEE at low depths
888 if ( predictedDepth < 3 * ONE_PLY
889 && pos.see_sign(move) < 0)
892 splitPoint->mutex.lock();
898 // Check for legality only before to do the move
899 if (!RootNode && !SpNode && !pos.pl_move_is_legal(move, ci.pinned))
905 pvMove = PvNode && moveCount == 1;
906 ss->currentMove = move;
907 if (!SpNode && !captureOrPromotion && playedMoveCount < 64)
908 movesSearched[playedMoveCount++] = move;
910 // Step 14. Make the move
911 pos.do_move(move, st, ci, givesCheck);
913 // Step 15. Reduced depth search (LMR). If the move fails high will be
914 // re-searched at full depth.
915 if ( depth > 3 * ONE_PLY
917 && !captureOrPromotion
920 && move != ss->killers[0]
921 && move != ss->killers[1])
923 ss->reduction = reduction<PvNode>(depth, moveCount);
924 Depth d = std::max(newDepth - ss->reduction, ONE_PLY);
926 alpha = splitPoint->alpha;
928 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d);
930 doFullDepthSearch = (value > alpha && ss->reduction != DEPTH_ZERO);
931 ss->reduction = DEPTH_ZERO;
934 doFullDepthSearch = !pvMove;
936 // Step 16. Full depth search, when LMR is skipped or fails high
937 if (doFullDepthSearch)
940 alpha = splitPoint->alpha;
942 value = newDepth < ONE_PLY ?
943 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
944 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
945 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth);
948 // Only for PV nodes do a full PV search on the first move or after a fail
949 // high, in the latter case search only if value < beta, otherwise let the
950 // parent node to fail low with value <= alpha and to try another move.
951 if (PvNode && (pvMove || (value > alpha && (RootNode || value < beta))))
952 value = newDepth < ONE_PLY ?
953 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
954 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
955 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
956 // Step 17. Undo move
959 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
961 // Step 18. Check for new best move
964 splitPoint->mutex.lock();
965 bestValue = splitPoint->bestValue;
966 alpha = splitPoint->alpha;
969 // Finished searching the move. If Signals.stop is true, the search
970 // was aborted because the user interrupted the search or because we
971 // ran out of time. In this case, the return value of the search cannot
972 // be trusted, and we don't update the best move and/or PV.
973 if (Signals.stop || thisThread->cutoff_occurred())
974 return value; // To avoid returning VALUE_INFINITE
978 RootMove& rm = *std::find(RootMoves.begin(), RootMoves.end(), move);
980 // PV move or new best move ?
981 if (pvMove || value > alpha)
984 rm.extract_pv_from_tt(pos);
986 // We record how often the best move has been changed in each
987 // iteration. This information is used for time management: When
988 // the best move changes frequently, we allocate some more time.
993 // All other moves but the PV are set to the lowest value, this
994 // is not a problem when sorting becuase sort is stable and move
995 // position in the list is preserved, just the PV is pushed up.
996 rm.score = -VALUE_INFINITE;
999 if (value > bestValue)
1001 bestValue = SpNode ? splitPoint->bestValue = value : value;
1005 bestMove = SpNode ? splitPoint->bestMove = move : move;
1007 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1008 alpha = SpNode ? splitPoint->alpha = value : value;
1011 assert(value >= beta); // Fail high
1014 splitPoint->cutoff = true;
1021 // Step 19. Check for splitting the search
1023 && depth >= Threads.minimumSplitDepth
1024 && Threads.available_slave(thisThread)
1025 && thisThread->splitPointsSize < MAX_SPLITPOINTS_PER_THREAD)
1027 assert(bestValue < beta);
1029 thisThread->split<FakeSplit>(pos, ss, alpha, beta, &bestValue, &bestMove,
1030 depth, threatMove, moveCount, &mp, NT);
1031 if (bestValue >= beta)
1039 // Step 20. Check for mate and stalemate
1040 // All legal moves have been searched and if there are no legal moves, it
1041 // must be mate or stalemate. Note that we can have a false positive in
1042 // case of Signals.stop or thread.cutoff_occurred() are set, but this is
1043 // harmless because return value is discarded anyhow in the parent nodes.
1044 // If we are in a singular extension search then return a fail low score.
1045 // A split node has at least one move, the one tried before to be splitted.
1047 return excludedMove ? alpha
1048 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1050 // If we have pruned all the moves without searching return a fail-low score
1051 if (bestValue == -VALUE_INFINITE)
1053 assert(!playedMoveCount);
1058 if (bestValue >= beta) // Failed high
1060 TT.store(posKey, value_to_tt(bestValue, ss->ply), BOUND_LOWER, depth,
1061 bestMove, ss->staticEval, ss->evalMargin);
1063 if (!pos.is_capture_or_promotion(bestMove) && !inCheck)
1065 if (bestMove != ss->killers[0])
1067 ss->killers[1] = ss->killers[0];
1068 ss->killers[0] = bestMove;
1071 // Increase history value of the cut-off move
1072 Value bonus = Value(int(depth) * int(depth));
1073 Hist.update(pos.piece_moved(bestMove), to_sq(bestMove), bonus);
1075 // Decrease history of all the other played non-capture moves
1076 for (int i = 0; i < playedMoveCount - 1; i++)
1078 Move m = movesSearched[i];
1079 Hist.update(pos.piece_moved(m), to_sq(m), -bonus);
1083 else // Failed low or PV search
1084 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1085 PvNode && bestMove != MOVE_NONE ? BOUND_EXACT : BOUND_UPPER,
1086 depth, bestMove, ss->staticEval, ss->evalMargin);
1088 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1094 // qsearch() is the quiescence search function, which is called by the main
1095 // search function when the remaining depth is zero (or, to be more precise,
1096 // less than ONE_PLY).
1098 template <NodeType NT, bool InCheck>
1099 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1101 const bool PvNode = (NT == PV);
1103 assert(NT == PV || NT == NonPV);
1104 assert(InCheck == !!pos.checkers());
1105 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1106 assert(PvNode || (alpha == beta - 1));
1107 assert(depth <= DEPTH_ZERO);
1112 Move ttMove, move, bestMove;
1113 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1114 bool givesCheck, enoughMaterial, evasionPrunable;
1117 // To flag BOUND_EXACT a node with eval above alpha and no available moves
1121 ss->currentMove = bestMove = MOVE_NONE;
1122 ss->ply = (ss-1)->ply + 1;
1124 // Check for an instant draw or maximum ply reached
1125 if (pos.is_draw<true>() || ss->ply > MAX_PLY)
1126 return DrawValue[pos.side_to_move()];
1128 // Transposition table lookup. At PV nodes, we don't use the TT for
1129 // pruning, but only for move ordering.
1131 tte = TT.probe(posKey);
1132 ttMove = tte ? tte->move() : MOVE_NONE;
1133 ttValue = tte ? value_from_tt(tte->value(),ss->ply) : VALUE_NONE;
1135 // Decide whether or not to include checks, this fixes also the type of
1136 // TT entry depth that we are going to use. Note that in qsearch we use
1137 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1138 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1139 : DEPTH_QS_NO_CHECKS;
1141 && tte->depth() >= ttDepth
1142 && ttValue != VALUE_NONE // Only in case of TT access race
1143 && ( PvNode ? tte->type() == BOUND_EXACT
1144 : ttValue >= beta ? (tte->type() & BOUND_LOWER)
1145 : (tte->type() & BOUND_UPPER)))
1147 ss->currentMove = ttMove; // Can be MOVE_NONE
1151 // Evaluate the position statically
1154 ss->staticEval = ss->evalMargin = VALUE_NONE;
1155 bestValue = futilityBase = -VALUE_INFINITE;
1156 enoughMaterial = false;
1162 // Never assume anything on values stored in TT
1163 if ( (ss->staticEval = bestValue = tte->eval_value()) == VALUE_NONE
1164 ||(ss->evalMargin = tte->eval_margin()) == VALUE_NONE)
1165 ss->staticEval = bestValue = evaluate(pos, ss->evalMargin);
1168 ss->staticEval = bestValue = evaluate(pos, ss->evalMargin);
1170 // Stand pat. Return immediately if static value is at least beta
1171 if (bestValue >= beta)
1174 TT.store(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1175 DEPTH_NONE, MOVE_NONE, ss->staticEval, ss->evalMargin);
1180 if (PvNode && bestValue > alpha)
1183 futilityBase = ss->staticEval + ss->evalMargin + Value(128);
1184 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMg;
1187 // Initialize a MovePicker object for the current position, and prepare
1188 // to search the moves. Because the depth is <= 0 here, only captures,
1189 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1191 MovePicker mp(pos, ttMove, depth, Hist, to_sq((ss-1)->currentMove));
1194 // Loop through the moves until no moves remain or a beta cutoff occurs
1195 while ((move = mp.next_move<false>()) != MOVE_NONE)
1197 assert(is_ok(move));
1199 givesCheck = pos.move_gives_check(move, ci);
1207 && type_of(move) != PROMOTION
1208 && !pos.is_passed_pawn_push(move))
1210 futilityValue = futilityBase
1211 + PieceValue[EG][pos.piece_on(to_sq(move))]
1212 + (type_of(move) == ENPASSANT ? PawnValueEg : VALUE_ZERO);
1214 if (futilityValue < beta)
1216 bestValue = std::max(bestValue, futilityValue);
1220 // Prune moves with negative or equal SEE
1221 if ( futilityBase < beta
1222 && depth < DEPTH_ZERO
1223 && pos.see(move) <= 0)
1225 bestValue = std::max(bestValue, futilityBase);
1230 // Detect non-capture evasions that are candidate to be pruned
1231 evasionPrunable = !PvNode
1233 && bestValue > VALUE_MATED_IN_MAX_PLY
1234 && !pos.is_capture(move)
1235 && !pos.can_castle(pos.side_to_move());
1237 // Don't search moves with negative SEE values
1239 && (!InCheck || evasionPrunable)
1241 && type_of(move) != PROMOTION
1242 && pos.see_sign(move) < 0)
1245 // Don't search useless checks
1250 && !pos.is_capture_or_promotion(move)
1251 && ss->staticEval + PawnValueMg / 4 < beta
1252 && !check_is_dangerous(pos, move, futilityBase, beta))
1255 // Check for legality only before to do the move
1256 if (!pos.pl_move_is_legal(move, ci.pinned))
1259 ss->currentMove = move;
1261 // Make and search the move
1262 pos.do_move(move, st, ci, givesCheck);
1263 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1264 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1265 pos.undo_move(move);
1267 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1269 // Check for new best move
1270 if (value > bestValue)
1276 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1283 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1284 ttDepth, move, ss->staticEval, ss->evalMargin);
1292 // All legal moves have been searched. A special case: If we're in check
1293 // and no legal moves were found, it is checkmate.
1294 if (InCheck && bestValue == -VALUE_INFINITE)
1295 return mated_in(ss->ply); // Plies to mate from the root
1297 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1298 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1299 ttDepth, bestMove, ss->staticEval, ss->evalMargin);
1301 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1307 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1308 // "plies to mate from the current position". Non-mate scores are unchanged.
1309 // The function is called before storing a value to the transposition table.
1311 Value value_to_tt(Value v, int ply) {
1313 assert(v != VALUE_NONE);
1315 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1316 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1320 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1321 // from the transposition table (where refers to the plies to mate/be mated
1322 // from current position) to "plies to mate/be mated from the root".
1324 Value value_from_tt(Value v, int ply) {
1326 return v == VALUE_NONE ? VALUE_NONE
1327 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1328 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1332 // check_is_dangerous() tests if a checking move can be pruned in qsearch()
1334 bool check_is_dangerous(const Position& pos, Move move, Value futilityBase, Value beta)
1336 Piece pc = pos.piece_moved(move);
1337 Square from = from_sq(move);
1338 Square to = to_sq(move);
1339 Color them = ~pos.side_to_move();
1340 Square ksq = pos.king_square(them);
1341 Bitboard enemies = pos.pieces(them);
1342 Bitboard kingAtt = pos.attacks_from<KING>(ksq);
1343 Bitboard occ = pos.pieces() ^ from ^ ksq;
1344 Bitboard oldAtt = pos.attacks_from(pc, from, occ);
1345 Bitboard newAtt = pos.attacks_from(pc, to, occ);
1347 // Checks which give opponent's king at most one escape square are dangerous
1348 if (!more_than_one(kingAtt & ~(enemies | newAtt | to)))
1351 // Queen contact check is very dangerous
1352 if (type_of(pc) == QUEEN && (kingAtt & to))
1355 // Creating new double threats with checks is dangerous
1356 Bitboard b = (enemies ^ ksq) & newAtt & ~oldAtt;
1359 // Note that here we generate illegal "double move"!
1360 if (futilityBase + PieceValue[EG][pos.piece_on(pop_lsb(&b))] >= beta)
1368 // allows() tests whether the 'first' move at previous ply somehow makes the
1369 // 'second' move possible, for instance if the moving piece is the same in
1370 // both moves. Normally the second move is the threat (the best move returned
1371 // from a null search that fails low).
1373 bool allows(const Position& pos, Move first, Move second) {
1375 assert(is_ok(first));
1376 assert(is_ok(second));
1377 assert(color_of(pos.piece_on(from_sq(second))) == ~pos.side_to_move());
1378 assert(color_of(pos.piece_on(to_sq(first))) == ~pos.side_to_move());
1380 Square m1from = from_sq(first);
1381 Square m2from = from_sq(second);
1382 Square m1to = to_sq(first);
1383 Square m2to = to_sq(second);
1385 // The piece is the same or second's destination was vacated by the first move
1386 if (m1to == m2from || m2to == m1from)
1389 // Second one moves through the square vacated by first one
1390 if (between_bb(m2from, m2to) & m1from)
1393 // Second's destination is defended by the first move's piece
1394 Bitboard m1att = pos.attacks_from(pos.piece_on(m1to), m1to, pos.pieces() ^ m2from);
1398 // Second move gives a discovered check through the first's checking piece
1399 if (m1att & pos.king_square(pos.side_to_move()))
1401 assert(between_bb(m1to, pos.king_square(pos.side_to_move())) & m2from);
1409 // refutes() tests whether a 'first' move is able to defend against a 'second'
1410 // opponent's move. In this case will not be pruned. Normally the second move
1411 // is the threat (the best move returned from a null search that fails low).
1413 bool refutes(const Position& pos, Move first, Move second) {
1415 assert(is_ok(first));
1416 assert(is_ok(second));
1418 Square m1from = from_sq(first);
1419 Square m2from = from_sq(second);
1420 Square m1to = to_sq(first);
1421 Square m2to = to_sq(second);
1423 // Don't prune moves of the threatened piece
1427 // If the threatened piece has value less than or equal to the value of the
1428 // threat piece, don't prune moves which defend it.
1429 if ( pos.is_capture(second)
1430 && ( PieceValue[MG][pos.piece_on(m2from)] >= PieceValue[MG][pos.piece_on(m2to)]
1431 || type_of(pos.piece_on(m2from)) == KING))
1433 // Update occupancy as if the piece and the threat are moving
1434 Bitboard occ = pos.pieces() ^ m1from ^ m1to ^ m2from;
1435 Piece piece = pos.piece_on(m1from);
1437 // The moved piece attacks the square 'tto' ?
1438 if (pos.attacks_from(piece, m1to, occ) & m2to)
1441 // Scan for possible X-ray attackers behind the moved piece
1442 Bitboard xray = (attacks_bb< ROOK>(m2to, occ) & pos.pieces(color_of(piece), QUEEN, ROOK))
1443 | (attacks_bb<BISHOP>(m2to, occ) & pos.pieces(color_of(piece), QUEEN, BISHOP));
1445 // Verify attackers are triggered by our move and not already existing
1446 if (xray && (xray ^ (xray & pos.attacks_from<QUEEN>(m2to))))
1450 // Don't prune safe moves which block the threat path
1451 if ((between_bb(m2from, m2to) & m1to) && pos.see_sign(first) >= 0)
1458 // When playing with strength handicap choose best move among the MultiPV set
1459 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1461 Move Skill::pick_move() {
1465 // PRNG sequence should be not deterministic
1466 for (int i = Time::now() % 50; i > 0; i--)
1467 rk.rand<unsigned>();
1469 // RootMoves are already sorted by score in descending order
1470 int variance = std::min(RootMoves[0].score - RootMoves[PVSize - 1].score, PawnValueMg);
1471 int weakness = 120 - 2 * level;
1472 int max_s = -VALUE_INFINITE;
1475 // Choose best move. For each move score we add two terms both dependent on
1476 // weakness, one deterministic and bigger for weaker moves, and one random,
1477 // then we choose the move with the resulting highest score.
1478 for (size_t i = 0; i < PVSize; i++)
1480 int s = RootMoves[i].score;
1482 // Don't allow crazy blunders even at very low skills
1483 if (i > 0 && RootMoves[i-1].score > s + 2 * PawnValueMg)
1486 // This is our magic formula
1487 s += ( weakness * int(RootMoves[0].score - s)
1488 + variance * (rk.rand<unsigned>() % weakness)) / 128;
1493 best = RootMoves[i].pv[0];
1500 // uci_pv() formats PV information according to UCI protocol. UCI requires
1501 // to send all the PV lines also if are still to be searched and so refer to
1502 // the previous search score.
1504 string uci_pv(const Position& pos, int depth, Value alpha, Value beta) {
1506 std::stringstream s;
1507 Time::point elaspsed = Time::now() - SearchTime + 1;
1508 size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
1511 for (size_t i = 0; i < Threads.size(); i++)
1512 if (Threads[i]->maxPly > selDepth)
1513 selDepth = Threads[i]->maxPly;
1515 for (size_t i = 0; i < uciPVSize; i++)
1517 bool updated = (i <= PVIdx);
1519 if (depth == 1 && !updated)
1522 int d = updated ? depth : depth - 1;
1523 Value v = updated ? RootMoves[i].score : RootMoves[i].prevScore;
1525 if (s.rdbuf()->in_avail()) // Not at first line
1528 s << "info depth " << d
1529 << " seldepth " << selDepth
1530 << " score " << (i == PVIdx ? score_to_uci(v, alpha, beta) : score_to_uci(v))
1531 << " nodes " << pos.nodes_searched()
1532 << " nps " << pos.nodes_searched() * 1000 / elaspsed
1533 << " time " << elaspsed
1534 << " multipv " << i + 1
1537 for (size_t j = 0; RootMoves[i].pv[j] != MOVE_NONE; j++)
1538 s << " " << move_to_uci(RootMoves[i].pv[j], pos.is_chess960());
1547 /// RootMove::extract_pv_from_tt() builds a PV by adding moves from the TT table.
1548 /// We consider also failing high nodes and not only BOUND_EXACT nodes so to
1549 /// allow to always have a ponder move even when we fail high at root, and a
1550 /// long PV to print that is important for position analysis.
1552 void RootMove::extract_pv_from_tt(Position& pos) {
1554 StateInfo state[MAX_PLY_PLUS_2], *st = state;
1564 assert(MoveList<LEGAL>(pos).contains(pv[ply]));
1566 pos.do_move(pv[ply++], *st++);
1567 tte = TT.probe(pos.key());
1570 && pos.is_pseudo_legal(m = tte->move()) // Local copy, TT could change
1571 && pos.pl_move_is_legal(m, pos.pinned_pieces())
1573 && (!pos.is_draw<false>() || ply < 2));
1575 pv.push_back(MOVE_NONE); // Must be zero-terminating
1577 while (ply) pos.undo_move(pv[--ply]);
1581 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1582 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1583 /// first, even if the old TT entries have been overwritten.
1585 void RootMove::insert_pv_in_tt(Position& pos) {
1587 StateInfo state[MAX_PLY_PLUS_2], *st = state;
1592 tte = TT.probe(pos.key());
1594 if (!tte || tte->move() != pv[ply]) // Don't overwrite correct entries
1595 TT.store(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[ply], VALUE_NONE, VALUE_NONE);
1597 assert(MoveList<LEGAL>(pos).contains(pv[ply]));
1599 pos.do_move(pv[ply++], *st++);
1601 } while (pv[ply] != MOVE_NONE);
1603 while (ply) pos.undo_move(pv[--ply]);
1607 /// Thread::idle_loop() is where the thread is parked when it has no work to do
1609 void Thread::idle_loop() {
1611 // Pointer 'this_sp' is not null only if we are called from split(), and not
1612 // at the thread creation. So it means we are the split point's master.
1613 SplitPoint* this_sp = splitPointsSize ? activeSplitPoint : NULL;
1615 assert(!this_sp || (this_sp->masterThread == this && searching));
1619 // If we are not searching, wait for a condition to be signaled instead of
1620 // wasting CPU time polling for work.
1621 while ((!searching && Threads.sleepWhileIdle) || exit)
1629 // Grab the lock to avoid races with Thread::notify_one()
1632 // If we are master and all slaves have finished then exit idle_loop
1633 if (this_sp && !this_sp->slavesMask)
1639 // Do sleep after retesting sleep conditions under lock protection, in
1640 // particular we need to avoid a deadlock in case a master thread has,
1641 // in the meanwhile, allocated us and sent the notify_one() call before
1642 // we had the chance to grab the lock.
1643 if (!searching && !exit)
1644 sleepCondition.wait(mutex);
1649 // If this thread has been assigned work, launch a search
1654 Threads.mutex.lock();
1657 SplitPoint* sp = activeSplitPoint;
1659 Threads.mutex.unlock();
1661 Stack ss[MAX_PLY_PLUS_2];
1662 Position pos(*sp->pos, this);
1664 memcpy(ss, sp->ss - 1, 4 * sizeof(Stack));
1665 (ss+1)->splitPoint = sp;
1669 assert(activePosition == NULL);
1671 activePosition = &pos;
1673 switch (sp->nodeType) {
1675 search<SplitPointRoot>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1678 search<SplitPointPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1681 search<SplitPointNonPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1690 activePosition = NULL;
1691 sp->slavesMask &= ~(1ULL << idx);
1692 sp->nodes += pos.nodes_searched();
1694 // Wake up master thread so to allow it to return from the idle loop
1695 // in case we are the last slave of the split point.
1696 if ( Threads.sleepWhileIdle
1697 && this != sp->masterThread
1700 assert(!sp->masterThread->searching);
1701 sp->masterThread->notify_one();
1704 // After releasing the lock we cannot access anymore any SplitPoint
1705 // related data in a safe way becuase it could have been released under
1706 // our feet by the sp master. Also accessing other Thread objects is
1707 // unsafe because if we are exiting there is a chance are already freed.
1711 // If this thread is the master of a split point and all slaves have finished
1712 // their work at this split point, return from the idle loop.
1713 if (this_sp && !this_sp->slavesMask)
1715 this_sp->mutex.lock();
1716 bool finished = !this_sp->slavesMask; // Retest under lock protection
1717 this_sp->mutex.unlock();
1725 /// check_time() is called by the timer thread when the timer triggers. It is
1726 /// used to print debug info and, more important, to detect when we are out of
1727 /// available time and so stop the search.
1731 static Time::point lastInfoTime = Time::now();
1732 int64_t nodes = 0; // Workaround silly 'uninitialized' gcc warning
1734 if (Time::now() - lastInfoTime >= 1000)
1736 lastInfoTime = Time::now();
1745 Threads.mutex.lock();
1747 nodes = RootPos.nodes_searched();
1749 // Loop across all split points and sum accumulated SplitPoint nodes plus
1750 // all the currently active positions nodes.
1751 for (size_t i = 0; i < Threads.size(); i++)
1752 for (int j = 0; j < Threads[i]->splitPointsSize; j++)
1754 SplitPoint& sp = Threads[i]->splitPoints[j];
1759 Bitboard sm = sp.slavesMask;
1762 Position* pos = Threads[pop_lsb(&sm)]->activePosition;
1764 nodes += pos->nodes_searched();
1770 Threads.mutex.unlock();
1773 Time::point elapsed = Time::now() - SearchTime;
1774 bool stillAtFirstMove = Signals.firstRootMove
1775 && !Signals.failedLowAtRoot
1776 && elapsed > TimeMgr.available_time();
1778 bool noMoreTime = elapsed > TimeMgr.maximum_time() - 2 * TimerResolution
1779 || stillAtFirstMove;
1781 if ( (Limits.use_time_management() && noMoreTime)
1782 || (Limits.movetime && elapsed >= Limits.movetime)
1783 || (Limits.nodes && nodes >= Limits.nodes))
1784 Signals.stop = true;