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-2014 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 "syzygy/tbprobe.h"
40 volatile SignalsType Signals;
42 std::vector<RootMove> RootMoves;
44 Time::point SearchTime;
45 StateStackPtr SetupStates;
56 using namespace Search;
60 // Different node types, used as template parameter
61 enum NodeType { Root, PV, NonPV };
63 // Dynamic razoring margin based on depth
64 inline Value razor_margin(Depth d) { return Value(512 + 32 * d); }
66 // Futility lookup tables (initialized at startup) and their access functions
67 int FutilityMoveCounts[2][16]; // [improving][depth]
69 inline Value futility_margin(Depth d) {
70 return Value(200 * d);
73 // Reduction lookup tables (initialized at startup) and their access function
74 int8_t Reductions[2][2][64][64]; // [pv][improving][depth][moveNumber]
76 template <bool PvNode> inline Depth reduction(bool i, Depth d, int mn) {
77 return (Depth) Reductions[PvNode][i][std::min(int(d), 63)][std::min(mn, 63)];
82 double BestMoveChanges;
83 Value DrawValue[COLOR_NB];
86 MovesStats Countermoves, Followupmoves;
88 template <NodeType NT, bool SpNode>
89 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
91 template <NodeType NT, bool InCheck>
92 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
94 void id_loop(Position& pos);
95 Value value_to_tt(Value v, int ply);
96 Value value_from_tt(Value v, int ply);
97 void update_pv(Move* pv, Move move, Move* childPv);
98 void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt);
99 string uci_pv(const Position& pos, Depth depth, Value alpha, Value beta);
102 Skill(int l, size_t rootSize) : level(l),
103 candidates(l < 20 ? std::min(4, (int)rootSize) : 0),
106 if (candidates) // Swap best PV line with the sub-optimal one
107 std::swap(RootMoves[0], *std::find(RootMoves.begin(),
108 RootMoves.end(), best ? best : pick_move()));
111 size_t candidates_size() const { return candidates; }
112 bool time_to_pick(Depth depth) const { return depth / ONE_PLY == 1 + level; }
123 /// Search::init() is called during startup to initialize various lookup tables
125 void Search::init() {
127 // Init reductions array
128 for (int d = 1; d < 64; ++d)
129 for (int mc = 1; mc < 64; ++mc)
131 double pvRed = 0.00 + log(double(d)) * log(double(mc)) / 3.00;
132 double nonPVRed = 0.33 + log(double(d)) * log(double(mc)) / 2.25;
134 Reductions[1][1][d][mc] = int8_t( pvRed >= 1.0 ? pvRed + 0.5: 0);
135 Reductions[0][1][d][mc] = int8_t(nonPVRed >= 1.0 ? nonPVRed + 0.5: 0);
137 Reductions[1][0][d][mc] = Reductions[1][1][d][mc];
138 Reductions[0][0][d][mc] = Reductions[0][1][d][mc];
140 // Increase reduction when eval is not improving
141 if (Reductions[0][0][d][mc] >= 2)
142 Reductions[0][0][d][mc] += 1;
145 // Init futility move count array
146 for (int d = 0; d < 16; ++d)
148 FutilityMoveCounts[0][d] = int(2.4 + 0.773 * pow(d + 0.00, 1.8));
149 FutilityMoveCounts[1][d] = int(2.9 + 1.045 * pow(d + 0.49, 1.8));
154 /// Search::perft() is our utility to verify move generation. All the leaf nodes
155 /// up to the given depth are generated and counted and the sum returned.
157 uint64_t Search::perft(Position& pos, Depth depth) {
160 uint64_t cnt, nodes = 0;
162 const bool leaf = (depth == 2 * ONE_PLY);
164 for (MoveList<LEGAL> it(pos); *it; ++it)
166 if (Root && depth <= ONE_PLY)
170 pos.do_move(*it, st, ci, pos.gives_check(*it, ci));
171 cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - ONE_PLY);
176 sync_cout << UCI::format_move(*it, pos.is_chess960()) << ": " << cnt << sync_endl;
181 template uint64_t Search::perft<true>(Position& pos, Depth depth);
184 /// Search::think() is the external interface to Stockfish's search, and is
185 /// called by the main thread when the program receives the UCI 'go' command. It
186 /// searches from RootPos and at the end prints the "bestmove" to output.
188 void Search::think() {
190 TimeMgr.init(Limits, RootPos.game_ply(), RootPos.side_to_move());
191 TBHits = TBCardinality = 0;
194 int cf = Options["Contempt"] * PawnValueEg / 100; // From centipawns
195 DrawValue[ RootPos.side_to_move()] = VALUE_DRAW - Value(cf);
196 DrawValue[~RootPos.side_to_move()] = VALUE_DRAW + Value(cf);
198 if (RootMoves.empty())
200 RootMoves.push_back(MOVE_NONE);
201 sync_cout << "info depth 0 score "
202 << UCI::format_value(RootPos.checkers() ? -VALUE_MATE : VALUE_DRAW)
207 // Check Tablebases at root
208 int piecesCnt = RootPos.count<ALL_PIECES>(WHITE) + RootPos.count<ALL_PIECES>(BLACK);
209 TBCardinality = Options["SyzygyProbeLimit"];
210 TBProbeDepth = Options["SyzygyProbeDepth"] * ONE_PLY;
211 if (TBCardinality > Tablebases::TBLargest)
213 TBCardinality = Tablebases::TBLargest;
214 TBProbeDepth = 0 * ONE_PLY;
216 TB50MoveRule = Options["Syzygy50MoveRule"];
218 if (piecesCnt <= TBCardinality)
220 TBHits = RootMoves.size();
222 // If the current root position is in the tablebases then RootMoves
223 // contains only moves that preserve the draw or win.
224 RootInTB = Tablebases::root_probe(RootPos, TBScore);
228 TBCardinality = 0; // Do not probe tablebases during the search
230 // It might be a good idea to mangle the hash key (xor it
231 // with a fixed value) in order to "clear" the hash table of
232 // the results of previous probes. However, that would have to
233 // be done from within the Position class, so we skip it for now.
235 // Optional: decrease target time.
237 else // If DTZ tables are missing, use WDL tables as a fallback
239 // Filter out moves that do not preserve a draw or win
240 RootInTB = Tablebases::root_probe_wdl(RootPos, TBScore);
242 // Only probe during search if winning
243 if (TBScore <= VALUE_DRAW)
251 else if (!TB50MoveRule)
253 TBScore = TBScore > VALUE_DRAW ? VALUE_MATE - MAX_PLY - 1
254 : TBScore < VALUE_DRAW ? -VALUE_MATE + MAX_PLY + 1
259 for (size_t i = 0; i < Threads.size(); ++i)
260 Threads[i]->maxPly = 0;
262 Threads.timer->run = true;
263 Threads.timer->notify_one(); // Wake up the recurring timer
265 id_loop(RootPos); // Let's start searching !
267 Threads.timer->run = false;
270 // When we reach the maximum depth, we can arrive here without a raise of
271 // Signals.stop. However, if we are pondering or in an infinite search,
272 // the UCI protocol states that we shouldn't print the best move before the
273 // GUI sends a "stop" or "ponderhit" command. We therefore simply wait here
274 // until the GUI sends one of those commands (which also raises Signals.stop).
275 if (!Signals.stop && (Limits.ponder || Limits.infinite))
277 Signals.stopOnPonderhit = true;
278 RootPos.this_thread()->wait_for(Signals.stop);
281 sync_cout << "bestmove " << UCI::format_move(RootMoves[0].pv[0], RootPos.is_chess960());
283 if (RootMoves[0].pv.size() > 1)
284 std::cout << " ponder " << UCI::format_move(RootMoves[0].pv[1], RootPos.is_chess960());
286 std::cout << sync_endl;
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 stack[MAX_PLY+4], *ss = stack+2; // To allow referencing (ss-2) and (ss+2)
300 Value bestValue, alpha, beta, delta;
302 std::memset(ss-2, 0, 5 * sizeof(Stack));
306 bestValue = delta = alpha = -VALUE_INFINITE;
307 beta = VALUE_INFINITE;
312 Countermoves.clear();
313 Followupmoves.clear();
315 size_t multiPV = Options["MultiPV"];
316 Skill skill(Options["Skill Level"], RootMoves.size());
318 // Do we have to play with skill handicap? In this case enable MultiPV search
319 // that we will use behind the scenes to retrieve a set of possible moves.
320 multiPV = std::max(multiPV, skill.candidates_size());
322 // Iterative deepening loop until requested to stop or target depth reached
323 while (++depth < DEPTH_MAX && !Signals.stop && (!Limits.depth || depth <= Limits.depth))
325 // Age out PV variability metric
326 BestMoveChanges *= 0.5;
328 // Save the last iteration's scores before first PV line is searched and
329 // all the move scores except the (new) PV are set to -VALUE_INFINITE.
330 for (size_t i = 0; i < RootMoves.size(); ++i)
331 RootMoves[i].prevScore = RootMoves[i].score;
333 // MultiPV loop. We perform a full root search for each PV line
334 for (PVIdx = 0; PVIdx < std::min(multiPV, RootMoves.size()) && !Signals.stop; ++PVIdx)
336 // Reset aspiration window starting size
337 if (depth >= 5 * ONE_PLY)
340 alpha = std::max(RootMoves[PVIdx].prevScore - delta,-VALUE_INFINITE);
341 beta = std::min(RootMoves[PVIdx].prevScore + delta, VALUE_INFINITE);
344 // Start with a small aspiration window and, in the case of a fail
345 // high/low, re-search with a bigger window until we're not failing
349 bestValue = search<Root, false>(pos, ss, alpha, beta, depth, false);
351 // Bring the best move to the front. It is critical that sorting
352 // is done with a stable algorithm because all the values but the
353 // first and eventually the new best one are set to -VALUE_INFINITE
354 // and we want to keep the same order for all the moves except the
355 // new PV that goes to the front. Note that in case of MultiPV
356 // search the already searched PV lines are preserved.
357 std::stable_sort(RootMoves.begin() + PVIdx, RootMoves.end());
359 // Write PV back to transposition table in case the relevant
360 // entries have been overwritten during the search.
361 for (size_t i = 0; i <= PVIdx; ++i)
362 RootMoves[i].insert_pv_in_tt(pos);
364 // If search has been stopped break immediately. Sorting and
365 // writing PV back to TT is safe because RootMoves is still
366 // valid, although it refers to previous iteration.
370 // When failing high/low give some update (without cluttering
371 // the UI) before a re-search.
372 if ( (bestValue <= alpha || bestValue >= beta)
373 && Time::now() - SearchTime > 3000)
374 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
376 // In case of failing low/high increase aspiration window and
377 // re-search, otherwise exit the loop.
378 if (bestValue <= alpha)
380 beta = (alpha + beta) / 2;
381 alpha = std::max(bestValue - delta, -VALUE_INFINITE);
383 Signals.failedLowAtRoot = true;
384 Signals.stopOnPonderhit = false;
386 else if (bestValue >= beta)
388 alpha = (alpha + beta) / 2;
389 beta = std::min(bestValue + delta, VALUE_INFINITE);
396 assert(alpha >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
399 // Sort the PV lines searched so far and update the GUI
400 std::stable_sort(RootMoves.begin(), RootMoves.begin() + PVIdx + 1);
403 sync_cout << "info nodes " << RootPos.nodes_searched()
404 << " time " << Time::now() - SearchTime << sync_endl;
406 else if ( PVIdx + 1 == std::min(multiPV, RootMoves.size())
407 || Time::now() - SearchTime > 3000)
408 sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
411 // If skill levels are enabled and time is up, pick a sub-optimal best move
412 if (skill.candidates_size() && skill.time_to_pick(depth))
415 // Have we found a "mate in x"?
417 && bestValue >= VALUE_MATE_IN_MAX_PLY
418 && VALUE_MATE - bestValue <= 2 * Limits.mate)
421 // Do we have time for the next iteration? Can we stop searching now?
422 if (Limits.use_time_management() && !Signals.stop && !Signals.stopOnPonderhit)
424 // Take some extra time if the best move has changed
425 if (depth > 4 * ONE_PLY && multiPV == 1)
426 TimeMgr.pv_instability(BestMoveChanges);
428 // Stop the search if only one legal move is available or all
429 // of the available time has been used.
430 if ( RootMoves.size() == 1
431 || Time::now() - SearchTime > TimeMgr.available_time())
433 // If we are allowed to ponder do not stop the search now but
434 // keep pondering until the GUI sends "ponderhit" or "stop".
436 Signals.stopOnPonderhit = true;
445 // search<>() is the main search function for both PV and non-PV nodes and for
446 // normal and SplitPoint nodes. When called just after a split point the search
447 // is simpler because we have already probed the hash table, done a null move
448 // search, and searched the first move before splitting, so we don't have to
449 // repeat all this work again. We also don't need to store anything to the hash
450 // table here: This is taken care of after we return from the split point.
452 template <NodeType NT, bool SpNode>
453 Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode) {
455 const bool RootNode = NT == Root;
456 const bool PvNode = NT == PV || NT == Root;
458 assert(-VALUE_INFINITE <= alpha && alpha < beta && beta <= VALUE_INFINITE);
459 assert(PvNode || (alpha == beta - 1));
460 assert(depth > DEPTH_ZERO);
462 Move pv[MAX_PLY+1], quietsSearched[64];
465 SplitPoint* splitPoint;
467 Move ttMove, move, excludedMove, bestMove;
468 Depth ext, newDepth, predictedDepth;
469 Value bestValue, value, ttValue, eval, nullValue, futilityValue;
470 bool inCheck, givesCheck, singularExtensionNode, improving;
471 bool captureOrPromotion, dangerous, doFullDepthSearch;
472 int moveCount, quietCount;
475 // Step 1. Initialize node
476 Thread* thisThread = pos.this_thread();
477 inCheck = pos.checkers();
481 splitPoint = ss->splitPoint;
482 bestMove = splitPoint->bestMove;
483 bestValue = splitPoint->bestValue;
485 ttMove = excludedMove = MOVE_NONE;
486 ttValue = VALUE_NONE;
488 assert(splitPoint->bestValue > -VALUE_INFINITE && splitPoint->moveCount > 0);
493 moveCount = quietCount = 0;
494 bestValue = -VALUE_INFINITE;
495 ss->ply = (ss-1)->ply + 1;
497 // Used to send selDepth info to GUI
498 if (PvNode && thisThread->maxPly < ss->ply)
499 thisThread->maxPly = ss->ply;
503 // Step 2. Check for aborted search and immediate draw
504 if (Signals.stop || pos.is_draw() || ss->ply >= MAX_PLY)
505 return ss->ply >= MAX_PLY && !inCheck ? evaluate(pos) : DrawValue[pos.side_to_move()];
507 // Step 3. Mate distance pruning. Even if we mate at the next move our score
508 // would be at best mate_in(ss->ply+1), but if alpha is already bigger because
509 // a shorter mate was found upward in the tree then there is no need to search
510 // because we will never beat the current alpha. Same logic but with reversed
511 // signs applies also in the opposite condition of being mated instead of giving
512 // mate. In this case return a fail-high score.
513 alpha = std::max(mated_in(ss->ply), alpha);
514 beta = std::min(mate_in(ss->ply+1), beta);
519 assert(0 <= ss->ply && ss->ply < MAX_PLY);
521 ss->currentMove = ss->ttMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
522 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
523 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
525 // Step 4. Transposition table lookup
526 // We don't want the score of a partial search to overwrite a previous full search
527 // TT value, so we use a different position key in case of an excluded move.
528 excludedMove = ss->excludedMove;
529 posKey = excludedMove ? pos.exclusion_key() : pos.key();
530 tte = TT.probe(posKey);
531 ss->ttMove = ttMove = RootNode ? RootMoves[PVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
532 ttValue = tte ? value_from_tt(tte->value(), ss->ply) : VALUE_NONE;
534 // At non-PV nodes we check for a fail high/low. We don't probe at PV nodes
537 && tte->depth() >= depth
538 && ttValue != VALUE_NONE // Only in case of TT access race
539 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
540 : (tte->bound() & BOUND_UPPER)))
542 ss->currentMove = ttMove; // Can be MOVE_NONE
544 // If ttMove is quiet, update killers, history, counter move and followup move on TT hit
545 if (ttValue >= beta && ttMove && !pos.capture_or_promotion(ttMove) && !inCheck)
546 update_stats(pos, ss, ttMove, depth, NULL, 0);
551 // Step 4a. Tablebase probe
552 piecesCnt = pos.count<ALL_PIECES>(WHITE) + pos.count<ALL_PIECES>(BLACK);
555 && piecesCnt <= TBCardinality
556 && (piecesCnt < TBCardinality || depth >= TBProbeDepth)
557 && pos.rule50_count() == 0)
559 int found, v = Tablebases::probe_wdl(pos, &found);
566 value = v < -1 ? -VALUE_MATE + MAX_PLY + ss->ply
567 : v > 1 ? VALUE_MATE - MAX_PLY - ss->ply
568 : VALUE_DRAW + 2 * v;
572 value = v < 0 ? -VALUE_MATE + MAX_PLY + ss->ply
573 : v > 0 ? VALUE_MATE - MAX_PLY - ss->ply
577 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_EXACT,
578 std::min(DEPTH_MAX - ONE_PLY, depth + 6 * ONE_PLY), MOVE_NONE, VALUE_NONE);
584 // Step 5. Evaluate the position statically and update parent's gain statistics
587 ss->staticEval = eval = VALUE_NONE;
593 // Never assume anything on values stored in TT
594 if ((ss->staticEval = eval = tte->eval_value()) == VALUE_NONE)
595 eval = ss->staticEval = evaluate(pos);
597 // Can ttValue be used as a better position evaluation?
598 if (ttValue != VALUE_NONE)
599 if (tte->bound() & (ttValue > eval ? BOUND_LOWER : BOUND_UPPER))
604 eval = ss->staticEval =
605 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos) : -(ss-1)->staticEval + 2 * Eval::Tempo;
607 TT.store(posKey, VALUE_NONE, BOUND_NONE, DEPTH_NONE, MOVE_NONE, ss->staticEval);
610 if ( !pos.captured_piece_type()
611 && ss->staticEval != VALUE_NONE
612 && (ss-1)->staticEval != VALUE_NONE
613 && (move = (ss-1)->currentMove) != MOVE_NULL
615 && type_of(move) == NORMAL)
617 Square to = to_sq(move);
618 Gains.update(pos.piece_on(to), to, -(ss-1)->staticEval - ss->staticEval);
621 // Step 6. Razoring (skipped when in check)
623 && depth < 4 * ONE_PLY
624 && eval + razor_margin(depth) <= alpha
625 && ttMove == MOVE_NONE
626 && !pos.pawn_on_7th(pos.side_to_move()))
628 if ( depth <= ONE_PLY
629 && eval + razor_margin(3 * ONE_PLY) <= alpha)
630 return qsearch<NonPV, false>(pos, ss, alpha, beta, DEPTH_ZERO);
632 Value ralpha = alpha - razor_margin(depth);
633 Value v = qsearch<NonPV, false>(pos, ss, ralpha, ralpha+1, DEPTH_ZERO);
638 // Step 7. Futility pruning: child node (skipped when in check)
641 && depth < 7 * ONE_PLY
642 && eval - futility_margin(depth) >= beta
643 && eval < VALUE_KNOWN_WIN // Do not return unproven wins
644 && pos.non_pawn_material(pos.side_to_move()))
645 return eval - futility_margin(depth);
647 // Step 8. Null move search with verification search (is omitted in PV nodes)
650 && depth >= 2 * ONE_PLY
652 && pos.non_pawn_material(pos.side_to_move()))
654 ss->currentMove = MOVE_NULL;
656 assert(eval - beta >= 0);
658 // Null move dynamic reduction based on depth and value
659 Depth R = (3 + depth / 4 + std::min((eval - beta) / PawnValueMg, 3)) * ONE_PLY;
661 pos.do_null_move(st);
662 (ss+1)->skipNullMove = true;
663 nullValue = depth-R < ONE_PLY ? -qsearch<NonPV, false>(pos, ss+1, -beta, -beta+1, DEPTH_ZERO)
664 : - search<NonPV, false>(pos, ss+1, -beta, -beta+1, depth-R, !cutNode);
665 (ss+1)->skipNullMove = false;
666 pos.undo_null_move();
668 if (nullValue >= beta)
670 // Do not return unproven mate scores
671 if (nullValue >= VALUE_MATE_IN_MAX_PLY)
674 if (depth < 12 * ONE_PLY && abs(beta) < VALUE_KNOWN_WIN)
677 // Do verification search at high depths
678 ss->skipNullMove = true;
679 Value v = depth-R < ONE_PLY ? qsearch<NonPV, false>(pos, ss, beta-1, beta, DEPTH_ZERO)
680 : search<NonPV, false>(pos, ss, beta-1, beta, depth-R, false);
681 ss->skipNullMove = false;
688 // Step 9. ProbCut (skipped when in check)
689 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
690 // and a reduced search returns a value much above beta, we can (almost) safely
691 // prune the previous move.
693 && depth >= 5 * ONE_PLY
695 && abs(beta) < VALUE_MATE_IN_MAX_PLY)
697 Value rbeta = std::min(beta + 200, VALUE_INFINITE);
698 Depth rdepth = depth - 4 * ONE_PLY;
700 assert(rdepth >= ONE_PLY);
701 assert((ss-1)->currentMove != MOVE_NONE);
702 assert((ss-1)->currentMove != MOVE_NULL);
704 MovePicker mp(pos, ttMove, History, pos.captured_piece_type());
707 while ((move = mp.next_move<false>()) != MOVE_NONE)
708 if (pos.legal(move, ci.pinned))
710 ss->currentMove = move;
711 pos.do_move(move, st, ci, pos.gives_check(move, ci));
712 value = -search<NonPV, false>(pos, ss+1, -rbeta, -rbeta+1, rdepth, !cutNode);
719 // Step 10. Internal iterative deepening (skipped when in check)
720 if ( depth >= (PvNode ? 5 * ONE_PLY : 8 * ONE_PLY)
722 && (PvNode || ss->staticEval + 256 >= beta))
724 Depth d = 2 * (depth - 2 * ONE_PLY) - (PvNode ? DEPTH_ZERO : depth / 2);
725 ss->skipNullMove = true;
726 search<PvNode ? PV : NonPV, false>(pos, ss, alpha, beta, d / 2, true);
727 ss->skipNullMove = false;
729 tte = TT.probe(posKey);
730 ttMove = tte ? tte->move() : MOVE_NONE;
733 moves_loop: // When in check and at SpNode search starts from here
735 Square prevMoveSq = to_sq((ss-1)->currentMove);
736 Move countermoves[] = { Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].first,
737 Countermoves[pos.piece_on(prevMoveSq)][prevMoveSq].second };
739 Square prevOwnMoveSq = to_sq((ss-2)->currentMove);
740 Move followupmoves[] = { Followupmoves[pos.piece_on(prevOwnMoveSq)][prevOwnMoveSq].first,
741 Followupmoves[pos.piece_on(prevOwnMoveSq)][prevOwnMoveSq].second };
743 MovePicker mp(pos, ttMove, depth, History, countermoves, followupmoves, ss);
745 value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
746 improving = ss->staticEval >= (ss-2)->staticEval
747 || ss->staticEval == VALUE_NONE
748 ||(ss-2)->staticEval == VALUE_NONE;
750 singularExtensionNode = !RootNode
752 && depth >= 8 * ONE_PLY
753 && ttMove != MOVE_NONE
754 /* && ttValue != VALUE_NONE Already implicit in the next condition */
755 && abs(ttValue) < VALUE_KNOWN_WIN
756 && !excludedMove // Recursive singular search is not allowed
757 && (tte->bound() & BOUND_LOWER)
758 && tte->depth() >= depth - 3 * ONE_PLY;
760 // Step 11. Loop through moves
761 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
762 while ((move = mp.next_move<SpNode>()) != MOVE_NONE)
766 if (move == excludedMove)
769 // At root obey the "searchmoves" option and skip moves not listed in Root
770 // Move List. As a consequence any illegal move is also skipped. In MultiPV
771 // mode we also skip PV moves which have been already searched.
772 if (RootNode && !std::count(RootMoves.begin() + PVIdx, RootMoves.end(), move))
777 // Shared counter cannot be decremented later if the move turns out to be illegal
778 if (!pos.legal(move, ci.pinned))
781 moveCount = ++splitPoint->moveCount;
782 splitPoint->mutex.unlock();
789 Signals.firstRootMove = (moveCount == 1);
791 if (thisThread == Threads.main() && Time::now() - SearchTime > 3000)
792 sync_cout << "info depth " << depth / ONE_PLY
793 << " currmove " << UCI::format_move(move, pos.is_chess960())
794 << " currmovenumber " << moveCount + PVIdx << sync_endl;
801 captureOrPromotion = pos.capture_or_promotion(move);
803 givesCheck = type_of(move) == NORMAL && !ci.dcCandidates
804 ? ci.checkSq[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
805 : pos.gives_check(move, ci);
807 dangerous = givesCheck
808 || type_of(move) != NORMAL
809 || pos.advanced_pawn_push(move);
811 // Step 12. Extend checks
812 if (givesCheck && pos.see_sign(move) >= VALUE_ZERO)
815 // Singular extension search. If all moves but one fail low on a search of
816 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
817 // is singular and should be extended. To verify this we do a reduced search
818 // on all the other moves but the ttMove and if the result is lower than
819 // ttValue minus a margin then we extend the ttMove.
820 if ( singularExtensionNode
823 && pos.legal(move, ci.pinned))
825 Value rBeta = ttValue - 2 * depth / ONE_PLY;
826 ss->excludedMove = move;
827 ss->skipNullMove = true;
828 value = search<NonPV, false>(pos, ss, rBeta - 1, rBeta, depth / 2, cutNode);
829 ss->skipNullMove = false;
830 ss->excludedMove = MOVE_NONE;
836 // Update the current move (this must be done after singular extension search)
837 newDepth = depth - ONE_PLY + ext;
839 // Step 13. Pruning at shallow depth (exclude PV nodes)
841 && !captureOrPromotion
844 && bestValue > VALUE_MATED_IN_MAX_PLY)
846 // Move count based pruning
847 if ( depth < 16 * ONE_PLY
848 && moveCount >= FutilityMoveCounts[improving][depth])
851 splitPoint->mutex.lock();
856 predictedDepth = newDepth - reduction<PvNode>(improving, depth, moveCount);
858 // Futility pruning: parent node
859 if (predictedDepth < 7 * ONE_PLY)
861 futilityValue = ss->staticEval + futility_margin(predictedDepth)
862 + 128 + Gains[pos.moved_piece(move)][to_sq(move)];
864 if (futilityValue <= alpha)
866 bestValue = std::max(bestValue, futilityValue);
870 splitPoint->mutex.lock();
871 if (bestValue > splitPoint->bestValue)
872 splitPoint->bestValue = bestValue;
878 // Prune moves with negative SEE at low depths
879 if (predictedDepth < 4 * ONE_PLY && pos.see_sign(move) < VALUE_ZERO)
882 splitPoint->mutex.lock();
888 // Speculative prefetch as early as possible
889 prefetch((char*)TT.first_entry(pos.key_after(move)));
891 // Check for legality just before making the move
892 if (!RootNode && !SpNode && !pos.legal(move, ci.pinned))
898 ss->currentMove = move;
899 if (!SpNode && !captureOrPromotion && quietCount < 64)
900 quietsSearched[quietCount++] = move;
902 // Step 14. Make the move
903 pos.do_move(move, st, ci, givesCheck);
905 // Step 15. Reduced depth search (LMR). If the move fails high it will be
906 // re-searched at full depth.
907 if ( depth >= 3 * ONE_PLY
909 && !captureOrPromotion
910 && move != ss->killers[0]
911 && move != ss->killers[1])
913 ss->reduction = reduction<PvNode>(improving, depth, moveCount);
915 if ( (!PvNode && cutNode)
916 || History[pos.piece_on(to_sq(move))][to_sq(move)] < 0)
917 ss->reduction += ONE_PLY;
919 if (move == countermoves[0] || move == countermoves[1])
920 ss->reduction = std::max(DEPTH_ZERO, ss->reduction - ONE_PLY);
922 // Decrease reduction for moves that escape a capture
924 && type_of(move) == NORMAL
925 && type_of(pos.piece_on(to_sq(move))) != PAWN
926 && pos.see(make_move(to_sq(move), from_sq(move))) < 0)
927 ss->reduction = std::max(DEPTH_ZERO, ss->reduction - ONE_PLY);
929 Depth d = std::max(newDepth - ss->reduction, ONE_PLY);
931 alpha = splitPoint->alpha;
933 value = -search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, d, true);
935 // Re-search at intermediate depth if reduction is very high
936 if (value > alpha && ss->reduction >= 4 * ONE_PLY)
938 Depth d2 = std::max(newDepth - 2 * ONE_PLY, ONE_PLY);
939 value = -search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, d2, true);
942 doFullDepthSearch = (value > alpha && ss->reduction != DEPTH_ZERO);
943 ss->reduction = DEPTH_ZERO;
946 doFullDepthSearch = !PvNode || moveCount > 1;
948 // Step 16. Full depth search, when LMR is skipped or fails high
949 if (doFullDepthSearch)
952 alpha = splitPoint->alpha;
954 value = newDepth < ONE_PLY ?
955 givesCheck ? -qsearch<NonPV, true>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
956 : -qsearch<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
957 : - search<NonPV, false>(pos, ss+1, -(alpha+1), -alpha, newDepth, !cutNode);
960 // For PV nodes only, do a full PV search on the first move or after a fail
961 // high (in the latter case search only if value < beta), otherwise let the
962 // parent node fail low with value <= alpha and to try another move.
963 if (PvNode && (moveCount == 1 || (value > alpha && (RootNode || value < beta))))
966 (ss+1)->pv[0] = MOVE_NONE;
968 value = newDepth < ONE_PLY ?
969 givesCheck ? -qsearch<PV, true>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
970 : -qsearch<PV, false>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
971 : - search<PV, false>(pos, ss+1, -beta, -alpha, newDepth, false);
974 // Step 17. Undo move
977 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
979 // Step 18. Check for new best move
982 splitPoint->mutex.lock();
983 bestValue = splitPoint->bestValue;
984 alpha = splitPoint->alpha;
987 // Finished searching the move. If a stop or a cutoff occurred, the return
988 // value of the search cannot be trusted, and we return immediately without
989 // updating best move, PV and TT.
990 if (Signals.stop || thisThread->cutoff_occurred())
995 RootMove& rm = *std::find(RootMoves.begin(), RootMoves.end(), move);
997 // PV move or new best move ?
998 if (moveCount == 1 || value > alpha)
1005 for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
1006 rm.pv.push_back(*m);
1008 // We record how often the best move has been changed in each
1009 // iteration. This information is used for time management: When
1010 // the best move changes frequently, we allocate some more time.
1015 // All other moves but the PV are set to the lowest value: this is
1016 // not a problem when sorting because the sort is stable and the
1017 // move position in the list is preserved - just the PV is pushed up.
1018 rm.score = -VALUE_INFINITE;
1021 if (value > bestValue)
1023 bestValue = SpNode ? splitPoint->bestValue = value : value;
1027 bestMove = SpNode ? splitPoint->bestMove = move : move;
1029 if (PvNode && !RootNode) // Update pv even in fail-high case
1030 update_pv(SpNode ? splitPoint->ss->pv : ss->pv, move, (ss+1)->pv);
1032 if (PvNode && value < beta) // Update alpha! Always alpha < beta
1033 alpha = SpNode ? splitPoint->alpha = value : value;
1036 assert(value >= beta); // Fail high
1039 splitPoint->cutoff = true;
1046 // Step 19. Check for splitting the search
1048 && Threads.size() >= 2
1049 && depth >= Threads.minimumSplitDepth
1050 && ( !thisThread->activeSplitPoint
1051 || !thisThread->activeSplitPoint->allSlavesSearching)
1052 && thisThread->splitPointsSize < MAX_SPLITPOINTS_PER_THREAD)
1054 assert(bestValue > -VALUE_INFINITE && bestValue < beta);
1056 thisThread->split(pos, ss, alpha, beta, &bestValue, &bestMove,
1057 depth, moveCount, &mp, NT, cutNode);
1059 if (Signals.stop || thisThread->cutoff_occurred())
1062 if (bestValue >= beta)
1070 // Following condition would detect a stop or a cutoff set only after move
1071 // loop has been completed. But in this case bestValue is valid because we
1072 // have fully searched our subtree, and we can anyhow save the result in TT.
1074 if (Signals.stop || thisThread->cutoff_occurred())
1078 // Step 20. Check for mate and stalemate
1079 // All legal moves have been searched and if there are no legal moves, it
1080 // must be mate or stalemate. If we are in a singular extension search then
1081 // return a fail low score.
1083 bestValue = excludedMove ? alpha
1084 : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
1086 // Quiet best move: update killers, history, countermoves and followupmoves
1087 else if (bestValue >= beta && !pos.capture_or_promotion(bestMove) && !inCheck)
1088 update_stats(pos, ss, bestMove, depth, quietsSearched, quietCount - 1);
1090 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1091 bestValue >= beta ? BOUND_LOWER :
1092 PvNode && bestMove ? BOUND_EXACT : BOUND_UPPER,
1093 depth, bestMove, ss->staticEval);
1095 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1101 // qsearch() is the quiescence search function, which is called by the main
1102 // search function when the remaining depth is zero (or, to be more precise,
1103 // less than ONE_PLY).
1105 template <NodeType NT, bool InCheck>
1106 Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
1108 const bool PvNode = NT == PV;
1110 assert(NT == PV || NT == NonPV);
1111 assert(InCheck == !!pos.checkers());
1112 assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
1113 assert(PvNode || (alpha == beta - 1));
1114 assert(depth <= DEPTH_ZERO);
1120 Move ttMove, move, bestMove;
1121 Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
1122 bool givesCheck, evasionPrunable;
1127 oldAlpha = alpha; // To flag BOUND_EXACT when eval above alpha and no available moves
1129 ss->pv[0] = MOVE_NONE;
1132 ss->currentMove = bestMove = MOVE_NONE;
1133 ss->ply = (ss-1)->ply + 1;
1135 // Check for an instant draw or if the maximum ply has been reached
1136 if (pos.is_draw() || ss->ply >= MAX_PLY)
1137 return ss->ply >= MAX_PLY && !InCheck ? evaluate(pos) : DrawValue[pos.side_to_move()];
1139 assert(0 <= ss->ply && ss->ply < MAX_PLY);
1141 // Decide whether or not to include checks: this fixes also the type of
1142 // TT entry depth that we are going to use. Note that in qsearch we use
1143 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1144 ttDepth = InCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS
1145 : DEPTH_QS_NO_CHECKS;
1147 // Transposition table lookup
1149 tte = TT.probe(posKey);
1150 ttMove = tte ? tte->move() : MOVE_NONE;
1151 ttValue = tte ? value_from_tt(tte->value(),ss->ply) : VALUE_NONE;
1155 && tte->depth() >= ttDepth
1156 && ttValue != VALUE_NONE // Only in case of TT access race
1157 && (ttValue >= beta ? (tte->bound() & BOUND_LOWER)
1158 : (tte->bound() & BOUND_UPPER)))
1160 ss->currentMove = ttMove; // Can be MOVE_NONE
1164 // Evaluate the position statically
1167 ss->staticEval = VALUE_NONE;
1168 bestValue = futilityBase = -VALUE_INFINITE;
1174 // Never assume anything on values stored in TT
1175 if ((ss->staticEval = bestValue = tte->eval_value()) == VALUE_NONE)
1176 ss->staticEval = bestValue = evaluate(pos);
1178 // Can ttValue be used as a better position evaluation?
1179 if (ttValue != VALUE_NONE)
1180 if (tte->bound() & (ttValue > bestValue ? BOUND_LOWER : BOUND_UPPER))
1181 bestValue = ttValue;
1184 ss->staticEval = bestValue =
1185 (ss-1)->currentMove != MOVE_NULL ? evaluate(pos) : -(ss-1)->staticEval + 2 * Eval::Tempo;
1187 // Stand pat. Return immediately if static value is at least beta
1188 if (bestValue >= beta)
1191 TT.store(pos.key(), value_to_tt(bestValue, ss->ply), BOUND_LOWER,
1192 DEPTH_NONE, MOVE_NONE, ss->staticEval);
1197 if (PvNode && bestValue > alpha)
1200 futilityBase = bestValue + 128;
1203 // Initialize a MovePicker object for the current position, and prepare
1204 // to search the moves. Because the depth is <= 0 here, only captures,
1205 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1207 MovePicker mp(pos, ttMove, depth, History, to_sq((ss-1)->currentMove));
1210 // Loop through the moves until no moves remain or a beta cutoff occurs
1211 while ((move = mp.next_move<false>()) != MOVE_NONE)
1213 assert(is_ok(move));
1215 givesCheck = type_of(move) == NORMAL && !ci.dcCandidates
1216 ? ci.checkSq[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
1217 : pos.gives_check(move, ci);
1223 && futilityBase > -VALUE_KNOWN_WIN
1224 && !pos.advanced_pawn_push(move))
1226 assert(type_of(move) != ENPASSANT); // Due to !pos.advanced_pawn_push
1228 futilityValue = futilityBase + PieceValue[EG][pos.piece_on(to_sq(move))];
1230 if (futilityValue < beta)
1232 bestValue = std::max(bestValue, futilityValue);
1236 if (futilityBase < beta && pos.see(move) <= VALUE_ZERO)
1238 bestValue = std::max(bestValue, futilityBase);
1243 // Detect non-capture evasions that are candidates to be pruned
1244 evasionPrunable = InCheck
1245 && bestValue > VALUE_MATED_IN_MAX_PLY
1246 && !pos.capture(move)
1247 && !pos.can_castle(pos.side_to_move());
1249 // Don't search moves with negative SEE values
1251 && (!InCheck || evasionPrunable)
1252 && type_of(move) != PROMOTION
1253 && pos.see_sign(move) < VALUE_ZERO)
1256 // Speculative prefetch as early as possible
1257 prefetch((char*)TT.first_entry(pos.key_after(move)));
1259 // Check for legality just before making the move
1260 if (!pos.legal(move, ci.pinned))
1263 ss->currentMove = move;
1265 // Make and search the move
1266 pos.do_move(move, st, ci, givesCheck);
1267 value = givesCheck ? -qsearch<NT, true>(pos, ss+1, -beta, -alpha, depth - ONE_PLY)
1268 : -qsearch<NT, false>(pos, ss+1, -beta, -alpha, depth - ONE_PLY);
1269 pos.undo_move(move);
1271 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1273 // Check for new best move
1274 if (value > bestValue)
1280 if (PvNode) // Update pv even in fail-high case
1281 update_pv(ss->pv, move, (ss+1)->pv);
1283 if (PvNode && value < beta) // Update alpha here! Always alpha < beta
1290 TT.store(posKey, value_to_tt(value, ss->ply), BOUND_LOWER,
1291 ttDepth, move, ss->staticEval);
1299 // All legal moves have been searched. A special case: If we're in check
1300 // and no legal moves were found, it is checkmate.
1301 if (InCheck && bestValue == -VALUE_INFINITE)
1302 return mated_in(ss->ply); // Plies to mate from the root
1304 TT.store(posKey, value_to_tt(bestValue, ss->ply),
1305 PvNode && bestValue > oldAlpha ? BOUND_EXACT : BOUND_UPPER,
1306 ttDepth, bestMove, ss->staticEval);
1308 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1314 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1315 // "plies to mate from the current position". Non-mate scores are unchanged.
1316 // The function is called before storing a value in the transposition table.
1318 Value value_to_tt(Value v, int ply) {
1320 assert(v != VALUE_NONE);
1322 return v >= VALUE_MATE_IN_MAX_PLY ? v + ply
1323 : v <= VALUE_MATED_IN_MAX_PLY ? v - ply : v;
1327 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score
1328 // from the transposition table (which refers to the plies to mate/be mated
1329 // from current position) to "plies to mate/be mated from the root".
1331 Value value_from_tt(Value v, int ply) {
1333 return v == VALUE_NONE ? VALUE_NONE
1334 : v >= VALUE_MATE_IN_MAX_PLY ? v - ply
1335 : v <= VALUE_MATED_IN_MAX_PLY ? v + ply : v;
1339 // update_pv() adds current move and appends child pv[]
1341 void update_pv(Move* pv, Move move, Move* childPv) {
1343 for (*pv++ = move; childPv && *childPv != MOVE_NONE; )
1348 // update_stats() updates killers, history, countermoves and followupmoves stats after a fail-high
1351 void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt) {
1353 if (ss->killers[0] != move)
1355 ss->killers[1] = ss->killers[0];
1356 ss->killers[0] = move;
1359 // Increase history value of the cut-off move and decrease all the other
1360 // played quiet moves.
1361 Value bonus = Value((depth / ONE_PLY) * (depth / ONE_PLY));
1362 History.update(pos.moved_piece(move), to_sq(move), bonus);
1363 for (int i = 0; i < quietsCnt; ++i)
1366 History.update(pos.moved_piece(m), to_sq(m), -bonus);
1369 if (is_ok((ss-1)->currentMove))
1371 Square prevMoveSq = to_sq((ss-1)->currentMove);
1372 Countermoves.update(pos.piece_on(prevMoveSq), prevMoveSq, move);
1375 if (is_ok((ss-2)->currentMove) && (ss-1)->currentMove == (ss-1)->ttMove)
1377 Square prevOwnMoveSq = to_sq((ss-2)->currentMove);
1378 Followupmoves.update(pos.piece_on(prevOwnMoveSq), prevOwnMoveSq, move);
1383 // When playing with a strength handicap, choose best move among the first 'candidates'
1384 // RootMoves using a statistical rule dependent on 'level'. Idea by Heinz van Saanen.
1386 Move Skill::pick_move() {
1390 // PRNG sequence should be not deterministic
1391 for (int i = Time::now() % 50; i > 0; --i)
1392 rk.rand<unsigned>();
1394 // RootMoves are already sorted by score in descending order
1395 int variance = std::min(RootMoves[0].score - RootMoves[candidates - 1].score, PawnValueMg);
1396 int weakness = 120 - 2 * level;
1397 int max_s = -VALUE_INFINITE;
1400 // Choose best move. For each move score we add two terms both dependent on
1401 // weakness. One deterministic and bigger for weaker moves, and one random,
1402 // then we choose the move with the resulting highest score.
1403 for (size_t i = 0; i < candidates; ++i)
1405 int s = RootMoves[i].score;
1407 // Don't allow crazy blunders even at very low skills
1408 if (i > 0 && RootMoves[i - 1].score > s + 2 * PawnValueMg)
1411 // This is our magic formula
1412 s += ( weakness * int(RootMoves[0].score - s)
1413 + variance * (rk.rand<unsigned>() % weakness)) / 128;
1418 best = RootMoves[i].pv[0];
1425 // uci_pv() formats PV information according to the UCI protocol. UCI
1426 // requires that all (if any) unsearched PV lines are sent using a previous
1429 string uci_pv(const Position& pos, Depth depth, Value alpha, Value beta) {
1431 std::stringstream ss;
1432 Time::point elapsed = Time::now() - SearchTime + 1;
1433 size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
1436 for (size_t i = 0; i < Threads.size(); ++i)
1437 if (Threads[i]->maxPly > selDepth)
1438 selDepth = Threads[i]->maxPly;
1440 for (size_t i = 0; i < uciPVSize; ++i)
1442 bool updated = (i <= PVIdx);
1444 if (depth == ONE_PLY && !updated)
1447 Depth d = updated ? depth : depth - ONE_PLY;
1448 Value v = updated ? RootMoves[i].score : RootMoves[i].prevScore;
1450 bool tb = RootInTB && abs(v) < VALUE_MATE - MAX_PLY;
1451 v = tb ? TBScore : v;
1453 if (ss.rdbuf()->in_avail()) // Not at first line
1456 ss << "info depth " << d / ONE_PLY
1457 << " seldepth " << selDepth
1458 << " multipv " << i + 1
1459 << " score " << ((!tb && i == PVIdx) ? UCI::format_value(v, alpha, beta) : UCI::format_value(v))
1460 << " nodes " << pos.nodes_searched()
1461 << " nps " << pos.nodes_searched() * 1000 / elapsed
1462 << " tbhits " << TBHits
1463 << " time " << elapsed
1466 for (size_t j = 0; j < RootMoves[i].pv.size(); ++j)
1467 ss << " " << UCI::format_move(RootMoves[i].pv[j], pos.is_chess960());
1476 /// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
1477 /// inserts the PV back into the TT. This makes sure the old PV moves are searched
1478 /// first, even if the old TT entries have been overwritten.
1480 void RootMove::insert_pv_in_tt(Position& pos) {
1482 StateInfo state[MAX_PLY], *st = state;
1486 for ( ; idx < pv.size(); ++idx)
1488 tte = TT.probe(pos.key());
1490 if (!tte || tte->move() != pv[idx]) // Don't overwrite correct entries
1491 TT.store(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[idx], VALUE_NONE);
1493 assert(MoveList<LEGAL>(pos).contains(pv[idx]));
1495 pos.do_move(pv[idx], *st++);
1498 while (idx) pos.undo_move(pv[--idx]);
1502 /// Thread::idle_loop() is where the thread is parked when it has no work to do
1504 void Thread::idle_loop() {
1506 // Pointer 'this_sp' is not null only if we are called from split(), and not
1507 // at the thread creation. This means we are the split point's master.
1508 SplitPoint* this_sp = splitPointsSize ? activeSplitPoint : NULL;
1510 assert(!this_sp || (this_sp->masterThread == this && searching));
1514 // If this thread has been assigned work, launch a search
1517 Threads.mutex.lock();
1519 assert(activeSplitPoint);
1520 SplitPoint* sp = activeSplitPoint;
1522 Threads.mutex.unlock();
1524 Stack stack[MAX_PLY+4], *ss = stack+2; // To allow referencing (ss-2) and (ss+2)
1525 Position pos(*sp->pos, this);
1527 std::memcpy(ss-2, sp->ss-2, 5 * sizeof(Stack));
1528 ss->splitPoint = sp;
1532 assert(activePosition == NULL);
1534 activePosition = &pos;
1536 if (sp->nodeType == NonPV)
1537 search<NonPV, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1539 else if (sp->nodeType == PV)
1540 search<PV, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1542 else if (sp->nodeType == Root)
1543 search<Root, true>(pos, ss, sp->alpha, sp->beta, sp->depth, sp->cutNode);
1551 activePosition = NULL;
1552 sp->slavesMask.reset(idx);
1553 sp->allSlavesSearching = false;
1554 sp->nodes += pos.nodes_searched();
1556 // Wake up the master thread so to allow it to return from the idle
1557 // loop in case we are the last slave of the split point.
1558 if ( this != sp->masterThread
1559 && sp->slavesMask.none())
1561 assert(!sp->masterThread->searching);
1562 sp->masterThread->notify_one();
1565 // After releasing the lock we can't access any SplitPoint related data
1566 // in a safe way because it could have been released under our feet by
1570 // Try to late join to another split point if none of its slaves has
1571 // already finished.
1572 if (Threads.size() > 2)
1573 for (size_t i = 0; i < Threads.size(); ++i)
1575 const int size = Threads[i]->splitPointsSize; // Local copy
1576 sp = size ? &Threads[i]->splitPoints[size - 1] : NULL;
1579 && sp->allSlavesSearching
1580 && available_to(Threads[i]))
1582 // Recheck the conditions under lock protection
1583 Threads.mutex.lock();
1586 if ( sp->allSlavesSearching
1587 && available_to(Threads[i]))
1589 sp->slavesMask.set(idx);
1590 activeSplitPoint = sp;
1595 Threads.mutex.unlock();
1597 break; // Just a single attempt
1602 // Grab the lock to avoid races with Thread::notify_one()
1605 // If we are master and all slaves have finished then exit idle_loop
1606 if (this_sp && this_sp->slavesMask.none())
1613 // If we are not searching, wait for a condition to be signaled instead of
1614 // wasting CPU time polling for work.
1615 if (!searching && !exit)
1616 sleepCondition.wait(mutex);
1623 /// check_time() is called by the timer thread when the timer triggers. It is
1624 /// used to print debug info and, more importantly, to detect when we are out of
1625 /// available time and thus stop the search.
1629 static Time::point lastInfoTime = Time::now();
1630 Time::point elapsed = Time::now() - SearchTime;
1632 if (Time::now() - lastInfoTime >= 1000)
1634 lastInfoTime = Time::now();
1638 // An engine may not stop pondering until told so by the GUI
1642 if (Limits.use_time_management())
1644 bool stillAtFirstMove = Signals.firstRootMove
1645 && !Signals.failedLowAtRoot
1646 && elapsed > TimeMgr.available_time() * 75 / 100;
1648 if ( stillAtFirstMove
1649 || elapsed > TimeMgr.maximum_time() - 2 * TimerThread::Resolution)
1650 Signals.stop = true;
1652 else if (Limits.movetime && elapsed >= Limits.movetime)
1653 Signals.stop = true;
1655 else if (Limits.nodes)
1657 Threads.mutex.lock();
1659 int64_t nodes = RootPos.nodes_searched();
1661 // Loop across all split points and sum accumulated SplitPoint nodes plus
1662 // all the currently active positions nodes.
1663 for (size_t i = 0; i < Threads.size(); ++i)
1664 for (int j = 0; j < Threads[i]->splitPointsSize; ++j)
1666 SplitPoint& sp = Threads[i]->splitPoints[j];
1672 for (size_t idx = 0; idx < Threads.size(); ++idx)
1673 if (sp.slavesMask.test(idx) && Threads[idx]->activePosition)
1674 nodes += Threads[idx]->activePosition->nodes_searched();
1679 Threads.mutex.unlock();
1681 if (nodes >= Limits.nodes)
1682 Signals.stop = true;