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];
91 CountermovesStats Countermoves;
93 template <NodeType NT>
94 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
96 template <NodeType NT, bool InCheck>
97 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
99 void id_loop(Position& pos);
100 Value value_to_tt(Value v, int ply);
101 Value value_from_tt(Value v, int ply);
102 bool check_is_dangerous(const Position& pos, Move move, Value futilityBase, Value beta);
103 bool allows(const Position& pos, Move first, Move second);
104 bool refutes(const Position& pos, Move first, Move second);
105 string uci_pv(const Position& pos, int depth, Value alpha, Value beta);
108 Skill(int l) : level(l), best(MOVE_NONE) {}
110 if (enabled()) // Swap best PV line with the sub-optimal one
111 std::swap(RootMoves[0], *std::find(RootMoves.begin(),
112 RootMoves.end(), best ? best : pick_move()));
115 bool enabled() const { return level < 20; }
116 bool time_to_pick(int depth) const { return depth == 1 + level; }
126 /// Search::init() is called during startup to initialize various lookup tables
128 void Search::init() {
130 int d; // depth (ONE_PLY == 2)
131 int hd; // half depth (ONE_PLY == 1)
134 // Init reductions array
135 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
137 double pvRed = log(double(hd)) * log(double(mc)) / 3.0;
138 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
139 Reductions[1][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
140 Reductions[0][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
143 // Init futility margins array
144 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
145 FutilityMargins[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
147 // Init futility move count array
148 for (d = 0; d < 32; d++)
149 FutilityMoveCounts[d] = int(3.001 + 0.3 * pow(double(d), 1.8));
153 /// Search::perft() is our utility to verify move generation. All the leaf nodes
154 /// up to the given depth are generated and counted and the sum returned.
156 size_t Search::perft(Position& pos, Depth depth) {
158 // At the last ply just return the number of legal moves (leaf nodes)
159 if (depth == ONE_PLY)
160 return MoveList<LEGAL>(pos).size();
166 for (MoveList<LEGAL> it(pos); !it.end(); ++it)
168 pos.do_move(*it, st, ci, pos.move_gives_check(*it, ci));
169 cnt += perft(pos, depth - ONE_PLY);
177 /// Search::think() is the external interface to Stockfish's search, and is
178 /// called by the main thread when the program receives the UCI 'go' command. It
179 /// searches from RootPos and at the end prints the "bestmove" to output.
181 void Search::think() {
183 static PolyglotBook book; // Defined static to initialize the PRNG only once
185 RootColor = RootPos.side_to_move();
186 TimeMgr.init(Limits, RootPos.game_ply(), RootColor);
188 if (RootMoves.empty())
190 RootMoves.push_back(MOVE_NONE);
191 sync_cout << "info depth 0 score "
192 << score_to_uci(RootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
198 if (Options["OwnBook"] && !Limits.infinite && !Limits.mate)
200 Move bookMove = book.probe(RootPos, Options["Book File"], Options["Best Book Move"]);
202 if (bookMove && std::count(RootMoves.begin(), RootMoves.end(), bookMove))
204 std::swap(RootMoves[0], *std::find(RootMoves.begin(), RootMoves.end(), bookMove));
209 if (Options["Contempt Factor"] && !Options["UCI_AnalyseMode"])
211 int cf = Options["Contempt Factor"] * PawnValueMg / 100; // From centipawns
212 cf = cf * Material::game_phase(RootPos) / PHASE_MIDGAME; // Scale down with phase
213 DrawValue[ RootColor] = VALUE_DRAW - Value(cf);
214 DrawValue[~RootColor] = VALUE_DRAW + Value(cf);
217 DrawValue[WHITE] = DrawValue[BLACK] = VALUE_DRAW;
219 if (Options["Use Search Log"])
221 Log log(Options["Search Log Filename"]);
222 log << "\nSearching: " << RootPos.fen()
223 << "\ninfinite: " << Limits.infinite
224 << " ponder: " << Limits.ponder
225 << " time: " << Limits.time[RootColor]
226 << " increment: " << Limits.inc[RootColor]
227 << " moves to go: " << Limits.movestogo
231 // Reset the threads, still sleeping: will be wake up at split time
232 for (size_t i = 0; i < Threads.size(); i++)
233 Threads[i]->maxPly = 0;
235 Threads.sleepWhileIdle = Options["Use Sleeping Threads"];
237 // Set best timer interval to avoid lagging under time pressure. Timer is
238 // used to check for remaining available thinking time.
239 Threads.timer->msec =
240 Limits.use_time_management() ? std::min(100, std::max(TimeMgr.available_time() / 16, TimerResolution)) :
241 Limits.nodes ? 2 * TimerResolution
244 Threads.timer->notify_one(); // Wake up the recurring timer
246 id_loop(RootPos); // Let's start searching !
248 Threads.timer->msec = 0; // Stop the timer
249 Threads.sleepWhileIdle = true; // Send idle threads to sleep
251 if (Options["Use Search Log"])
253 Time::point elapsed = Time::now() - SearchTime + 1;
255 Log log(Options["Search Log Filename"]);
256 log << "Nodes: " << RootPos.nodes_searched()
257 << "\nNodes/second: " << RootPos.nodes_searched() * 1000 / elapsed
258 << "\nBest move: " << move_to_san(RootPos, RootMoves[0].pv[0]);
261 RootPos.do_move(RootMoves[0].pv[0], st);
262 log << "\nPonder move: " << move_to_san(RootPos, RootMoves[0].pv[1]) << std::endl;
263 RootPos.undo_move(RootMoves[0].pv[0]);
268 // When search is stopped this info is not printed
269 sync_cout << "info nodes " << RootPos.nodes_searched()
270 << " time " << Time::now() - SearchTime + 1 << sync_endl;
272 // When we reach max depth we arrive here even without Signals.stop is raised,
273 // but if we are pondering or in infinite search, according to UCI protocol,
274 // we shouldn't print the best move before the GUI sends a "stop" or "ponderhit"
275 // command. We simply wait here until GUI sends one of those commands (that
276 // raise Signals.stop).
277 if (!Signals.stop && (Limits.ponder || Limits.infinite))
279 Signals.stopOnPonderhit = true;
280 RootPos.this_thread()->wait_for(Signals.stop);
283 // Best move could be MOVE_NONE when searching on a stalemate position
284 sync_cout << "bestmove " << move_to_uci(RootMoves[0].pv[0], RootPos.is_chess960())
285 << " ponder " << move_to_uci(RootMoves[0].pv[1], RootPos.is_chess960())
292 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
293 // with increasing depth until the allocated thinking time has been consumed,
294 // user stops the search, or the maximum search depth is reached.
296 void id_loop(Position& pos) {
298 Stack ss[MAX_PLY_PLUS_2];
299 int depth, prevBestMoveChanges;
300 Value bestValue, alpha, beta, delta;
302 memset(ss, 0, 4 * sizeof(Stack));
303 depth = BestMoveChanges = 0;
304 bestValue = delta = -VALUE_INFINITE;
305 ss->currentMove = MOVE_NULL; // Hack to skip update gains
309 Countermoves.clear();
311 PVSize = Options["MultiPV"];
312 Skill skill(Options["Skill Level"]);
314 // Do we have to play with skill handicap? In this case enable MultiPV search
315 // that we will use behind the scenes to retrieve a set of possible moves.
316 if (skill.enabled() && PVSize < 4)
319 PVSize = std::min(PVSize, RootMoves.size());
321 // Iterative deepening loop until requested to stop or target depth reached
322 while (++depth <= MAX_PLY && !Signals.stop && (!Limits.depth || depth <= Limits.depth))
324 // Save last iteration's scores before first PV line is searched and all
325 // the move scores but the (new) PV are set to -VALUE_INFINITE.
326 for (size_t i = 0; i < RootMoves.size(); i++)
327 RootMoves[i].prevScore = RootMoves[i].score;
329 prevBestMoveChanges = BestMoveChanges; // Only sensible when PVSize == 1
332 // MultiPV loop. We perform a full root search for each PV line
333 for (PVIdx = 0; PVIdx < PVSize; PVIdx++)
335 // Set aspiration window default width
336 if (depth >= 5 && abs(RootMoves[PVIdx].prevScore) < VALUE_KNOWN_WIN)
339 alpha = RootMoves[PVIdx].prevScore - delta;
340 beta = RootMoves[PVIdx].prevScore + delta;
344 alpha = -VALUE_INFINITE;
345 beta = VALUE_INFINITE;
348 // Start with a small aspiration window and, in case of fail high/low,
349 // research with bigger window until not failing high/low anymore.
352 // Search starts from ss+1 to allow referencing (ss-1). This is
353 // needed by update gains and ss copy when splitting at Root.
354 bestValue = search<Root>(pos, ss+1, alpha, beta, depth * ONE_PLY);
356 // Bring to front the best move. It is critical that sorting is
357 // done with a stable algorithm because all the values but the first
358 // and eventually the new best one are set to -VALUE_INFINITE and
359 // we want to keep the same order for all the moves but the new
360 // PV that goes to the front. Note that in case of MultiPV search
361 // the already searched PV lines are preserved.
362 std::stable_sort(RootMoves.begin() + PVIdx, RootMoves.end());
364 // Write PV back to transposition table in case the relevant
365 // entries have been overwritten during the search.
366 for (size_t i = 0; i <= PVIdx; i++)
367 RootMoves[i].insert_pv_in_tt(pos);
369 // If search has been stopped return immediately. Sorting and
370 // writing PV back to TT is safe becuase RootMoves is still
371 // valid, although refers to previous iteration.
375 // In case of failing high/low increase aspiration window and
376 // research, otherwise exit the loop.
377 if (bestValue > alpha && bestValue < beta)
380 // Give some update (without cluttering the UI) before to research
381 if (Time::now() - SearchTime > 3000)
382 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
384 if (abs(bestValue) >= VALUE_KNOWN_WIN)
386 alpha = -VALUE_INFINITE;
387 beta = VALUE_INFINITE;
389 else if (bestValue >= beta)
396 Signals.failedLowAtRoot = true;
397 Signals.stopOnPonderhit = false;
403 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
406 // Sort the PV lines searched so far and update the GUI
407 std::stable_sort(RootMoves.begin(), RootMoves.begin() + PVIdx + 1);
409 if (PVIdx + 1 == PVSize || Time::now() - SearchTime > 3000)
410 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
413 // Do we need to pick now the sub-optimal best move ?
414 if (skill.enabled() && skill.time_to_pick(depth))
417 if (Options["Use Search Log"])
419 Log log(Options["Search Log Filename"]);
420 log << pretty_pv(pos, depth, bestValue, Time::now() - SearchTime, &RootMoves[0].pv[0])
424 // Do we have found a "mate in x"?
426 && bestValue >= VALUE_MATE_IN_MAX_PLY
427 && VALUE_MATE - bestValue <= 2 * Limits.mate)
430 // Do we have time for the next iteration? Can we stop searching now?
431 if (Limits.use_time_management() && !Signals.stopOnPonderhit)
433 bool stop = false; // Local variable, not the volatile Signals.stop
435 // Take in account some extra time if the best move has changed
436 if (depth > 4 && depth < 50 && PVSize == 1)
437 TimeMgr.pv_instability(BestMoveChanges, prevBestMoveChanges);
439 // Stop search if most of available time is already consumed. We
440 // probably don't have enough time to search the first move at the
441 // next iteration anyway.
442 if (Time::now() - SearchTime > (TimeMgr.available_time() * 62) / 100)
445 // Stop search early if one move seems to be much better than others
449 && bestValue > VALUE_MATED_IN_MAX_PLY
450 && ( RootMoves.size() == 1
451 || Time::now() - SearchTime > (TimeMgr.available_time() * 20) / 100))
453 Value rBeta = bestValue - 2 * PawnValueMg;
454 (ss+1)->excludedMove = RootMoves[0].pv[0];
455 (ss+1)->skipNullMove = true;
456 Value v = search<NonPV>(pos, ss+1, rBeta - 1, rBeta, (depth - 3) * ONE_PLY);
457 (ss+1)->skipNullMove = false;
458 (ss+1)->excludedMove = MOVE_NONE;
466 // If we are allowed to ponder do not stop the search now but
467 // keep pondering until GUI sends "ponderhit" or "stop".
469 Signals.stopOnPonderhit = true;
478 // search<>() is the main search function for both PV and non-PV nodes and for
479 // normal and SplitPoint nodes. When called just after a split point the search
480 // is simpler because we have already probed the hash table, done a null move
481 // search, and searched the first move before splitting, we don't have to repeat
482 // all this work again. We also don't need to store anything to the hash table
483 // here: This is taken care of after we return from the split point.
485 template <NodeType NT>
486 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
488 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV || NT == SplitPointRoot);
489 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV || NT == SplitPointRoot);
490 const bool RootNode = (NT == Root || NT == SplitPointRoot);
492 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
493 assert(PvNode || (alpha == beta - 1));
494 assert(depth > DEPTH_ZERO);
496 Move movesSearched[64];
499 SplitPoint* splitPoint;
501 Move ttMove, move, excludedMove, bestMove, threatMove;
503 Value bestValue, value, ttValue;
504 Value eval, nullValue, futilityValue;
505 bool inCheck, givesCheck, pvMove, singularExtensionNode;
506 bool captureOrPromotion, dangerous, doFullDepthSearch;
507 int moveCount, playedMoveCount;
509 // Step 1. Initialize node
510 Thread* thisThread = pos.this_thread();
511 moveCount = playedMoveCount = 0;
512 inCheck = pos.checkers();
516 splitPoint = ss->splitPoint;
517 bestMove = splitPoint->bestMove;
518 threatMove = splitPoint->threatMove;
519 bestValue = splitPoint->bestValue;
521 ttMove = excludedMove = MOVE_NONE;
522 ttValue = VALUE_NONE;
524 assert(splitPoint->bestValue > -VALUE_INFINITE && splitPoint->moveCount > 0);
526 goto split_point_start;
529 bestValue = -VALUE_INFINITE;
530 ss->currentMove = threatMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
531 ss->ply = (ss-1)->ply + 1;
532 ss->futilityMoveCount = 0;
533 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
534 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
536 // Used to send selDepth info to GUI
537 if (PvNode && thisThread->maxPly < ss->ply)
538 thisThread->maxPly = ss->ply;
542 // Step 2. Check for aborted search and immediate draw
543 if (Signals.stop || pos.is_draw() || ss->ply > MAX_PLY)
544 return DrawValue[pos.side_to_move()];
546 // Step 3. Mate distance pruning. Even if we mate at the next move our score
547 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
548 // a shorter mate was found upward in the tree then there is no need to search
549 // further, we will never beat current alpha. Same logic but with reversed signs
550 // applies also in the opposite condition of being mated instead of giving mate,
551 // in this case return a fail-high score.
552 alpha = std::max(mated_in(ss->ply), alpha);
553 beta = std::min(mate_in(ss->ply+1), beta);
558 // Step 4. Transposition table lookup
559 // We don't want the score of a partial search to overwrite a previous full search
560 // TT value, so we use a different position key in case of an excluded move.
561 excludedMove = ss->excludedMove;
562 posKey = excludedMove ? pos.exclusion_key() : pos.key();
563 tte = TT.probe(posKey);
564 ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
565 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
567 // At PV nodes we check for exact scores, while at non-PV nodes we check for
568 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
569 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
570 // we should also update RootMoveList to avoid bogus output.
573 && tte->depth() >= depth
574 && ttValue != VALUE_NONE // Only in case of TT access race
575 && ( PvNode ? tte->type() == BOUND_EXACT
576 : ttValue >= beta ? (tte->type() & BOUND_LOWER)
577 : (tte->type() & BOUND_UPPER)))
580 ss->currentMove = ttMove; // Can be MOVE_NONE
584 && !pos.is_capture_or_promotion(ttMove)
585 && ttMove != ss->killers[0])
587 ss->killers[1] = ss->killers[0];
588 ss->killers[0] = ttMove;
593 // Step 5. Evaluate the position statically and update parent's gain statistics
595 ss->staticEval = ss->evalMargin = eval = VALUE_NONE;
599 // Never assume anything on values stored in TT
600 if ( (ss->staticEval = eval = tte->eval_value()) == VALUE_NONE
601 ||(ss->evalMargin = tte->eval_margin()) == VALUE_NONE)
602 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
604 // Can ttValue be used as a better position evaluation?
605 if (ttValue != VALUE_NONE)
606 if ( ((tte->type() & BOUND_LOWER) && ttValue > eval)
607 || ((tte->type() & BOUND_UPPER) && ttValue < eval))
612 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
613 TT.store(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE,
614 ss->staticEval, ss->evalMargin);
617 // Update gain for the parent non-capture move given the static position
618 // evaluation before and after the move.
619 if ( (move = (ss-1)->currentMove) != MOVE_NULL
620 && (ss-1)->staticEval != VALUE_NONE
621 && ss->staticEval != VALUE_NONE
622 && !pos.captured_piece_type()
623 && type_of(move) == NORMAL)
625 Square to = to_sq(move);
626 Gains.update(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
629 // Step 6. Razoring (is omitted in PV nodes)
631 && depth < 4 * ONE_PLY
633 && eval + razor_margin(depth) < beta
634 && ttMove == MOVE_NONE
635 && abs(beta) < VALUE_MATE_IN_MAX_PLY
636 && !pos.pawn_on_7th(pos.side_to_move()))
638 Value rbeta = beta - razor_margin(depth);
639 Value v = qsearch<NonPV, false>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
641 // Logically we should return (v + razor_margin(depth)), but
642 // surprisingly this did slightly weaker in tests.
646 // Step 7. Static null move pruning (is omitted in PV nodes)
647 // We're betting that the opponent doesn't have a move that will reduce
648 // the score by more than futility_margin(depth) if we do a null move.
651 && depth < 4 * ONE_PLY
653 && eval - futility_margin(depth, (ss-1)->futilityMoveCount) >= beta
654 && abs(beta) < VALUE_MATE_IN_MAX_PLY
655 && abs(eval) < VALUE_KNOWN_WIN
656 && pos.non_pawn_material(pos.side_to_move()))
657 return eval - futility_margin(depth, (ss-1)->futilityMoveCount);
659 // Step 8. Null move search with verification search (is omitted in PV nodes)
665 && abs(beta) < VALUE_MATE_IN_MAX_PLY
666 && pos.non_pawn_material(pos.side_to_move()))
668 ss->currentMove = MOVE_NULL;
670 // Null move dynamic reduction based on depth
671 Depth R = 3 * ONE_PLY + depth / 4;
673 // Null move dynamic reduction based on value
674 if (eval - PawnValueMg > beta)
677 pos.do_null_move(st);
678 (ss+1)->skipNullMove = true;
679 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
680 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R);
681 (ss+1)->skipNullMove = false;
682 pos.undo_null_move();
684 if (nullValue >= beta)
686 // Do not return unproven mate scores
687 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
690 if (depth < 12 * ONE_PLY)
693 // Do verification search at high depths
694 ss->skipNullMove = true;
695 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R);
696 ss->skipNullMove = false;
703 // The null move failed low, which means that we may be faced with
704 // some kind of threat. If the previous move was reduced, check if
705 // the move that refuted the null move was somehow connected to the
706 // move which was reduced. If a connection is found, return a fail
707 // low score (which will cause the reduced move to fail high in the
708 // parent node, which will trigger a re-search with full depth).
709 threatMove = (ss+1)->currentMove;
711 if ( depth < 5 * ONE_PLY
713 && threatMove != MOVE_NONE
714 && allows(pos, (ss-1)->currentMove, threatMove))
719 // Step 9. ProbCut (is omitted in PV nodes)
720 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
721 // and a reduced search returns a value much above beta, we can (almost) safely
722 // prune the previous move.
724 && depth >= 5 * ONE_PLY
727 && excludedMove == MOVE_NONE
728 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
730 Value rbeta = beta + 200;
731 Depth rdepth = depth - ONE_PLY - 3 * ONE_PLY;
733 assert(rdepth >= ONE_PLY);
734 assert((ss-1)->currentMove != MOVE_NONE);
735 assert((ss-1)->currentMove != MOVE_NULL);
737 MovePicker mp(pos, ttMove, History, pos.captured_piece_type());
740 while ((move = mp.next_move<false>()) != MOVE_NONE)
741 if (pos.pl_move_is_legal(move, ci.pinned))
743 ss->currentMove = move;
744 pos.do_move(move, st, ci, pos.move_gives_check(move, ci));
745 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth);
752 // Step 10. Internal iterative deepening
753 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
754 && ttMove == MOVE_NONE
755 && (PvNode || (!inCheck && ss->staticEval + Value(256) >= beta)))
757 Depth d = depth - 2 * ONE_PLY - (PvNode ? DEPTH_ZERO : depth / 4);
759 ss->skipNullMove = true;
760 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d);
761 ss->skipNullMove = false;
763 tte = TT.probe(posKey);
764 ttMove = tte ? tte->move() : MOVE_NONE;
767 split_point_start: // At split points actual search starts from here
769 MovePicker mp(pos, ttMove, depth, History, Countermoves, ss, PvNode ? -VALUE_INFINITE : beta);
771 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
772 singularExtensionNode = !RootNode
774 && depth >= (PvNode ? 6 * ONE_PLY : 8 * ONE_PLY)
775 && ttMove != MOVE_NONE
776 && !excludedMove // Recursive singular search is not allowed
777 && (tte->type() & BOUND_LOWER)
778 && tte->depth() >= depth - 3 * ONE_PLY;
780 // Step 11. Loop through moves
781 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
782 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
786 if (move == excludedMove)
789 // At root obey the "searchmoves" option and skip moves not listed in Root
790 // Move List, as a consequence any illegal move is also skipped. In MultiPV
791 // mode we also skip PV moves which have been already searched.
792 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
797 // Shared counter cannot be decremented later if move turns out to be illegal
798 if (!pos.pl_move_is_legal(move, ci.pinned))
801 moveCount = ++splitPoint->moveCount;
802 splitPoint->mutex.unlock();
809 Signals.firstRootMove = (moveCount == 1);
811 if (thisThread == Threads.main_thread() && Time::now() - SearchTime > 3000)
812 sync_cout << "info depth " << depth / ONE_PLY
813 << " currmove " << move_to_uci(move, pos.is_chess960())
814 << " currmovenumber " << moveCount + PVIdx << sync_endl;
818 captureOrPromotion = pos.is_capture_or_promotion(move);
819 givesCheck = pos.move_gives_check(move, ci);
820 dangerous = givesCheck
821 || pos.is_passed_pawn_push(move)
822 || type_of(move) == CASTLE
823 || ( captureOrPromotion // Entering a pawn endgame?
824 && type_of(pos.piece_on(to_sq(move))) != PAWN
825 && type_of(move) == NORMAL
826 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
827 - PieceValue[MG][pos.piece_on(to_sq(move))] == VALUE_ZERO));
829 // Step 12. Extend checks and, in PV nodes, also dangerous moves
830 if (PvNode && dangerous)
833 else if (givesCheck && pos.see_sign(move) >= 0)
836 // Singular extension search. If all moves but one fail low on a search of
837 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
838 // is singular and should be extended. To verify this we do a reduced search
839 // on all the other moves but the ttMove, if result is lower than ttValue minus
840 // a margin then we extend ttMove.
841 if ( singularExtensionNode
844 && pos.pl_move_is_legal(move, ci.pinned)
845 && abs(ttValue) < VALUE_KNOWN_WIN)
847 assert(ttValue != VALUE_NONE);
849 Value rBeta = ttValue - int(depth);
850 ss->excludedMove = move;
851 ss->skipNullMove = true;
852 value = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2);
853 ss->skipNullMove = false;
854 ss->excludedMove = MOVE_NONE;
860 // Update current move (this must be done after singular extension search)
861 newDepth = depth - ONE_PLY + ext;
863 // Step 13. Futility pruning (is omitted in PV nodes)
865 && !captureOrPromotion
868 /* && move != ttMove Already implicit in the next condition */
869 && bestValue > VALUE_MATED_IN_MAX_PLY)
871 // Move count based pruning
872 if ( depth < 16 * ONE_PLY
873 && moveCount >= FutilityMoveCounts[depth]
874 && (!threatMove || !refutes(pos, move, threatMove)))
877 splitPoint->mutex.lock();
882 // Value based pruning
883 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
884 // but fixing this made program slightly weaker.
885 Depth predictedDepth = newDepth - reduction<PvNode>(depth, moveCount);
886 futilityValue = ss->staticEval + ss->evalMargin + futility_margin(predictedDepth, moveCount)
887 + Gains[pos.piece_moved(move)][to_sq(move)];
889 if (futilityValue < beta)
891 bestValue = std::max(bestValue, futilityValue);
895 splitPoint->mutex.lock();
896 if (bestValue > splitPoint->bestValue)
897 splitPoint->bestValue = bestValue;
902 // Prune moves with negative SEE at low depths
903 if ( predictedDepth < 4 * ONE_PLY
904 && pos.see_sign(move) < 0)
907 splitPoint->mutex.lock();
912 // We have not pruned the move that will be searched, but remember how
913 // far in the move list we are to be more aggressive in the child node.
914 ss->futilityMoveCount = moveCount;
917 ss->futilityMoveCount = 0;
919 // Check for legality only before to do the move
920 if (!RootNode && !SpNode && !pos.pl_move_is_legal(move, ci.pinned))
926 pvMove = PvNode && moveCount == 1;
927 ss->currentMove = move;
928 if (!SpNode && !captureOrPromotion && playedMoveCount < 64)
929 movesSearched[playedMoveCount++] = move;
931 // Step 14. Make the move
932 pos.do_move(move, st, ci, givesCheck);
934 // Step 15. Reduced depth search (LMR). If the move fails high will be
935 // re-searched at full depth.
936 if ( depth > 3 * ONE_PLY
938 && !captureOrPromotion
941 && move != ss->killers[0]
942 && move != ss->killers[1])
944 ss->reduction = reduction<PvNode>(depth, moveCount);
945 Depth d = std::max(newDepth - ss->reduction, ONE_PLY);
947 alpha = splitPoint->alpha;
949 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d);
951 doFullDepthSearch = (value > alpha && ss->reduction != DEPTH_ZERO);
952 ss->reduction = DEPTH_ZERO;
955 doFullDepthSearch = !pvMove;
957 // Step 16. Full depth search, when LMR is skipped or fails high
958 if (doFullDepthSearch)
961 alpha = splitPoint->alpha;
963 value = newDepth < ONE_PLY ?
964 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
965 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
966 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth);
969 // Only for PV nodes do a full PV search on the first move or after a fail
970 // high, in the latter case search only if value < beta, otherwise let the
971 // parent node to fail low with value <= alpha and to try another move.
972 if (PvNode && (pvMove || (value > alpha && (RootNode || value < beta))))
973 value = newDepth < ONE_PLY ?
974 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
975 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
976 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
977 // Step 17. Undo move
980 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
982 // Step 18. Check for new best move
985 splitPoint->mutex.lock();
986 bestValue = splitPoint->bestValue;
987 alpha = splitPoint->alpha;
990 // Finished searching the move. If Signals.stop is true, the search
991 // was aborted because the user interrupted the search or because we
992 // ran out of time. In this case, the return value of the search cannot
993 // be trusted, and we don't update the best move and/or PV.
994 if (Signals.stop || thisThread->cutoff_occurred())
995 return value; // To avoid returning VALUE_INFINITE
999 RootMove& rm = *std::find(RootMoves.begin(), RootMoves.end(), move);
1001 // PV move or new best move ?
1002 if (pvMove || value > alpha)
1005 rm.extract_pv_from_tt(pos);
1007 // We record how often the best move has been changed in each
1008 // iteration. This information is used for time management: When
1009 // the best move changes frequently, we allocate some more time.
1014 // All other moves but the PV are set to the lowest value, this
1015 // is not a problem when sorting becuase sort is stable and move
1016 // position in the list is preserved, just the PV is pushed up.
1017 rm.score = -VALUE_INFINITE;
1020 if (value > bestValue)
1022 bestValue = SpNode ? splitPoint->bestValue = value : value;
1026 bestMove = SpNode ? splitPoint->bestMove = move : move;
1028 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1029 alpha = SpNode ? splitPoint->alpha = value : value;
1032 assert(value >= beta); // Fail high
1035 splitPoint->cutoff = true;
1042 // Step 19. Check for splitting the search
1044 && depth >= Threads.minimumSplitDepth
1045 && Threads.available_slave(thisThread)
1046 && thisThread->splitPointsSize < MAX_SPLITPOINTS_PER_THREAD)
1048 assert(bestValue < beta);
1050 thisThread->split<FakeSplit>(pos, ss, alpha, beta, &bestValue, &bestMove,
1051 depth, threatMove, moveCount, &mp, NT);
1052 if (bestValue >= beta)
1060 // Step 20. Check for mate and stalemate
1061 // All legal moves have been searched and if there are no legal moves, it
1062 // must be mate or stalemate. Note that we can have a false positive in
1063 // case of Signals.stop or thread.cutoff_occurred() are set, but this is
1064 // harmless because return value is discarded anyhow in the parent nodes.
1065 // If we are in a singular extension search then return a fail low score.
1066 // A split node has at least one move, the one tried before to be splitted.
1068 return excludedMove ? alpha
1069 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1071 // If we have pruned all the moves without searching return a fail-low score
1072 if (bestValue == -VALUE_INFINITE)
1074 assert(!playedMoveCount);
1079 if (bestValue >= beta) // Failed high
1081 TT.store(posKey, value_to_tt(bestValue, ss->ply), BOUND_LOWER, depth,
1082 bestMove, ss->staticEval, ss->evalMargin);
1084 if (!pos.is_capture_or_promotion(bestMove) && !inCheck)
1086 if (bestMove != ss->killers[0])
1088 ss->killers[1] = ss->killers[0];
1089 ss->killers[0] = bestMove;
1092 // Increase history value of the cut-off move
1093 Value bonus = Value(int(depth) * int(depth));
1094 History.update(pos.piece_moved(bestMove), to_sq(bestMove), bonus);
1095 if (is_ok((ss-1)->currentMove))
1097 Square prevSq = to_sq((ss-1)->currentMove);
1098 Countermoves.update(pos.piece_on(prevSq), prevSq, bestMove);
1101 // Decrease history of all the other played non-capture moves
1102 for (int i = 0; i < playedMoveCount - 1; i++)
1104 Move m = movesSearched[i];
1105 History.update(pos.piece_moved(m), to_sq(m), -bonus);
1109 else // Failed low or PV search
1110 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1111 PvNode && bestMove != MOVE_NONE ? BOUND_EXACT : BOUND_UPPER,
1112 depth, bestMove, ss->staticEval, ss->evalMargin);
1114 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1120 // qsearch() is the quiescence search function, which is called by the main
1121 // search function when the remaining depth is zero (or, to be more precise,
1122 // less than ONE_PLY).
1124 template <NodeType NT, bool InCheck>
1125 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1127 const bool PvNode = (NT == PV);
1129 assert(NT == PV || NT == NonPV);
1130 assert(InCheck == !!pos.checkers());
1131 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1132 assert(PvNode || (alpha == beta - 1));
1133 assert(depth <= DEPTH_ZERO);
1138 Move ttMove, move, bestMove;
1139 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1140 bool givesCheck, enoughMaterial, evasionPrunable;
1143 // To flag BOUND_EXACT a node with eval above alpha and no available moves
1147 ss->currentMove = bestMove = MOVE_NONE;
1148 ss->ply = (ss-1)->ply + 1;
1150 // Check for an instant draw or maximum ply reached
1151 if (pos.is_draw() || ss->ply > MAX_PLY)
1152 return DrawValue[pos.side_to_move()];
1154 // Decide whether or not to include checks, this fixes also the type of
1155 // TT entry depth that we are going to use. Note that in qsearch we use
1156 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1157 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1158 : DEPTH_QS_NO_CHECKS;
1160 // Transposition table lookup. At PV nodes, we don't use the TT for
1161 // pruning, but only for move ordering.
1163 tte = TT.probe(posKey);
1164 ttMove = tte ? tte->move() : MOVE_NONE;
1165 ttValue = tte ? value_from_tt(tte->value(),ss->ply) : VALUE_NONE;
1168 && tte->depth() >= ttDepth
1169 && ttValue != VALUE_NONE // Only in case of TT access race
1170 && ( PvNode ? tte->type() == BOUND_EXACT
1171 : ttValue >= beta ? (tte->type() & BOUND_LOWER)
1172 : (tte->type() & BOUND_UPPER)))
1174 ss->currentMove = ttMove; // Can be MOVE_NONE
1178 // Evaluate the position statically
1181 ss->staticEval = ss->evalMargin = VALUE_NONE;
1182 bestValue = futilityBase = -VALUE_INFINITE;
1183 enoughMaterial = false;
1189 // Never assume anything on values stored in TT
1190 if ( (ss->staticEval = bestValue = tte->eval_value()) == VALUE_NONE
1191 ||(ss->evalMargin = tte->eval_margin()) == VALUE_NONE)
1192 ss->staticEval = bestValue = evaluate(pos, ss->evalMargin);
1195 ss->staticEval = bestValue = evaluate(pos, ss->evalMargin);
1197 // Stand pat. Return immediately if static value is at least beta
1198 if (bestValue >= beta)
1201 TT.store(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1202 DEPTH_NONE, MOVE_NONE, ss->staticEval, ss->evalMargin);
1207 if (PvNode && bestValue > alpha)
1210 futilityBase = ss->staticEval + ss->evalMargin + Value(128);
1211 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMg;
1214 // Initialize a MovePicker object for the current position, and prepare
1215 // to search the moves. Because the depth is <= 0 here, only captures,
1216 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1218 MovePicker mp(pos, ttMove, depth, History, to_sq((ss-1)->currentMove));
1221 // Loop through the moves until no moves remain or a beta cutoff occurs
1222 while ((move = mp.next_move<false>()) != MOVE_NONE)
1224 assert(is_ok(move));
1226 givesCheck = pos.move_gives_check(move, ci);
1234 && type_of(move) != PROMOTION
1235 && !pos.is_passed_pawn_push(move))
1237 futilityValue = futilityBase
1238 + PieceValue[EG][pos.piece_on(to_sq(move))]
1239 + (type_of(move) == ENPASSANT ? PawnValueEg : VALUE_ZERO);
1241 if (futilityValue < beta)
1243 bestValue = std::max(bestValue, futilityValue);
1247 // Prune moves with negative or equal SEE and also moves with positive
1248 // SEE where capturing piece loses a tempo and SEE < beta - futilityBase.
1249 if ( futilityBase < beta
1250 && depth < DEPTH_ZERO
1251 && pos.see(move, beta - futilityBase) <= 0)
1253 bestValue = std::max(bestValue, futilityBase);
1258 // Detect non-capture evasions that are candidate to be pruned
1259 evasionPrunable = !PvNode
1261 && bestValue > VALUE_MATED_IN_MAX_PLY
1262 && !pos.is_capture(move)
1263 && !pos.can_castle(pos.side_to_move());
1265 // Don't search moves with negative SEE values
1267 && (!InCheck || evasionPrunable)
1269 && type_of(move) != PROMOTION
1270 && pos.see_sign(move) < 0)
1273 // Don't search useless checks
1278 && !pos.is_capture_or_promotion(move)
1279 && ss->staticEval + PawnValueMg / 4 < beta
1280 && !check_is_dangerous(pos, move, futilityBase, beta))
1283 // Check for legality only before to do the move
1284 if (!pos.pl_move_is_legal(move, ci.pinned))
1287 ss->currentMove = move;
1289 // Make and search the move
1290 pos.do_move(move, st, ci, givesCheck);
1291 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1292 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1293 pos.undo_move(move);
1295 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1297 // Check for new best move
1298 if (value > bestValue)
1304 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1311 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1312 ttDepth, move, ss->staticEval, ss->evalMargin);
1320 // All legal moves have been searched. A special case: If we're in check
1321 // and no legal moves were found, it is checkmate.
1322 if (InCheck && bestValue == -VALUE_INFINITE)
1323 return mated_in(ss->ply); // Plies to mate from the root
1325 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1326 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1327 ttDepth, bestMove, ss->staticEval, ss->evalMargin);
1329 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1335 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1336 // "plies to mate from the current position". Non-mate scores are unchanged.
1337 // The function is called before storing a value to the transposition table.
1339 Value value_to_tt(Value v, int ply) {
1341 assert(v != VALUE_NONE);
1343 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1344 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1348 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1349 // from the transposition table (where refers to the plies to mate/be mated
1350 // from current position) to "plies to mate/be mated from the root".
1352 Value value_from_tt(Value v, int ply) {
1354 return v == VALUE_NONE ? VALUE_NONE
1355 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1356 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1360 // check_is_dangerous() tests if a checking move can be pruned in qsearch()
1362 bool check_is_dangerous(const Position& pos, Move move, Value futilityBase, Value beta)
1364 Piece pc = pos.piece_moved(move);
1365 Square from = from_sq(move);
1366 Square to = to_sq(move);
1367 Color them = ~pos.side_to_move();
1368 Square ksq = pos.king_square(them);
1369 Bitboard enemies = pos.pieces(them);
1370 Bitboard kingAtt = pos.attacks_from<KING>(ksq);
1371 Bitboard occ = pos.pieces() ^ from ^ ksq;
1372 Bitboard oldAtt = pos.attacks_from(pc, from, occ);
1373 Bitboard newAtt = pos.attacks_from(pc, to, occ);
1375 // Checks which give opponent's king at most one escape square are dangerous
1376 if (!more_than_one(kingAtt & ~(enemies | newAtt | to)))
1379 // Queen contact check is very dangerous
1380 if (type_of(pc) == QUEEN && (kingAtt & to))
1383 // Creating new double threats with checks is dangerous
1384 Bitboard b = (enemies ^ ksq) & newAtt & ~oldAtt;
1387 // Note that here we generate illegal "double move"!
1388 if (futilityBase + PieceValue[EG][pos.piece_on(pop_lsb(&b))] >= beta)
1396 // allows() tests whether the 'first' move at previous ply somehow makes the
1397 // 'second' move possible, for instance if the moving piece is the same in
1398 // both moves. Normally the second move is the threat (the best move returned
1399 // from a null search that fails low).
1401 bool allows(const Position& pos, Move first, Move second) {
1403 assert(is_ok(first));
1404 assert(is_ok(second));
1405 assert(color_of(pos.piece_on(from_sq(second))) == ~pos.side_to_move());
1406 assert(color_of(pos.piece_on(to_sq(first))) == ~pos.side_to_move());
1408 Square m1from = from_sq(first);
1409 Square m2from = from_sq(second);
1410 Square m1to = to_sq(first);
1411 Square m2to = to_sq(second);
1413 // The piece is the same or second's destination was vacated by the first move
1414 if (m1to == m2from || m2to == m1from)
1417 // Second one moves through the square vacated by first one
1418 if (between_bb(m2from, m2to) & m1from)
1421 // Second's destination is defended by the first move's piece
1422 Bitboard m1att = pos.attacks_from(pos.piece_on(m1to), m1to, pos.pieces() ^ m2from);
1426 // Second move gives a discovered check through the first's checking piece
1427 if (m1att & pos.king_square(pos.side_to_move()))
1429 assert(between_bb(m1to, pos.king_square(pos.side_to_move())) & m2from);
1437 // refutes() tests whether a 'first' move is able to defend against a 'second'
1438 // opponent's move. In this case will not be pruned. Normally the second move
1439 // is the threat (the best move returned from a null search that fails low).
1441 bool refutes(const Position& pos, Move first, Move second) {
1443 assert(is_ok(first));
1444 assert(is_ok(second));
1446 Square m1from = from_sq(first);
1447 Square m2from = from_sq(second);
1448 Square m1to = to_sq(first);
1449 Square m2to = to_sq(second);
1451 // Don't prune moves of the threatened piece
1455 // If the threatened piece has value less than or equal to the value of the
1456 // threat piece, don't prune moves which defend it.
1457 if ( pos.is_capture(second)
1458 && ( PieceValue[MG][pos.piece_on(m2from)] >= PieceValue[MG][pos.piece_on(m2to)]
1459 || type_of(pos.piece_on(m2from)) == KING))
1461 // Update occupancy as if the piece and the threat are moving
1462 Bitboard occ = pos.pieces() ^ m1from ^ m1to ^ m2from;
1463 Piece piece = pos.piece_on(m1from);
1465 // The moved piece attacks the square 'tto' ?
1466 if (pos.attacks_from(piece, m1to, occ) & m2to)
1469 // Scan for possible X-ray attackers behind the moved piece
1470 Bitboard xray = (attacks_bb< ROOK>(m2to, occ) & pos.pieces(color_of(piece), QUEEN, ROOK))
1471 | (attacks_bb<BISHOP>(m2to, occ) & pos.pieces(color_of(piece), QUEEN, BISHOP));
1473 // Verify attackers are triggered by our move and not already existing
1474 if (xray && (xray ^ (xray & pos.attacks_from<QUEEN>(m2to))))
1478 // Don't prune safe moves which block the threat path
1479 if ((between_bb(m2from, m2to) & m1to) && pos.see_sign(first) >= 0)
1486 // When playing with strength handicap choose best move among the MultiPV set
1487 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1489 Move Skill::pick_move() {
1493 // PRNG sequence should be not deterministic
1494 for (int i = Time::now() % 50; i > 0; i--)
1495 rk.rand<unsigned>();
1497 // RootMoves are already sorted by score in descending order
1498 int variance = std::min(RootMoves[0].score - RootMoves[PVSize - 1].score, PawnValueMg);
1499 int weakness = 120 - 2 * level;
1500 int max_s = -VALUE_INFINITE;
1503 // Choose best move. For each move score we add two terms both dependent on
1504 // weakness, one deterministic and bigger for weaker moves, and one random,
1505 // then we choose the move with the resulting highest score.
1506 for (size_t i = 0; i < PVSize; i++)
1508 int s = RootMoves[i].score;
1510 // Don't allow crazy blunders even at very low skills
1511 if (i > 0 && RootMoves[i-1].score > s + 2 * PawnValueMg)
1514 // This is our magic formula
1515 s += ( weakness * int(RootMoves[0].score - s)
1516 + variance * (rk.rand<unsigned>() % weakness)) / 128;
1521 best = RootMoves[i].pv[0];
1528 // uci_pv() formats PV information according to UCI protocol. UCI requires
1529 // to send all the PV lines also if are still to be searched and so refer to
1530 // the previous search score.
1532 string uci_pv(const Position& pos, int depth, Value alpha, Value beta) {
1534 std::stringstream s;
1535 Time::point elaspsed = Time::now() - SearchTime + 1;
1536 size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
1539 for (size_t i = 0; i < Threads.size(); i++)
1540 if (Threads[i]->maxPly > selDepth)
1541 selDepth = Threads[i]->maxPly;
1543 for (size_t i = 0; i < uciPVSize; i++)
1545 bool updated = (i <= PVIdx);
1547 if (depth == 1 && !updated)
1550 int d = updated ? depth : depth - 1;
1551 Value v = updated ? RootMoves[i].score : RootMoves[i].prevScore;
1553 if (s.rdbuf()->in_avail()) // Not at first line
1556 s << "info depth " << d
1557 << " seldepth " << selDepth
1558 << " score " << (i == PVIdx ? score_to_uci(v, alpha, beta) : score_to_uci(v))
1559 << " nodes " << pos.nodes_searched()
1560 << " nps " << pos.nodes_searched() * 1000 / elaspsed
1561 << " time " << elaspsed
1562 << " multipv " << i + 1
1565 for (size_t j = 0; RootMoves[i].pv[j] != MOVE_NONE; j++)
1566 s << " " << move_to_uci(RootMoves[i].pv[j], pos.is_chess960());
1575 /// RootMove::extract_pv_from_tt() builds a PV by adding moves from the TT table.
1576 /// We consider also failing high nodes and not only BOUND_EXACT nodes so to
1577 /// allow to always have a ponder move even when we fail high at root, and a
1578 /// long PV to print that is important for position analysis.
1580 void RootMove::extract_pv_from_tt(Position& pos) {
1582 StateInfo state[MAX_PLY_PLUS_2], *st = state;
1592 assert(MoveList<LEGAL>(pos).contains(pv[ply]));
1594 pos.do_move(pv[ply++], *st++);
1595 tte = TT.probe(pos.key());
1598 && pos.is_pseudo_legal(m = tte->move()) // Local copy, TT could change
1599 && pos.pl_move_is_legal(m, pos.pinned_pieces())
1601 && (!pos.is_draw() || ply < 2));
1603 pv.push_back(MOVE_NONE); // Must be zero-terminating
1605 while (ply) pos.undo_move(pv[--ply]);
1609 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1610 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1611 /// first, even if the old TT entries have been overwritten.
1613 void RootMove::insert_pv_in_tt(Position& pos) {
1615 StateInfo state[MAX_PLY_PLUS_2], *st = state;
1620 tte = TT.probe(pos.key());
1622 if (!tte || tte->move() != pv[ply]) // Don't overwrite correct entries
1623 TT.store(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[ply], VALUE_NONE, VALUE_NONE);
1625 assert(MoveList<LEGAL>(pos).contains(pv[ply]));
1627 pos.do_move(pv[ply++], *st++);
1629 } while (pv[ply] != MOVE_NONE);
1631 while (ply) pos.undo_move(pv[--ply]);
1635 /// Thread::idle_loop() is where the thread is parked when it has no work to do
1637 void Thread::idle_loop() {
1639 // Pointer 'this_sp' is not null only if we are called from split(), and not
1640 // at the thread creation. So it means we are the split point's master.
1641 SplitPoint* this_sp = splitPointsSize ? activeSplitPoint : NULL;
1643 assert(!this_sp || (this_sp->masterThread == this && searching));
1647 // If we are not searching, wait for a condition to be signaled instead of
1648 // wasting CPU time polling for work.
1649 while ((!searching && Threads.sleepWhileIdle) || exit)
1657 // Grab the lock to avoid races with Thread::notify_one()
1660 // If we are master and all slaves have finished then exit idle_loop
1661 if (this_sp && !this_sp->slavesMask)
1667 // Do sleep after retesting sleep conditions under lock protection, in
1668 // particular we need to avoid a deadlock in case a master thread has,
1669 // in the meanwhile, allocated us and sent the notify_one() call before
1670 // we had the chance to grab the lock.
1671 if (!searching && !exit)
1672 sleepCondition.wait(mutex);
1677 // If this thread has been assigned work, launch a search
1682 Threads.mutex.lock();
1685 SplitPoint* sp = activeSplitPoint;
1687 Threads.mutex.unlock();
1689 Stack ss[MAX_PLY_PLUS_2];
1690 Position pos(*sp->pos, this);
1692 memcpy(ss, sp->ss - 1, 4 * sizeof(Stack));
1693 (ss+1)->splitPoint = sp;
1697 assert(activePosition == NULL);
1699 activePosition = &pos;
1701 switch (sp->nodeType) {
1703 search<SplitPointRoot>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1706 search<SplitPointPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1709 search<SplitPointNonPV>(pos, ss+1, sp->alpha, sp->beta, sp->depth);
1718 activePosition = NULL;
1719 sp->slavesMask &= ~(1ULL << idx);
1720 sp->nodes += pos.nodes_searched();
1722 // Wake up master thread so to allow it to return from the idle loop
1723 // in case we are the last slave of the split point.
1724 if ( Threads.sleepWhileIdle
1725 && this != sp->masterThread
1728 assert(!sp->masterThread->searching);
1729 sp->masterThread->notify_one();
1732 // After releasing the lock we cannot access anymore any SplitPoint
1733 // related data in a safe way becuase it could have been released under
1734 // our feet by the sp master. Also accessing other Thread objects is
1735 // unsafe because if we are exiting there is a chance are already freed.
1739 // If this thread is the master of a split point and all slaves have finished
1740 // their work at this split point, return from the idle loop.
1741 if (this_sp && !this_sp->slavesMask)
1743 this_sp->mutex.lock();
1744 bool finished = !this_sp->slavesMask; // Retest under lock protection
1745 this_sp->mutex.unlock();
1753 /// check_time() is called by the timer thread when the timer triggers. It is
1754 /// used to print debug info and, more important, to detect when we are out of
1755 /// available time and so stop the search.
1759 static Time::point lastInfoTime = Time::now();
1760 int64_t nodes = 0; // Workaround silly 'uninitialized' gcc warning
1762 if (Time::now() - lastInfoTime >= 1000)
1764 lastInfoTime = Time::now();
1773 Threads.mutex.lock();
1775 nodes = RootPos.nodes_searched();
1777 // Loop across all split points and sum accumulated SplitPoint nodes plus
1778 // all the currently active positions nodes.
1779 for (size_t i = 0; i < Threads.size(); i++)
1780 for (int j = 0; j < Threads[i]->splitPointsSize; j++)
1782 SplitPoint& sp = Threads[i]->splitPoints[j];
1787 Bitboard sm = sp.slavesMask;
1790 Position* pos = Threads[pop_lsb(&sm)]->activePosition;
1792 nodes += pos->nodes_searched();
1798 Threads.mutex.unlock();
1801 Time::point elapsed = Time::now() - SearchTime;
1802 bool stillAtFirstMove = Signals.firstRootMove
1803 && !Signals.failedLowAtRoot
1804 && elapsed > TimeMgr.available_time();
1806 bool noMoreTime = elapsed > TimeMgr.maximum_time() - 2 * TimerResolution
1807 || stillAtFirstMove;
1809 if ( (Limits.use_time_management() && noMoreTime)
1810 || (Limits.movetime && elapsed >= Limits.movetime)
1811 || (Limits.nodes && nodes >= Limits.nodes))
1812 Signals.stop = true;