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[Max(d, 1)][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][Min(d / ONE_PLY, 63)][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, MultiPVIteration;
164 // Time management variables
165 bool StopOnPonderhit, FirstRootMove, StopRequest, QuitRequest, AspirationFailLow;
170 std::ofstream LogFile;
172 // Skill level adjustment
174 bool SkillLevelEnabled;
176 // Node counters, used only by thread[0] but try to keep in different cache
177 // lines (64 bytes each) from the heavy multi-thread read accessed variables.
179 int NodesBetweenPolls = 30000;
187 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove);
189 template <NodeType NT>
190 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth);
192 template <NodeType NT>
193 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth);
195 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bValue);
196 bool connected_moves(const Position& pos, Move m1, Move m2);
197 Value value_to_tt(Value v, int ply);
198 Value value_from_tt(Value v, int ply);
199 bool can_return_tt(const TTEntry* tte, Depth depth, Value beta, int ply);
200 bool connected_threat(const Position& pos, Move m, Move threat);
201 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply);
202 void update_history(const Position& pos, Move move, Depth depth, Move movesSearched[], int moveCount);
203 void update_gains(const Position& pos, Move move, Value before, Value after);
204 void do_skill_level(Move* best, Move* ponder);
206 int current_search_time(int set = 0);
207 string score_to_uci(Value v, Value alpha = -VALUE_INFINITE, Value beta = VALUE_INFINITE);
208 string speed_to_uci(int64_t nodes);
209 string pv_to_uci(const Move pv[], int pvNum, bool chess960);
210 string pretty_pv(Position& pos, int depth, Value score, int time, Move pv[]);
211 string depth_to_uci(Depth depth);
212 void poll(const Position& pos);
213 void wait_for_stop_or_ponderhit();
215 // MovePickerExt template class extends MovePicker and allows to choose at compile
216 // time the proper moves source according to the type of node. In the default case
217 // we simply create and use a standard MovePicker object.
218 template<bool SpNode> struct MovePickerExt : public MovePicker {
220 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
221 : MovePicker(p, ttm, d, h, ss, b) {}
224 // In case of a SpNode we use split point's shared MovePicker object as moves source
225 template<> struct MovePickerExt<true> : public MovePicker {
227 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
228 : MovePicker(p, ttm, d, h, ss, b), mp(ss->sp->mp) {}
230 Move get_next_move() { return mp->get_next_move(); }
234 // Overload operator<<() to make it easier to print moves in a coordinate
235 // notation compatible with UCI protocol.
236 std::ostream& operator<<(std::ostream& os, Move m) {
238 bool chess960 = (os.iword(0) != 0); // See set960()
239 return os << move_to_uci(m, chess960);
242 // When formatting a move for std::cout we must know if we are in Chess960
243 // or not. To keep using the handy operator<<() on the move the trick is to
244 // embed this flag in the stream itself. Function-like named enum set960 is
245 // used as a custom manipulator and the stream internal general-purpose array,
246 // accessed through ios_base::iword(), is used to pass the flag to the move's
247 // operator<<() that will read it to properly format castling moves.
250 std::ostream& operator<< (std::ostream& os, const set960& f) {
252 os.iword(0) = int(f);
256 // extension() decides whether a move should be searched with normal depth,
257 // or with extended depth. Certain classes of moves (checking moves, in
258 // particular) are searched with bigger depth than ordinary moves and in
259 // any case are marked as 'dangerous'. Note that also if a move is not
260 // extended, as example because the corresponding UCI option is set to zero,
261 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
262 template <bool PvNode>
263 FORCE_INLINE Depth extension(const Position& pos, Move m, bool captureOrPromotion,
264 bool moveIsCheck, bool* dangerous) {
265 assert(m != MOVE_NONE);
267 Depth result = DEPTH_ZERO;
268 *dangerous = moveIsCheck;
270 if (moveIsCheck && pos.see_sign(m) >= 0)
271 result += CheckExtension[PvNode];
273 if (type_of(pos.piece_on(move_from(m))) == PAWN)
275 Color c = pos.side_to_move();
276 if (relative_rank(c, move_to(m)) == RANK_7)
278 result += PawnPushTo7thExtension[PvNode];
281 if (pos.pawn_is_passed(c, move_to(m)))
283 result += PassedPawnExtension[PvNode];
288 if ( captureOrPromotion
289 && type_of(pos.piece_on(move_to(m))) != PAWN
290 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
291 - piece_value_midgame(pos.piece_on(move_to(m))) == VALUE_ZERO)
292 && !move_is_special(m))
294 result += PawnEndgameExtension[PvNode];
298 return Min(result, ONE_PLY);
304 /// init_search() is called during startup to initialize various lookup tables
308 int d; // depth (ONE_PLY == 2)
309 int hd; // half depth (ONE_PLY == 1)
312 // Init reductions array
313 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
315 double pvRed = log(double(hd)) * log(double(mc)) / 3.0;
316 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
317 Reductions[1][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
318 Reductions[0][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
321 // Init futility margins array
322 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
323 FutilityMargins[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
325 // Init futility move count array
326 for (d = 0; d < 32; d++)
327 FutilityMoveCounts[d] = int(3.001 + 0.25 * pow(d, 2.0));
331 /// perft() is our utility to verify move generation. All the leaf nodes up to
332 /// the given depth are generated and counted and the sum returned.
334 int64_t perft(Position& pos, Depth depth) {
339 // Generate all legal moves
340 MoveList<MV_LEGAL> ml(pos);
342 // If we are at the last ply we don't need to do and undo
343 // the moves, just to count them.
344 if (depth <= ONE_PLY)
347 // Loop through all legal moves
349 for ( ; !ml.end(); ++ml)
351 pos.do_move(ml.move(), st, ci, pos.move_gives_check(ml.move(), ci));
352 sum += perft(pos, depth - ONE_PLY);
353 pos.undo_move(ml.move());
359 /// think() is the external interface to Stockfish's search, and is called when
360 /// the program receives the UCI 'go' command. It initializes various global
361 /// variables, and calls id_loop(). It returns false when a "quit" command is
362 /// received during the search.
364 bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]) {
366 static Book book; // Define static to initialize the PRNG only once
368 // Initialize global search-related variables
369 StopOnPonderhit = StopRequest = QuitRequest = AspirationFailLow = false;
371 current_search_time(get_system_time());
373 TimeMgr.init(Limits, pos.startpos_ply_counter());
375 // Set output steram in normal or chess960 mode
376 cout << set960(pos.is_chess960());
378 // Set best NodesBetweenPolls interval to avoid lagging under time pressure
380 NodesBetweenPolls = Min(Limits.maxNodes, 30000);
381 else if (Limits.time && Limits.time < 1000)
382 NodesBetweenPolls = 1000;
383 else if (Limits.time && Limits.time < 5000)
384 NodesBetweenPolls = 5000;
386 NodesBetweenPolls = 30000;
388 // Look for a book move
389 if (Options["OwnBook"].value<bool>())
391 if (Options["Book File"].value<string>() != book.name())
392 book.open(Options["Book File"].value<string>());
394 Move bookMove = book.probe(pos, Options["Best Book Move"].value<bool>());
395 if (bookMove != MOVE_NONE)
398 wait_for_stop_or_ponderhit();
400 cout << "bestmove " << bookMove << endl;
406 UCIMultiPV = Options["MultiPV"].value<int>();
407 SkillLevel = Options["Skill Level"].value<int>();
409 read_evaluation_uci_options(pos.side_to_move());
410 Threads.read_uci_options();
412 // Set a new TT size if changed
413 TT.set_size(Options["Hash"].value<int>());
415 if (Options["Clear Hash"].value<bool>())
417 Options["Clear Hash"].set_value("false");
421 // Do we have to play with skill handicap? In this case enable MultiPV that
422 // we will use behind the scenes to retrieve a set of possible moves.
423 SkillLevelEnabled = (SkillLevel < 20);
424 MultiPV = (SkillLevelEnabled ? Max(UCIMultiPV, 4) : UCIMultiPV);
426 // Wake up needed threads and reset maxPly counter
427 for (int i = 0; i < Threads.size(); i++)
429 Threads[i].wake_up();
430 Threads[i].maxPly = 0;
433 // Write to log file and keep it open to be accessed during the search
434 if (Options["Use Search Log"].value<bool>())
436 string name = Options["Search Log Filename"].value<string>();
437 LogFile.open(name.c_str(), std::ios::out | std::ios::app);
439 if (LogFile.is_open())
440 LogFile << "\nSearching: " << pos.to_fen()
441 << "\ninfinite: " << Limits.infinite
442 << " ponder: " << Limits.ponder
443 << " time: " << Limits.time
444 << " increment: " << Limits.increment
445 << " moves to go: " << Limits.movesToGo
449 // We're ready to start thinking. Call the iterative deepening loop function
450 Move ponderMove = MOVE_NONE;
451 Move bestMove = id_loop(pos, searchMoves, &ponderMove);
453 // Write final search statistics and close log file
454 if (LogFile.is_open())
456 int t = current_search_time();
458 LogFile << "Nodes: " << pos.nodes_searched()
459 << "\nNodes/second: " << (t > 0 ? pos.nodes_searched() * 1000 / t : 0)
460 << "\nBest move: " << move_to_san(pos, bestMove);
463 pos.do_move(bestMove, st);
464 LogFile << "\nPonder move: " << move_to_san(pos, ponderMove) << endl;
465 pos.undo_move(bestMove); // Return from think() with unchanged position
469 // This makes all the threads to go to sleep
472 // If we are pondering or in infinite search, we shouldn't print the
473 // best move before we are told to do so.
474 if (!StopRequest && (Limits.ponder || Limits.infinite))
475 wait_for_stop_or_ponderhit();
477 // Could be MOVE_NONE when searching on a stalemate position
478 cout << "bestmove " << bestMove;
480 // UCI protol is not clear on allowing sending an empty ponder move, instead
481 // it is clear that ponder move is optional. So skip it if empty.
482 if (ponderMove != MOVE_NONE)
483 cout << " ponder " << ponderMove;
493 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
494 // with increasing depth until the allocated thinking time has been consumed,
495 // user stops the search, or the maximum search depth is reached.
497 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove) {
499 SearchStack ss[PLY_MAX_PLUS_2];
500 Value bestValues[PLY_MAX_PLUS_2];
501 int bestMoveChanges[PLY_MAX_PLUS_2];
502 int depth, aspirationDelta;
503 Value value, alpha, beta;
504 Move bestMove, easyMove, skillBest, skillPonder;
506 // Initialize stuff before a new search
507 memset(ss, 0, 4 * sizeof(SearchStack));
510 *ponderMove = bestMove = easyMove = skillBest = skillPonder = MOVE_NONE;
511 depth = aspirationDelta = 0;
512 value = alpha = -VALUE_INFINITE, beta = VALUE_INFINITE;
513 ss->currentMove = MOVE_NULL; // Hack to skip update_gains()
515 // Moves to search are verified and copied
516 Rml.init(pos, searchMoves);
518 // Handle special case of searching on a mate/stalemate position
521 cout << "info" << depth_to_uci(DEPTH_ZERO)
522 << score_to_uci(pos.in_check() ? -VALUE_MATE : VALUE_DRAW, alpha, beta) << endl;
527 // Iterative deepening loop until requested to stop or target depth reached
528 while (!StopRequest && ++depth <= PLY_MAX && (!Limits.maxDepth || depth <= Limits.maxDepth))
530 // Save last iteration's scores, this needs to be done now, because in
531 // the following MultiPV loop Rml moves could be reordered.
532 for (size_t i = 0; i < Rml.size(); i++)
533 Rml[i].prevScore = Rml[i].score;
535 Rml.bestMoveChanges = 0;
537 // MultiPV iteration loop
538 for (MultiPVIteration = 0; MultiPVIteration < Min(MultiPV, (int)Rml.size()); MultiPVIteration++)
540 // Calculate dynamic aspiration window based on previous iterations
541 if (depth >= 5 && abs(Rml[MultiPVIteration].prevScore) < VALUE_KNOWN_WIN)
543 int prevDelta1 = bestValues[depth - 1] - bestValues[depth - 2];
544 int prevDelta2 = bestValues[depth - 2] - bestValues[depth - 3];
546 aspirationDelta = Min(Max(abs(prevDelta1) + abs(prevDelta2) / 2, 16), 24);
547 aspirationDelta = (aspirationDelta + 7) / 8 * 8; // Round to match grainSize
549 alpha = Max(Rml[MultiPVIteration].prevScore - aspirationDelta, -VALUE_INFINITE);
550 beta = Min(Rml[MultiPVIteration].prevScore + aspirationDelta, VALUE_INFINITE);
554 alpha = -VALUE_INFINITE;
555 beta = VALUE_INFINITE;
558 // Start with a small aspiration window and, in case of fail high/low,
559 // research with bigger window until not failing high/low anymore.
561 // Search starting from ss+1 to allow referencing (ss-1). This is
562 // needed by update_gains() and ss copy when splitting at Root.
563 value = search<Root>(pos, ss+1, alpha, beta, depth * ONE_PLY);
565 // It is critical that sorting is done with a stable algorithm
566 // because all the values but the first are usually set to
567 // -VALUE_INFINITE and we want to keep the same order for all
568 // the moves but the new PV that goes to head.
569 sort<RootMove>(Rml.begin() + MultiPVIteration, Rml.end());
571 // In case we have found an exact score reorder the PV moves
572 // before leaving the fail high/low loop, otherwise leave the
573 // last PV move in its position so to be searched again.
574 if (value > alpha && value < beta)
575 sort<RootMove>(Rml.begin(), Rml.begin() + MultiPVIteration);
577 // Write PV back to transposition table in case the relevant entries
578 // have been overwritten during the search.
579 for (int i = 0; i <= MultiPVIteration; i++)
580 Rml[i].insert_pv_in_tt(pos);
582 // Value cannot be trusted. Break out immediately!
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.
588 if ((value > alpha && value < beta) || current_search_time() > 2000)
589 for (int i = 0; i < Min(UCIMultiPV, MultiPVIteration + 1); i++)
591 << depth_to_uci(depth * ONE_PLY)
592 << (i == MultiPVIteration ? score_to_uci(Rml[i].score, alpha, beta) :
593 score_to_uci(Rml[i].score))
594 << speed_to_uci(pos.nodes_searched())
595 << pv_to_uci(&Rml[i].pv[0], i + 1, pos.is_chess960())
598 // In case of failing high/low increase aspiration window and research,
599 // otherwise exit the fail high/low loop.
602 beta = Min(beta + aspirationDelta, VALUE_INFINITE);
603 aspirationDelta += aspirationDelta / 2;
605 else if (value <= alpha)
607 AspirationFailLow = true;
608 StopOnPonderhit = false;
610 alpha = Max(alpha - aspirationDelta, -VALUE_INFINITE);
611 aspirationDelta += aspirationDelta / 2;
616 } while (abs(value) < VALUE_KNOWN_WIN);
619 // Collect info about search result
620 bestMove = Rml[0].pv[0];
621 *ponderMove = Rml[0].pv[1];
622 bestValues[depth] = value;
623 bestMoveChanges[depth] = Rml.bestMoveChanges;
625 // Do we need to pick now the best and the ponder moves ?
626 if (SkillLevelEnabled && depth == 1 + SkillLevel)
627 do_skill_level(&skillBest, &skillPonder);
629 if (LogFile.is_open())
630 LogFile << pretty_pv(pos, depth, value, current_search_time(), &Rml[0].pv[0]) << endl;
632 // Init easyMove after first iteration or drop if differs from the best move
633 if (depth == 1 && (Rml.size() == 1 || Rml[0].score > Rml[1].score + EasyMoveMargin))
635 else if (bestMove != easyMove)
636 easyMove = MOVE_NONE;
638 // Check for some early stop condition
639 if (!StopRequest && Limits.useTimeManagement())
641 // Stop search early if one move seems to be much better than the
642 // others or if there is only a single legal move. Also in the latter
643 // case we search up to some depth anyway to get a proper score.
645 && easyMove == bestMove
647 ||( Rml[0].nodes > (pos.nodes_searched() * 85) / 100
648 && current_search_time() > TimeMgr.available_time() / 16)
649 ||( Rml[0].nodes > (pos.nodes_searched() * 98) / 100
650 && current_search_time() > TimeMgr.available_time() / 32)))
653 // Take in account some extra time if the best move has changed
654 if (depth > 4 && depth < 50)
655 TimeMgr.pv_instability(bestMoveChanges[depth], bestMoveChanges[depth - 1]);
657 // Stop search if most of available time is already consumed. We probably don't
658 // have enough time to search the first move at the next iteration anyway.
659 if (current_search_time() > (TimeMgr.available_time() * 62) / 100)
662 // If we are allowed to ponder do not stop the search now but keep pondering
663 if (StopRequest && Limits.ponder)
666 StopOnPonderhit = true;
671 // When using skills overwrite best and ponder moves with the sub-optimal ones
672 if (SkillLevelEnabled)
674 if (skillBest == MOVE_NONE) // Still unassigned ?
675 do_skill_level(&skillBest, &skillPonder);
677 bestMove = skillBest;
678 *ponderMove = skillPonder;
685 // search<>() is the main search function for both PV and non-PV nodes and for
686 // normal and SplitPoint nodes. When called just after a split point the search
687 // is simpler because we have already probed the hash table, done a null move
688 // search, and searched the first move before splitting, we don't have to repeat
689 // all this work again. We also don't need to store anything to the hash table
690 // here: This is taken care of after we return from the split point.
692 template <NodeType NT>
693 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth) {
695 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV || NT == SplitPointRoot);
696 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV || NT == SplitPointRoot);
697 const bool RootNode = (NT == Root || NT == SplitPointRoot);
699 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
700 assert(beta > alpha && beta <= VALUE_INFINITE);
701 assert(PvNode || alpha == beta - 1);
702 assert(pos.thread() >= 0 && pos.thread() < Threads.size());
704 Move movesSearched[MAX_MOVES];
709 Move ttMove, move, excludedMove, threatMove;
712 Value bestValue, value, oldAlpha;
713 Value refinedValue, nullValue, futilityBase, futilityValue;
714 bool isPvMove, inCheck, singularExtensionNode, givesCheck, captureOrPromotion, dangerous;
715 int moveCount = 0, playedMoveCount = 0;
716 Thread& thread = Threads[pos.thread()];
717 SplitPoint* sp = NULL;
719 refinedValue = bestValue = value = -VALUE_INFINITE;
721 inCheck = pos.in_check();
722 ss->ply = (ss-1)->ply + 1;
724 // Used to send selDepth info to GUI
725 if (PvNode && thread.maxPly < ss->ply)
726 thread.maxPly = ss->ply;
728 // Step 1. Initialize node and poll. Polling can abort search
731 ss->currentMove = ss->bestMove = threatMove = (ss+1)->excludedMove = MOVE_NONE;
732 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
733 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
739 ttMove = excludedMove = MOVE_NONE;
740 threatMove = sp->threatMove;
741 goto split_point_start;
744 if (pos.thread() == 0 && ++NodesSincePoll > NodesBetweenPolls)
750 // Step 2. Check for aborted search and immediate draw
752 || pos.is_draw<false>()
753 || ss->ply > PLY_MAX) && !RootNode)
756 // Step 3. Mate distance pruning
759 alpha = Max(value_mated_in(ss->ply), alpha);
760 beta = Min(value_mate_in(ss->ply+1), beta);
765 // Step 4. Transposition table lookup
766 // We don't want the score of a partial search to overwrite a previous full search
767 // TT value, so we use a different position key in case of an excluded move.
768 excludedMove = ss->excludedMove;
769 posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
770 tte = TT.probe(posKey);
771 ttMove = RootNode ? Rml[MultiPVIteration].pv[0] : tte ? tte->move() : MOVE_NONE;
773 // At PV nodes we check for exact scores, while at non-PV nodes we check for
774 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
775 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
776 // we should also update RootMoveList to avoid bogus output.
777 if (!RootNode && tte && (PvNode ? tte->depth() >= depth && tte->type() == VALUE_TYPE_EXACT
778 : can_return_tt(tte, depth, beta, ss->ply)))
781 ss->bestMove = move = ttMove; // Can be MOVE_NONE
782 value = value_from_tt(tte->value(), ss->ply);
786 && !pos.move_is_capture_or_promotion(move)
787 && move != ss->killers[0])
789 ss->killers[1] = ss->killers[0];
790 ss->killers[0] = move;
795 // Step 5. Evaluate the position statically and update parent's gain statistics
797 ss->eval = ss->evalMargin = VALUE_NONE;
800 assert(tte->static_value() != VALUE_NONE);
802 ss->eval = tte->static_value();
803 ss->evalMargin = tte->static_value_margin();
804 refinedValue = refine_eval(tte, ss->eval, ss->ply);
808 refinedValue = ss->eval = evaluate(pos, ss->evalMargin);
809 TT.store(posKey, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, MOVE_NONE, ss->eval, ss->evalMargin);
812 // Save gain for the parent non-capture move
813 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
815 // Step 6. Razoring (is omitted in PV nodes)
817 && depth < RazorDepth
819 && refinedValue + razor_margin(depth) < beta
820 && ttMove == MOVE_NONE
821 && abs(beta) < VALUE_MATE_IN_PLY_MAX
822 && !pos.has_pawn_on_7th(pos.side_to_move()))
824 Value rbeta = beta - razor_margin(depth);
825 Value v = qsearch<NonPV>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
827 // Logically we should return (v + razor_margin(depth)), but
828 // surprisingly this did slightly weaker in tests.
832 // Step 7. Static null move pruning (is omitted in PV nodes)
833 // We're betting that the opponent doesn't have a move that will reduce
834 // the score by more than futility_margin(depth) if we do a null move.
837 && depth < RazorDepth
839 && refinedValue - futility_margin(depth, 0) >= beta
840 && abs(beta) < VALUE_MATE_IN_PLY_MAX
841 && pos.non_pawn_material(pos.side_to_move()))
842 return refinedValue - futility_margin(depth, 0);
844 // Step 8. Null move search with verification search (is omitted in PV nodes)
849 && refinedValue >= beta
850 && abs(beta) < VALUE_MATE_IN_PLY_MAX
851 && pos.non_pawn_material(pos.side_to_move()))
853 ss->currentMove = MOVE_NULL;
855 // Null move dynamic reduction based on depth
856 int R = 3 + (depth >= 5 * ONE_PLY ? depth / 8 : 0);
858 // Null move dynamic reduction based on value
859 if (refinedValue - PawnValueMidgame > beta)
862 pos.do_null_move(st);
863 (ss+1)->skipNullMove = true;
864 nullValue = depth-R*ONE_PLY < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
865 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R*ONE_PLY);
866 (ss+1)->skipNullMove = false;
867 pos.undo_null_move();
869 if (nullValue >= beta)
871 // Do not return unproven mate scores
872 if (nullValue >= VALUE_MATE_IN_PLY_MAX)
875 if (depth < 6 * ONE_PLY)
878 // Do verification search at high depths
879 ss->skipNullMove = true;
880 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R*ONE_PLY);
881 ss->skipNullMove = false;
888 // The null move failed low, which means that we may be faced with
889 // some kind of threat. If the previous move was reduced, check if
890 // the move that refuted the null move was somehow connected to the
891 // move which was reduced. If a connection is found, return a fail
892 // low score (which will cause the reduced move to fail high in the
893 // parent node, which will trigger a re-search with full depth).
894 threatMove = (ss+1)->bestMove;
896 if ( depth < ThreatDepth
898 && threatMove != MOVE_NONE
899 && connected_moves(pos, (ss-1)->currentMove, threatMove))
904 // Step 9. ProbCut (is omitted in PV nodes)
905 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
906 // and a reduced search returns a value much above beta, we can (almost) safely
907 // prune the previous move.
909 && depth >= RazorDepth + ONE_PLY
912 && excludedMove == MOVE_NONE
913 && abs(beta) < VALUE_MATE_IN_PLY_MAX)
915 Value rbeta = beta + 200;
916 Depth rdepth = depth - ONE_PLY - 3 * ONE_PLY;
918 assert(rdepth >= ONE_PLY);
920 MovePicker mp(pos, ttMove, H, pos.captured_piece_type());
923 while ((move = mp.get_next_move()) != MOVE_NONE)
924 if (pos.pl_move_is_legal(move, ci.pinned))
926 pos.do_move(move, st, ci, pos.move_gives_check(move, ci));
927 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth);
934 // Step 10. Internal iterative deepening
935 if ( depth >= IIDDepth[PvNode]
936 && ttMove == MOVE_NONE
937 && (PvNode || (!inCheck && ss->eval + IIDMargin >= beta)))
939 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
941 ss->skipNullMove = true;
942 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d);
943 ss->skipNullMove = false;
945 tte = TT.probe(posKey);
946 ttMove = tte ? tte->move() : MOVE_NONE;
949 split_point_start: // At split points actual search starts from here
951 // Initialize a MovePicker object for the current position
952 MovePickerExt<SpNode> mp(pos, ttMove, depth, H, ss, PvNode ? -VALUE_INFINITE : beta);
954 ss->bestMove = MOVE_NONE;
955 futilityBase = ss->eval + ss->evalMargin;
956 singularExtensionNode = !RootNode
958 && depth >= SingularExtensionDepth[PvNode]
959 && ttMove != MOVE_NONE
960 && !excludedMove // Do not allow recursive singular extension search
961 && (tte->type() & VALUE_TYPE_LOWER)
962 && tte->depth() >= depth - 3 * ONE_PLY;
965 lock_grab(&(sp->lock));
966 bestValue = sp->bestValue;
969 // Step 11. Loop through moves
970 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
971 while ( bestValue < beta
972 && (move = mp.get_next_move()) != MOVE_NONE
973 && !thread.cutoff_occurred())
975 assert(move_is_ok(move));
977 if (move == excludedMove)
980 // At root obey the "searchmoves" option and skip moves not listed in Root Move List.
981 // Also in MultiPV mode we skip moves which already have got an exact score
982 // in previous MultiPV Iteration. Finally any illegal move is skipped here.
983 if (RootNode && !Rml.find(move, MultiPVIteration))
986 // At PV and SpNode nodes we want all moves to be legal since the beginning
987 if ((PvNode || SpNode) && !pos.pl_move_is_legal(move, ci.pinned))
992 moveCount = ++sp->moveCount;
993 lock_release(&(sp->lock));
1000 // This is used by time management
1001 FirstRootMove = (moveCount == 1);
1003 // Save the current node count before the move is searched
1004 nodes = pos.nodes_searched();
1006 // For long searches send current move info to GUI
1007 if (pos.thread() == 0 && current_search_time() > 2000)
1008 cout << "info" << depth_to_uci(depth)
1009 << " currmove " << move
1010 << " currmovenumber " << moveCount + MultiPVIteration << endl;
1013 // At Root and at first iteration do a PV search on all the moves to score root moves
1014 isPvMove = (PvNode && moveCount <= (RootNode && depth <= ONE_PLY ? MAX_MOVES : 1));
1015 givesCheck = pos.move_gives_check(move, ci);
1016 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1018 // Step 12. Decide the new search depth
1019 ext = extension<PvNode>(pos, move, captureOrPromotion, givesCheck, &dangerous);
1021 // Singular extension search. If all moves but one fail low on a search of
1022 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
1023 // is singular and should be extended. To verify this we do a reduced search
1024 // on all the other moves but the ttMove, if result is lower than ttValue minus
1025 // a margin then we extend ttMove.
1026 if ( singularExtensionNode
1028 && pos.pl_move_is_legal(move, ci.pinned)
1031 Value ttValue = value_from_tt(tte->value(), ss->ply);
1033 if (abs(ttValue) < VALUE_KNOWN_WIN)
1035 Value rBeta = ttValue - int(depth);
1036 ss->excludedMove = move;
1037 ss->skipNullMove = true;
1038 Value v = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2);
1039 ss->skipNullMove = false;
1040 ss->excludedMove = MOVE_NONE;
1041 ss->bestMove = MOVE_NONE;
1047 // Update current move (this must be done after singular extension search)
1048 newDepth = depth - ONE_PLY + ext;
1050 // Step 13. Futility pruning (is omitted in PV nodes)
1052 && !captureOrPromotion
1056 && !move_is_castle(move))
1058 // Move count based pruning
1059 if ( moveCount >= futility_move_count(depth)
1060 && (!threatMove || !connected_threat(pos, move, threatMove))
1061 && bestValue > VALUE_MATED_IN_PLY_MAX) // FIXME bestValue is racy
1064 lock_grab(&(sp->lock));
1069 // Value based pruning
1070 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
1071 // but fixing this made program slightly weaker.
1072 Depth predictedDepth = newDepth - reduction<PvNode>(depth, moveCount);
1073 futilityValue = futilityBase + futility_margin(predictedDepth, moveCount)
1074 + H.gain(pos.piece_on(move_from(move)), move_to(move));
1076 if (futilityValue < beta)
1080 lock_grab(&(sp->lock));
1081 if (futilityValue > sp->bestValue)
1082 sp->bestValue = bestValue = futilityValue;
1084 else if (futilityValue > bestValue)
1085 bestValue = futilityValue;
1090 // Prune moves with negative SEE at low depths
1091 if ( predictedDepth < 2 * ONE_PLY
1092 && bestValue > VALUE_MATED_IN_PLY_MAX
1093 && pos.see_sign(move) < 0)
1096 lock_grab(&(sp->lock));
1102 // Check for legality only before to do the move
1103 if (!pos.pl_move_is_legal(move, ci.pinned))
1109 ss->currentMove = move;
1110 if (!SpNode && !captureOrPromotion)
1111 movesSearched[playedMoveCount++] = move;
1113 // Step 14. Make the move
1114 pos.do_move(move, st, ci, givesCheck);
1116 // Step extra. pv search (only in PV nodes)
1117 // The first move in list is the expected PV
1119 value = newDepth < ONE_PLY ? -qsearch<PV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
1120 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
1123 // Step 15. Reduced depth search
1124 // If the move fails high will be re-searched at full depth.
1125 bool doFullDepthSearch = true;
1127 if ( depth > 3 * ONE_PLY
1128 && !captureOrPromotion
1130 && !move_is_castle(move)
1131 && ss->killers[0] != move
1132 && ss->killers[1] != move
1133 && (ss->reduction = reduction<PvNode>(depth, moveCount)) != DEPTH_ZERO)
1135 Depth d = newDepth - ss->reduction;
1136 alpha = SpNode ? sp->alpha : alpha;
1138 value = d < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
1139 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d);
1141 ss->reduction = DEPTH_ZERO;
1142 doFullDepthSearch = (value > alpha);
1145 // Step 16. Full depth search
1146 if (doFullDepthSearch)
1148 alpha = SpNode ? sp->alpha : alpha;
1149 value = newDepth < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
1150 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth);
1152 // Step extra. pv search (only in PV nodes)
1153 // Search only for possible new PV nodes, if instead value >= beta then
1154 // parent node fails low with value <= alpha and tries another move.
1155 if (PvNode && value > alpha && (RootNode || value < beta))
1156 value = newDepth < ONE_PLY ? -qsearch<PV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
1157 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
1161 // Step 17. Undo move
1162 pos.undo_move(move);
1164 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1166 // Step 18. Check for new best move
1169 lock_grab(&(sp->lock));
1170 bestValue = sp->bestValue;
1174 // Finished searching the move. If StopRequest is true, the search
1175 // was aborted because the user interrupted the search or because we
1176 // ran out of time. In this case, the return value of the search cannot
1177 // be trusted, and we don't update the best move and/or PV.
1178 if (RootNode && !StopRequest)
1180 // Remember searched nodes counts for this move
1181 RootMove* rm = Rml.find(move);
1182 rm->nodes += pos.nodes_searched() - nodes;
1184 // PV move or new best move ?
1185 if (isPvMove || value > alpha)
1189 rm->extract_pv_from_tt(pos);
1191 // We record how often the best move has been changed in each
1192 // iteration. This information is used for time management: When
1193 // the best move changes frequently, we allocate some more time.
1194 if (!isPvMove && MultiPV == 1)
1195 Rml.bestMoveChanges++;
1198 // All other moves but the PV are set to the lowest value, this
1199 // is not a problem when sorting becuase sort is stable and move
1200 // position in the list is preserved, just the PV is pushed up.
1201 rm->score = -VALUE_INFINITE;
1205 if (value > bestValue)
1208 ss->bestMove = move;
1212 && value < beta) // We want always alpha < beta
1215 if (SpNode && !thread.cutoff_occurred())
1217 sp->bestValue = value;
1218 sp->ss->bestMove = move;
1220 sp->is_betaCutoff = (value >= beta);
1224 // Step 19. Check for split
1226 && depth >= Threads.min_split_depth()
1228 && Threads.available_slave_exists(pos.thread())
1230 && !thread.cutoff_occurred())
1231 bestValue = Threads.split<FakeSplit>(pos, ss, alpha, beta, bestValue, depth,
1232 threatMove, moveCount, &mp, NT);
1235 // Step 20. Check for mate and stalemate
1236 // All legal moves have been searched and if there are
1237 // no legal moves, it must be mate or stalemate.
1238 // If one move was excluded return fail low score.
1239 if (!SpNode && !moveCount)
1240 return excludedMove ? oldAlpha : inCheck ? value_mated_in(ss->ply) : VALUE_DRAW;
1242 // Step 21. Update tables
1243 // If the search is not aborted, update the transposition table,
1244 // history counters, and killer moves.
1245 if (!SpNode && !StopRequest && !thread.cutoff_occurred())
1247 move = bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove;
1248 vt = bestValue <= oldAlpha ? VALUE_TYPE_UPPER
1249 : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT;
1251 TT.store(posKey, value_to_tt(bestValue, ss->ply), vt, depth, move, ss->eval, ss->evalMargin);
1253 // Update killers and history only for non capture moves that fails high
1254 if ( bestValue >= beta
1255 && !pos.move_is_capture_or_promotion(move))
1257 if (move != ss->killers[0])
1259 ss->killers[1] = ss->killers[0];
1260 ss->killers[0] = move;
1262 update_history(pos, move, depth, movesSearched, playedMoveCount);
1268 // Here we have the lock still grabbed
1269 sp->is_slave[pos.thread()] = false;
1270 sp->nodes += pos.nodes_searched();
1271 lock_release(&(sp->lock));
1274 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1279 // qsearch() is the quiescence search function, which is called by the main
1280 // search function when the remaining depth is zero (or, to be more precise,
1281 // less than ONE_PLY).
1283 template <NodeType NT>
1284 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth) {
1286 const bool PvNode = (NT == PV);
1288 assert(NT == PV || NT == NonPV);
1289 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1290 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1291 assert(PvNode || alpha == beta - 1);
1293 assert(pos.thread() >= 0 && pos.thread() < Threads.size());
1297 Value bestValue, value, evalMargin, futilityValue, futilityBase;
1298 bool inCheck, enoughMaterial, givesCheck, evasionPrunable;
1302 Value oldAlpha = alpha;
1304 ss->bestMove = ss->currentMove = MOVE_NONE;
1305 ss->ply = (ss-1)->ply + 1;
1307 // Check for an instant draw or maximum ply reached
1308 if (pos.is_draw<true>() || ss->ply > PLY_MAX)
1311 // Decide whether or not to include checks, this fixes also the type of
1312 // TT entry depth that we are going to use. Note that in qsearch we use
1313 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1314 inCheck = pos.in_check();
1315 ttDepth = (inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS : DEPTH_QS_NO_CHECKS);
1317 // Transposition table lookup. At PV nodes, we don't use the TT for
1318 // pruning, but only for move ordering.
1319 tte = TT.probe(pos.get_key());
1320 ttMove = (tte ? tte->move() : MOVE_NONE);
1322 if (!PvNode && tte && can_return_tt(tte, ttDepth, beta, ss->ply))
1324 ss->bestMove = ttMove; // Can be MOVE_NONE
1325 return value_from_tt(tte->value(), ss->ply);
1328 // Evaluate the position statically
1331 bestValue = futilityBase = -VALUE_INFINITE;
1332 ss->eval = evalMargin = VALUE_NONE;
1333 enoughMaterial = false;
1339 assert(tte->static_value() != VALUE_NONE);
1341 evalMargin = tte->static_value_margin();
1342 ss->eval = bestValue = tte->static_value();
1345 ss->eval = bestValue = evaluate(pos, evalMargin);
1347 // Stand pat. Return immediately if static value is at least beta
1348 if (bestValue >= beta)
1351 TT.store(pos.get_key(), value_to_tt(bestValue, ss->ply), VALUE_TYPE_LOWER, DEPTH_NONE, MOVE_NONE, ss->eval, evalMargin);
1356 if (PvNode && bestValue > alpha)
1359 // Futility pruning parameters, not needed when in check
1360 futilityBase = ss->eval + evalMargin + FutilityMarginQS;
1361 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1364 // Initialize a MovePicker object for the current position, and prepare
1365 // to search the moves. Because the depth is <= 0 here, only captures,
1366 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1368 MovePicker mp(pos, ttMove, depth, H, move_to((ss-1)->currentMove));
1371 // Loop through the moves until no moves remain or a beta cutoff occurs
1372 while ( bestValue < beta
1373 && (move = mp.get_next_move()) != MOVE_NONE)
1375 assert(move_is_ok(move));
1377 givesCheck = pos.move_gives_check(move, ci);
1385 && !move_is_promotion(move)
1386 && !pos.move_is_passed_pawn_push(move))
1388 futilityValue = futilityBase
1389 + piece_value_endgame(pos.piece_on(move_to(move)))
1390 + (move_is_ep(move) ? PawnValueEndgame : VALUE_ZERO);
1392 if (futilityValue < beta)
1394 if (futilityValue > bestValue)
1395 bestValue = futilityValue;
1400 // Prune moves with negative or equal SEE
1401 if ( futilityBase < beta
1402 && depth < DEPTH_ZERO
1403 && pos.see(move) <= 0)
1407 // Detect non-capture evasions that are candidate to be pruned
1408 evasionPrunable = !PvNode
1410 && bestValue > VALUE_MATED_IN_PLY_MAX
1411 && !pos.move_is_capture(move)
1412 && !pos.can_castle(pos.side_to_move());
1414 // Don't search moves with negative SEE values
1416 && (!inCheck || evasionPrunable)
1418 && !move_is_promotion(move)
1419 && pos.see_sign(move) < 0)
1422 // Don't search useless checks
1427 && !pos.move_is_capture_or_promotion(move)
1428 && ss->eval + PawnValueMidgame / 4 < beta
1429 && !check_is_dangerous(pos, move, futilityBase, beta, &bestValue))
1431 if (ss->eval + PawnValueMidgame / 4 > bestValue)
1432 bestValue = ss->eval + PawnValueMidgame / 4;
1437 // Check for legality only before to do the move
1438 if (!pos.pl_move_is_legal(move, ci.pinned))
1441 // Update current move
1442 ss->currentMove = move;
1444 // Make and search the move
1445 pos.do_move(move, st, ci, givesCheck);
1446 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth-ONE_PLY);
1447 pos.undo_move(move);
1449 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1452 if (value > bestValue)
1455 ss->bestMove = move;
1459 && value < beta) // We want always alpha < beta
1464 // All legal moves have been searched. A special case: If we're in check
1465 // and no legal moves were found, it is checkmate.
1466 if (inCheck && bestValue == -VALUE_INFINITE)
1467 return value_mated_in(ss->ply);
1469 // Update transposition table
1470 move = bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove;
1471 vt = bestValue <= oldAlpha ? VALUE_TYPE_UPPER
1472 : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT;
1474 TT.store(pos.get_key(), value_to_tt(bestValue, ss->ply), vt, ttDepth, move, ss->eval, evalMargin);
1476 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1482 // check_is_dangerous() tests if a checking move can be pruned in qsearch().
1483 // bestValue is updated only when returning false because in that case move
1486 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bestValue)
1488 Bitboard b, occ, oldAtt, newAtt, kingAtt;
1489 Square from, to, ksq, victimSq;
1492 Value futilityValue, bv = *bestValue;
1494 from = move_from(move);
1496 them = flip(pos.side_to_move());
1497 ksq = pos.king_square(them);
1498 kingAtt = pos.attacks_from<KING>(ksq);
1499 pc = pos.piece_on(from);
1501 occ = pos.occupied_squares() & ~(1ULL << from) & ~(1ULL << ksq);
1502 oldAtt = pos.attacks_from(pc, from, occ);
1503 newAtt = pos.attacks_from(pc, to, occ);
1505 // Rule 1. Checks which give opponent's king at most one escape square are dangerous
1506 b = kingAtt & ~pos.pieces(them) & ~newAtt & ~(1ULL << to);
1508 if (!(b && (b & (b - 1))))
1511 // Rule 2. Queen contact check is very dangerous
1512 if ( type_of(pc) == QUEEN
1513 && bit_is_set(kingAtt, to))
1516 // Rule 3. Creating new double threats with checks
1517 b = pos.pieces(them) & newAtt & ~oldAtt & ~(1ULL << ksq);
1521 victimSq = pop_1st_bit(&b);
1522 futilityValue = futilityBase + piece_value_endgame(pos.piece_on(victimSq));
1524 // Note that here we generate illegal "double move"!
1525 if ( futilityValue >= beta
1526 && pos.see_sign(make_move(from, victimSq)) >= 0)
1529 if (futilityValue > bv)
1533 // Update bestValue only if check is not dangerous (because we will prune the move)
1539 // connected_moves() tests whether two moves are 'connected' in the sense
1540 // that the first move somehow made the second move possible (for instance
1541 // if the moving piece is the same in both moves). The first move is assumed
1542 // to be the move that was made to reach the current position, while the
1543 // second move is assumed to be a move from the current position.
1545 bool connected_moves(const Position& pos, Move m1, Move m2) {
1547 Square f1, t1, f2, t2;
1551 assert(move_is_ok(m1));
1552 assert(move_is_ok(m2));
1554 // Case 1: The moving piece is the same in both moves
1560 // Case 2: The destination square for m2 was vacated by m1
1566 // Case 3: Moving through the vacated square
1567 p2 = pos.piece_on(f2);
1568 if ( piece_is_slider(p2)
1569 && bit_is_set(squares_between(f2, t2), f1))
1572 // Case 4: The destination square for m2 is defended by the moving piece in m1
1573 p1 = pos.piece_on(t1);
1574 if (bit_is_set(pos.attacks_from(p1, t1), t2))
1577 // Case 5: Discovered check, checking piece is the piece moved in m1
1578 ksq = pos.king_square(pos.side_to_move());
1579 if ( piece_is_slider(p1)
1580 && bit_is_set(squares_between(t1, ksq), f2))
1582 Bitboard occ = pos.occupied_squares();
1583 clear_bit(&occ, f2);
1584 if (bit_is_set(pos.attacks_from(p1, t1, occ), ksq))
1591 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1592 // "plies to mate from the current ply". Non-mate scores are unchanged.
1593 // The function is called before storing a value to the transposition table.
1595 Value value_to_tt(Value v, int ply) {
1597 if (v >= VALUE_MATE_IN_PLY_MAX)
1600 if (v <= VALUE_MATED_IN_PLY_MAX)
1607 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score from
1608 // the transposition table to a mate score corrected for the current ply.
1610 Value value_from_tt(Value v, int ply) {
1612 if (v >= VALUE_MATE_IN_PLY_MAX)
1615 if (v <= VALUE_MATED_IN_PLY_MAX)
1622 // connected_threat() tests whether it is safe to forward prune a move or if
1623 // is somehow connected to the threat move returned by null search.
1625 bool connected_threat(const Position& pos, Move m, Move threat) {
1627 assert(move_is_ok(m));
1628 assert(move_is_ok(threat));
1629 assert(!pos.move_is_capture_or_promotion(m));
1630 assert(!pos.move_is_passed_pawn_push(m));
1632 Square mfrom, mto, tfrom, tto;
1634 mfrom = move_from(m);
1636 tfrom = move_from(threat);
1637 tto = move_to(threat);
1639 // Case 1: Don't prune moves which move the threatened piece
1643 // Case 2: If the threatened piece has value less than or equal to the
1644 // value of the threatening piece, don't prune moves which defend it.
1645 if ( pos.move_is_capture(threat)
1646 && ( piece_value_midgame(pos.piece_on(tfrom)) >= piece_value_midgame(pos.piece_on(tto))
1647 || type_of(pos.piece_on(tfrom)) == KING)
1648 && pos.move_attacks_square(m, tto))
1651 // Case 3: If the moving piece in the threatened move is a slider, don't
1652 // prune safe moves which block its ray.
1653 if ( piece_is_slider(pos.piece_on(tfrom))
1654 && bit_is_set(squares_between(tfrom, tto), mto)
1655 && pos.see_sign(m) >= 0)
1662 // can_return_tt() returns true if a transposition table score
1663 // can be used to cut-off at a given point in search.
1665 bool can_return_tt(const TTEntry* tte, Depth depth, Value beta, int ply) {
1667 Value v = value_from_tt(tte->value(), ply);
1669 return ( tte->depth() >= depth
1670 || v >= Max(VALUE_MATE_IN_PLY_MAX, beta)
1671 || v < Min(VALUE_MATED_IN_PLY_MAX, beta))
1673 && ( ((tte->type() & VALUE_TYPE_LOWER) && v >= beta)
1674 || ((tte->type() & VALUE_TYPE_UPPER) && v < beta));
1678 // refine_eval() returns the transposition table score if
1679 // possible otherwise falls back on static position evaluation.
1681 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
1685 Value v = value_from_tt(tte->value(), ply);
1687 if ( ((tte->type() & VALUE_TYPE_LOWER) && v >= defaultEval)
1688 || ((tte->type() & VALUE_TYPE_UPPER) && v < defaultEval))
1695 // update_history() registers a good move that produced a beta-cutoff
1696 // in history and marks as failures all the other moves of that ply.
1698 void update_history(const Position& pos, Move move, Depth depth,
1699 Move movesSearched[], int moveCount) {
1701 Value bonus = Value(int(depth) * int(depth));
1703 H.update(pos.piece_on(move_from(move)), move_to(move), bonus);
1705 for (int i = 0; i < moveCount - 1; i++)
1707 m = movesSearched[i];
1711 H.update(pos.piece_on(move_from(m)), move_to(m), -bonus);
1716 // update_gains() updates the gains table of a non-capture move given
1717 // the static position evaluation before and after the move.
1719 void update_gains(const Position& pos, Move m, Value before, Value after) {
1722 && before != VALUE_NONE
1723 && after != VALUE_NONE
1724 && pos.captured_piece_type() == PIECE_TYPE_NONE
1725 && !move_is_special(m))
1726 H.update_gain(pos.piece_on(move_to(m)), move_to(m), -(before + after));
1730 // current_search_time() returns the number of milliseconds which have passed
1731 // since the beginning of the current search.
1733 int current_search_time(int set) {
1735 static int searchStartTime;
1738 searchStartTime = set;
1740 return get_system_time() - searchStartTime;
1744 // score_to_uci() converts a value to a string suitable for use with the UCI
1745 // protocol specifications:
1747 // cp <x> The score from the engine's point of view in centipawns.
1748 // mate <y> Mate in y moves, not plies. If the engine is getting mated
1749 // use negative values for y.
1751 string score_to_uci(Value v, Value alpha, Value beta) {
1753 std::stringstream s;
1755 if (abs(v) < VALUE_MATE - PLY_MAX * ONE_PLY)
1756 s << " score cp " << int(v) * 100 / int(PawnValueMidgame); // Scale to centipawns
1758 s << " score mate " << (v > 0 ? VALUE_MATE - v + 1 : -VALUE_MATE - v) / 2;
1760 s << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1766 // speed_to_uci() returns a string with time stats of current search suitable
1767 // to be sent to UCI gui.
1769 string speed_to_uci(int64_t nodes) {
1771 std::stringstream s;
1772 int t = current_search_time();
1774 s << " nodes " << nodes
1775 << " nps " << (t > 0 ? int(nodes * 1000 / t) : 0)
1781 // pv_to_uci() returns a string with information on the current PV line
1782 // formatted according to UCI specification.
1784 string pv_to_uci(const Move pv[], int pvNum, bool chess960) {
1786 std::stringstream s;
1788 s << " multipv " << pvNum << " pv " << set960(chess960);
1790 for ( ; *pv != MOVE_NONE; pv++)
1796 // depth_to_uci() returns a string with information on the current depth and
1797 // seldepth formatted according to UCI specification.
1799 string depth_to_uci(Depth depth) {
1801 std::stringstream s;
1803 // Retrieve max searched depth among threads
1805 for (int i = 0; i < Threads.size(); i++)
1806 if (Threads[i].maxPly > selDepth)
1807 selDepth = Threads[i].maxPly;
1809 s << " depth " << depth / ONE_PLY << " seldepth " << selDepth;
1814 string time_to_string(int millisecs) {
1816 const int MSecMinute = 1000 * 60;
1817 const int MSecHour = 1000 * 60 * 60;
1819 int hours = millisecs / MSecHour;
1820 int minutes = (millisecs % MSecHour) / MSecMinute;
1821 int seconds = ((millisecs % MSecHour) % MSecMinute) / 1000;
1823 std::stringstream s;
1828 s << std::setfill('0') << std::setw(2) << minutes << ':' << std::setw(2) << seconds;
1832 string score_to_string(Value v) {
1834 std::stringstream s;
1836 if (v >= VALUE_MATE_IN_PLY_MAX)
1837 s << "#" << (VALUE_MATE - v + 1) / 2;
1838 else if (v <= VALUE_MATED_IN_PLY_MAX)
1839 s << "-#" << (VALUE_MATE + v) / 2;
1841 s << std::setprecision(2) << std::fixed << std::showpos << float(v) / PawnValueMidgame;
1846 // pretty_pv() creates a human-readable string from a position and a PV.
1847 // It is used to write search information to the log file (which is created
1848 // when the UCI parameter "Use Search Log" is "true").
1850 string pretty_pv(Position& pos, int depth, Value value, int time, Move pv[]) {
1852 const int64_t K = 1000;
1853 const int64_t M = 1000000;
1854 const int startColumn = 28;
1855 const size_t maxLength = 80 - startColumn;
1857 StateInfo state[PLY_MAX_PLUS_2], *st = state;
1860 std::stringstream s;
1863 // First print depth, score, time and searched nodes...
1864 s << set960(pos.is_chess960())
1865 << std::setw(2) << depth
1866 << std::setw(8) << score_to_string(value)
1867 << std::setw(8) << time_to_string(time);
1869 if (pos.nodes_searched() < M)
1870 s << std::setw(8) << pos.nodes_searched() / 1 << " ";
1871 else if (pos.nodes_searched() < K * M)
1872 s << std::setw(7) << pos.nodes_searched() / K << "K ";
1874 s << std::setw(7) << pos.nodes_searched() / M << "M ";
1876 // ...then print the full PV line in short algebraic notation
1877 while (*m != MOVE_NONE)
1879 san = move_to_san(pos, *m);
1880 length += san.length() + 1;
1882 if (length > maxLength)
1884 length = san.length() + 1;
1885 s << "\n" + string(startColumn, ' ');
1889 pos.do_move(*m++, *st++);
1892 // Restore original position before to leave
1893 while (m != pv) pos.undo_move(*--m);
1898 // poll() performs two different functions: It polls for user input, and it
1899 // looks at the time consumed so far and decides if it's time to abort the
1902 void poll(const Position& pos) {
1904 static int lastInfoTime;
1905 int t = current_search_time();
1908 if (input_available())
1910 // We are line oriented, don't read single chars
1913 if (!std::getline(std::cin, command) || command == "quit")
1915 // Quit the program as soon as possible
1916 Limits.ponder = false;
1917 QuitRequest = StopRequest = true;
1920 else if (command == "stop")
1922 // Stop calculating as soon as possible, but still send the "bestmove"
1923 // and possibly the "ponder" token when finishing the search.
1924 Limits.ponder = false;
1927 else if (command == "ponderhit")
1929 // The opponent has played the expected move. GUI sends "ponderhit" if
1930 // we were told to ponder on the same move the opponent has played. We
1931 // should continue searching but switching from pondering to normal search.
1932 Limits.ponder = false;
1934 if (StopOnPonderhit)
1939 // Print search information
1943 else if (lastInfoTime > t)
1944 // HACK: Must be a new search where we searched less than
1945 // NodesBetweenPolls nodes during the first second of search.
1948 else if (t - lastInfoTime >= 1000)
1953 dbg_print_hit_rate();
1956 // Should we stop the search?
1960 bool stillAtFirstMove = FirstRootMove
1961 && !AspirationFailLow
1962 && t > TimeMgr.available_time();
1964 bool noMoreTime = t > TimeMgr.maximum_time()
1965 || stillAtFirstMove;
1967 if ( (Limits.useTimeManagement() && noMoreTime)
1968 || (Limits.maxTime && t >= Limits.maxTime)
1969 || (Limits.maxNodes && pos.nodes_searched() >= Limits.maxNodes)) // FIXME
1974 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
1975 // while the program is pondering. The point is to work around a wrinkle in
1976 // the UCI protocol: When pondering, the engine is not allowed to give a
1977 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
1978 // We simply wait here until one of these commands is sent, and return,
1979 // after which the bestmove and pondermove will be printed.
1981 void wait_for_stop_or_ponderhit() {
1985 // Wait for a command from stdin
1986 while ( std::getline(std::cin, command)
1987 && command != "ponderhit" && command != "stop" && command != "quit") {};
1989 if (command != "ponderhit" && command != "stop")
1990 QuitRequest = true; // Must be "quit" or getline() returned false
1994 // When playing with strength handicap choose best move among the MultiPV set
1995 // using a statistical rule dependent on SkillLevel. Idea by Heinz van Saanen.
1996 void do_skill_level(Move* best, Move* ponder) {
1998 assert(MultiPV > 1);
2002 // Rml list is already sorted by score in descending order
2004 int max_s = -VALUE_INFINITE;
2005 int size = Min(MultiPV, (int)Rml.size());
2006 int max = Rml[0].score;
2007 int var = Min(max - Rml[size - 1].score, PawnValueMidgame);
2008 int wk = 120 - 2 * SkillLevel;
2010 // PRNG sequence should be non deterministic
2011 for (int i = abs(get_system_time() % 50); i > 0; i--)
2012 rk.rand<unsigned>();
2014 // Choose best move. For each move's score we add two terms both dependent
2015 // on wk, one deterministic and bigger for weaker moves, and one random,
2016 // then we choose the move with the resulting highest score.
2017 for (int i = 0; i < size; i++)
2021 // Don't allow crazy blunders even at very low skills
2022 if (i > 0 && Rml[i-1].score > s + EasyMoveMargin)
2025 // This is our magical formula
2026 s += ((max - s) * wk + var * (rk.rand<unsigned>() % wk)) / 128;
2031 *best = Rml[i].pv[0];
2032 *ponder = Rml[i].pv[1];
2038 /// RootMove and RootMoveList method's definitions
2040 void RootMoveList::init(Position& pos, Move searchMoves[]) {
2043 bestMoveChanges = 0;
2046 // Generate all legal moves and add them to RootMoveList
2047 for (MoveList<MV_LEGAL> ml(pos); !ml.end(); ++ml)
2049 // If we have a searchMoves[] list then verify the move
2050 // is in the list before to add it.
2051 for (sm = searchMoves; *sm && *sm != ml.move(); sm++) {}
2053 if (sm != searchMoves && *sm != ml.move())
2057 rm.pv.push_back(ml.move());
2058 rm.pv.push_back(MOVE_NONE);
2059 rm.score = rm.prevScore = -VALUE_INFINITE;
2065 RootMove* RootMoveList::find(const Move& m, int startIndex) {
2067 for (size_t i = startIndex; i < size(); i++)
2068 if ((*this)[i].pv[0] == m)
2074 // extract_pv_from_tt() builds a PV by adding moves from the transposition table.
2075 // We consider also failing high nodes and not only VALUE_TYPE_EXACT nodes. This
2076 // allow to always have a ponder move even when we fail high at root and also a
2077 // long PV to print that is important for position analysis.
2079 void RootMove::extract_pv_from_tt(Position& pos) {
2081 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2086 assert(m != MOVE_NONE && pos.move_is_pl(m));
2090 pos.do_move(m, *st++);
2092 while ( (tte = TT.probe(pos.get_key())) != NULL
2093 && tte->move() != MOVE_NONE
2094 && pos.move_is_pl(tte->move())
2095 && pos.pl_move_is_legal(tte->move(), pos.pinned_pieces())
2097 && (!pos.is_draw<false>() || ply < 2))
2099 pv.push_back(tte->move());
2100 pos.do_move(tte->move(), *st++);
2103 pv.push_back(MOVE_NONE);
2105 do pos.undo_move(pv[--ply]); while (ply);
2108 // insert_pv_in_tt() is called at the end of a search iteration, and inserts
2109 // the PV back into the TT. This makes sure the old PV moves are searched
2110 // first, even if the old TT entries have been overwritten.
2112 void RootMove::insert_pv_in_tt(Position& pos) {
2114 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2117 Value v, m = VALUE_NONE;
2120 assert(pv[0] != MOVE_NONE && pos.move_is_pl(pv[0]));
2126 // Don't overwrite existing correct entries
2127 if (!tte || tte->move() != pv[ply])
2129 v = (pos.in_check() ? VALUE_NONE : evaluate(pos, m));
2130 TT.store(k, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, pv[ply], v, m);
2132 pos.do_move(pv[ply], *st++);
2134 } while (pv[++ply] != MOVE_NONE);
2136 do pos.undo_move(pv[--ply]); while (ply);
2141 // Little helper used by idle_loop() to check that all the slave threads of a
2142 // split point have finished searching.
2144 static bool all_slaves_finished(SplitPoint* sp) {
2146 for (int i = 0; i < Threads.size(); i++)
2147 if (sp->is_slave[i])
2154 // Thread::idle_loop() is where the thread is parked when it has no work to do.
2155 // The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint object
2156 // for which the thread is the master.
2158 void Thread::idle_loop(SplitPoint* sp) {
2162 // If we are not searching, wait for a condition to be signaled
2163 // instead of wasting CPU time polling for work.
2166 || (Threads.use_sleeping_threads() && !is_searching))
2168 assert((!sp && threadID) || Threads.use_sleeping_threads());
2170 // Slave thread should exit as soon as do_terminate flag raises
2177 // Grab the lock to avoid races with Thread::wake_up()
2178 lock_grab(&sleepLock);
2180 // If we are master and all slaves have finished don't go to sleep
2181 if (sp && all_slaves_finished(sp))
2183 lock_release(&sleepLock);
2187 // Do sleep after retesting sleep conditions under lock protection, in
2188 // particular we need to avoid a deadlock in case a master thread has,
2189 // in the meanwhile, allocated us and sent the wake_up() call before we
2190 // had the chance to grab the lock.
2191 if (do_sleep || !is_searching)
2192 cond_wait(&sleepCond, &sleepLock);
2194 lock_release(&sleepLock);
2197 // If this thread has been assigned work, launch a search
2200 assert(!do_terminate);
2202 // Copy split point position and search stack and call search()
2203 SearchStack ss[PLY_MAX_PLUS_2];
2204 SplitPoint* tsp = splitPoint;
2205 Position pos(*tsp->pos, threadID);
2207 memcpy(ss, tsp->ss - 1, 4 * sizeof(SearchStack));
2210 if (tsp->nodeType == Root)
2211 search<SplitPointRoot>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2212 else if (tsp->nodeType == PV)
2213 search<SplitPointPV>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2214 else if (tsp->nodeType == NonPV)
2215 search<SplitPointNonPV>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2219 assert(is_searching);
2221 is_searching = false;
2223 // Wake up master thread so to allow it to return from the idle loop in
2224 // case we are the last slave of the split point.
2225 if ( Threads.use_sleeping_threads()
2226 && threadID != tsp->master
2227 && !Threads[tsp->master].is_searching)
2228 Threads[tsp->master].wake_up();
2231 // If this thread is the master of a split point and all slaves have
2232 // finished their work at this split point, return from the idle loop.
2233 if (sp && all_slaves_finished(sp))
2235 // Because sp->is_slave[] is reset under lock protection,
2236 // be sure sp->lock has been released before to return.
2237 lock_grab(&(sp->lock));
2238 lock_release(&(sp->lock));