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-2010 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/>.
40 #include "ucioption.h"
48 // Set to true to force running with one thread. Used for debugging
49 const bool FakeSplit = false;
51 // Different node types, used as template parameter
52 enum NodeType { Root, PV, NonPV, SplitPointRoot, SplitPointPV, SplitPointNonPV };
54 // RootMove struct is used for moves at the root of the tree. For each root
55 // move, we store a score, a node count, and a PV (really a refutation
56 // in the case of moves which fail low). Score is normally set at
57 // -VALUE_INFINITE for all non-pv moves.
60 // RootMove::operator<() is the comparison function used when
61 // sorting the moves. A move m1 is considered to be better
62 // than a move m2 if it has an higher score
63 bool operator<(const RootMove& m) const { return score < m.score; }
65 void extract_pv_from_tt(Position& pos);
66 void insert_pv_in_tt(Position& pos);
74 // RootMoveList struct is mainly a std::vector of RootMove objects
75 struct RootMoveList : public std::vector<RootMove> {
77 void init(Position& pos, Move searchMoves[]);
78 RootMove* find(const Move& m, int startIndex = 0);
86 // Lookup table to check if a Piece is a slider and its access function
87 const bool Slidings[18] = { 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1 };
88 inline bool piece_is_slider(Piece p) { return Slidings[p]; }
92 // Maximum depth for razoring
93 const Depth RazorDepth = 4 * ONE_PLY;
95 // Dynamic razoring margin based on depth
96 inline Value razor_margin(Depth d) { return Value(0x200 + 0x10 * int(d)); }
98 // Maximum depth for use of dynamic threat detection when null move fails low
99 const Depth ThreatDepth = 5 * ONE_PLY;
101 // Step 9. Internal iterative deepening
103 // Minimum depth for use of internal iterative deepening
104 const Depth IIDDepth[] = { 8 * ONE_PLY, 5 * ONE_PLY };
106 // At Non-PV nodes we do an internal iterative deepening search
107 // when the static evaluation is bigger then beta - IIDMargin.
108 const Value IIDMargin = Value(0x100);
110 // Step 11. Decide the new search depth
112 // Extensions. Array index 0 is used for non-PV nodes, index 1 for PV nodes
113 const Depth CheckExtension[] = { ONE_PLY / 2, ONE_PLY / 1 };
114 const Depth PawnEndgameExtension[] = { ONE_PLY / 1, ONE_PLY / 1 };
115 const Depth PawnPushTo7thExtension[] = { ONE_PLY / 2, ONE_PLY / 2 };
116 const Depth PassedPawnExtension[] = { DEPTH_ZERO, ONE_PLY / 2 };
118 // Minimum depth for use of singular extension
119 const Depth SingularExtensionDepth[] = { 8 * ONE_PLY, 6 * ONE_PLY };
121 // Step 12. Futility pruning
123 // Futility margin for quiescence search
124 const Value FutilityMarginQS = Value(0x80);
126 // Futility lookup tables (initialized at startup) and their access functions
127 Value FutilityMargins[16][64]; // [depth][moveNumber]
128 int FutilityMoveCounts[32]; // [depth]
130 inline Value futility_margin(Depth d, int mn) {
132 return d < 7 * ONE_PLY ? FutilityMargins[std::max(int(d), 1)][std::min(mn, 63)]
133 : 2 * VALUE_INFINITE;
136 inline int futility_move_count(Depth d) {
138 return d < 16 * ONE_PLY ? FutilityMoveCounts[d] : MAX_MOVES;
141 // Step 14. Reduced search
143 // Reduction lookup tables (initialized at startup) and their access function
144 int8_t Reductions[2][64][64]; // [pv][depth][moveNumber]
146 template <bool PvNode> inline Depth reduction(Depth d, int mn) {
148 return (Depth) Reductions[PvNode][std::min(int(d) / ONE_PLY, 63)][std::min(mn, 63)];
151 // Easy move margin. An easy move candidate must be at least this much
152 // better than the second best move.
153 const Value EasyMoveMargin = Value(0x200);
156 /// Namespace variables
162 int MultiPV, UCIMultiPV, MultiPVIdx;
164 // Time management variables
165 bool StopOnPonderhit, FirstRootMove, StopRequest, QuitRequest, AspirationFailLow;
169 // Skill level adjustment
171 bool SkillLevelEnabled;
179 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove);
181 template <NodeType NT>
182 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth);
184 template <NodeType NT>
185 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth);
187 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bValue);
188 bool connected_moves(const Position& pos, Move m1, Move m2);
189 Value value_to_tt(Value v, int ply);
190 Value value_from_tt(Value v, int ply);
191 bool can_return_tt(const TTEntry* tte, Depth depth, Value beta, int ply);
192 bool connected_threat(const Position& pos, Move m, Move threat);
193 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply);
194 void update_history(const Position& pos, Move move, Depth depth, Move movesSearched[], int moveCount);
195 void do_skill_level(Move* best, Move* ponder);
197 int elapsed_search_time(int set = 0);
198 string score_to_uci(Value v, Value alpha = -VALUE_INFINITE, Value beta = VALUE_INFINITE);
199 string speed_to_uci(int64_t nodes);
200 string pv_to_uci(const Move pv[], int pvNum, bool chess960);
201 string pretty_pv(Position& pos, int depth, Value score, int time, Move pv[]);
202 string depth_to_uci(Depth depth);
203 void wait_for_stop_or_ponderhit();
205 // MovePickerExt template class extends MovePicker and allows to choose at compile
206 // time the proper moves source according to the type of node. In the default case
207 // we simply create and use a standard MovePicker object.
208 template<bool SpNode> struct MovePickerExt : public MovePicker {
210 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
211 : MovePicker(p, ttm, d, h, ss, b) {}
214 // In case of a SpNode we use split point's shared MovePicker object as moves source
215 template<> struct MovePickerExt<true> : public MovePicker {
217 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
218 : MovePicker(p, ttm, d, h, ss, b), mp(ss->sp->mp) {}
220 Move get_next_move() { return mp->get_next_move(); }
224 // Overload operator<<() to make it easier to print moves in a coordinate
225 // notation compatible with UCI protocol.
226 std::ostream& operator<<(std::ostream& os, Move m) {
228 bool chess960 = (os.iword(0) != 0); // See set960()
229 return os << move_to_uci(m, chess960);
232 // When formatting a move for std::cout we must know if we are in Chess960
233 // or not. To keep using the handy operator<<() on the move the trick is to
234 // embed this flag in the stream itself. Function-like named enum set960 is
235 // used as a custom manipulator and the stream internal general-purpose array,
236 // accessed through ios_base::iword(), is used to pass the flag to the move's
237 // operator<<() that will read it to properly format castling moves.
240 std::ostream& operator<< (std::ostream& os, const set960& f) {
242 os.iword(0) = int(f);
246 // extension() decides whether a move should be searched with normal depth,
247 // or with extended depth. Certain classes of moves (checking moves, in
248 // particular) are searched with bigger depth than ordinary moves and in
249 // any case are marked as 'dangerous'. Note that also if a move is not
250 // extended, as example because the corresponding UCI option is set to zero,
251 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
252 template <bool PvNode>
253 FORCE_INLINE Depth extension(const Position& pos, Move m, bool captureOrPromotion,
254 bool moveIsCheck, bool* dangerous) {
255 assert(m != MOVE_NONE);
257 Depth result = DEPTH_ZERO;
258 *dangerous = moveIsCheck;
260 if (moveIsCheck && pos.see_sign(m) >= 0)
261 result += CheckExtension[PvNode];
263 if (type_of(pos.piece_on(move_from(m))) == PAWN)
265 Color c = pos.side_to_move();
266 if (relative_rank(c, move_to(m)) == RANK_7)
268 result += PawnPushTo7thExtension[PvNode];
271 if (pos.pawn_is_passed(c, move_to(m)))
273 result += PassedPawnExtension[PvNode];
278 if ( captureOrPromotion
279 && type_of(pos.piece_on(move_to(m))) != PAWN
280 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
281 - PieceValueMidgame[pos.piece_on(move_to(m))] == VALUE_ZERO)
284 result += PawnEndgameExtension[PvNode];
288 return std::min(result, ONE_PLY);
294 /// init_search() is called during startup to initialize various lookup tables
298 int d; // depth (ONE_PLY == 2)
299 int hd; // half depth (ONE_PLY == 1)
302 // Init reductions array
303 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
305 double pvRed = log(double(hd)) * log(double(mc)) / 3.0;
306 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
307 Reductions[1][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
308 Reductions[0][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
311 // Init futility margins array
312 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
313 FutilityMargins[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
315 // Init futility move count array
316 for (d = 0; d < 32; d++)
317 FutilityMoveCounts[d] = int(3.001 + 0.25 * pow(d, 2.0));
321 /// perft() is our utility to verify move generation. All the leaf nodes up to
322 /// the given depth are generated and counted and the sum returned.
324 int64_t perft(Position& pos, Depth depth) {
329 // Generate all legal moves
330 MoveList<MV_LEGAL> ml(pos);
332 // If we are at the last ply we don't need to do and undo
333 // the moves, just to count them.
334 if (depth <= ONE_PLY)
337 // Loop through all legal moves
339 for ( ; !ml.end(); ++ml)
341 pos.do_move(ml.move(), st, ci, pos.move_gives_check(ml.move(), ci));
342 sum += perft(pos, depth - ONE_PLY);
343 pos.undo_move(ml.move());
349 /// think() is the external interface to Stockfish's search, and is called when
350 /// the program receives the UCI 'go' command. It initializes various global
351 /// variables, and calls id_loop(). It returns false when a "quit" command is
352 /// received during the search.
354 bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]) {
356 static Book book; // Defined static to initialize the PRNG only once
358 // Save "search start" time and reset elapsed time to zero
359 elapsed_search_time(get_system_time());
361 // Initialize global search-related variables
362 StopOnPonderhit = StopRequest = QuitRequest = AspirationFailLow = false;
365 // Set output stream mode: normal or chess960. Castling notation is different
366 cout << set960(pos.is_chess960());
368 // Look for a book move
369 if (Options["OwnBook"].value<bool>())
371 if (Options["Book File"].value<string>() != book.name())
372 book.open(Options["Book File"].value<string>());
374 Move bookMove = book.probe(pos, Options["Best Book Move"].value<bool>());
375 if (bookMove != MOVE_NONE)
378 wait_for_stop_or_ponderhit();
380 cout << "bestmove " << bookMove << endl;
385 // Read UCI options: GUI could change UCI parameters during the game
386 read_evaluation_uci_options(pos.side_to_move());
387 Threads.read_uci_options();
389 // Set a new TT size if changed
390 TT.set_size(Options["Hash"].value<int>());
392 if (Options["Clear Hash"].value<bool>())
394 Options["Clear Hash"].set_value("false");
398 UCIMultiPV = Options["MultiPV"].value<int>();
399 SkillLevel = Options["Skill Level"].value<int>();
401 // Do we have to play with skill handicap? In this case enable MultiPV that
402 // we will use behind the scenes to retrieve a set of possible moves.
403 SkillLevelEnabled = (SkillLevel < 20);
404 MultiPV = (SkillLevelEnabled ? std::max(UCIMultiPV, 4) : UCIMultiPV);
406 // Write current search header to log file
407 if (Options["Use Search Log"].value<bool>())
409 Log log(Options["Search Log Filename"].value<string>());
410 log << "\nSearching: " << pos.to_fen()
411 << "\ninfinite: " << Limits.infinite
412 << " ponder: " << Limits.ponder
413 << " time: " << Limits.time
414 << " increment: " << Limits.increment
415 << " moves to go: " << Limits.movesToGo
419 // Wake up needed threads and reset maxPly counter
420 for (int i = 0; i < Threads.size(); i++)
422 Threads[i].maxPly = 0;
423 Threads[i].wake_up();
426 // Set best timer interval to avoid lagging under time pressure. Timer is
427 // used to check for remaining available thinking time.
428 TimeMgr.init(Limits, pos.startpos_ply_counter());
430 if (TimeMgr.available_time())
431 Threads.set_timer(std::min(100, std::max(TimeMgr.available_time() / 8, 20)));
433 Threads.set_timer(100);
435 // Start async mode to catch UCI commands sent to us while searching,
436 // like "quit", "stop", etc.
437 Threads.start_listener();
439 // We're ready to start thinking. Call the iterative deepening loop function
440 Move ponderMove = MOVE_NONE;
441 Move bestMove = id_loop(pos, searchMoves, &ponderMove);
443 // From now on any UCI command will be read in-sync with Threads.getline()
444 Threads.stop_listener();
446 // Stop timer, no need to check for available time any more
447 Threads.set_timer(0);
449 // This makes all the slave threads to go to sleep, if not already sleeping
452 // Write current search final statistics to log file
453 if (Options["Use Search Log"].value<bool>())
455 int e = elapsed_search_time();
457 Log log(Options["Search Log Filename"].value<string>());
458 log << "Nodes: " << pos.nodes_searched()
459 << "\nNodes/second: " << (e > 0 ? pos.nodes_searched() * 1000 / e : 0)
460 << "\nBest move: " << move_to_san(pos, bestMove);
463 pos.do_move(bestMove, st);
464 log << "\nPonder move: " << move_to_san(pos, ponderMove) << endl;
465 pos.undo_move(bestMove); // Return from think() with unchanged position
468 // If we are pondering or in infinite search, we shouldn't print the best move
469 // before we are told to do so.
470 if (Limits.ponder || Limits.infinite)
471 wait_for_stop_or_ponderhit();
473 // Could be MOVE_NONE when searching on a stalemate position
474 cout << "bestmove " << bestMove;
476 // UCI protol is not clear on allowing sending an empty ponder move, instead
477 // it is clear that ponder move is optional. So skip it if empty.
478 if (ponderMove != MOVE_NONE)
479 cout << " ponder " << ponderMove;
489 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
490 // with increasing depth until the allocated thinking time has been consumed,
491 // user stops the search, or the maximum search depth is reached.
493 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove) {
495 SearchStack ss[PLY_MAX_PLUS_2];
496 Value bestValues[PLY_MAX_PLUS_2];
497 int bestMoveChanges[PLY_MAX_PLUS_2];
498 int depth, aspirationDelta;
499 Value bestValue, alpha, beta;
500 Move bestMove, easyMove, skillBest, skillPonder;
502 // Initialize stuff before a new search
503 memset(ss, 0, 4 * sizeof(SearchStack));
506 *ponderMove = bestMove = easyMove = skillBest = skillPonder = MOVE_NONE;
507 depth = aspirationDelta = 0;
508 bestValue = alpha = -VALUE_INFINITE, beta = VALUE_INFINITE;
509 ss->currentMove = MOVE_NULL; // Hack to skip update gains
511 // Moves to search are verified and copied
512 Rml.init(pos, searchMoves);
514 // Handle special case of searching on a mate/stalemate position
517 cout << "info" << depth_to_uci(DEPTH_ZERO)
518 << score_to_uci(pos.in_check() ? -VALUE_MATE : VALUE_DRAW, alpha, beta) << endl;
523 // Iterative deepening loop until requested to stop or target depth reached
524 while (!StopRequest && ++depth <= PLY_MAX && (!Limits.maxDepth || depth <= Limits.maxDepth))
526 // Save now last iteration's scores, before Rml moves are reordered
527 for (size_t i = 0; i < Rml.size(); i++)
528 Rml[i].prevScore = Rml[i].score;
530 Rml.bestMoveChanges = 0;
532 // MultiPV loop. We perform a full root search for each PV line
533 for (MultiPVIdx = 0; MultiPVIdx < std::min(MultiPV, (int)Rml.size()); MultiPVIdx++)
535 // Calculate dynamic aspiration window based on previous iterations
536 if (depth >= 5 && abs(Rml[MultiPVIdx].prevScore) < VALUE_KNOWN_WIN)
538 int prevDelta1 = bestValues[depth - 1] - bestValues[depth - 2];
539 int prevDelta2 = bestValues[depth - 2] - bestValues[depth - 3];
541 aspirationDelta = std::min(std::max(abs(prevDelta1) + abs(prevDelta2) / 2, 16), 24);
542 aspirationDelta = (aspirationDelta + 7) / 8 * 8; // Round to match grainSize
544 alpha = std::max(Rml[MultiPVIdx].prevScore - aspirationDelta, -VALUE_INFINITE);
545 beta = std::min(Rml[MultiPVIdx].prevScore + aspirationDelta, VALUE_INFINITE);
549 alpha = -VALUE_INFINITE;
550 beta = VALUE_INFINITE;
553 // Start with a small aspiration window and, in case of fail high/low,
554 // research with bigger window until not failing high/low anymore.
556 // Search starts from ss+1 to allow referencing (ss-1). This is
557 // needed by update gains and ss copy when splitting at Root.
558 bestValue = search<Root>(pos, ss+1, alpha, beta, depth * ONE_PLY);
560 // Bring to front the best move. It is critical that sorting is
561 // done with a stable algorithm because all the values but the first
562 // and eventually the new best one are set to -VALUE_INFINITE and
563 // we want to keep the same order for all the moves but the new
564 // PV that goes to the front. Note that in case of MultiPV search
565 // the already searched PV lines are preserved.
566 sort<RootMove>(Rml.begin() + MultiPVIdx, Rml.end());
568 // In case we have found an exact score and we are going to leave
569 // the fail high/low loop then reorder the PV moves, otherwise
570 // leave the last PV move in its position so to be searched again.
571 // Of course this is needed only in MultiPV search.
572 if (MultiPVIdx && bestValue > alpha && bestValue < beta)
573 sort<RootMove>(Rml.begin(), Rml.begin() + MultiPVIdx);
575 // Write PV back to transposition table in case the relevant entries
576 // have been overwritten during the search.
577 for (int i = 0; i <= MultiPVIdx; i++)
578 Rml[i].insert_pv_in_tt(pos);
580 // If search has been stopped exit the aspiration window loop,
581 // note that sorting and writing PV back to TT is safe becuase
582 // Rml is still valid, although refers to the previous iteration.
586 // Send full PV info to GUI if we are going to leave the loop or
587 // if we have a fail high/low and we are deep in the search. UCI
588 // protocol requires to send all the PV lines also if are still
589 // to be searched and so refer to the previous search's score.
590 if ((bestValue > alpha && bestValue < beta) || elapsed_search_time() > 2000)
591 for (int i = 0; i < std::min(UCIMultiPV, (int)Rml.size()); i++)
593 bool updated = (i <= MultiPVIdx);
595 if (depth == 1 && !updated)
598 Depth d = (updated ? depth : depth - 1) * ONE_PLY;
599 Value s = (updated ? Rml[i].score : Rml[i].prevScore);
603 << (i == MultiPVIdx ? score_to_uci(s, alpha, beta) : score_to_uci(s))
604 << speed_to_uci(pos.nodes_searched())
605 << pv_to_uci(&Rml[i].pv[0], i + 1, pos.is_chess960())
609 // In case of failing high/low increase aspiration window and
610 // research, otherwise exit the fail high/low loop.
611 if (bestValue >= beta)
613 beta = std::min(beta + aspirationDelta, VALUE_INFINITE);
614 aspirationDelta += aspirationDelta / 2;
616 else if (bestValue <= alpha)
618 AspirationFailLow = true;
619 StopOnPonderhit = false;
621 alpha = std::max(alpha - aspirationDelta, -VALUE_INFINITE);
622 aspirationDelta += aspirationDelta / 2;
627 } while (abs(bestValue) < VALUE_KNOWN_WIN);
630 // Collect info about search result
631 bestMove = Rml[0].pv[0];
632 *ponderMove = Rml[0].pv[1];
633 bestValues[depth] = bestValue;
634 bestMoveChanges[depth] = Rml.bestMoveChanges;
636 // Skills: Do we need to pick now the best and the ponder moves ?
637 if (SkillLevelEnabled && depth == 1 + SkillLevel)
638 do_skill_level(&skillBest, &skillPonder);
640 if (Options["Use Search Log"].value<bool>())
642 Log log(Options["Search Log Filename"].value<string>());
643 log << pretty_pv(pos, depth, bestValue, elapsed_search_time(), &Rml[0].pv[0]) << endl;
646 // Init easyMove at first iteration or drop it if differs from the best move
647 if (depth == 1 && (Rml.size() == 1 || Rml[0].score > Rml[1].score + EasyMoveMargin))
649 else if (bestMove != easyMove)
650 easyMove = MOVE_NONE;
652 // Check for some early stop condition
653 if (!StopRequest && Limits.useTimeManagement())
655 // Easy move: Stop search early if one move seems to be much better
656 // than the others or if there is only a single legal move. Also in
657 // the latter case search to some depth anyway to get a proper score.
659 && easyMove == bestMove
661 ||( Rml[0].nodes > (pos.nodes_searched() * 85) / 100
662 && elapsed_search_time() > TimeMgr.available_time() / 16)
663 ||( Rml[0].nodes > (pos.nodes_searched() * 98) / 100
664 && elapsed_search_time() > TimeMgr.available_time() / 32)))
667 // Take in account some extra time if the best move has changed
668 if (depth > 4 && depth < 50)
669 TimeMgr.pv_instability(bestMoveChanges[depth], bestMoveChanges[depth - 1]);
671 // Stop search if most of available time is already consumed. We probably don't
672 // have enough time to search the first move at the next iteration anyway.
673 if (elapsed_search_time() > (TimeMgr.available_time() * 62) / 100)
676 // If we are allowed to ponder do not stop the search now but keep pondering
677 if (StopRequest && Limits.ponder)
680 StopOnPonderhit = true;
685 // When using skills overwrite best and ponder moves with the sub-optimal ones
686 if (SkillLevelEnabled)
688 if (skillBest == MOVE_NONE) // Still unassigned ?
689 do_skill_level(&skillBest, &skillPonder);
691 bestMove = skillBest;
692 *ponderMove = skillPonder;
699 // search<>() is the main search function for both PV and non-PV nodes and for
700 // normal and SplitPoint nodes. When called just after a split point the search
701 // is simpler because we have already probed the hash table, done a null move
702 // search, and searched the first move before splitting, we don't have to repeat
703 // all this work again. We also don't need to store anything to the hash table
704 // here: This is taken care of after we return from the split point.
706 template <NodeType NT>
707 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth) {
709 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV || NT == SplitPointRoot);
710 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV || NT == SplitPointRoot);
711 const bool RootNode = (NT == Root || NT == SplitPointRoot);
713 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
714 assert(beta > alpha && beta <= VALUE_INFINITE);
715 assert(PvNode || alpha == beta - 1);
716 assert(pos.thread() >= 0 && pos.thread() < Threads.size());
718 Move movesSearched[MAX_MOVES];
723 Move ttMove, move, excludedMove, threatMove;
726 Value bestValue, value, oldAlpha;
727 Value refinedValue, nullValue, futilityBase, futilityValue;
728 bool isPvMove, inCheck, singularExtensionNode, givesCheck, captureOrPromotion, dangerous;
729 int moveCount = 0, playedMoveCount = 0;
730 Thread& thread = Threads[pos.thread()];
731 SplitPoint* sp = NULL;
733 refinedValue = bestValue = value = -VALUE_INFINITE;
735 inCheck = pos.in_check();
736 ss->ply = (ss-1)->ply + 1;
738 // Used to send selDepth info to GUI
739 if (PvNode && thread.maxPly < ss->ply)
740 thread.maxPly = ss->ply;
742 // Step 1. Initialize node
745 ss->currentMove = ss->bestMove = threatMove = (ss+1)->excludedMove = MOVE_NONE;
746 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
747 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
753 ttMove = excludedMove = MOVE_NONE;
754 threatMove = sp->threatMove;
755 goto split_point_start;
758 // Step 2. Check for aborted search and immediate draw
760 || pos.is_draw<false>()
761 || ss->ply > PLY_MAX) && !RootNode)
764 // Step 3. Mate distance pruning
767 alpha = std::max(value_mated_in(ss->ply), alpha);
768 beta = std::min(value_mate_in(ss->ply+1), beta);
773 // Step 4. Transposition table lookup
774 // We don't want the score of a partial search to overwrite a previous full search
775 // TT value, so we use a different position key in case of an excluded move.
776 excludedMove = ss->excludedMove;
777 posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
778 tte = TT.probe(posKey);
779 ttMove = RootNode ? Rml[MultiPVIdx].pv[0] : tte ? tte->move() : MOVE_NONE;
781 // At PV nodes we check for exact scores, while at non-PV nodes we check for
782 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
783 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
784 // we should also update RootMoveList to avoid bogus output.
785 if (!RootNode && tte && (PvNode ? tte->depth() >= depth && tte->type() == VALUE_TYPE_EXACT
786 : can_return_tt(tte, depth, beta, ss->ply)))
789 ss->bestMove = move = ttMove; // Can be MOVE_NONE
790 value = value_from_tt(tte->value(), ss->ply);
794 && !pos.is_capture_or_promotion(move)
795 && move != ss->killers[0])
797 ss->killers[1] = ss->killers[0];
798 ss->killers[0] = move;
803 // Step 5. Evaluate the position statically and update parent's gain statistics
805 ss->eval = ss->evalMargin = VALUE_NONE;
808 assert(tte->static_value() != VALUE_NONE);
810 ss->eval = tte->static_value();
811 ss->evalMargin = tte->static_value_margin();
812 refinedValue = refine_eval(tte, ss->eval, ss->ply);
816 refinedValue = ss->eval = evaluate(pos, ss->evalMargin);
817 TT.store(posKey, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, MOVE_NONE, ss->eval, ss->evalMargin);
820 // Update gain for the parent non-capture move given the static position
821 // evaluation before and after the move.
822 if ( (move = (ss-1)->currentMove) != MOVE_NULL
823 && (ss-1)->eval != VALUE_NONE
824 && ss->eval != VALUE_NONE
825 && pos.captured_piece_type() == PIECE_TYPE_NONE
826 && !is_special(move))
828 Square to = move_to(move);
829 H.update_gain(pos.piece_on(to), to, -(ss-1)->eval - ss->eval);
832 // Step 6. Razoring (is omitted in PV nodes)
834 && depth < RazorDepth
836 && refinedValue + razor_margin(depth) < beta
837 && ttMove == MOVE_NONE
838 && abs(beta) < VALUE_MATE_IN_PLY_MAX
839 && !pos.has_pawn_on_7th(pos.side_to_move()))
841 Value rbeta = beta - razor_margin(depth);
842 Value v = qsearch<NonPV>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
844 // Logically we should return (v + razor_margin(depth)), but
845 // surprisingly this did slightly weaker in tests.
849 // Step 7. Static null move pruning (is omitted in PV nodes)
850 // We're betting that the opponent doesn't have a move that will reduce
851 // the score by more than futility_margin(depth) if we do a null move.
854 && depth < RazorDepth
856 && refinedValue - futility_margin(depth, 0) >= beta
857 && abs(beta) < VALUE_MATE_IN_PLY_MAX
858 && pos.non_pawn_material(pos.side_to_move()))
859 return refinedValue - futility_margin(depth, 0);
861 // Step 8. Null move search with verification search (is omitted in PV nodes)
866 && refinedValue >= beta
867 && abs(beta) < VALUE_MATE_IN_PLY_MAX
868 && pos.non_pawn_material(pos.side_to_move()))
870 ss->currentMove = MOVE_NULL;
872 // Null move dynamic reduction based on depth
873 int R = 3 + (depth >= 5 * ONE_PLY ? depth / 8 : 0);
875 // Null move dynamic reduction based on value
876 if (refinedValue - PawnValueMidgame > beta)
879 pos.do_null_move<true>(st);
880 (ss+1)->skipNullMove = true;
881 nullValue = depth-R*ONE_PLY < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
882 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R*ONE_PLY);
883 (ss+1)->skipNullMove = false;
884 pos.do_null_move<false>(st);
886 if (nullValue >= beta)
888 // Do not return unproven mate scores
889 if (nullValue >= VALUE_MATE_IN_PLY_MAX)
892 if (depth < 6 * ONE_PLY)
895 // Do verification search at high depths
896 ss->skipNullMove = true;
897 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R*ONE_PLY);
898 ss->skipNullMove = false;
905 // The null move failed low, which means that we may be faced with
906 // some kind of threat. If the previous move was reduced, check if
907 // the move that refuted the null move was somehow connected to the
908 // move which was reduced. If a connection is found, return a fail
909 // low score (which will cause the reduced move to fail high in the
910 // parent node, which will trigger a re-search with full depth).
911 threatMove = (ss+1)->bestMove;
913 if ( depth < ThreatDepth
915 && threatMove != MOVE_NONE
916 && connected_moves(pos, (ss-1)->currentMove, threatMove))
921 // Step 9. ProbCut (is omitted in PV nodes)
922 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
923 // and a reduced search returns a value much above beta, we can (almost) safely
924 // prune the previous move.
926 && depth >= RazorDepth + ONE_PLY
929 && excludedMove == MOVE_NONE
930 && abs(beta) < VALUE_MATE_IN_PLY_MAX)
932 Value rbeta = beta + 200;
933 Depth rdepth = depth - ONE_PLY - 3 * ONE_PLY;
935 assert(rdepth >= ONE_PLY);
937 MovePicker mp(pos, ttMove, H, pos.captured_piece_type());
940 while ((move = mp.get_next_move()) != MOVE_NONE)
941 if (pos.pl_move_is_legal(move, ci.pinned))
943 pos.do_move(move, st, ci, pos.move_gives_check(move, ci));
944 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth);
951 // Step 10. Internal iterative deepening
952 if ( depth >= IIDDepth[PvNode]
953 && ttMove == MOVE_NONE
954 && (PvNode || (!inCheck && ss->eval + IIDMargin >= beta)))
956 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
958 ss->skipNullMove = true;
959 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d);
960 ss->skipNullMove = false;
962 tte = TT.probe(posKey);
963 ttMove = tte ? tte->move() : MOVE_NONE;
966 split_point_start: // At split points actual search starts from here
968 // Initialize a MovePicker object for the current position
969 MovePickerExt<SpNode> mp(pos, ttMove, depth, H, ss, PvNode ? -VALUE_INFINITE : beta);
971 ss->bestMove = MOVE_NONE;
972 futilityBase = ss->eval + ss->evalMargin;
973 singularExtensionNode = !RootNode
975 && depth >= SingularExtensionDepth[PvNode]
976 && ttMove != MOVE_NONE
977 && !excludedMove // Do not allow recursive singular extension search
978 && (tte->type() & VALUE_TYPE_LOWER)
979 && tte->depth() >= depth - 3 * ONE_PLY;
982 lock_grab(&(sp->lock));
983 bestValue = sp->bestValue;
986 // Step 11. Loop through moves
987 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
988 while ( bestValue < beta
989 && (move = mp.get_next_move()) != MOVE_NONE
990 && !thread.cutoff_occurred())
994 if (move == excludedMove)
997 // At root obey the "searchmoves" option and skip moves not listed in Root
998 // Move List, as a consequence any illegal move is also skipped. In MultiPV
999 // mode we also skip PV moves which have been already searched.
1000 if (RootNode && !Rml.find(move, MultiPVIdx))
1003 // At PV and SpNode nodes we want all moves to be legal since the beginning
1004 if ((PvNode || SpNode) && !pos.pl_move_is_legal(move, ci.pinned))
1009 moveCount = ++sp->moveCount;
1010 lock_release(&(sp->lock));
1017 // This is used by time management
1018 FirstRootMove = (moveCount == 1);
1020 // Save the current node count before the move is searched
1021 nodes = pos.nodes_searched();
1023 // For long searches send current move info to GUI
1024 if (pos.thread() == 0 && elapsed_search_time() > 2000)
1025 cout << "info" << depth_to_uci(depth)
1026 << " currmove " << move
1027 << " currmovenumber " << moveCount + MultiPVIdx << endl;
1030 // At Root and at first iteration do a PV search on all the moves to score root moves
1031 isPvMove = (PvNode && moveCount <= (RootNode && depth <= ONE_PLY ? MAX_MOVES : 1));
1032 givesCheck = pos.move_gives_check(move, ci);
1033 captureOrPromotion = pos.is_capture_or_promotion(move);
1035 // Step 12. Decide the new search depth
1036 ext = extension<PvNode>(pos, move, captureOrPromotion, givesCheck, &dangerous);
1038 // Singular extension search. If all moves but one fail low on a search of
1039 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
1040 // is singular and should be extended. To verify this we do a reduced search
1041 // on all the other moves but the ttMove, if result is lower than ttValue minus
1042 // a margin then we extend ttMove.
1043 if ( singularExtensionNode
1045 && pos.pl_move_is_legal(move, ci.pinned)
1048 Value ttValue = value_from_tt(tte->value(), ss->ply);
1050 if (abs(ttValue) < VALUE_KNOWN_WIN)
1052 Value rBeta = ttValue - int(depth);
1053 ss->excludedMove = move;
1054 ss->skipNullMove = true;
1055 Value v = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2);
1056 ss->skipNullMove = false;
1057 ss->excludedMove = MOVE_NONE;
1058 ss->bestMove = MOVE_NONE;
1064 // Update current move (this must be done after singular extension search)
1065 newDepth = depth - ONE_PLY + ext;
1067 // Step 13. Futility pruning (is omitted in PV nodes)
1069 && !captureOrPromotion
1073 && !is_castle(move))
1075 // Move count based pruning
1076 if ( moveCount >= futility_move_count(depth)
1077 && (!threatMove || !connected_threat(pos, move, threatMove))
1078 && bestValue > VALUE_MATED_IN_PLY_MAX) // FIXME bestValue is racy
1081 lock_grab(&(sp->lock));
1086 // Value based pruning
1087 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
1088 // but fixing this made program slightly weaker.
1089 Depth predictedDepth = newDepth - reduction<PvNode>(depth, moveCount);
1090 futilityValue = futilityBase + futility_margin(predictedDepth, moveCount)
1091 + H.gain(pos.piece_on(move_from(move)), move_to(move));
1093 if (futilityValue < beta)
1097 lock_grab(&(sp->lock));
1098 if (futilityValue > sp->bestValue)
1099 sp->bestValue = bestValue = futilityValue;
1101 else if (futilityValue > bestValue)
1102 bestValue = futilityValue;
1107 // Prune moves with negative SEE at low depths
1108 if ( predictedDepth < 2 * ONE_PLY
1109 && bestValue > VALUE_MATED_IN_PLY_MAX
1110 && pos.see_sign(move) < 0)
1113 lock_grab(&(sp->lock));
1119 // Check for legality only before to do the move
1120 if (!pos.pl_move_is_legal(move, ci.pinned))
1126 ss->currentMove = move;
1127 if (!SpNode && !captureOrPromotion)
1128 movesSearched[playedMoveCount++] = move;
1130 // Step 14. Make the move
1131 pos.do_move(move, st, ci, givesCheck);
1133 // Step extra. pv search (only in PV nodes)
1134 // The first move in list is the expected PV
1136 value = newDepth < ONE_PLY ? -qsearch<PV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
1137 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
1140 // Step 15. Reduced depth search
1141 // If the move fails high will be re-searched at full depth.
1142 bool doFullDepthSearch = true;
1144 if ( depth > 3 * ONE_PLY
1145 && !captureOrPromotion
1148 && ss->killers[0] != move
1149 && ss->killers[1] != move
1150 && (ss->reduction = reduction<PvNode>(depth, moveCount)) != DEPTH_ZERO)
1152 Depth d = newDepth - ss->reduction;
1153 alpha = SpNode ? sp->alpha : alpha;
1155 value = d < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
1156 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d);
1158 ss->reduction = DEPTH_ZERO;
1159 doFullDepthSearch = (value > alpha);
1162 // Step 16. Full depth search
1163 if (doFullDepthSearch)
1165 alpha = SpNode ? sp->alpha : alpha;
1166 value = newDepth < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
1167 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth);
1169 // Step extra. pv search (only in PV nodes)
1170 // Search only for possible new PV nodes, if instead value >= beta then
1171 // parent node fails low with value <= alpha and tries another move.
1172 if (PvNode && value > alpha && (RootNode || value < beta))
1173 value = newDepth < ONE_PLY ? -qsearch<PV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
1174 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
1178 // Step 17. Undo move
1179 pos.undo_move(move);
1181 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1183 // Step 18. Check for new best move
1186 lock_grab(&(sp->lock));
1187 bestValue = sp->bestValue;
1191 // Finished searching the move. If StopRequest is true, the search
1192 // was aborted because the user interrupted the search or because we
1193 // ran out of time. In this case, the return value of the search cannot
1194 // be trusted, and we don't update the best move and/or PV.
1195 if (RootNode && !StopRequest)
1197 // Remember searched nodes counts for this move
1198 RootMove* rm = Rml.find(move);
1199 rm->nodes += pos.nodes_searched() - nodes;
1201 // PV move or new best move ?
1202 if (isPvMove || value > alpha)
1206 rm->extract_pv_from_tt(pos);
1208 // We record how often the best move has been changed in each
1209 // iteration. This information is used for time management: When
1210 // the best move changes frequently, we allocate some more time.
1211 if (!isPvMove && MultiPV == 1)
1212 Rml.bestMoveChanges++;
1215 // All other moves but the PV are set to the lowest value, this
1216 // is not a problem when sorting becuase sort is stable and move
1217 // position in the list is preserved, just the PV is pushed up.
1218 rm->score = -VALUE_INFINITE;
1222 if (value > bestValue)
1225 ss->bestMove = move;
1229 && value < beta) // We want always alpha < beta
1232 if (SpNode && !thread.cutoff_occurred())
1234 sp->bestValue = value;
1235 sp->ss->bestMove = move;
1237 sp->is_betaCutoff = (value >= beta);
1241 // Step 19. Check for split
1243 && depth >= Threads.min_split_depth()
1245 && Threads.available_slave_exists(pos.thread())
1247 && !thread.cutoff_occurred())
1248 bestValue = Threads.split<FakeSplit>(pos, ss, alpha, beta, bestValue, depth,
1249 threatMove, moveCount, &mp, NT);
1252 // Step 20. Check for mate and stalemate
1253 // All legal moves have been searched and if there are no legal moves, it
1254 // must be mate or stalemate. Note that we can have a false positive in
1255 // case of StopRequest or thread.cutoff_occurred() are set, but this is
1256 // harmless because return value is discarded anyhow in the parent nodes.
1257 // If we are in a singular extension search then return a fail low score.
1258 if (!SpNode && !moveCount)
1259 return excludedMove ? oldAlpha : inCheck ? value_mated_in(ss->ply) : VALUE_DRAW;
1261 // Step 21. Update tables
1262 // If the search is not aborted, update the transposition table,
1263 // history counters, and killer moves.
1264 if (!SpNode && !StopRequest && !thread.cutoff_occurred())
1266 move = bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove;
1267 vt = bestValue <= oldAlpha ? VALUE_TYPE_UPPER
1268 : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT;
1270 TT.store(posKey, value_to_tt(bestValue, ss->ply), vt, depth, move, ss->eval, ss->evalMargin);
1272 // Update killers and history only for non capture moves that fails high
1273 if ( bestValue >= beta
1274 && !pos.is_capture_or_promotion(move))
1276 if (move != ss->killers[0])
1278 ss->killers[1] = ss->killers[0];
1279 ss->killers[0] = move;
1281 update_history(pos, move, depth, movesSearched, playedMoveCount);
1287 // Here we have the lock still grabbed
1288 sp->is_slave[pos.thread()] = false;
1289 sp->nodes += pos.nodes_searched();
1290 lock_release(&(sp->lock));
1293 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1298 // qsearch() is the quiescence search function, which is called by the main
1299 // search function when the remaining depth is zero (or, to be more precise,
1300 // less than ONE_PLY).
1302 template <NodeType NT>
1303 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth) {
1305 const bool PvNode = (NT == PV);
1307 assert(NT == PV || NT == NonPV);
1308 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1309 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1310 assert(PvNode || alpha == beta - 1);
1312 assert(pos.thread() >= 0 && pos.thread() < Threads.size());
1316 Value bestValue, value, evalMargin, futilityValue, futilityBase;
1317 bool inCheck, enoughMaterial, givesCheck, evasionPrunable;
1321 Value oldAlpha = alpha;
1323 ss->bestMove = ss->currentMove = MOVE_NONE;
1324 ss->ply = (ss-1)->ply + 1;
1326 // Check for an instant draw or maximum ply reached
1327 if (pos.is_draw<true>() || ss->ply > PLY_MAX)
1330 // Decide whether or not to include checks, this fixes also the type of
1331 // TT entry depth that we are going to use. Note that in qsearch we use
1332 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1333 inCheck = pos.in_check();
1334 ttDepth = (inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS : DEPTH_QS_NO_CHECKS);
1336 // Transposition table lookup. At PV nodes, we don't use the TT for
1337 // pruning, but only for move ordering.
1338 tte = TT.probe(pos.get_key());
1339 ttMove = (tte ? tte->move() : MOVE_NONE);
1341 if (!PvNode && tte && can_return_tt(tte, ttDepth, beta, ss->ply))
1343 ss->bestMove = ttMove; // Can be MOVE_NONE
1344 return value_from_tt(tte->value(), ss->ply);
1347 // Evaluate the position statically
1350 bestValue = futilityBase = -VALUE_INFINITE;
1351 ss->eval = evalMargin = VALUE_NONE;
1352 enoughMaterial = false;
1358 assert(tte->static_value() != VALUE_NONE);
1360 evalMargin = tte->static_value_margin();
1361 ss->eval = bestValue = tte->static_value();
1364 ss->eval = bestValue = evaluate(pos, evalMargin);
1366 // Stand pat. Return immediately if static value is at least beta
1367 if (bestValue >= beta)
1370 TT.store(pos.get_key(), value_to_tt(bestValue, ss->ply), VALUE_TYPE_LOWER, DEPTH_NONE, MOVE_NONE, ss->eval, evalMargin);
1375 if (PvNode && bestValue > alpha)
1378 // Futility pruning parameters, not needed when in check
1379 futilityBase = ss->eval + evalMargin + FutilityMarginQS;
1380 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1383 // Initialize a MovePicker object for the current position, and prepare
1384 // to search the moves. Because the depth is <= 0 here, only captures,
1385 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1387 MovePicker mp(pos, ttMove, depth, H, move_to((ss-1)->currentMove));
1390 // Loop through the moves until no moves remain or a beta cutoff occurs
1391 while ( bestValue < beta
1392 && (move = mp.get_next_move()) != MOVE_NONE)
1394 assert(is_ok(move));
1396 givesCheck = pos.move_gives_check(move, ci);
1404 && !is_promotion(move)
1405 && !pos.is_passed_pawn_push(move))
1407 futilityValue = futilityBase
1408 + PieceValueEndgame[pos.piece_on(move_to(move))]
1409 + (is_enpassant(move) ? PawnValueEndgame : VALUE_ZERO);
1411 if (futilityValue < beta)
1413 if (futilityValue > bestValue)
1414 bestValue = futilityValue;
1419 // Prune moves with negative or equal SEE
1420 if ( futilityBase < beta
1421 && depth < DEPTH_ZERO
1422 && pos.see(move) <= 0)
1426 // Detect non-capture evasions that are candidate to be pruned
1427 evasionPrunable = !PvNode
1429 && bestValue > VALUE_MATED_IN_PLY_MAX
1430 && !pos.is_capture(move)
1431 && !pos.can_castle(pos.side_to_move());
1433 // Don't search moves with negative SEE values
1435 && (!inCheck || evasionPrunable)
1437 && !is_promotion(move)
1438 && pos.see_sign(move) < 0)
1441 // Don't search useless checks
1446 && !pos.is_capture_or_promotion(move)
1447 && ss->eval + PawnValueMidgame / 4 < beta
1448 && !check_is_dangerous(pos, move, futilityBase, beta, &bestValue))
1450 if (ss->eval + PawnValueMidgame / 4 > bestValue)
1451 bestValue = ss->eval + PawnValueMidgame / 4;
1456 // Check for legality only before to do the move
1457 if (!pos.pl_move_is_legal(move, ci.pinned))
1460 // Update current move
1461 ss->currentMove = move;
1463 // Make and search the move
1464 pos.do_move(move, st, ci, givesCheck);
1465 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth-ONE_PLY);
1466 pos.undo_move(move);
1468 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1471 if (value > bestValue)
1474 ss->bestMove = move;
1478 && value < beta) // We want always alpha < beta
1483 // All legal moves have been searched. A special case: If we're in check
1484 // and no legal moves were found, it is checkmate.
1485 if (inCheck && bestValue == -VALUE_INFINITE)
1486 return value_mated_in(ss->ply);
1488 // Update transposition table
1489 move = bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove;
1490 vt = bestValue <= oldAlpha ? VALUE_TYPE_UPPER
1491 : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT;
1493 TT.store(pos.get_key(), value_to_tt(bestValue, ss->ply), vt, ttDepth, move, ss->eval, evalMargin);
1495 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1501 // check_is_dangerous() tests if a checking move can be pruned in qsearch().
1502 // bestValue is updated only when returning false because in that case move
1505 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bestValue)
1507 Bitboard b, occ, oldAtt, newAtt, kingAtt;
1508 Square from, to, ksq, victimSq;
1511 Value futilityValue, bv = *bestValue;
1513 from = move_from(move);
1515 them = flip(pos.side_to_move());
1516 ksq = pos.king_square(them);
1517 kingAtt = pos.attacks_from<KING>(ksq);
1518 pc = pos.piece_on(from);
1520 occ = pos.occupied_squares() & ~(1ULL << from) & ~(1ULL << ksq);
1521 oldAtt = pos.attacks_from(pc, from, occ);
1522 newAtt = pos.attacks_from(pc, to, occ);
1524 // Rule 1. Checks which give opponent's king at most one escape square are dangerous
1525 b = kingAtt & ~pos.pieces(them) & ~newAtt & ~(1ULL << to);
1527 if (!(b && (b & (b - 1))))
1530 // Rule 2. Queen contact check is very dangerous
1531 if ( type_of(pc) == QUEEN
1532 && bit_is_set(kingAtt, to))
1535 // Rule 3. Creating new double threats with checks
1536 b = pos.pieces(them) & newAtt & ~oldAtt & ~(1ULL << ksq);
1540 victimSq = pop_1st_bit(&b);
1541 futilityValue = futilityBase + PieceValueEndgame[pos.piece_on(victimSq)];
1543 // Note that here we generate illegal "double move"!
1544 if ( futilityValue >= beta
1545 && pos.see_sign(make_move(from, victimSq)) >= 0)
1548 if (futilityValue > bv)
1552 // Update bestValue only if check is not dangerous (because we will prune the move)
1558 // connected_moves() tests whether two moves are 'connected' in the sense
1559 // that the first move somehow made the second move possible (for instance
1560 // if the moving piece is the same in both moves). The first move is assumed
1561 // to be the move that was made to reach the current position, while the
1562 // second move is assumed to be a move from the current position.
1564 bool connected_moves(const Position& pos, Move m1, Move m2) {
1566 Square f1, t1, f2, t2;
1573 // Case 1: The moving piece is the same in both moves
1579 // Case 2: The destination square for m2 was vacated by m1
1585 // Case 3: Moving through the vacated square
1586 p2 = pos.piece_on(f2);
1587 if ( piece_is_slider(p2)
1588 && bit_is_set(squares_between(f2, t2), f1))
1591 // Case 4: The destination square for m2 is defended by the moving piece in m1
1592 p1 = pos.piece_on(t1);
1593 if (bit_is_set(pos.attacks_from(p1, t1), t2))
1596 // Case 5: Discovered check, checking piece is the piece moved in m1
1597 ksq = pos.king_square(pos.side_to_move());
1598 if ( piece_is_slider(p1)
1599 && bit_is_set(squares_between(t1, ksq), f2))
1601 Bitboard occ = pos.occupied_squares();
1602 clear_bit(&occ, f2);
1603 if (bit_is_set(pos.attacks_from(p1, t1, occ), ksq))
1610 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1611 // "plies to mate from the current ply". Non-mate scores are unchanged.
1612 // The function is called before storing a value to the transposition table.
1614 Value value_to_tt(Value v, int ply) {
1616 if (v >= VALUE_MATE_IN_PLY_MAX)
1619 if (v <= VALUE_MATED_IN_PLY_MAX)
1626 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score from
1627 // the transposition table to a mate score corrected for the current ply.
1629 Value value_from_tt(Value v, int ply) {
1631 if (v >= VALUE_MATE_IN_PLY_MAX)
1634 if (v <= VALUE_MATED_IN_PLY_MAX)
1641 // connected_threat() tests whether it is safe to forward prune a move or if
1642 // is somehow connected to the threat move returned by null search.
1644 bool connected_threat(const Position& pos, Move m, Move threat) {
1647 assert(is_ok(threat));
1648 assert(!pos.is_capture_or_promotion(m));
1649 assert(!pos.is_passed_pawn_push(m));
1651 Square mfrom, mto, tfrom, tto;
1653 mfrom = move_from(m);
1655 tfrom = move_from(threat);
1656 tto = move_to(threat);
1658 // Case 1: Don't prune moves which move the threatened piece
1662 // Case 2: If the threatened piece has value less than or equal to the
1663 // value of the threatening piece, don't prune moves which defend it.
1664 if ( pos.is_capture(threat)
1665 && ( PieceValueMidgame[pos.piece_on(tfrom)] >= PieceValueMidgame[pos.piece_on(tto)]
1666 || type_of(pos.piece_on(tfrom)) == KING)
1667 && pos.move_attacks_square(m, tto))
1670 // Case 3: If the moving piece in the threatened move is a slider, don't
1671 // prune safe moves which block its ray.
1672 if ( piece_is_slider(pos.piece_on(tfrom))
1673 && bit_is_set(squares_between(tfrom, tto), mto)
1674 && pos.see_sign(m) >= 0)
1681 // can_return_tt() returns true if a transposition table score
1682 // can be used to cut-off at a given point in search.
1684 bool can_return_tt(const TTEntry* tte, Depth depth, Value beta, int ply) {
1686 Value v = value_from_tt(tte->value(), ply);
1688 return ( tte->depth() >= depth
1689 || v >= std::max(VALUE_MATE_IN_PLY_MAX, beta)
1690 || v < std::min(VALUE_MATED_IN_PLY_MAX, beta))
1692 && ( ((tte->type() & VALUE_TYPE_LOWER) && v >= beta)
1693 || ((tte->type() & VALUE_TYPE_UPPER) && v < beta));
1697 // refine_eval() returns the transposition table score if
1698 // possible otherwise falls back on static position evaluation.
1700 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
1704 Value v = value_from_tt(tte->value(), ply);
1706 if ( ((tte->type() & VALUE_TYPE_LOWER) && v >= defaultEval)
1707 || ((tte->type() & VALUE_TYPE_UPPER) && v < defaultEval))
1714 // update_history() registers a good move that produced a beta-cutoff
1715 // in history and marks as failures all the other moves of that ply.
1717 void update_history(const Position& pos, Move move, Depth depth,
1718 Move movesSearched[], int moveCount) {
1720 Value bonus = Value(int(depth) * int(depth));
1722 H.update(pos.piece_on(move_from(move)), move_to(move), bonus);
1724 for (int i = 0; i < moveCount - 1; i++)
1726 m = movesSearched[i];
1730 H.update(pos.piece_on(move_from(m)), move_to(m), -bonus);
1735 // current_search_time() returns the number of milliseconds which have passed
1736 // since the beginning of the current search.
1738 int elapsed_search_time(int set) {
1740 static int searchStartTime;
1743 searchStartTime = set;
1745 return get_system_time() - searchStartTime;
1749 // score_to_uci() converts a value to a string suitable for use with the UCI
1750 // protocol specifications:
1752 // cp <x> The score from the engine's point of view in centipawns.
1753 // mate <y> Mate in y moves, not plies. If the engine is getting mated
1754 // use negative values for y.
1756 string score_to_uci(Value v, Value alpha, Value beta) {
1758 std::stringstream s;
1760 if (abs(v) < VALUE_MATE - PLY_MAX * ONE_PLY)
1761 s << " score cp " << int(v) * 100 / int(PawnValueMidgame); // Scale to centipawns
1763 s << " score mate " << (v > 0 ? VALUE_MATE - v + 1 : -VALUE_MATE - v) / 2;
1765 s << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1771 // speed_to_uci() returns a string with time stats of current search suitable
1772 // to be sent to UCI gui.
1774 string speed_to_uci(int64_t nodes) {
1776 std::stringstream s;
1777 int t = elapsed_search_time();
1779 s << " nodes " << nodes
1780 << " nps " << (t > 0 ? int(nodes * 1000 / t) : 0)
1787 // pv_to_uci() returns a string with information on the current PV line
1788 // formatted according to UCI specification.
1790 string pv_to_uci(const Move pv[], int pvNum, bool chess960) {
1792 std::stringstream s;
1794 s << " multipv " << pvNum << " pv " << set960(chess960);
1796 for ( ; *pv != MOVE_NONE; pv++)
1803 // depth_to_uci() returns a string with information on the current depth and
1804 // seldepth formatted according to UCI specification.
1806 string depth_to_uci(Depth depth) {
1808 std::stringstream s;
1810 // Retrieve max searched depth among threads
1812 for (int i = 0; i < Threads.size(); i++)
1813 if (Threads[i].maxPly > selDepth)
1814 selDepth = Threads[i].maxPly;
1816 s << " depth " << depth / ONE_PLY << " seldepth " << selDepth;
1821 string time_to_string(int millisecs) {
1823 const int MSecMinute = 1000 * 60;
1824 const int MSecHour = 1000 * 60 * 60;
1826 int hours = millisecs / MSecHour;
1827 int minutes = (millisecs % MSecHour) / MSecMinute;
1828 int seconds = ((millisecs % MSecHour) % MSecMinute) / 1000;
1830 std::stringstream s;
1835 s << std::setfill('0') << std::setw(2) << minutes << ':' << std::setw(2) << seconds;
1839 string score_to_string(Value v) {
1841 std::stringstream s;
1843 if (v >= VALUE_MATE_IN_PLY_MAX)
1844 s << "#" << (VALUE_MATE - v + 1) / 2;
1845 else if (v <= VALUE_MATED_IN_PLY_MAX)
1846 s << "-#" << (VALUE_MATE + v) / 2;
1848 s << std::setprecision(2) << std::fixed << std::showpos << float(v) / PawnValueMidgame;
1854 // pretty_pv() creates a human-readable string from a position and a PV.
1855 // It is used to write search information to the log file (which is created
1856 // when the UCI parameter "Use Search Log" is "true").
1858 string pretty_pv(Position& pos, int depth, Value value, int time, Move pv[]) {
1860 const int64_t K = 1000;
1861 const int64_t M = 1000000;
1862 const int startColumn = 28;
1863 const size_t maxLength = 80 - startColumn;
1865 StateInfo state[PLY_MAX_PLUS_2], *st = state;
1868 std::stringstream s;
1871 // First print depth, score, time and searched nodes...
1872 s << set960(pos.is_chess960())
1873 << std::setw(2) << depth
1874 << std::setw(8) << score_to_string(value)
1875 << std::setw(8) << time_to_string(time);
1877 if (pos.nodes_searched() < M)
1878 s << std::setw(8) << pos.nodes_searched() / 1 << " ";
1879 else if (pos.nodes_searched() < K * M)
1880 s << std::setw(7) << pos.nodes_searched() / K << "K ";
1882 s << std::setw(7) << pos.nodes_searched() / M << "M ";
1884 // ...then print the full PV line in short algebraic notation
1885 while (*m != MOVE_NONE)
1887 san = move_to_san(pos, *m);
1888 length += san.length() + 1;
1890 if (length > maxLength)
1892 length = san.length() + 1;
1893 s << "\n" + string(startColumn, ' ');
1897 pos.do_move(*m++, *st++);
1900 // Restore original position before to leave
1901 while (m != pv) pos.undo_move(*--m);
1907 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
1908 // while the program is pondering. The point is to work around a wrinkle in
1909 // the UCI protocol: When pondering, the engine is not allowed to give a
1910 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
1911 // We simply wait here until one of these commands (that raise StopRequest) is
1912 // sent, and return, after which the bestmove and pondermove will be printed.
1914 void wait_for_stop_or_ponderhit() {
1917 StopOnPonderhit = true;
1919 while (!StopRequest)
1921 Threads.getline(cmd);
1922 do_uci_async_cmd(cmd);
1927 // When playing with strength handicap choose best move among the MultiPV set
1928 // using a statistical rule dependent on SkillLevel. Idea by Heinz van Saanen.
1930 void do_skill_level(Move* best, Move* ponder) {
1932 assert(MultiPV > 1);
1936 // Rml list is already sorted by score in descending order
1938 int max_s = -VALUE_INFINITE;
1939 int size = std::min(MultiPV, (int)Rml.size());
1940 int max = Rml[0].score;
1941 int var = std::min(max - Rml[size - 1].score, int(PawnValueMidgame));
1942 int wk = 120 - 2 * SkillLevel;
1944 // PRNG sequence should be non deterministic
1945 for (int i = abs(get_system_time() % 50); i > 0; i--)
1946 rk.rand<unsigned>();
1948 // Choose best move. For each move's score we add two terms both dependent
1949 // on wk, one deterministic and bigger for weaker moves, and one random,
1950 // then we choose the move with the resulting highest score.
1951 for (int i = 0; i < size; i++)
1955 // Don't allow crazy blunders even at very low skills
1956 if (i > 0 && Rml[i-1].score > s + EasyMoveMargin)
1959 // This is our magical formula
1960 s += ((max - s) * wk + var * (rk.rand<unsigned>() % wk)) / 128;
1965 *best = Rml[i].pv[0];
1966 *ponder = Rml[i].pv[1];
1972 /// RootMove and RootMoveList method's definitions
1974 void RootMoveList::init(Position& pos, Move searchMoves[]) {
1977 bestMoveChanges = 0;
1980 // Generate all legal moves and add them to RootMoveList
1981 for (MoveList<MV_LEGAL> ml(pos); !ml.end(); ++ml)
1983 // If we have a searchMoves[] list then verify the move
1984 // is in the list before to add it.
1985 for (sm = searchMoves; *sm && *sm != ml.move(); sm++) {}
1987 if (sm != searchMoves && *sm != ml.move())
1991 rm.pv.push_back(ml.move());
1992 rm.pv.push_back(MOVE_NONE);
1993 rm.score = rm.prevScore = -VALUE_INFINITE;
1999 RootMove* RootMoveList::find(const Move& m, int startIndex) {
2001 for (size_t i = startIndex; i < size(); i++)
2002 if ((*this)[i].pv[0] == m)
2009 // extract_pv_from_tt() builds a PV by adding moves from the transposition table.
2010 // We consider also failing high nodes and not only VALUE_TYPE_EXACT nodes. This
2011 // allow to always have a ponder move even when we fail high at root and also a
2012 // long PV to print that is important for position analysis.
2014 void RootMove::extract_pv_from_tt(Position& pos) {
2016 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2021 assert(m != MOVE_NONE && pos.is_pseudo_legal(m));
2025 pos.do_move(m, *st++);
2027 while ( (tte = TT.probe(pos.get_key())) != NULL
2028 && tte->move() != MOVE_NONE
2029 && pos.is_pseudo_legal(tte->move())
2030 && pos.pl_move_is_legal(tte->move(), pos.pinned_pieces())
2032 && (!pos.is_draw<false>() || ply < 2))
2034 pv.push_back(tte->move());
2035 pos.do_move(tte->move(), *st++);
2038 pv.push_back(MOVE_NONE);
2040 do pos.undo_move(pv[--ply]); while (ply);
2044 // insert_pv_in_tt() is called at the end of a search iteration, and inserts
2045 // the PV back into the TT. This makes sure the old PV moves are searched
2046 // first, even if the old TT entries have been overwritten.
2048 void RootMove::insert_pv_in_tt(Position& pos) {
2050 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2053 Value v, m = VALUE_NONE;
2056 assert(pv[0] != MOVE_NONE && pos.is_pseudo_legal(pv[0]));
2062 // Don't overwrite existing correct entries
2063 if (!tte || tte->move() != pv[ply])
2065 v = (pos.in_check() ? VALUE_NONE : evaluate(pos, m));
2066 TT.store(k, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, pv[ply], v, m);
2068 pos.do_move(pv[ply], *st++);
2070 } while (pv[++ply] != MOVE_NONE);
2072 do pos.undo_move(pv[--ply]); while (ply);
2078 // Thread::idle_loop() is where the thread is parked when it has no work to do.
2079 // The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint object
2080 // for which the thread is the master.
2082 void Thread::idle_loop(SplitPoint* sp) {
2086 // If we are not searching, wait for a condition to be signaled
2087 // instead of wasting CPU time polling for work.
2090 || (Threads.use_sleeping_threads() && !is_searching))
2092 assert((!sp && threadID) || Threads.use_sleeping_threads());
2094 // Slave thread should exit as soon as do_terminate flag raises
2101 // Grab the lock to avoid races with Thread::wake_up()
2102 lock_grab(&sleepLock);
2104 // If we are master and all slaves have finished don't go to sleep
2105 if (sp && Threads.split_point_finished(sp))
2107 lock_release(&sleepLock);
2111 // Do sleep after retesting sleep conditions under lock protection, in
2112 // particular we need to avoid a deadlock in case a master thread has,
2113 // in the meanwhile, allocated us and sent the wake_up() call before we
2114 // had the chance to grab the lock.
2115 if (do_sleep || !is_searching)
2116 cond_wait(&sleepCond, &sleepLock);
2118 lock_release(&sleepLock);
2121 // If this thread has been assigned work, launch a search
2124 assert(!do_terminate);
2126 // Copy split point position and search stack and call search()
2127 SearchStack ss[PLY_MAX_PLUS_2];
2128 SplitPoint* tsp = splitPoint;
2129 Position pos(*tsp->pos, threadID);
2131 memcpy(ss, tsp->ss - 1, 4 * sizeof(SearchStack));
2134 if (tsp->nodeType == Root)
2135 search<SplitPointRoot>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2136 else if (tsp->nodeType == PV)
2137 search<SplitPointPV>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2138 else if (tsp->nodeType == NonPV)
2139 search<SplitPointNonPV>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2143 assert(is_searching);
2145 is_searching = false;
2147 // Wake up master thread so to allow it to return from the idle loop in
2148 // case we are the last slave of the split point.
2149 if ( Threads.use_sleeping_threads()
2150 && threadID != tsp->master
2151 && !Threads[tsp->master].is_searching)
2152 Threads[tsp->master].wake_up();
2155 // If this thread is the master of a split point and all slaves have
2156 // finished their work at this split point, return from the idle loop.
2157 if (sp && Threads.split_point_finished(sp))
2159 // Because sp->is_slave[] is reset under lock protection,
2160 // be sure sp->lock has been released before to return.
2161 lock_grab(&(sp->lock));
2162 lock_release(&(sp->lock));
2169 // do_uci_async_cmd() is called by listener thread when in async mode and 'cmd'
2170 // input line is received from the GUI.
2172 void do_uci_async_cmd(const std::string& cmd) {
2175 QuitRequest = StopRequest = true;
2177 else if (cmd == "stop")
2180 else if (cmd == "ponderhit")
2182 // The opponent has played the expected move. GUI sends "ponderhit" if
2183 // we were told to ponder on the same move the opponent has played. We
2184 // should continue searching but switching from pondering to normal search.
2185 Limits.ponder = false;
2187 if (StopOnPonderhit)
2193 // do_timer_event() is called by the timer thread when the timer triggers
2195 void do_timer_event() {
2197 static int lastInfoTime;
2198 int e = elapsed_search_time();
2200 // Print debug information every second
2201 if (get_system_time() - lastInfoTime >= 1000)
2203 lastInfoTime = get_system_time();
2206 dbg_print_hit_rate();
2209 // Should we stop the search?
2213 bool stillAtFirstMove = FirstRootMove
2214 && !AspirationFailLow
2215 && e > TimeMgr.available_time();
2217 bool noMoreTime = e > TimeMgr.maximum_time()
2218 || stillAtFirstMove;
2220 if ( (Limits.useTimeManagement() && noMoreTime)
2221 || (Limits.maxTime && e >= Limits.maxTime)
2222 /* missing nodes limit */ ) // FIXME