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[2][32]; // [improving][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][2][64][64]; // [pv][improving][depth][moveNumber]
80 template <bool PvNode> inline Depth reduction(bool i, Depth d, int mn) {
82 return (Depth) Reductions[PvNode][i][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, bool cutNode);
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][1][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
140 Reductions[0][1][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
142 Reductions[1][0][hd][mc] = Reductions[1][1][hd][mc];
143 Reductions[0][0][hd][mc] = Reductions[0][1][hd][mc];
145 if (Reductions[0][0][hd][mc] > 2 * ONE_PLY)
146 Reductions[0][0][hd][mc] += ONE_PLY;
149 // Init futility margins array
150 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
151 FutilityMargins[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
153 // Init futility move count array
154 for (d = 0; d < 32; d++)
156 FutilityMoveCounts[0][d] = int(3.001 + 0.3 * pow(double(d ), 1.8)) * (d < 5 ? 4 : 3) / 4;
157 FutilityMoveCounts[1][d] = int(3.001 + 0.3 * pow(double(d + 0.98), 1.8));
162 /// Search::perft() is our utility to verify move generation. All the leaf nodes
163 /// up to the given depth are generated and counted and the sum returned.
165 static size_t perft(Position& pos, Depth depth) {
170 const bool leaf = depth == 2 * ONE_PLY;
172 for (MoveList<LEGAL> it(pos); *it; ++it)
174 pos.do_move(*it, st, ci, pos.move_gives_check(*it, ci));
175 cnt += leaf ? MoveList<LEGAL>(pos).size() : ::perft(pos, depth - ONE_PLY);
181 size_t Search::perft(Position& pos, Depth depth) {
182 return depth > ONE_PLY ? ::perft(pos, depth) : MoveList<LEGAL>(pos).size();
185 /// Search::think() is the external interface to Stockfish's search, and is
186 /// called by the main thread when the program receives the UCI 'go' command. It
187 /// searches from RootPos and at the end prints the "bestmove" to output.
189 void Search::think() {
191 static PolyglotBook book; // Defined static to initialize the PRNG only once
193 RootColor = RootPos.side_to_move();
194 TimeMgr.init(Limits, RootPos.game_ply(), RootColor);
196 if (RootMoves.empty())
198 RootMoves.push_back(MOVE_NONE);
199 sync_cout << "info depth 0 score "
200 << score_to_uci(RootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
206 if (Options["OwnBook"] && !Limits.infinite && !Limits.mate)
208 Move bookMove = book.probe(RootPos, Options["Book File"], Options["Best Book Move"]);
210 if (bookMove && std::count(RootMoves.begin(), RootMoves.end(), bookMove))
212 std::swap(RootMoves[0], *std::find(RootMoves.begin(), RootMoves.end(), bookMove));
217 if (Options["Contempt Factor"] && !Options["UCI_AnalyseMode"])
219 int cf = Options["Contempt Factor"] * PawnValueMg / 100; // From centipawns
220 cf = cf * Material::game_phase(RootPos) / PHASE_MIDGAME; // Scale down with phase
221 DrawValue[ RootColor] = VALUE_DRAW - Value(cf);
222 DrawValue[~RootColor] = VALUE_DRAW + Value(cf);
225 DrawValue[WHITE] = DrawValue[BLACK] = VALUE_DRAW;
227 if (Options["Write Search Log"])
229 Log log(Options["Search Log Filename"]);
230 log << "\nSearching: " << RootPos.fen()
231 << "\ninfinite: " << Limits.infinite
232 << " ponder: " << Limits.ponder
233 << " time: " << Limits.time[RootColor]
234 << " increment: " << Limits.inc[RootColor]
235 << " moves to go: " << Limits.movestogo
239 // Reset the threads, still sleeping: will be wake up at split time
240 for (size_t i = 0; i < Threads.size(); i++)
241 Threads[i]->maxPly = 0;
243 Threads.sleepWhileIdle = Options["Idle Threads Sleep"];
245 // Set best timer interval to avoid lagging under time pressure. Timer is
246 // used to check for remaining available thinking time.
247 Threads.timer->msec =
248 Limits.use_time_management() ? std::min(100, std::max(TimeMgr.available_time() / 16, TimerResolution)) :
249 Limits.nodes ? 2 * TimerResolution
252 Threads.timer->notify_one(); // Wake up the recurring timer
254 id_loop(RootPos); // Let's start searching !
256 Threads.timer->msec = 0; // Stop the timer
257 Threads.sleepWhileIdle = true; // Send idle threads to sleep
259 if (Options["Write Search Log"])
261 Time::point elapsed = Time::now() - SearchTime + 1;
263 Log log(Options["Search Log Filename"]);
264 log << "Nodes: " << RootPos.nodes_searched()
265 << "\nNodes/second: " << RootPos.nodes_searched() * 1000 / elapsed
266 << "\nBest move: " << move_to_san(RootPos, RootMoves[0].pv[0]);
269 RootPos.do_move(RootMoves[0].pv[0], st);
270 log << "\nPonder move: " << move_to_san(RootPos, RootMoves[0].pv[1]) << std::endl;
271 RootPos.undo_move(RootMoves[0].pv[0]);
276 // When search is stopped this info is not printed
277 sync_cout << "info nodes " << RootPos.nodes_searched()
278 << " time " << Time::now() - SearchTime + 1 << sync_endl;
280 // When we reach max depth we arrive here even without Signals.stop is raised,
281 // but if we are pondering or in infinite search, according to UCI protocol,
282 // we shouldn't print the best move before the GUI sends a "stop" or "ponderhit"
283 // command. We simply wait here until GUI sends one of those commands (that
284 // raise Signals.stop).
285 if (!Signals.stop && (Limits.ponder || Limits.infinite))
287 Signals.stopOnPonderhit = true;
288 RootPos.this_thread()->wait_for(Signals.stop);
291 // Best move could be MOVE_NONE when searching on a stalemate position
292 sync_cout << "bestmove " << move_to_uci(RootMoves[0].pv[0], RootPos.is_chess960())
293 << " ponder " << move_to_uci(RootMoves[0].pv[1], RootPos.is_chess960())
300 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
301 // with increasing depth until the allocated thinking time has been consumed,
302 // user stops the search, or the maximum search depth is reached.
304 void id_loop(Position& pos) {
306 Stack stack[MAX_PLY_PLUS_6], *ss = stack+2; // To allow referencing (ss-2)
307 int depth, prevBestMoveChanges;
308 Value bestValue, alpha, beta, delta;
310 std::memset(ss-2, 0, 5 * sizeof(Stack));
311 (ss-1)->currentMove = MOVE_NULL; // Hack to skip update gains
313 depth = BestMoveChanges = 0;
314 bestValue = delta = alpha = -VALUE_INFINITE;
315 beta = VALUE_INFINITE;
320 Countermoves.clear();
322 PVSize = Options["MultiPV"];
323 Skill skill(Options["Skill Level"]);
325 // Do we have to play with skill handicap? In this case enable MultiPV search
326 // that we will use behind the scenes to retrieve a set of possible moves.
327 if (skill.enabled() && PVSize < 4)
330 PVSize = std::min(PVSize, RootMoves.size());
332 // Iterative deepening loop until requested to stop or target depth reached
333 while (++depth <= MAX_PLY && !Signals.stop && (!Limits.depth || depth <= Limits.depth))
335 // Save last iteration's scores before first PV line is searched and all
336 // the move scores but the (new) PV are set to -VALUE_INFINITE.
337 for (size_t i = 0; i < RootMoves.size(); i++)
338 RootMoves[i].prevScore = RootMoves[i].score;
340 prevBestMoveChanges = BestMoveChanges; // Only sensible when PVSize == 1
343 // MultiPV loop. We perform a full root search for each PV line
344 for (PVIdx = 0; PVIdx < PVSize; PVIdx++)
346 // Reset aspiration window starting size
350 alpha = std::max(RootMoves[PVIdx].prevScore - delta,-VALUE_INFINITE);
351 beta = std::min(RootMoves[PVIdx].prevScore + delta, VALUE_INFINITE);
354 // Start with a small aspiration window and, in case of fail high/low,
355 // research with bigger window until not failing high/low anymore.
358 bestValue = search<Root>(pos, ss, alpha, beta, depth * ONE_PLY, false);
360 // Bring to front the best move. It is critical that sorting is
361 // done with a stable algorithm because all the values but the first
362 // and eventually the new best one are set to -VALUE_INFINITE and
363 // we want to keep the same order for all the moves but the new
364 // PV that goes to the front. Note that in case of MultiPV search
365 // the already searched PV lines are preserved.
366 std::stable_sort(RootMoves.begin() + PVIdx, RootMoves.end());
368 // Write PV back to transposition table in case the relevant
369 // entries have been overwritten during the search.
370 for (size_t i = 0; i <= PVIdx; i++)
371 RootMoves[i].insert_pv_in_tt(pos);
373 // If search has been stopped return immediately. Sorting and
374 // writing PV back to TT is safe becuase RootMoves is still
375 // valid, although refers to previous iteration.
379 // When failing high/low give some update (without cluttering
380 // the UI) before to research.
381 if ( (bestValue <= alpha || bestValue >= beta)
382 && Time::now() - SearchTime > 3000)
383 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
385 // In case of failing low/high increase aspiration window and
386 // research, otherwise exit the loop.
387 if (bestValue <= alpha)
389 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
391 Signals.failedLowAtRoot = true;
392 Signals.stopOnPonderhit = false;
394 else if (bestValue >= beta)
395 beta = std::min(bestValue + delta, VALUE_INFINITE);
402 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
405 // Sort the PV lines searched so far and update the GUI
406 std::stable_sort(RootMoves.begin(), RootMoves.begin() + PVIdx + 1);
408 if (PVIdx + 1 == PVSize || Time::now() - SearchTime > 3000)
409 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
412 // Do we need to pick now the sub-optimal best move ?
413 if (skill.enabled() && skill.time_to_pick(depth))
416 if (Options["Write Search Log"])
418 RootMove& rm = RootMoves[0];
419 if (skill.best != MOVE_NONE)
420 rm = *std::find(RootMoves.begin(), RootMoves.end(), skill.best);
422 Log log(Options["Search Log Filename"]);
423 log << pretty_pv(pos, depth, rm.score, Time::now() - SearchTime, &rm.pv[0])
427 // Do we have found a "mate in x"?
429 && bestValue >= VALUE_MATE_IN_MAX_PLY
430 && VALUE_MATE - bestValue <= 2 * Limits.mate)
433 // Do we have time for the next iteration? Can we stop searching now?
434 if (Limits.use_time_management() && !Signals.stopOnPonderhit)
436 bool stop = false; // Local variable, not the volatile Signals.stop
438 // Take in account some extra time if the best move has changed
439 if (depth > 4 && depth < 50 && PVSize == 1)
440 TimeMgr.pv_instability(BestMoveChanges, prevBestMoveChanges);
442 // Stop search if most of available time is already consumed. We
443 // probably don't have enough time to search the first move at the
444 // next iteration anyway.
445 if (Time::now() - SearchTime > (TimeMgr.available_time() * 62) / 100)
448 // Stop search early if one move seems to be much better than others
452 && bestValue > VALUE_MATED_IN_MAX_PLY
453 && ( RootMoves.size() == 1
454 || Time::now() - SearchTime > (TimeMgr.available_time() * 20) / 100))
456 Value rBeta = bestValue - 2 * PawnValueMg;
457 ss->excludedMove = RootMoves[0].pv[0];
458 ss->skipNullMove = true;
459 Value v = search<NonPV>(pos, ss, rBeta - 1, rBeta, (depth - 3) * ONE_PLY, true);
460 ss->skipNullMove = false;
461 ss->excludedMove = MOVE_NONE;
469 // If we are allowed to ponder do not stop the search now but
470 // keep pondering until GUI sends "ponderhit" or "stop".
472 Signals.stopOnPonderhit = true;
481 // search<>() is the main search function for both PV and non-PV nodes and for
482 // normal and SplitPoint nodes. When called just after a split point the search
483 // is simpler because we have already probed the hash table, done a null move
484 // search, and searched the first move before splitting, we don't have to repeat
485 // all this work again. We also don't need to store anything to the hash table
486 // here: This is taken care of after we return from the split point.
488 template <NodeType NT>
489 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
491 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV || NT == SplitPointRoot);
492 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV || NT == SplitPointRoot);
493 const bool RootNode = (NT == Root || NT == SplitPointRoot);
495 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
496 assert(PvNode || (alpha == beta - 1));
497 assert(depth > DEPTH_ZERO);
499 Move quietsSearched[64];
502 SplitPoint* splitPoint;
504 Move ttMove, move, excludedMove, bestMove, threatMove;
506 Value bestValue, value, ttValue;
507 Value eval, nullValue, futilityValue;
508 bool inCheck, givesCheck, pvMove, singularExtensionNode, improving;
509 bool captureOrPromotion, dangerous, doFullDepthSearch;
510 int moveCount, quietCount;
512 // Step 1. Initialize node
513 Thread* thisThread = pos.this_thread();
514 inCheck = pos.checkers();
518 splitPoint = ss->splitPoint;
519 bestMove = splitPoint->bestMove;
520 threatMove = splitPoint->threatMove;
521 bestValue = splitPoint->bestValue;
523 ttMove = excludedMove = MOVE_NONE;
524 ttValue = VALUE_NONE;
526 assert(splitPoint->bestValue > -VALUE_INFINITE && splitPoint->moveCount > 0);
531 moveCount = quietCount = 0;
532 bestValue = -VALUE_INFINITE;
533 ss->currentMove = threatMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
534 ss->ply = (ss-1)->ply + 1;
535 ss->futilityMoveCount = 0;
536 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
537 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
539 // Used to send selDepth info to GUI
540 if (PvNode && thisThread->maxPly < ss->ply)
541 thisThread->maxPly = ss->ply;
545 // Step 2. Check for aborted search and immediate draw
546 if (Signals.stop || pos.is_draw() || ss->ply > MAX_PLY)
547 return DrawValue[pos.side_to_move()];
549 // Step 3. Mate distance pruning. Even if we mate at the next move our score
550 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
551 // a shorter mate was found upward in the tree then there is no need to search
552 // further, we will never beat current alpha. Same logic but with reversed signs
553 // applies also in the opposite condition of being mated instead of giving mate,
554 // in this case return a fail-high score.
555 alpha = std::max(mated_in(ss->ply), alpha);
556 beta = std::min(mate_in(ss->ply+1), beta);
561 // Step 4. Transposition table lookup
562 // We don't want the score of a partial search to overwrite a previous full search
563 // TT value, so we use a different position key in case of an excluded move.
564 excludedMove = ss->excludedMove;
565 posKey = excludedMove ? pos.exclusion_key() : pos.key();
566 tte = TT.probe(posKey);
567 ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
568 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
570 // At PV nodes we check for exact scores, while at non-PV nodes we check for
571 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
572 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
573 // we should also update RootMoveList to avoid bogus output.
576 && tte->depth() >= depth
577 && ttValue != VALUE_NONE // Only in case of TT access race
578 && ( PvNode ? tte->bound() == BOUND_EXACT
579 : ttValue >= beta ? (tte->bound() & BOUND_LOWER)
580 : (tte->bound() & BOUND_UPPER)))
583 ss->currentMove = ttMove; // Can be MOVE_NONE
587 && !pos.is_capture_or_promotion(ttMove)
588 && ttMove != ss->killers[0])
590 ss->killers[1] = ss->killers[0];
591 ss->killers[0] = ttMove;
596 // Step 5. Evaluate the position statically and update parent's gain statistics
599 ss->staticEval = ss->evalMargin = eval = VALUE_NONE;
605 // Never assume anything on values stored in TT
606 if ( (ss->staticEval = eval = tte->eval_value()) == VALUE_NONE
607 ||(ss->evalMargin = tte->eval_margin()) == VALUE_NONE)
608 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
610 // Can ttValue be used as a better position evaluation?
611 if (ttValue != VALUE_NONE)
612 if ( ((tte->bound() & BOUND_LOWER) && ttValue > eval)
613 || ((tte->bound() & BOUND_UPPER) && ttValue < eval))
618 eval = ss->staticEval = evaluate(pos, ss->evalMargin);
619 TT.store(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE,
620 ss->staticEval, ss->evalMargin);
623 // Update gain for the parent non-capture move given the static position
624 // evaluation before and after the move.
625 if ( !pos.captured_piece_type()
626 && ss->staticEval != VALUE_NONE
627 && (ss-1)->staticEval != VALUE_NONE
628 && (move = (ss-1)->currentMove) != MOVE_NULL
629 && type_of(move) == NORMAL)
631 Square to = to_sq(move);
632 Gains.update(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
635 // Step 6. Razoring (skipped when in check)
637 && depth < 4 * ONE_PLY
638 && eval + razor_margin(depth) < beta
639 && ttMove == MOVE_NONE
640 && abs(beta) < VALUE_MATE_IN_MAX_PLY
641 && !pos.pawn_on_7th(pos.side_to_move()))
643 Value rbeta = beta - razor_margin(depth);
644 Value v = qsearch<NonPV, false>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
646 // Logically we should return (v + razor_margin(depth)), but
647 // surprisingly this did slightly weaker in tests.
651 // Step 7. Static null move pruning (skipped when in check)
652 // We're betting that the opponent doesn't have a move that will reduce
653 // the score by more than futility_margin(depth) if we do a null move.
656 && depth < 4 * ONE_PLY
657 && eval - futility_margin(depth, (ss-1)->futilityMoveCount) >= beta
658 && abs(beta) < VALUE_MATE_IN_MAX_PLY
659 && abs(eval) < VALUE_KNOWN_WIN
660 && pos.non_pawn_material(pos.side_to_move()))
661 return eval - futility_margin(depth, (ss-1)->futilityMoveCount);
663 // Step 8. Null move search with verification search (is omitted in PV nodes)
666 && depth >= 2 * ONE_PLY
668 && abs(beta) < VALUE_MATE_IN_MAX_PLY
669 && pos.non_pawn_material(pos.side_to_move()))
671 ss->currentMove = MOVE_NULL;
673 // Null move dynamic reduction based on depth
674 Depth R = 3 * ONE_PLY + depth / 4;
676 // Null move dynamic reduction based on value
677 if (eval - PawnValueMg > beta)
680 pos.do_null_move(st);
681 (ss+1)->skipNullMove = true;
682 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
683 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R, !cutNode);
684 (ss+1)->skipNullMove = false;
685 pos.undo_null_move();
687 if (nullValue >= beta)
689 // Do not return unproven mate scores
690 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
693 if (depth < 12 * ONE_PLY)
696 // Do verification search at high depths
697 ss->skipNullMove = true;
698 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R, false);
699 ss->skipNullMove = false;
706 // The null move failed low, which means that we may be faced with
707 // some kind of threat. If the previous move was reduced, check if
708 // the move that refuted the null move was somehow connected to the
709 // move which was reduced. If a connection is found, return a fail
710 // low score (which will cause the reduced move to fail high in the
711 // parent node, which will trigger a re-search with full depth).
712 threatMove = (ss+1)->currentMove;
714 if ( depth < 5 * ONE_PLY
716 && threatMove != MOVE_NONE
717 && allows(pos, (ss-1)->currentMove, threatMove))
722 // Step 9. ProbCut (skipped when in check)
723 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
724 // and a reduced search returns a value much above beta, we can (almost) safely
725 // prune the previous move.
727 && depth >= 5 * ONE_PLY
729 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
731 Value rbeta = beta + 200;
732 Depth rdepth = depth - ONE_PLY - 3 * ONE_PLY;
734 assert(rdepth >= ONE_PLY);
735 assert((ss-1)->currentMove != MOVE_NONE);
736 assert((ss-1)->currentMove != MOVE_NULL);
738 MovePicker mp(pos, ttMove, History, pos.captured_piece_type());
741 while ((move = mp.next_move<false>()) != MOVE_NONE)
742 if (pos.pl_move_is_legal(move, ci.pinned))
744 ss->currentMove = move;
745 pos.do_move(move, st, ci, pos.move_gives_check(move, ci));
746 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth, !cutNode);
753 // Step 10. Internal iterative deepening (skipped when in check)
754 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
755 && ttMove == MOVE_NONE
756 && (PvNode || ss->staticEval + Value(256) >= beta))
758 Depth d = depth - 2 * ONE_PLY - (PvNode ? DEPTH_ZERO : depth / 4);
760 ss->skipNullMove = true;
761 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d, true);
762 ss->skipNullMove = false;
764 tte = TT.probe(posKey);
765 ttMove = tte ? tte->move() : MOVE_NONE;
768 moves_loop: // When in check and at SpNode search starts from here
770 Square prevMoveSq = to_sq((ss-1)->currentMove);
771 Move countermoves[] = { Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].first,
772 Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].second };
774 MovePicker mp(pos, ttMove, depth, History, countermoves, ss);
776 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
777 improving = ss->staticEval >= (ss-2)->staticEval
778 || ss->staticEval == VALUE_NONE
779 ||(ss-2)->staticEval == VALUE_NONE;
781 singularExtensionNode = !RootNode
783 && depth >= (PvNode ? 6 * ONE_PLY : 8 * ONE_PLY)
784 && ttMove != MOVE_NONE
785 && !excludedMove // Recursive singular search is not allowed
786 && (tte->bound() & BOUND_LOWER)
787 && tte->depth() >= depth - 3 * ONE_PLY;
789 // Step 11. Loop through moves
790 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
791 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
795 if (move == excludedMove)
798 // At root obey the "searchmoves" option and skip moves not listed in Root
799 // Move List, as a consequence any illegal move is also skipped. In MultiPV
800 // mode we also skip PV moves which have been already searched.
801 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
806 // Shared counter cannot be decremented later if move turns out to be illegal
807 if (!pos.pl_move_is_legal(move, ci.pinned))
810 moveCount = ++splitPoint->moveCount;
811 splitPoint->mutex.unlock();
818 Signals.firstRootMove = (moveCount == 1);
820 if (thisThread == Threads.main() && Time::now() - SearchTime > 3000)
821 sync_cout << "info depth " << depth / ONE_PLY
822 << " currmove " << move_to_uci(move, pos.is_chess960())
823 << " currmovenumber " << moveCount + PVIdx << sync_endl;
827 captureOrPromotion = pos.is_capture_or_promotion(move);
828 givesCheck = pos.move_gives_check(move, ci);
829 dangerous = givesCheck
830 || pos.is_passed_pawn_push(move)
831 || type_of(move) == CASTLE;
833 // Step 12. Extend checks and, in PV nodes, also dangerous moves
834 if (PvNode && dangerous)
837 else if (givesCheck && pos.see_sign(move) >= 0)
840 // Singular extension search. If all moves but one fail low on a search of
841 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
842 // is singular and should be extended. To verify this we do a reduced search
843 // on all the other moves but the ttMove, if result is lower than ttValue minus
844 // a margin then we extend ttMove.
845 if ( singularExtensionNode
848 && pos.pl_move_is_legal(move, ci.pinned)
849 && abs(ttValue) < VALUE_KNOWN_WIN)
851 assert(ttValue != VALUE_NONE);
853 Value rBeta = ttValue - int(depth);
854 ss->excludedMove = move;
855 ss->skipNullMove = true;
856 value = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2, cutNode);
857 ss->skipNullMove = false;
858 ss->excludedMove = MOVE_NONE;
864 // Update current move (this must be done after singular extension search)
865 newDepth = depth - ONE_PLY + ext;
867 // Step 13. Futility pruning (is omitted in PV nodes)
869 && !captureOrPromotion
872 /* && move != ttMove Already implicit in the next condition */
873 && bestValue > VALUE_MATED_IN_MAX_PLY)
875 // Move count based pruning
876 if ( depth < 16 * ONE_PLY
877 && moveCount >= FutilityMoveCounts[improving][depth]
878 && (!threatMove || !refutes(pos, move, threatMove)))
881 splitPoint->mutex.lock();
886 // Value based pruning
887 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
888 // but fixing this made program slightly weaker.
889 Depth predictedDepth = newDepth - reduction<PvNode>(improving, depth, moveCount);
890 futilityValue = ss->staticEval + ss->evalMargin + futility_margin(predictedDepth, moveCount)
891 + Gains[pos.piece_moved(move)][to_sq(move)];
893 if (futilityValue < beta)
895 bestValue = std::max(bestValue, futilityValue);
899 splitPoint->mutex.lock();
900 if (bestValue > splitPoint->bestValue)
901 splitPoint->bestValue = bestValue;
906 // Prune moves with negative SEE at low depths
907 if ( predictedDepth < 4 * ONE_PLY
908 && pos.see_sign(move) < 0)
911 splitPoint->mutex.lock();
916 // We have not pruned the move that will be searched, but remember how
917 // far in the move list we are to be more aggressive in the child node.
918 ss->futilityMoveCount = moveCount;
921 ss->futilityMoveCount = 0;
923 // Check for legality only before to do the move
924 if (!RootNode && !SpNode && !pos.pl_move_is_legal(move, ci.pinned))
930 pvMove = PvNode && moveCount == 1;
931 ss->currentMove = move;
932 if (!SpNode && !captureOrPromotion && quietCount < 64)
933 quietsSearched[quietCount++] = move;
935 // Step 14. Make the move
936 pos.do_move(move, st, ci, givesCheck);
938 // Step 15. Reduced depth search (LMR). If the move fails high will be
939 // re-searched at full depth.
940 if ( depth > 3 * ONE_PLY
942 && !captureOrPromotion
945 && move != ss->killers[0]
946 && move != ss->killers[1])
948 ss->reduction = reduction<PvNode>(improving, depth, moveCount);
950 if (!PvNode && cutNode)
951 ss->reduction += ONE_PLY;
953 if (move == countermoves[0] || move == countermoves[1])
954 ss->reduction = std::max(DEPTH_ZERO, ss->reduction-ONE_PLY);
956 Depth d = std::max(newDepth - ss->reduction, ONE_PLY);
958 alpha = splitPoint->alpha;
960 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, true);
962 doFullDepthSearch = (value > alpha && ss->reduction != DEPTH_ZERO);
963 ss->reduction = DEPTH_ZERO;
966 doFullDepthSearch = !pvMove;
968 // Step 16. Full depth search, when LMR is skipped or fails high
969 if (doFullDepthSearch)
972 alpha = splitPoint->alpha;
974 value = newDepth < ONE_PLY ?
975 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
976 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
977 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
980 // Only for PV nodes do a full PV search on the first move or after a fail
981 // high, in the latter case search only if value < beta, otherwise let the
982 // parent node to fail low with value <= alpha and to try another move.
983 if (PvNode && (pvMove || (value > alpha && (RootNode || value < beta))))
984 value = newDepth < ONE_PLY ?
985 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
986 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
987 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth, false);
988 // Step 17. Undo move
991 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
993 // Step 18. Check for new best move
996 splitPoint->mutex.lock();
997 bestValue = splitPoint->bestValue;
998 alpha = splitPoint->alpha;
1001 // Finished searching the move. If Signals.stop is true, the search
1002 // was aborted because the user interrupted the search or because we
1003 // ran out of time. In this case, the return value of the search cannot
1004 // be trusted, and we don't update the best move and/or PV.
1005 if (Signals.stop || thisThread->cutoff_occurred())
1006 return value; // To avoid returning VALUE_INFINITE
1010 RootMove& rm = *std::find(RootMoves.begin(), RootMoves.end(), move);
1012 // PV move or new best move ?
1013 if (pvMove || value > alpha)
1016 rm.extract_pv_from_tt(pos);
1018 // We record how often the best move has been changed in each
1019 // iteration. This information is used for time management: When
1020 // the best move changes frequently, we allocate some more time.
1025 // All other moves but the PV are set to the lowest value, this
1026 // is not a problem when sorting becuase sort is stable and move
1027 // position in the list is preserved, just the PV is pushed up.
1028 rm.score = -VALUE_INFINITE;
1031 if (value > bestValue)
1033 bestValue = SpNode ? splitPoint->bestValue = value : value;
1037 bestMove = SpNode ? splitPoint->bestMove = move : move;
1039 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1040 alpha = SpNode ? splitPoint->alpha = value : value;
1043 assert(value >= beta); // Fail high
1046 splitPoint->cutoff = true;
1053 // Step 19. Check for splitting the search
1055 && depth >= Threads.minimumSplitDepth
1056 && Threads.available_slave(thisThread)
1057 && thisThread->splitPointsSize < MAX_SPLITPOINTS_PER_THREAD)
1059 assert(bestValue < beta);
1061 thisThread->split<FakeSplit>(pos, ss, alpha, beta, &bestValue, &bestMove,
1062 depth, threatMove, moveCount, &mp, NT, cutNode);
1063 if (bestValue >= beta)
1071 // Step 20. Check for mate and stalemate
1072 // All legal moves have been searched and if there are no legal moves, it
1073 // must be mate or stalemate. Note that we can have a false positive in
1074 // case of Signals.stop or thread.cutoff_occurred() are set, but this is
1075 // harmless because return value is discarded anyhow in the parent nodes.
1076 // If we are in a singular extension search then return a fail low score.
1077 // A split node has at least one move, the one tried before to be splitted.
1079 return excludedMove ? alpha
1080 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1082 // If we have pruned all the moves without searching return a fail-low score
1083 if (bestValue == -VALUE_INFINITE)
1086 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1087 bestValue >= beta ? BOUND_LOWER :
1088 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1089 depth, bestMove, ss->staticEval, ss->evalMargin);
1091 // Quiet best move: update killers, history and countermoves
1092 if ( bestValue >= beta
1093 && !pos.is_capture_or_promotion(bestMove)
1096 if (ss->killers[0] != bestMove)
1098 ss->killers[1] = ss->killers[0];
1099 ss->killers[0] = bestMove;
1102 // Increase history value of the cut-off move and decrease all the other
1103 // played non-capture moves.
1104 Value bonus = Value(int(depth) * int(depth));
1105 History.update(pos.piece_moved(bestMove), to_sq(bestMove), bonus);
1106 for (int i = 0; i < quietCount - 1; i++)
1108 Move m = quietsSearched[i];
1109 History.update(pos.piece_moved(m), to_sq(m), -bonus);
1112 if (is_ok((ss-1)->currentMove))
1113 Countermoves.update(pos.piece_on(prevMoveSq), prevMoveSq, bestMove);
1116 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1122 // qsearch() is the quiescence search function, which is called by the main
1123 // search function when the remaining depth is zero (or, to be more precise,
1124 // less than ONE_PLY).
1126 template <NodeType NT, bool InCheck>
1127 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1129 const bool PvNode = (NT == PV);
1131 assert(NT == PV || NT == NonPV);
1132 assert(InCheck == !!pos.checkers());
1133 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1134 assert(PvNode || (alpha == beta - 1));
1135 assert(depth <= DEPTH_ZERO);
1140 Move ttMove, move, bestMove;
1141 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1142 bool givesCheck, evasionPrunable;
1145 // To flag BOUND_EXACT a node with eval above alpha and no available moves
1149 ss->currentMove = bestMove = MOVE_NONE;
1150 ss->ply = (ss-1)->ply + 1;
1152 // Check for an instant draw or maximum ply reached
1153 if (pos.is_draw() || ss->ply > MAX_PLY)
1154 return DrawValue[pos.side_to_move()];
1156 // Decide whether or not to include checks, this fixes also the type of
1157 // TT entry depth that we are going to use. Note that in qsearch we use
1158 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1159 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1160 : DEPTH_QS_NO_CHECKS;
1162 // Transposition table lookup
1164 tte = TT.probe(posKey);
1165 ttMove = tte ? tte->move() : MOVE_NONE;
1166 ttValue = tte ? value_from_tt(tte->value(),ss->ply) : VALUE_NONE;
1169 && tte->depth() >= ttDepth
1170 && ttValue != VALUE_NONE // Only in case of TT access race
1171 && ( PvNode ? tte->bound() == BOUND_EXACT
1172 : ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1173 : (tte->bound() & BOUND_UPPER)))
1175 ss->currentMove = ttMove; // Can be MOVE_NONE
1179 // Evaluate the position statically
1182 ss->staticEval = ss->evalMargin = VALUE_NONE;
1183 bestValue = futilityBase = -VALUE_INFINITE;
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);
1213 // Initialize a MovePicker object for the current position, and prepare
1214 // to search the moves. Because the depth is <= 0 here, only captures,
1215 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1217 MovePicker mp(pos, ttMove, depth, History, to_sq((ss-1)->currentMove));
1220 // Loop through the moves until no moves remain or a beta cutoff occurs
1221 while ((move = mp.next_move<false>()) != MOVE_NONE)
1223 assert(is_ok(move));
1225 givesCheck = pos.move_gives_check(move, ci);
1232 && type_of(move) != PROMOTION
1233 && futilityBase > -VALUE_KNOWN_WIN
1234 && !pos.is_passed_pawn_push(move))
1236 futilityValue = futilityBase
1237 + PieceValue[EG][pos.piece_on(to_sq(move))]
1238 + (type_of(move) == ENPASSANT ? PawnValueEg : VALUE_ZERO);
1240 if (futilityValue < beta)
1242 bestValue = std::max(bestValue, futilityValue);
1246 // Prune moves with negative or equal SEE and also moves with positive
1247 // SEE where capturing piece loses a tempo and SEE < beta - futilityBase.
1248 if ( futilityBase < beta
1249 && pos.see(move, beta - futilityBase) <= 0)
1251 bestValue = std::max(bestValue, futilityBase);
1256 // Detect non-capture evasions that are candidate to be pruned
1257 evasionPrunable = InCheck
1258 && bestValue > VALUE_MATED_IN_MAX_PLY
1259 && !pos.is_capture(move)
1260 && !pos.can_castle(pos.side_to_move());
1262 // Don't search moves with negative SEE values
1264 && (!InCheck || evasionPrunable)
1266 && type_of(move) != PROMOTION
1267 && pos.see_sign(move) < 0)
1270 // Don't search useless checks
1275 && !pos.is_capture_or_promotion(move)
1276 && ss->staticEval + PawnValueMg / 4 < beta
1277 && !check_is_dangerous(pos, move, futilityBase, beta))
1280 // Check for legality only before to do the move
1281 if (!pos.pl_move_is_legal(move, ci.pinned))
1284 ss->currentMove = move;
1286 // Make and search the move
1287 pos.do_move(move, st, ci, givesCheck);
1288 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1289 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1290 pos.undo_move(move);
1292 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1294 // Check for new best move
1295 if (value > bestValue)
1301 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1308 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1309 ttDepth, move, ss->staticEval, ss->evalMargin);
1317 // All legal moves have been searched. A special case: If we're in check
1318 // and no legal moves were found, it is checkmate.
1319 if (InCheck && bestValue == -VALUE_INFINITE)
1320 return mated_in(ss->ply); // Plies to mate from the root
1322 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1323 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1324 ttDepth, bestMove, ss->staticEval, ss->evalMargin);
1326 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1332 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1333 // "plies to mate from the current position". Non-mate scores are unchanged.
1334 // The function is called before storing a value to the transposition table.
1336 Value value_to_tt(Value v, int ply) {
1338 assert(v != VALUE_NONE);
1340 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1341 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1345 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1346 // from the transposition table (where refers to the plies to mate/be mated
1347 // from current position) to "plies to mate/be mated from the root".
1349 Value value_from_tt(Value v, int ply) {
1351 return v == VALUE_NONE ? VALUE_NONE
1352 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1353 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1357 // check_is_dangerous() tests if a checking move can be pruned in qsearch()
1359 bool check_is_dangerous(const Position& pos, Move move, Value futilityBase, Value beta)
1361 Piece pc = pos.piece_moved(move);
1362 Square from = from_sq(move);
1363 Square to = to_sq(move);
1364 Color them = ~pos.side_to_move();
1365 Square ksq = pos.king_square(them);
1366 Bitboard enemies = pos.pieces(them);
1367 Bitboard kingAtt = pos.attacks_from<KING>(ksq);
1368 Bitboard occ = pos.pieces() ^ from ^ ksq;
1369 Bitboard oldAtt = pos.attacks_from(pc, from, occ);
1370 Bitboard newAtt = pos.attacks_from(pc, to, occ);
1372 // Checks which give opponent's king at most one escape square are dangerous
1373 if (!more_than_one(kingAtt & ~(enemies | newAtt | to)))
1376 // Queen contact check is very dangerous
1377 if (type_of(pc) == QUEEN && (kingAtt & to))
1380 // Creating new double threats with checks is dangerous
1381 Bitboard b = (enemies ^ ksq) & newAtt & ~oldAtt;
1384 // Note that here we generate illegal "double move"!
1385 if (futilityBase + PieceValue[EG][pos.piece_on(pop_lsb(&b))] >= beta)
1393 // allows() tests whether the 'first' move at previous ply somehow makes the
1394 // 'second' move possible, for instance if the moving piece is the same in
1395 // both moves. Normally the second move is the threat (the best move returned
1396 // from a null search that fails low).
1398 bool allows(const Position& pos, Move first, Move second) {
1400 assert(is_ok(first));
1401 assert(is_ok(second));
1402 assert(color_of(pos.piece_on(from_sq(second))) == ~pos.side_to_move());
1403 assert(color_of(pos.piece_on(to_sq(first))) == ~pos.side_to_move());
1405 Square m1from = from_sq(first);
1406 Square m2from = from_sq(second);
1407 Square m1to = to_sq(first);
1408 Square m2to = to_sq(second);
1410 // The piece is the same or second's destination was vacated by the first move
1411 if (m1to == m2from || m2to == m1from)
1414 // Second one moves through the square vacated by first one
1415 if (between_bb(m2from, m2to) & m1from)
1418 // Second's destination is defended by the first move's piece
1419 Bitboard m1att = pos.attacks_from(pos.piece_on(m1to), m1to, pos.pieces() ^ m2from);
1423 // Second move gives a discovered check through the first's checking piece
1424 if (m1att & pos.king_square(pos.side_to_move()))
1426 assert(between_bb(m1to, pos.king_square(pos.side_to_move())) & m2from);
1434 // refutes() tests whether a 'first' move is able to defend against a 'second'
1435 // opponent's move. In this case will not be pruned. Normally the second move
1436 // is the threat (the best move returned from a null search that fails low).
1438 bool refutes(const Position& pos, Move first, Move second) {
1440 assert(is_ok(first));
1441 assert(is_ok(second));
1443 Square m1from = from_sq(first);
1444 Square m2from = from_sq(second);
1445 Square m1to = to_sq(first);
1446 Square m2to = to_sq(second);
1448 // Don't prune moves of the threatened piece
1452 // If the threatened piece has value less than or equal to the value of the
1453 // threat piece, don't prune moves which defend it.
1454 if ( pos.is_capture(second)
1455 && ( PieceValue[MG][pos.piece_on(m2from)] >= PieceValue[MG][pos.piece_on(m2to)]
1456 || type_of(pos.piece_on(m2from)) == KING))
1458 // Update occupancy as if the piece and the threat are moving
1459 Bitboard occ = pos.pieces() ^ m1from ^ m1to ^ m2from;
1460 Piece pc = pos.piece_on(m1from);
1462 // The moved piece attacks the square 'tto' ?
1463 if (pos.attacks_from(pc, m1to, occ) & m2to)
1466 // Scan for possible X-ray attackers behind the moved piece
1467 Bitboard xray = (attacks_bb< ROOK>(m2to, occ) & pos.pieces(color_of(pc), QUEEN, ROOK))
1468 | (attacks_bb<BISHOP>(m2to, occ) & pos.pieces(color_of(pc), QUEEN, BISHOP));
1470 // Verify attackers are triggered by our move and not already existing
1471 if (unlikely(xray) && (xray & ~pos.attacks_from<QUEEN>(m2to)))
1475 // Don't prune safe moves which block the threat path
1476 if ((between_bb(m2from, m2to) & m1to) && pos.see_sign(first) >= 0)
1483 // When playing with strength handicap choose best move among the MultiPV set
1484 // using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1486 Move Skill::pick_move() {
1490 // PRNG sequence should be not deterministic
1491 for (int i = Time::now() % 50; i > 0; i--)
1492 rk.rand<unsigned>();
1494 // RootMoves are already sorted by score in descending order
1495 int variance = std::min(RootMoves[0].score - RootMoves[PVSize - 1].score, PawnValueMg);
1496 int weakness = 120 - 2 * level;
1497 int max_s = -VALUE_INFINITE;
1500 // Choose best move. For each move score we add two terms both dependent on
1501 // weakness, one deterministic and bigger for weaker moves, and one random,
1502 // then we choose the move with the resulting highest score.
1503 for (size_t i = 0; i < PVSize; i++)
1505 int s = RootMoves[i].score;
1507 // Don't allow crazy blunders even at very low skills
1508 if (i > 0 && RootMoves[i-1].score > s + 2 * PawnValueMg)
1511 // This is our magic formula
1512 s += ( weakness * int(RootMoves[0].score - s)
1513 + variance * (rk.rand<unsigned>() % weakness)) / 128;
1518 best = RootMoves[i].pv[0];
1525 // uci_pv() formats PV information according to UCI protocol. UCI requires
1526 // to send all the PV lines also if are still to be searched and so refer to
1527 // the previous search score.
1529 string uci_pv(const Position& pos, int depth, Value alpha, Value beta) {
1531 std::stringstream s;
1532 Time::point elapsed = Time::now() - SearchTime + 1;
1533 size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
1536 for (size_t i = 0; i < Threads.size(); i++)
1537 if (Threads[i]->maxPly > selDepth)
1538 selDepth = Threads[i]->maxPly;
1540 for (size_t i = 0; i < uciPVSize; i++)
1542 bool updated = (i <= PVIdx);
1544 if (depth == 1 && !updated)
1547 int d = updated ? depth : depth - 1;
1548 Value v = updated ? RootMoves[i].score : RootMoves[i].prevScore;
1550 if (s.rdbuf()->in_avail()) // Not at first line
1553 s << "info depth " << d
1554 << " seldepth " << selDepth
1555 << " score " << (i == PVIdx ? score_to_uci(v, alpha, beta) : score_to_uci(v))
1556 << " nodes " << pos.nodes_searched()
1557 << " nps " << pos.nodes_searched() * 1000 / elapsed
1558 << " time " << elapsed
1559 << " multipv " << i + 1
1562 for (size_t j = 0; RootMoves[i].pv[j] != MOVE_NONE; j++)
1563 s << " " << move_to_uci(RootMoves[i].pv[j], pos.is_chess960());
1572 /// RootMove::extract_pv_from_tt() builds a PV by adding moves from the TT table.
1573 /// We consider also failing high nodes and not only BOUND_EXACT nodes so to
1574 /// allow to always have a ponder move even when we fail high at root, and a
1575 /// long PV to print that is important for position analysis.
1577 void RootMove::extract_pv_from_tt(Position& pos) {
1579 StateInfo state[MAX_PLY_PLUS_6], *st = state;
1589 assert(MoveList<LEGAL>(pos).contains(pv[ply]));
1591 pos.do_move(pv[ply++], *st++);
1592 tte = TT.probe(pos.key());
1595 && pos.is_pseudo_legal(m = tte->move()) // Local copy, TT could change
1596 && pos.pl_move_is_legal(m, pos.pinned_pieces())
1598 && (!pos.is_draw() || ply < 2));
1600 pv.push_back(MOVE_NONE); // Must be zero-terminating
1602 while (ply) pos.undo_move(pv[--ply]);
1606 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1607 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1608 /// first, even if the old TT entries have been overwritten.
1610 void RootMove::insert_pv_in_tt(Position& pos) {
1612 StateInfo state[MAX_PLY_PLUS_6], *st = state;
1617 tte = TT.probe(pos.key());
1619 if (!tte || tte->move() != pv[ply]) // Don't overwrite correct entries
1620 TT.store(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[ply], VALUE_NONE, VALUE_NONE);
1622 assert(MoveList<LEGAL>(pos).contains(pv[ply]));
1624 pos.do_move(pv[ply++], *st++);
1626 } while (pv[ply] != MOVE_NONE);
1628 while (ply) pos.undo_move(pv[--ply]);
1632 /// Thread::idle_loop() is where the thread is parked when it has no work to do
1634 void Thread::idle_loop() {
1636 // Pointer 'this_sp' is not null only if we are called from split(), and not
1637 // at the thread creation. So it means we are the split point's master.
1638 SplitPoint* this_sp = splitPointsSize ? activeSplitPoint : NULL;
1640 assert(!this_sp || (this_sp->masterThread == this && searching));
1644 // If we are not searching, wait for a condition to be signaled instead of
1645 // wasting CPU time polling for work.
1646 while ((!searching && Threads.sleepWhileIdle) || exit)
1654 // Grab the lock to avoid races with Thread::notify_one()
1657 // If we are master and all slaves have finished then exit idle_loop
1658 if (this_sp && !this_sp->slavesMask)
1664 // Do sleep after retesting sleep conditions under lock protection, in
1665 // particular we need to avoid a deadlock in case a master thread has,
1666 // in the meanwhile, allocated us and sent the notify_one() call before
1667 // we had the chance to grab the lock.
1668 if (!searching && !exit)
1669 sleepCondition.wait(mutex);
1674 // If this thread has been assigned work, launch a search
1679 Threads.mutex.lock();
1682 assert(activeSplitPoint);
1683 SplitPoint* sp = activeSplitPoint;
1685 Threads.mutex.unlock();
1687 Stack stack[MAX_PLY_PLUS_6], *ss = stack+2; // To allow referencing (ss-2)
1688 Position pos(*sp->pos, this);
1690 std::memcpy(ss-2, sp->ss-2, 5 * sizeof(Stack));
1691 ss->splitPoint = sp;
1695 assert(activePosition == NULL);
1697 activePosition = &pos;
1699 switch (sp->nodeType) {
1701 search<SplitPointRoot>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1704 search<SplitPointPV>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1707 search<SplitPointNonPV>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1716 activePosition = NULL;
1717 sp->slavesMask &= ~(1ULL << idx);
1718 sp->nodes += pos.nodes_searched();
1720 // Wake up master thread so to allow it to return from the idle loop
1721 // in case we are the last slave of the split point.
1722 if ( Threads.sleepWhileIdle
1723 && this != sp->masterThread
1726 assert(!sp->masterThread->searching);
1727 sp->masterThread->notify_one();
1730 // After releasing the lock we cannot access anymore any SplitPoint
1731 // related data in a safe way becuase it could have been released under
1732 // our feet by the sp master. Also accessing other Thread objects is
1733 // unsafe because if we are exiting there is a chance are already freed.
1737 // If this thread is the master of a split point and all slaves have finished
1738 // their work at this split point, return from the idle loop.
1739 if (this_sp && !this_sp->slavesMask)
1741 this_sp->mutex.lock();
1742 bool finished = !this_sp->slavesMask; // Retest under lock protection
1743 this_sp->mutex.unlock();
1751 /// check_time() is called by the timer thread when the timer triggers. It is
1752 /// used to print debug info and, more important, to detect when we are out of
1753 /// available time and so stop the search.
1757 static Time::point lastInfoTime = Time::now();
1758 int64_t nodes = 0; // Workaround silly 'uninitialized' gcc warning
1760 if (Time::now() - lastInfoTime >= 1000)
1762 lastInfoTime = Time::now();
1771 Threads.mutex.lock();
1773 nodes = RootPos.nodes_searched();
1775 // Loop across all split points and sum accumulated SplitPoint nodes plus
1776 // all the currently active positions nodes.
1777 for (size_t i = 0; i < Threads.size(); i++)
1778 for (int j = 0; j < Threads[i]->splitPointsSize; j++)
1780 SplitPoint& sp = Threads[i]->splitPoints[j];
1785 Bitboard sm = sp.slavesMask;
1788 Position* pos = Threads[pop_lsb(&sm)]->activePosition;
1790 nodes += pos->nodes_searched();
1796 Threads.mutex.unlock();
1799 Time::point elapsed = Time::now() - SearchTime;
1800 bool stillAtFirstMove = Signals.firstRootMove
1801 && !Signals.failedLowAtRoot
1802 && elapsed > TimeMgr.available_time();
1804 bool noMoreTime = elapsed > TimeMgr.maximum_time() - 2 * TimerResolution
1805 || stillAtFirstMove;
1807 if ( (Limits.use_time_management() && noMoreTime)
1808 || (Limits.movetime && elapsed >= Limits.movetime)
1809 || (Limits.nodes && nodes >= Limits.nodes))
1810 Signals.stop = true;