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/>.
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.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->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;
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
306 PVSize = Options["MultiPV"];
307 Skill skill(Options["Skill Level"]);
309 // Do we have to play with skill handicap? In this case enable MultiPV search
310 // that we will use behind the scenes to retrieve a set of possible moves.
311 if (skill.enabled() && PVSize < 4)
314 PVSize = std::min(PVSize, RootMoves.size());
316 // Iterative deepening loop until requested to stop or target depth reached
317 while (++depth <= MAX_PLY && !Signals.stop && (!Limits.depth || depth <= Limits.depth))
319 // Save last iteration's scores before first PV line is searched and all
320 // the move scores but the (new) PV are set to -VALUE_INFINITE.
321 for (size_t i = 0; i < RootMoves.size(); i++)
322 RootMoves[i].prevScore = RootMoves[i].score;
324 prevBestMoveChanges = BestMoveChanges; // Only sensible when PVSize == 1
327 // MultiPV loop. We perform a full root search for each PV line
328 for (PVIdx = 0; PVIdx < PVSize; PVIdx++)
330 // Set aspiration window default width
331 if (depth >= 5 && abs(RootMoves[PVIdx].prevScore) < VALUE_KNOWN_WIN)
334 alpha = RootMoves[PVIdx].prevScore - delta;
335 beta = RootMoves[PVIdx].prevScore + delta;
339 alpha = -VALUE_INFINITE;
340 beta = VALUE_INFINITE;
343 // Start with a small aspiration window and, in case of fail high/low,
344 // research with bigger window until not failing high/low anymore.
347 // Search starts from ss+1 to allow referencing (ss-1). This is
348 // needed by update gains and ss copy when splitting at Root.
349 bestValue = search<Root>(pos, ss+1, alpha, beta, depth * ONE_PLY);
351 // Bring to front the best move. It is critical that sorting is
352 // done with a stable algorithm because all the values but the first
353 // and eventually the new best one are set to -VALUE_INFINITE and
354 // we want to keep the same order for all the moves but the new
355 // PV that goes to the front. Note that in case of MultiPV search
356 // the already searched PV lines are preserved.
357 sort<RootMove>(RootMoves.begin() + PVIdx, RootMoves.end());
359 // Write PV back to transposition table in case the relevant
360 // entries have been overwritten during the search.
361 for (size_t i = 0; i <= PVIdx; i++)
362 RootMoves[i].insert_pv_in_tt(pos);
364 // If search has been stopped return immediately. Sorting and
365 // writing PV back to TT is safe becuase RootMoves is still
366 // valid, although refers to previous iteration.
370 // In case of failing high/low increase aspiration window and
371 // research, otherwise exit the loop.
372 if (bestValue > alpha && bestValue < beta)
375 // Give some update (without cluttering the UI) before to research
376 if (Time::now() - SearchTime > 3000)
377 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
379 if (abs(bestValue) >= VALUE_KNOWN_WIN)
381 alpha = -VALUE_INFINITE;
382 beta = VALUE_INFINITE;
384 else if (bestValue >= beta)
391 Signals.failedLowAtRoot = true;
392 Signals.stopOnPonderhit = false;
398 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
401 // Sort the PV lines searched so far and update the GUI
402 sort<RootMove>(RootMoves.begin(), RootMoves.begin() + PVIdx + 1);
404 if (PVIdx + 1 == PVSize || Time::now() - SearchTime > 3000)
405 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
408 // Do we need to pick now the sub-optimal best move ?
409 if (skill.enabled() && skill.time_to_pick(depth))
412 if (Options["Use Search Log"])
414 Log log(Options["Search Log Filename"]);
415 log << pretty_pv(pos, depth, bestValue, Time::now() - SearchTime, &RootMoves[0].pv[0])
419 // Filter out startup noise when monitoring best move stability
420 if (depth > 2 && BestMoveChanges)
421 bestMoveNeverChanged = false;
423 // Do we have found a "mate in x"?
425 && bestValue >= VALUE_MATE_IN_MAX_PLY
426 && VALUE_MATE - bestValue <= 2 * Limits.mate)
429 // Do we have time for the next iteration? Can we stop searching now?
430 if (Limits.use_time_management() && !Signals.stopOnPonderhit)
432 bool stop = false; // Local variable, not the volatile Signals.stop
434 // Take in account some extra time if the best move has changed
435 if (depth > 4 && depth < 50 && PVSize == 1)
436 TimeMgr.pv_instability(BestMoveChanges, prevBestMoveChanges);
438 // Stop search if most of available time is already consumed. We
439 // probably don't have enough time to search the first move at the
440 // next iteration anyway.
441 if (Time::now() - SearchTime > (TimeMgr.available_time() * 62) / 100)
444 // Stop search early if one move seems to be much better than others
448 && ( (bestMoveNeverChanged && pos.captured_piece_type())
449 || Time::now() - SearchTime > (TimeMgr.available_time() * 40) / 100))
451 Value rBeta = bestValue - 2 * PawnValueMg;
452 (ss+1)->excludedMove = RootMoves[0].pv[0];
453 (ss+1)->skipNullMove = true;
454 Value v = search<NonPV>(pos, ss+1, rBeta - 1, rBeta, (depth - 3) * ONE_PLY);
455 (ss+1)->skipNullMove = false;
456 (ss+1)->excludedMove = MOVE_NONE;
464 // If we are allowed to ponder do not stop the search now but
465 // keep pondering until GUI sends "ponderhit" or "stop".
467 Signals.stopOnPonderhit = true;
476 // search<>() is the main search function for both PV and non-PV nodes and for
477 // normal and SplitPoint nodes. When called just after a split point the search
478 // is simpler because we have already probed the hash table, done a null move
479 // search, and searched the first move before splitting, we don't have to repeat
480 // all this work again. We also don't need to store anything to the hash table
481 // here: This is taken care of after we return from the split point.
483 template <NodeType NT>
484 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
486 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV || NT == SplitPointRoot);
487 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV || NT == SplitPointRoot);
488 const bool RootNode = (NT == Root || NT == SplitPointRoot);
490 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
491 assert(PvNode || (alpha == beta - 1));
492 assert(depth > DEPTH_ZERO);
494 Move movesSearched[64];
499 Move ttMove, move, excludedMove, bestMove, threatMove;
501 Value bestValue, value, ttValue;
502 Value eval, nullValue, futilityValue;
503 bool inCheck, givesCheck, pvMove, singularExtensionNode;
504 bool captureOrPromotion, dangerous, doFullDepthSearch;
505 int moveCount, playedMoveCount;
507 // Step 1. Initialize node
508 Thread* thisThread = pos.this_thread();
509 moveCount = playedMoveCount = 0;
510 inCheck = pos.checkers();
515 bestMove = sp->bestMove;
516 threatMove = sp->threatMove;
517 bestValue = sp->bestValue;
519 ttMove = excludedMove = MOVE_NONE;
520 ttValue = VALUE_NONE;
522 assert(sp->bestValue > -VALUE_INFINITE && sp->moveCount > 0);
524 goto split_point_start;
527 bestValue = -VALUE_INFINITE;
528 ss->currentMove = threatMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
529 ss->ply = (ss-1)->ply + 1;
530 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
531 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
533 // Used to send selDepth info to GUI
534 if (PvNode && thisThread->maxPly < ss->ply)
535 thisThread->maxPly = ss->ply;
539 // Step 2. Check for aborted search and immediate draw
540 if (Signals.stop || pos.is_draw<false>() || ss->ply > MAX_PLY)
541 return DrawValue[pos.side_to_move()];
543 // Step 3. Mate distance pruning. Even if we mate at the next move our score
544 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
545 // a shorter mate was found upward in the tree then there is no need to search
546 // further, we will never beat current alpha. Same logic but with reversed signs
547 // applies also in the opposite condition of being mated instead of giving mate,
548 // in this case return a fail-high score.
549 alpha = std::max(mated_in(ss->ply), alpha);
550 beta = std::min(mate_in(ss->ply+1), beta);
555 // Step 4. Transposition table lookup
556 // We don't want the score of a partial search to overwrite a previous full search
557 // TT value, so we use a different position key in case of an excluded move.
558 excludedMove = ss->excludedMove;
559 posKey = excludedMove ? pos.exclusion_key() : pos.key();
560 tte = TT.probe(posKey);
561 ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
562 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
564 // At PV nodes we check for exact scores, while at non-PV nodes we check for
565 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
566 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
567 // we should also update RootMoveList to avoid bogus output.
570 && tte->depth() >= depth
571 && ttValue != VALUE_NONE // Only in case of TT access race
572 && ( PvNode ? tte->type() == BOUND_EXACT
573 : ttValue >= beta ? (tte->type() & BOUND_LOWER)
574 : (tte->type() & BOUND_UPPER)))
577 ss->currentMove = ttMove; // Can be MOVE_NONE
581 && !pos.is_capture_or_promotion(ttMove)
582 && ttMove != ss->killers[0])
584 ss->killers[1] = ss->killers[0];
585 ss->killers[0] = ttMove;
590 // Step 5. Evaluate the position statically and update parent's gain statistics
592 ss->staticEval = ss->evalMargin = eval = VALUE_NONE;
596 // Never assume anything on values stored in TT
597 if ( (ss->staticEval = eval = tte->eval_value()) == VALUE_NONE
598 ||(ss->evalMargin = tte->eval_margin()) == VALUE_NONE)
599 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
601 // Can ttValue be used as a better position evaluation?
602 if (ttValue != VALUE_NONE)
603 if ( ((tte->type() & BOUND_LOWER) && ttValue > eval)
604 || ((tte->type() & BOUND_UPPER) && ttValue < eval))
609 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
610 TT.store(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE,
611 ss->staticEval, ss->evalMargin);
614 // Update gain for the parent non-capture move given the static position
615 // evaluation before and after the move.
616 if ( (move = (ss-1)->currentMove) != MOVE_NULL
617 && (ss-1)->staticEval != VALUE_NONE
618 && ss->staticEval != VALUE_NONE
619 && !pos.captured_piece_type()
620 && type_of(move) == NORMAL)
622 Square to = to_sq(move);
623 Gain.update(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
626 // Step 6. Razoring (is omitted in PV nodes)
628 && depth < 4 * ONE_PLY
630 && eval + razor_margin(depth) < beta
631 && ttMove == MOVE_NONE
632 && abs(beta) < VALUE_MATE_IN_MAX_PLY
633 && !pos.pawn_on_7th(pos.side_to_move()))
635 Value rbeta = beta - razor_margin(depth);
636 Value v = qsearch<NonPV, false>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
638 // Logically we should return (v + razor_margin(depth)), but
639 // surprisingly this did slightly weaker in tests.
643 // Step 7. Static null move pruning (is omitted in PV nodes)
644 // We're betting that the opponent doesn't have a move that will reduce
645 // the score by more than futility_margin(depth) if we do a null move.
648 && depth < 4 * ONE_PLY
650 && eval - FutilityMargins[depth][0] >= beta
651 && abs(beta) < VALUE_MATE_IN_MAX_PLY
652 && pos.non_pawn_material(pos.side_to_move()))
653 return eval - FutilityMargins[depth][0];
655 // Step 8. Null move search with verification search (is omitted in PV nodes)
661 && abs(beta) < VALUE_MATE_IN_MAX_PLY
662 && pos.non_pawn_material(pos.side_to_move()))
664 ss->currentMove = MOVE_NULL;
666 // Null move dynamic reduction based on depth
667 Depth R = 3 * ONE_PLY + depth / 4;
669 // Null move dynamic reduction based on value
670 if (eval - PawnValueMg > beta)
673 pos.do_null_move(st);
674 (ss+1)->skipNullMove = true;
675 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
676 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R);
677 (ss+1)->skipNullMove = false;
678 pos.undo_null_move();
680 if (nullValue >= beta)
682 // Do not return unproven mate scores
683 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
686 if (depth < 6 * ONE_PLY)
689 // Do verification search at high depths
690 ss->skipNullMove = true;
691 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R);
692 ss->skipNullMove = false;
699 // The null move failed low, which means that we may be faced with
700 // some kind of threat. If the previous move was reduced, check if
701 // the move that refuted the null move was somehow connected to the
702 // move which was reduced. If a connection is found, return a fail
703 // low score (which will cause the reduced move to fail high in the
704 // parent node, which will trigger a re-search with full depth).
705 threatMove = (ss+1)->currentMove;
707 if ( depth < 5 * ONE_PLY
709 && threatMove != MOVE_NONE
710 && allows(pos, (ss-1)->currentMove, threatMove))
715 // Step 9. ProbCut (is omitted in PV nodes)
716 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
717 // and a reduced search returns a value much above beta, we can (almost) safely
718 // prune the previous move.
720 && depth >= 5 * ONE_PLY
723 && excludedMove == MOVE_NONE
724 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
726 Value rbeta = beta + 200;
727 Depth rdepth = depth - ONE_PLY - 3 * ONE_PLY;
729 assert(rdepth >= ONE_PLY);
730 assert((ss-1)->currentMove != MOVE_NONE);
731 assert((ss-1)->currentMove != MOVE_NULL);
733 MovePicker mp(pos, ttMove, Hist, pos.captured_piece_type());
736 while ((move = mp.next_move<false>()) != MOVE_NONE)
737 if (pos.pl_move_is_legal(move, ci.pinned))
739 ss->currentMove = move;
740 pos.do_move(move, st, ci, pos.move_gives_check(move, ci));
741 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth);
748 // Step 10. Internal iterative deepening
749 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
750 && ttMove == MOVE_NONE
751 && (PvNode || (!inCheck && ss->staticEval + Value(256) >= beta)))
753 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
755 ss->skipNullMove = true;
756 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d);
757 ss->skipNullMove = false;
759 tte = TT.probe(posKey);
760 ttMove = tte ? tte->move() : MOVE_NONE;
763 split_point_start: // At split points actual search starts from here
765 MovePicker mp(pos, ttMove, depth, Hist, ss, PvNode ? -VALUE_INFINITE : beta);
767 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
768 singularExtensionNode = !RootNode
770 && depth >= (PvNode ? 6 * ONE_PLY : 8 * ONE_PLY)
771 && ttMove != MOVE_NONE
772 && !excludedMove // Recursive singular search is not allowed
773 && (tte->type() & BOUND_LOWER)
774 && tte->depth() >= depth - 3 * ONE_PLY;
776 // Step 11. Loop through moves
777 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
778 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
782 if (move == excludedMove)
785 // At root obey the "searchmoves" option and skip moves not listed in Root
786 // Move List, as a consequence any illegal move is also skipped. In MultiPV
787 // mode we also skip PV moves which have been already searched.
788 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
793 // Shared counter cannot be decremented later if move turns out to be illegal
794 if (!pos.pl_move_is_legal(move, ci.pinned))
797 moveCount = ++sp->moveCount;
805 Signals.firstRootMove = (moveCount == 1);
807 if (thisThread == Threads.main_thread() && Time::now() - SearchTime > 3000)
808 sync_cout << "info depth " << depth / ONE_PLY
809 << " currmove " << move_to_uci(move, pos.is_chess960())
810 << " currmovenumber " << moveCount + PVIdx << sync_endl;
814 captureOrPromotion = pos.is_capture_or_promotion(move);
815 givesCheck = pos.move_gives_check(move, ci);
816 dangerous = givesCheck
817 || pos.is_passed_pawn_push(move)
818 || type_of(move) == CASTLE
819 || ( captureOrPromotion // Entering a pawn endgame?
820 && type_of(pos.piece_on(to_sq(move))) != PAWN
821 && type_of(move) == NORMAL
822 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
823 - PieceValue[MG][pos.piece_on(to_sq(move))] == VALUE_ZERO));
825 // Step 12. Extend checks and, in PV nodes, also dangerous moves
826 if (PvNode && dangerous)
829 else if (givesCheck && pos.see_sign(move) >= 0)
832 // Singular extension search. If all moves but one fail low on a search of
833 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
834 // is singular and should be extended. To verify this we do a reduced search
835 // on all the other moves but the ttMove, if result is lower than ttValue minus
836 // a margin then we extend ttMove.
837 if ( singularExtensionNode
840 && pos.pl_move_is_legal(move, ci.pinned)
841 && abs(ttValue) < VALUE_KNOWN_WIN)
843 assert(ttValue != VALUE_NONE);
845 Value rBeta = ttValue - int(depth);
846 ss->excludedMove = move;
847 ss->skipNullMove = true;
848 value = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2);
849 ss->skipNullMove = false;
850 ss->excludedMove = MOVE_NONE;
856 // Update current move (this must be done after singular extension search)
857 newDepth = depth - ONE_PLY + ext;
859 // Step 13. Futility pruning (is omitted in PV nodes)
861 && !captureOrPromotion
865 && (bestValue > VALUE_MATED_IN_MAX_PLY || ( bestValue == -VALUE_INFINITE
866 && alpha > VALUE_MATED_IN_MAX_PLY)))
868 // Move count based pruning
869 if ( depth < 16 * ONE_PLY
870 && moveCount >= FutilityMoveCounts[depth]
871 && (!threatMove || !refutes(pos, move, threatMove)))
879 // Value based pruning
880 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
881 // but fixing this made program slightly weaker.
882 Depth predictedDepth = newDepth - reduction<PvNode>(depth, moveCount);
883 futilityValue = ss->staticEval + ss->evalMargin + futility_margin(predictedDepth, moveCount)
884 + Gain[pos.piece_moved(move)][to_sq(move)];
886 if (futilityValue < beta)
894 // Prune moves with negative SEE at low depths
895 if ( predictedDepth < 2 * ONE_PLY
896 && pos.see_sign(move) < 0)
905 // Check for legality only before to do the move
906 if (!RootNode && !SpNode && !pos.pl_move_is_legal(move, ci.pinned))
912 pvMove = PvNode && moveCount == 1;
913 ss->currentMove = move;
914 if (!SpNode && !captureOrPromotion && playedMoveCount < 64)
915 movesSearched[playedMoveCount++] = move;
917 // Step 14. Make the move
918 pos.do_move(move, st, ci, givesCheck);
920 // Step 15. Reduced depth search (LMR). If the move fails high will be
921 // re-searched at full depth.
922 if ( depth > 3 * ONE_PLY
924 && !captureOrPromotion
927 && move != ss->killers[0]
928 && move != ss->killers[1])
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.minimumSplitDepth
1028 && Threads.available_slave(thisThread)
1029 && thisThread->splitPointsSize < MAX_SPLITPOINTS_PER_THREAD)
1031 assert(bestValue < beta);
1033 thisThread->split<FakeSplit>(pos, ss, alpha, beta, &bestValue, &bestMove,
1034 depth, threatMove, moveCount, &mp, NT);
1035 if (bestValue >= beta)
1043 // Step 20. Check for mate and stalemate
1044 // All legal moves have been searched and if there are no legal moves, it
1045 // must be mate or stalemate. Note that we can have a false positive in
1046 // case of Signals.stop or thread.cutoff_occurred() are set, but this is
1047 // harmless because return value is discarded anyhow in the parent nodes.
1048 // If we are in a singular extension search then return a fail low score.
1049 // A split node has at least one move, the one tried before to be splitted.
1051 return excludedMove ? alpha
1052 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1054 // If we have pruned all the moves without searching return a fail-low score
1055 if (bestValue == -VALUE_INFINITE)
1057 assert(!playedMoveCount);
1062 if (bestValue >= beta) // Failed high
1064 TT.store(posKey, value_to_tt(bestValue, ss->ply), BOUND_LOWER, depth,
1065 bestMove, ss->staticEval, ss->evalMargin);
1067 if (!pos.is_capture_or_promotion(bestMove) && !inCheck)
1069 if (bestMove != ss->killers[0])
1071 ss->killers[1] = ss->killers[0];
1072 ss->killers[0] = bestMove;
1075 // Increase history value of the cut-off move
1076 Value bonus = Value(int(depth) * int(depth));
1077 Hist.update(pos.piece_moved(bestMove), to_sq(bestMove), bonus);
1079 // Decrease history of all the other played non-capture moves
1080 for (int i = 0; i < playedMoveCount - 1; i++)
1082 Move m = movesSearched[i];
1083 Hist.update(pos.piece_moved(m), to_sq(m), -bonus);
1087 else // Failed low or PV search
1088 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1089 PvNode && bestMove != MOVE_NONE ? BOUND_EXACT : BOUND_UPPER,
1090 depth, bestMove, ss->staticEval, ss->evalMargin);
1092 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1098 // qsearch() is the quiescence search function, which is called by the main
1099 // search function when the remaining depth is zero (or, to be more precise,
1100 // less than ONE_PLY).
1102 template <NodeType NT, bool InCheck>
1103 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1105 const bool PvNode = (NT == PV);
1107 assert(NT == PV || NT == NonPV);
1108 assert(InCheck == !!pos.checkers());
1109 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1110 assert(PvNode || (alpha == beta - 1));
1111 assert(depth <= DEPTH_ZERO);
1116 Move ttMove, move, bestMove;
1117 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1118 bool givesCheck, enoughMaterial, evasionPrunable;
1121 // To flag BOUND_EXACT a node with eval above alpha and no available moves
1125 ss->currentMove = bestMove = MOVE_NONE;
1126 ss->ply = (ss-1)->ply + 1;
1128 // Check for an instant draw or maximum ply reached
1129 if (pos.is_draw<true>() || ss->ply > MAX_PLY)
1130 return DrawValue[pos.side_to_move()];
1132 // Transposition table lookup. At PV nodes, we don't use the TT for
1133 // pruning, but only for move ordering.
1135 tte = TT.probe(posKey);
1136 ttMove = tte ? tte->move() : MOVE_NONE;
1137 ttValue = tte ? value_from_tt(tte->value(),ss->ply) : VALUE_NONE;
1139 // Decide whether or not to include checks, this fixes also the type of
1140 // TT entry depth that we are going to use. Note that in qsearch we use
1141 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1142 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1143 : DEPTH_QS_NO_CHECKS;
1145 && tte->depth() >= ttDepth
1146 && ttValue != VALUE_NONE // Only in case of TT access race
1147 && ( PvNode ? tte->type() == BOUND_EXACT
1148 : ttValue >= beta ? (tte->type() & BOUND_LOWER)
1149 : (tte->type() & BOUND_UPPER)))
1151 ss->currentMove = ttMove; // Can be MOVE_NONE
1155 // Evaluate the position statically
1158 ss->staticEval = ss->evalMargin = VALUE_NONE;
1159 bestValue = futilityBase = -VALUE_INFINITE;
1160 enoughMaterial = false;
1166 // Never assume anything on values stored in TT
1167 if ( (ss->staticEval = bestValue = tte->eval_value()) == VALUE_NONE
1168 ||(ss->evalMargin = tte->eval_margin()) == VALUE_NONE)
1169 ss->staticEval = bestValue = evaluate(pos, ss->evalMargin);
1172 ss->staticEval = bestValue = evaluate(pos, ss->evalMargin);
1174 // Stand pat. Return immediately if static value is at least beta
1175 if (bestValue >= beta)
1178 TT.store(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1179 DEPTH_NONE, MOVE_NONE, ss->staticEval, ss->evalMargin);
1184 if (PvNode && bestValue > alpha)
1187 futilityBase = ss->staticEval + ss->evalMargin + Value(128);
1188 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMg;
1191 // Initialize a MovePicker object for the current position, and prepare
1192 // to search the moves. Because the depth is <= 0 here, only captures,
1193 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1195 MovePicker mp(pos, ttMove, depth, Hist, to_sq((ss-1)->currentMove));
1198 // Loop through the moves until no moves remain or a beta cutoff occurs
1199 while ((move = mp.next_move<false>()) != MOVE_NONE)
1201 assert(is_ok(move));
1203 givesCheck = pos.move_gives_check(move, ci);
1211 && type_of(move) != PROMOTION
1212 && !pos.is_passed_pawn_push(move))
1214 futilityValue = futilityBase
1215 + PieceValue[EG][pos.piece_on(to_sq(move))]
1216 + (type_of(move) == ENPASSANT ? PawnValueEg : VALUE_ZERO);
1218 if (futilityValue < beta)
1220 bestValue = std::max(bestValue, futilityValue);
1224 // Prune moves with negative or equal SEE
1225 if ( futilityBase < beta
1226 && depth < DEPTH_ZERO
1227 && pos.see(move) <= 0)
1229 bestValue = std::max(bestValue, futilityBase);
1234 // Detect non-capture evasions that are candidate to be pruned
1235 evasionPrunable = !PvNode
1237 && bestValue > VALUE_MATED_IN_MAX_PLY
1238 && !pos.is_capture(move)
1239 && !pos.can_castle(pos.side_to_move());
1241 // Don't search moves with negative SEE values
1243 && (!InCheck || evasionPrunable)
1245 && type_of(move) != PROMOTION
1246 && pos.see_sign(move) < 0)
1249 // Don't search useless checks
1254 && !pos.is_capture_or_promotion(move)
1255 && ss->staticEval + PawnValueMg / 4 < beta
1256 && !check_is_dangerous(pos, move, futilityBase, beta))
1259 // Check for legality only before to do the move
1260 if (!pos.pl_move_is_legal(move, ci.pinned))
1263 ss->currentMove = move;
1265 // Make and search the move
1266 pos.do_move(move, st, ci, givesCheck);
1267 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1268 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1269 pos.undo_move(move);
1271 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1273 // Check for new best move
1274 if (value > bestValue)
1280 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1287 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1288 ttDepth, move, ss->staticEval, ss->evalMargin);
1296 // All legal moves have been searched. A special case: If we're in check
1297 // and no legal moves were found, it is checkmate.
1298 if (InCheck && bestValue == -VALUE_INFINITE)
1299 return mated_in(ss->ply); // Plies to mate from the root
1301 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1302 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1303 ttDepth, bestMove, ss->staticEval, ss->evalMargin);
1305 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1311 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1312 // "plies to mate from the current position". Non-mate scores are unchanged.
1313 // The function is called before storing a value to the transposition table.
1315 Value value_to_tt(Value v, int ply) {
1317 assert(v != VALUE_NONE);
1319 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1320 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1324 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1325 // from the transposition table (where refers to the plies to mate/be mated
1326 // from current position) to "plies to mate/be mated from the root".
1328 Value value_from_tt(Value v, int ply) {
1330 return v == VALUE_NONE ? VALUE_NONE
1331 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1332 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1336 // check_is_dangerous() tests if a checking move can be pruned in qsearch()
1338 bool check_is_dangerous(const Position& pos, Move move, Value futilityBase, Value beta)
1340 Piece pc = pos.piece_moved(move);
1341 Square from = from_sq(move);
1342 Square to = to_sq(move);
1343 Color them = ~pos.side_to_move();
1344 Square ksq = pos.king_square(them);
1345 Bitboard enemies = pos.pieces(them);
1346 Bitboard kingAtt = pos.attacks_from<KING>(ksq);
1347 Bitboard occ = pos.pieces() ^ from ^ ksq;
1348 Bitboard oldAtt = pos.attacks_from(pc, from, occ);
1349 Bitboard newAtt = pos.attacks_from(pc, to, occ);
1351 // Checks which give opponent's king at most one escape square are dangerous
1352 if (!more_than_one(kingAtt & ~(enemies | newAtt | to)))
1355 // Queen contact check is very dangerous
1356 if (type_of(pc) == QUEEN && (kingAtt & to))
1359 // Creating new double threats with checks is dangerous
1360 Bitboard b = (enemies ^ ksq) & newAtt & ~oldAtt;
1363 // Note that here we generate illegal "double move"!
1364 if (futilityBase + PieceValue[EG][pos.piece_on(pop_lsb(&b))] >= beta)
1372 // allows() tests whether the 'first' move at previous ply somehow makes the
1373 // 'second' move possible, for instance if the moving piece is the same in
1374 // both moves. Normally the second move is the threat (the best move returned
1375 // from a null search that fails low).
1377 bool allows(const Position& pos, Move first, Move second) {
1379 assert(is_ok(first));
1380 assert(is_ok(second));
1381 assert(color_of(pos.piece_on(from_sq(second))) == ~pos.side_to_move());
1382 assert(color_of(pos.piece_on(to_sq(first))) == ~pos.side_to_move());
1384 Square m1from = from_sq(first);
1385 Square m2from = from_sq(second);
1386 Square m1to = to_sq(first);
1387 Square m2to = to_sq(second);
1389 // The piece is the same or second's destination was vacated by the first move
1390 if (m1to == m2from || m2to == m1from)
1393 // Second one moves through the square vacated by first one
1394 if (between_bb(m2from, m2to) & m1from)
1397 // Second's destination is defended by the first move's piece
1398 Bitboard m1att = pos.attacks_from(pos.piece_on(m1to), m1to, pos.pieces() ^ m2from);
1402 // Second move gives a discovered check through the first's checking piece
1403 if (m1att & pos.king_square(pos.side_to_move()))
1405 assert(between_bb(m1to, pos.king_square(pos.side_to_move())) & m2from);
1413 // refutes() tests whether a 'first' move is able to defend against a 'second'
1414 // opponent's move. In this case will not be pruned. Normally the second move
1415 // is the threat (the best move returned from a null search that fails low).
1417 bool refutes(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<false>() || 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 'this_sp' is not null only if we are called from split(), and not
1616 // at the thread creation. So it means we are the split point's master.
1617 const SplitPoint* this_sp = splitPointsSize ? activeSplitPoint : NULL;
1619 assert(!this_sp || (this_sp->masterThread == this && searching));
1621 // If this thread is the master of a split point and all slaves have finished
1622 // their work at this split point, return from the idle loop.
1623 while (!this_sp || this_sp->slavesMask)
1625 // If we are not searching, wait for a condition to be signaled instead of
1626 // wasting CPU time polling for work.
1627 while ((!searching && Threads.sleepWhileIdle) || exit)
1635 // Grab the lock to avoid races with Thread::notify_one()
1638 // If we are master and all slaves have finished then exit idle_loop
1639 if (this_sp && !this_sp->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 notify_one() call before
1648 // we had the chance to grab the lock.
1649 if (!searching && !exit)
1650 sleepCondition.wait(mutex);
1655 // If this thread has been assigned work, launch a search
1660 Threads.mutex.lock();
1663 SplitPoint* sp = activeSplitPoint;
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(activePosition == NULL);
1677 activePosition = &pos;
1679 switch (sp->nodeType) {
1681 search<SplitPointRoot>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1684 search<SplitPointPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1687 search<SplitPointNonPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1696 activePosition = NULL;
1697 sp->slavesMask &= ~(1ULL << idx);
1698 sp->nodes += pos.nodes_searched();
1700 // Wake up master thread so to allow it to return from the idle loop
1701 // in case we are the last slave of the split point.
1702 if ( Threads.sleepWhileIdle
1703 && this != sp->masterThread
1706 assert(!sp->masterThread->searching);
1707 sp->masterThread->notify_one();
1710 // After releasing the lock we cannot access anymore any SplitPoint
1711 // related data in a safe way becuase it could have been released under
1712 // our feet by the sp master. Also accessing other Thread objects is
1713 // unsafe because if we are exiting there is a chance are already freed.
1720 /// check_time() is called by the timer thread when the timer triggers. It is
1721 /// used to print debug info and, more important, to detect when we are out of
1722 /// available time and so stop the search.
1726 static Time::point lastInfoTime = Time::now();
1727 int64_t nodes = 0; // Workaround silly 'uninitialized' gcc warning
1729 if (Time::now() - lastInfoTime >= 1000)
1731 lastInfoTime = Time::now();
1740 Threads.mutex.lock();
1742 nodes = RootPos.nodes_searched();
1744 // Loop across all split points and sum accumulated SplitPoint nodes plus
1745 // all the currently active positions nodes.
1746 for (size_t i = 0; i < Threads.size(); i++)
1747 for (int j = 0; j < Threads[i]->splitPointsSize; j++)
1749 SplitPoint& sp = Threads[i]->splitPoints[j];
1754 Bitboard sm = sp.slavesMask;
1757 Position* pos = Threads[pop_lsb(&sm)]->activePosition;
1759 nodes += pos->nodes_searched();
1765 Threads.mutex.unlock();
1768 Time::point elapsed = Time::now() - SearchTime;
1769 bool stillAtFirstMove = Signals.firstRootMove
1770 && !Signals.failedLowAtRoot
1771 && elapsed > TimeMgr.available_time();
1773 bool noMoreTime = elapsed > TimeMgr.maximum_time() - 2 * TimerResolution
1774 || stillAtFirstMove;
1776 if ( (Limits.use_time_management() && noMoreTime)
1777 || (Limits.movetime && elapsed >= Limits.movetime)
1778 || (Limits.nodes && nodes >= Limits.nodes))
1779 Signals.stop = true;