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/>.
39 #include "ucioption.h"
46 // Set to true to force running with one thread. Used for debugging
47 const bool FakeSplit = false;
49 // Different node types, used as template parameter
50 enum NodeType { Root, PV, NonPV, SplitPointPV, SplitPointNonPV };
52 // RootMove struct is used for moves at the root of the tree. For each root
53 // move, we store two scores, a node count, and a PV (really a refutation
54 // in the case of moves which fail low). Value pv_score is normally set at
55 // -VALUE_INFINITE for all non-pv moves, while non_pv_score is computed
56 // according to the order in which moves are returned by MovePicker.
60 RootMove(const RootMove& rm) { *this = rm; }
61 RootMove& operator=(const RootMove& rm);
63 // RootMove::operator<() is the comparison function used when
64 // sorting the moves. A move m1 is considered to be better
65 // than a move m2 if it has an higher pv_score, or if it has
66 // equal pv_score but m1 has the higher non_pv_score. In this way
67 // we are guaranteed that PV moves are always sorted as first.
68 bool operator<(const RootMove& m) const {
69 return pv_score != m.pv_score ? pv_score < m.pv_score
70 : non_pv_score < m.non_pv_score;
73 void extract_pv_from_tt(Position& pos);
74 void insert_pv_in_tt(Position& pos);
75 std::string pv_info_to_uci(Position& pos, int depth, int selDepth,
76 Value alpha, Value beta, int pvIdx);
80 Move pv[PLY_MAX_PLUS_2];
83 // RootMoveList struct is just a vector of RootMove objects,
84 // with an handful of methods above the standard ones.
85 struct RootMoveList : public std::vector<RootMove> {
87 typedef std::vector<RootMove> Base;
89 void init(Position& pos, Move searchMoves[]);
90 void sort() { insertion_sort<RootMove, Base::iterator>(begin(), end()); }
91 void sort_multipv(int n) { insertion_sort<RootMove, Base::iterator>(begin(), begin() + n); }
96 // MovePickerExt template class extends MovePicker and allows to choose at compile
97 // time the proper moves source according to the type of node. In the default case
98 // we simply create and use a standard MovePicker object.
99 template<NodeType> struct MovePickerExt : public MovePicker {
101 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
102 : MovePicker(p, ttm, d, h, ss, b) {}
104 RootMoveList::iterator rm; // Dummy, needed to compile
107 // In case of a SpNode we use split point's shared MovePicker object as moves source
108 template<> struct MovePickerExt<SplitPointNonPV> : public MovePickerExt<NonPV> {
110 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
111 : MovePickerExt<NonPV>(p, ttm, d, h, ss, b), mp(ss->sp->mp) {}
113 Move get_next_move() { return mp->get_next_move(); }
117 template<> struct MovePickerExt<SplitPointPV> : public MovePickerExt<SplitPointNonPV> {
119 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
120 : MovePickerExt<SplitPointNonPV>(p, ttm, d, h, ss, b) {}
123 // In case of a Root node we use RootMoveList as moves source
124 template<> struct MovePickerExt<Root> : public MovePicker {
126 MovePickerExt(const Position&, Move, Depth, const History&, SearchStack*, Value);
127 Move get_next_move();
129 RootMoveList::iterator rm;
136 // Lookup table to check if a Piece is a slider and its access function
137 const bool Slidings[18] = { 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1 };
138 inline bool piece_is_slider(Piece p) { return Slidings[p]; }
142 // Maximum depth for razoring
143 const Depth RazorDepth = 4 * ONE_PLY;
145 // Dynamic razoring margin based on depth
146 inline Value razor_margin(Depth d) { return Value(0x200 + 0x10 * int(d)); }
148 // Maximum depth for use of dynamic threat detection when null move fails low
149 const Depth ThreatDepth = 5 * ONE_PLY;
151 // Step 9. Internal iterative deepening
153 // Minimum depth for use of internal iterative deepening
154 const Depth IIDDepth[] = { 8 * ONE_PLY, 5 * ONE_PLY };
156 // At Non-PV nodes we do an internal iterative deepening search
157 // when the static evaluation is bigger then beta - IIDMargin.
158 const Value IIDMargin = Value(0x100);
160 // Step 11. Decide the new search depth
162 // Extensions. Array index 0 is used for non-PV nodes, index 1 for PV nodes
163 const Depth CheckExtension[] = { ONE_PLY / 2, ONE_PLY / 1 };
164 const Depth PawnEndgameExtension[] = { ONE_PLY / 1, ONE_PLY / 1 };
165 const Depth PawnPushTo7thExtension[] = { ONE_PLY / 2, ONE_PLY / 2 };
166 const Depth PassedPawnExtension[] = { DEPTH_ZERO, ONE_PLY / 2 };
168 // Minimum depth for use of singular extension
169 const Depth SingularExtensionDepth[] = { 8 * ONE_PLY, 6 * ONE_PLY };
171 // Step 12. Futility pruning
173 // Futility margin for quiescence search
174 const Value FutilityMarginQS = Value(0x80);
176 // Futility lookup tables (initialized at startup) and their access functions
177 Value FutilityMargins[16][64]; // [depth][moveNumber]
178 int FutilityMoveCounts[32]; // [depth]
180 inline Value futility_margin(Depth d, int mn) {
182 return d < 7 * ONE_PLY ? FutilityMargins[Max(d, 1)][Min(mn, 63)]
183 : 2 * VALUE_INFINITE;
186 inline int futility_move_count(Depth d) {
188 return d < 16 * ONE_PLY ? FutilityMoveCounts[d] : MAX_MOVES;
191 // Step 14. Reduced search
193 // Reduction lookup tables (initialized at startup) and their access function
194 int8_t Reductions[2][64][64]; // [pv][depth][moveNumber]
196 template <bool PvNode> inline Depth reduction(Depth d, int mn) {
198 return (Depth) Reductions[PvNode][Min(d / ONE_PLY, 63)][Min(mn, 63)];
201 // Easy move margin. An easy move candidate must be at least this much
202 // better than the second best move.
203 const Value EasyMoveMargin = Value(0x200);
206 /// Namespace variables
212 int MultiPV, UCIMultiPV;
214 // Time management variables
215 bool StopOnPonderhit, FirstRootMove, StopRequest, QuitRequest, AspirationFailLow;
220 std::ofstream LogFile;
222 // Skill level adjustment
224 bool SkillLevelEnabled;
226 // Node counters, used only by thread[0] but try to keep in different cache
227 // lines (64 bytes each) from the heavy multi-thread read accessed variables.
228 bool SendSearchedNodes;
230 int NodesBetweenPolls = 30000;
238 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove);
240 template <NodeType NT>
241 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth);
243 template <NodeType NT>
244 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth);
246 template <bool PvNode>
247 Depth extension(const Position& pos, Move m, bool captureOrPromotion, bool moveIsCheck, bool* dangerous);
249 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bValue);
250 bool connected_moves(const Position& pos, Move m1, Move m2);
251 Value value_to_tt(Value v, int ply);
252 Value value_from_tt(Value v, int ply);
253 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply);
254 bool connected_threat(const Position& pos, Move m, Move threat);
255 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply);
256 void update_history(const Position& pos, Move move, Depth depth, Move movesSearched[], int moveCount);
257 void update_gains(const Position& pos, Move move, Value before, Value after);
258 void do_skill_level(Move* best, Move* ponder);
260 int current_search_time(int set = 0);
261 std::string value_to_uci(Value v);
262 std::string speed_to_uci(int64_t nodes);
263 void poll(const Position& pos);
264 void wait_for_stop_or_ponderhit();
266 // Overload operator<<() to make it easier to print moves in a coordinate
267 // notation compatible with UCI protocol.
268 std::ostream& operator<<(std::ostream& os, Move m) {
270 bool chess960 = (os.iword(0) != 0); // See set960()
271 return os << move_to_uci(m, chess960);
274 // When formatting a move for std::cout we must know if we are in Chess960
275 // or not. To keep using the handy operator<<() on the move the trick is to
276 // embed this flag in the stream itself. Function-like named enum set960 is
277 // used as a custom manipulator and the stream internal general-purpose array,
278 // accessed through ios_base::iword(), is used to pass the flag to the move's
279 // operator<<() that will read it to properly format castling moves.
282 std::ostream& operator<< (std::ostream& os, const set960& f) {
284 os.iword(0) = int(f);
291 /// init_search() is called during startup to initialize various lookup tables
295 int d; // depth (ONE_PLY == 2)
296 int hd; // half depth (ONE_PLY == 1)
299 // Init reductions array
300 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
302 double pvRed = log(double(hd)) * log(double(mc)) / 3.0;
303 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
304 Reductions[1][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
305 Reductions[0][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
308 // Init futility margins array
309 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
310 FutilityMargins[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
312 // Init futility move count array
313 for (d = 0; d < 32; d++)
314 FutilityMoveCounts[d] = int(3.001 + 0.25 * pow(d, 2.0));
318 /// perft() is our utility to verify move generation. All the leaf nodes up to
319 /// the given depth are generated and counted and the sum returned.
321 int64_t perft(Position& pos, Depth depth) {
323 MoveStack mlist[MAX_MOVES];
328 // Generate all legal moves
329 MoveStack* last = generate<MV_LEGAL>(pos, mlist);
331 // If we are at the last ply we don't need to do and undo
332 // the moves, just to count them.
333 if (depth <= ONE_PLY)
334 return int(last - mlist);
336 // Loop through all legal moves
338 for (MoveStack* cur = mlist; cur != last; cur++)
341 pos.do_move(m, st, ci, pos.move_gives_check(m, ci));
342 sum += perft(pos, depth - ONE_PLY);
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[]) {
358 // Initialize global search-related variables
359 StopOnPonderhit = StopRequest = QuitRequest = AspirationFailLow = SendSearchedNodes = false;
361 current_search_time(get_system_time());
363 TimeMgr.init(Limits, pos.startpos_ply_counter());
365 // Set best NodesBetweenPolls interval to avoid lagging under time pressure
367 NodesBetweenPolls = Min(Limits.maxNodes, 30000);
368 else if (Limits.time && Limits.time < 1000)
369 NodesBetweenPolls = 1000;
370 else if (Limits.time && Limits.time < 5000)
371 NodesBetweenPolls = 5000;
373 NodesBetweenPolls = 30000;
375 // Look for a book move
376 if (Options["OwnBook"].value<bool>())
378 if (Options["Book File"].value<std::string>() != book.name())
379 book.open(Options["Book File"].value<std::string>());
381 Move bookMove = book.get_move(pos, Options["Best Book Move"].value<bool>());
382 if (bookMove != MOVE_NONE)
385 wait_for_stop_or_ponderhit();
387 cout << "bestmove " << bookMove << endl;
393 UCIMultiPV = Options["MultiPV"].value<int>();
394 SkillLevel = Options["Skill Level"].value<int>();
396 read_evaluation_uci_options(pos.side_to_move());
397 Threads.read_uci_options();
399 // If needed allocate pawn and material hash tables and adjust TT size
400 Threads.init_hash_tables();
401 TT.set_size(Options["Hash"].value<int>());
403 if (Options["Clear Hash"].value<bool>())
405 Options["Clear Hash"].set_value("false");
409 // Do we have to play with skill handicap? In this case enable MultiPV that
410 // we will use behind the scenes to retrieve a set of possible moves.
411 SkillLevelEnabled = (SkillLevel < 20);
412 MultiPV = (SkillLevelEnabled ? Max(UCIMultiPV, 4) : UCIMultiPV);
414 // Wake up needed threads and reset maxPly counter
415 for (int i = 0; i < Threads.size(); i++)
417 Threads[i].wake_up();
418 Threads[i].maxPly = 0;
421 // Write to log file and keep it open to be accessed during the search
422 if (Options["Use Search Log"].value<bool>())
424 std::string name = Options["Search Log Filename"].value<std::string>();
425 LogFile.open(name.c_str(), std::ios::out | std::ios::app);
427 if (LogFile.is_open())
428 LogFile << "\nSearching: " << pos.to_fen()
429 << "\ninfinite: " << Limits.infinite
430 << " ponder: " << Limits.ponder
431 << " time: " << Limits.time
432 << " increment: " << Limits.increment
433 << " moves to go: " << Limits.movesToGo
437 // We're ready to start thinking. Call the iterative deepening loop function
438 Move ponderMove = MOVE_NONE;
439 Move bestMove = id_loop(pos, searchMoves, &ponderMove);
441 cout << "info" << speed_to_uci(pos.nodes_searched()) << endl;
443 // Write final search statistics and close log file
444 if (LogFile.is_open())
446 int t = current_search_time();
448 LogFile << "Nodes: " << pos.nodes_searched()
449 << "\nNodes/second: " << (t > 0 ? pos.nodes_searched() * 1000 / t : 0)
450 << "\nBest move: " << move_to_san(pos, bestMove);
453 pos.do_move(bestMove, st);
454 LogFile << "\nPonder move: " << move_to_san(pos, ponderMove) << endl;
455 pos.undo_move(bestMove); // Return from think() with unchanged position
459 // This makes all the threads to go to sleep
462 // If we are pondering or in infinite search, we shouldn't print the
463 // best move before we are told to do so.
464 if (!StopRequest && (Limits.ponder || Limits.infinite))
465 wait_for_stop_or_ponderhit();
467 // Could be MOVE_NONE when searching on a stalemate position
468 cout << "bestmove " << bestMove;
470 // UCI protol is not clear on allowing sending an empty ponder move, instead
471 // it is clear that ponder move is optional. So skip it if empty.
472 if (ponderMove != MOVE_NONE)
473 cout << " ponder " << ponderMove;
483 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
484 // with increasing depth until the allocated thinking time has been consumed,
485 // user stops the search, or the maximum search depth is reached.
487 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove) {
489 SearchStack ss[PLY_MAX_PLUS_2];
490 Value bestValues[PLY_MAX_PLUS_2];
491 int bestMoveChanges[PLY_MAX_PLUS_2];
492 int depth, selDepth, aspirationDelta;
493 Value value, alpha, beta;
494 Move bestMove, easyMove, skillBest, skillPonder;
496 // Initialize stuff before a new search
497 memset(ss, 0, 4 * sizeof(SearchStack));
500 *ponderMove = bestMove = easyMove = skillBest = skillPonder = MOVE_NONE;
501 depth = aspirationDelta = 0;
502 alpha = -VALUE_INFINITE, beta = VALUE_INFINITE;
503 ss->currentMove = MOVE_NULL; // Hack to skip update_gains()
505 // Moves to search are verified and copied
506 Rml.init(pos, searchMoves);
508 // Handle special case of searching on a mate/stalemate position
511 cout << "info depth 0 score "
512 << value_to_uci(pos.in_check() ? -VALUE_MATE : VALUE_DRAW)
518 // Iterative deepening loop until requested to stop or target depth reached
519 while (!StopRequest && ++depth <= PLY_MAX && (!Limits.maxDepth || depth <= Limits.maxDepth))
521 Rml.bestMoveChanges = 0;
522 cout << set960(pos.is_chess960()) << "info depth " << depth << endl;
524 // Calculate dynamic aspiration window based on previous iterations
525 if (MultiPV == 1 && depth >= 5 && abs(bestValues[depth - 1]) < VALUE_KNOWN_WIN)
527 int prevDelta1 = bestValues[depth - 1] - bestValues[depth - 2];
528 int prevDelta2 = bestValues[depth - 2] - bestValues[depth - 3];
530 aspirationDelta = Min(Max(abs(prevDelta1) + abs(prevDelta2) / 2, 16), 24);
531 aspirationDelta = (aspirationDelta + 7) / 8 * 8; // Round to match grainSize
533 alpha = Max(bestValues[depth - 1] - aspirationDelta, -VALUE_INFINITE);
534 beta = Min(bestValues[depth - 1] + aspirationDelta, VALUE_INFINITE);
537 // Start with a small aspiration window and, in case of fail high/low,
538 // research with bigger window until not failing high/low anymore.
540 // Search starting from ss+1 to allow calling update_gains()
541 value = search<Root>(pos, ss+1, alpha, beta, depth * ONE_PLY);
543 // Write PV back to transposition table in case the relevant entries
544 // have been overwritten during the search.
545 for (int i = 0; i < Min(MultiPV, (int)Rml.size()); i++)
546 Rml[i].insert_pv_in_tt(pos);
548 // Value cannot be trusted. Break out immediately!
552 assert(value >= alpha);
554 // In case of failing high/low increase aspiration window and research,
555 // otherwise exit the fail high/low loop.
558 beta = Min(beta + aspirationDelta, VALUE_INFINITE);
559 aspirationDelta += aspirationDelta / 2;
561 else if (value <= alpha)
563 AspirationFailLow = true;
564 StopOnPonderhit = false;
566 alpha = Max(alpha - aspirationDelta, -VALUE_INFINITE);
567 aspirationDelta += aspirationDelta / 2;
572 } while (abs(value) < VALUE_KNOWN_WIN);
574 // Collect info about search result
575 bestMove = Rml[0].pv[0];
576 *ponderMove = Rml[0].pv[1];
577 bestValues[depth] = value;
578 bestMoveChanges[depth] = Rml.bestMoveChanges;
580 // Do we need to pick now the best and the ponder moves ?
581 if (SkillLevelEnabled && depth == 1 + SkillLevel)
582 do_skill_level(&skillBest, &skillPonder);
584 // Retrieve max searched depth among threads
586 for (int i = 0; i < Threads.size(); i++)
587 if (Threads[i].maxPly > selDepth)
588 selDepth = Threads[i].maxPly;
590 // Send PV line to GUI and to log file
591 for (int i = 0; i < Min(UCIMultiPV, (int)Rml.size()); i++)
592 cout << Rml[i].pv_info_to_uci(pos, depth, selDepth, alpha, beta, i) << endl;
594 if (LogFile.is_open())
595 LogFile << pretty_pv(pos, depth, value, current_search_time(), Rml[0].pv) << endl;
597 // Init easyMove after first iteration or drop if differs from the best move
598 if (depth == 1 && (Rml.size() == 1 || Rml[0].pv_score > Rml[1].pv_score + EasyMoveMargin))
600 else if (bestMove != easyMove)
601 easyMove = MOVE_NONE;
603 // Check for some early stop condition
604 if (!StopRequest && Limits.useTimeManagement())
606 // Stop search early when the last two iterations returned a mate score
608 && abs(bestValues[depth]) >= VALUE_MATE_IN_PLY_MAX
609 && abs(bestValues[depth - 1]) >= VALUE_MATE_IN_PLY_MAX)
612 // Stop search early if one move seems to be much better than the
613 // others or if there is only a single legal move. Also in the latter
614 // case we search up to some depth anyway to get a proper score.
616 && easyMove == bestMove
618 ||( Rml[0].nodes > (pos.nodes_searched() * 85) / 100
619 && current_search_time() > TimeMgr.available_time() / 16)
620 ||( Rml[0].nodes > (pos.nodes_searched() * 98) / 100
621 && current_search_time() > TimeMgr.available_time() / 32)))
624 // Take in account some extra time if the best move has changed
625 if (depth > 4 && depth < 50)
626 TimeMgr.pv_instability(bestMoveChanges[depth], bestMoveChanges[depth - 1]);
628 // Stop search if most of available time is already consumed. We probably don't
629 // have enough time to search the first move at the next iteration anyway.
630 if (current_search_time() > (TimeMgr.available_time() * 62) / 100)
633 // If we are allowed to ponder do not stop the search now but keep pondering
634 if (StopRequest && Limits.ponder)
637 StopOnPonderhit = true;
642 // When using skills overwrite best and ponder moves with the sub-optimal ones
643 if (SkillLevelEnabled)
645 if (skillBest == MOVE_NONE) // Still unassigned ?
646 do_skill_level(&skillBest, &skillPonder);
648 bestMove = skillBest;
649 *ponderMove = skillPonder;
656 // search<>() is the main search function for both PV and non-PV nodes and for
657 // normal and SplitPoint nodes. When called just after a split point the search
658 // is simpler because we have already probed the hash table, done a null move
659 // search, and searched the first move before splitting, we don't have to repeat
660 // all this work again. We also don't need to store anything to the hash table
661 // here: This is taken care of after we return from the split point.
663 template <NodeType NT>
664 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth) {
666 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV);
667 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV);
668 const bool RootNode = (NT == Root);
670 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
671 assert(beta > alpha && beta <= VALUE_INFINITE);
672 assert(PvNode || alpha == beta - 1);
673 assert(pos.thread() >= 0 && pos.thread() < Threads.size());
675 Move movesSearched[MAX_MOVES];
680 Move ttMove, move, excludedMove, threatMove;
683 Value bestValue, value, oldAlpha;
684 Value refinedValue, nullValue, futilityBase, futilityValueScaled; // Non-PV specific
685 bool isPvMove, inCheck, singularExtensionNode, givesCheck, captureOrPromotion, dangerous;
686 int moveCount = 0, playedMoveCount = 0;
687 int threadID = pos.thread();
688 SplitPoint* sp = NULL;
690 refinedValue = bestValue = value = -VALUE_INFINITE;
692 inCheck = pos.in_check();
693 ss->ply = (ss-1)->ply + 1;
695 // Used to send selDepth info to GUI
696 if (PvNode && Threads[threadID].maxPly < ss->ply)
697 Threads[threadID].maxPly = ss->ply;
703 ttMove = excludedMove = MOVE_NONE;
704 threatMove = sp->threatMove;
705 goto split_point_start;
710 // Step 1. Initialize node and poll. Polling can abort search
711 ss->currentMove = ss->bestMove = threatMove = (ss+1)->excludedMove = MOVE_NONE;
712 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
713 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
715 if (threadID == 0 && ++NodesSincePoll > NodesBetweenPolls)
721 // Step 2. Check for aborted search and immediate draw
723 || Threads[threadID].cutoff_occurred()
725 || ss->ply > PLY_MAX) && !RootNode)
728 // Step 3. Mate distance pruning
729 alpha = Max(value_mated_in(ss->ply), alpha);
730 beta = Min(value_mate_in(ss->ply+1), beta);
734 // Step 4. Transposition table lookup
735 // We don't want the score of a partial search to overwrite a previous full search
736 // TT value, so we use a different position key in case of an excluded move.
737 excludedMove = ss->excludedMove;
738 posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
740 tte = TT.probe(posKey);
741 ttMove = tte ? tte->move() : MOVE_NONE;
743 // At PV nodes we check for exact scores, while at non-PV nodes we check for
744 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
745 // smooth experience in analysis mode.
748 && (PvNode ? tte->depth() >= depth && tte->type() == VALUE_TYPE_EXACT
749 : ok_to_use_TT(tte, depth, beta, ss->ply)))
752 ss->bestMove = ttMove; // Can be MOVE_NONE
753 return value_from_tt(tte->value(), ss->ply);
756 // Step 5. Evaluate the position statically and update parent's gain statistics
758 ss->eval = ss->evalMargin = VALUE_NONE;
761 assert(tte->static_value() != VALUE_NONE);
763 ss->eval = tte->static_value();
764 ss->evalMargin = tte->static_value_margin();
765 refinedValue = refine_eval(tte, ss->eval, ss->ply);
769 refinedValue = ss->eval = evaluate(pos, ss->evalMargin);
770 TT.store(posKey, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, MOVE_NONE, ss->eval, ss->evalMargin);
773 // Save gain for the parent non-capture move
774 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
776 // Step 6. Razoring (is omitted in PV nodes)
778 && depth < RazorDepth
780 && refinedValue + razor_margin(depth) < beta
781 && ttMove == MOVE_NONE
782 && abs(beta) < VALUE_MATE_IN_PLY_MAX
783 && !pos.has_pawn_on_7th(pos.side_to_move()))
785 Value rbeta = beta - razor_margin(depth);
786 Value v = qsearch<NonPV>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
788 // Logically we should return (v + razor_margin(depth)), but
789 // surprisingly this did slightly weaker in tests.
793 // Step 7. Static null move pruning (is omitted in PV nodes)
794 // We're betting that the opponent doesn't have a move that will reduce
795 // the score by more than futility_margin(depth) if we do a null move.
798 && depth < RazorDepth
800 && refinedValue - futility_margin(depth, 0) >= beta
801 && abs(beta) < VALUE_MATE_IN_PLY_MAX
802 && pos.non_pawn_material(pos.side_to_move()))
803 return refinedValue - futility_margin(depth, 0);
805 // Step 8. Null move search with verification search (is omitted in PV nodes)
810 && refinedValue >= beta
811 && abs(beta) < VALUE_MATE_IN_PLY_MAX
812 && pos.non_pawn_material(pos.side_to_move()))
814 ss->currentMove = MOVE_NULL;
816 // Null move dynamic reduction based on depth
817 int R = 3 + (depth >= 5 * ONE_PLY ? depth / 8 : 0);
819 // Null move dynamic reduction based on value
820 if (refinedValue - PawnValueMidgame > beta)
823 pos.do_null_move(st);
824 (ss+1)->skipNullMove = true;
825 nullValue = depth-R*ONE_PLY < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
826 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R*ONE_PLY);
827 (ss+1)->skipNullMove = false;
828 pos.undo_null_move();
830 if (nullValue >= beta)
832 // Do not return unproven mate scores
833 if (nullValue >= VALUE_MATE_IN_PLY_MAX)
836 if (depth < 6 * ONE_PLY)
839 // Do verification search at high depths
840 ss->skipNullMove = true;
841 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R*ONE_PLY);
842 ss->skipNullMove = false;
849 // The null move failed low, which means that we may be faced with
850 // some kind of threat. If the previous move was reduced, check if
851 // the move that refuted the null move was somehow connected to the
852 // move which was reduced. If a connection is found, return a fail
853 // low score (which will cause the reduced move to fail high in the
854 // parent node, which will trigger a re-search with full depth).
855 threatMove = (ss+1)->bestMove;
857 if ( depth < ThreatDepth
859 && threatMove != MOVE_NONE
860 && connected_moves(pos, (ss-1)->currentMove, threatMove))
865 // Step 9. Internal iterative deepening
866 if ( depth >= IIDDepth[PvNode]
867 && ttMove == MOVE_NONE
868 && (PvNode || (!inCheck && ss->eval + IIDMargin >= beta)))
870 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
872 ss->skipNullMove = true;
873 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d);
874 ss->skipNullMove = false;
876 tte = TT.probe(posKey);
877 ttMove = tte ? tte->move() : MOVE_NONE;
880 split_point_start: // At split points actual search starts from here
882 // Initialize a MovePicker object for the current position
883 MovePickerExt<NT> mp(pos, ttMove, depth, H, ss, PvNode ? -VALUE_INFINITE : beta);
885 Bitboard pinned = pos.pinned_pieces(pos.side_to_move());
886 ss->bestMove = MOVE_NONE;
887 futilityBase = ss->eval + ss->evalMargin;
888 singularExtensionNode = !RootNode
890 && depth >= SingularExtensionDepth[PvNode]
891 && ttMove != MOVE_NONE
892 && !excludedMove // Do not allow recursive singular extension search
893 && (tte->type() & VALUE_TYPE_LOWER)
894 && tte->depth() >= depth - 3 * ONE_PLY;
897 lock_grab(&(sp->lock));
898 bestValue = sp->bestValue;
901 // Step 10. Loop through moves
902 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
903 while ( bestValue < beta
904 && (move = mp.get_next_move()) != MOVE_NONE
905 && !Threads[threadID].cutoff_occurred())
907 assert(move_is_ok(move));
909 if (move == excludedMove)
912 // At PV and SpNode nodes we want the moves to be legal
913 if ((PvNode || SpNode) && !pos.pl_move_is_legal(move, pinned))
918 moveCount = ++sp->moveCount;
919 lock_release(&(sp->lock));
926 // This is used by time management
927 FirstRootMove = (moveCount == 1);
929 // Save the current node count before the move is searched
930 nodes = pos.nodes_searched();
932 // If it's time to send nodes info, do it here where we have the
933 // correct accumulated node counts searched by each thread.
934 if (SendSearchedNodes)
936 SendSearchedNodes = false;
937 cout << "info" << speed_to_uci(pos.nodes_searched()) << endl;
940 if (current_search_time() > 2000)
941 cout << "info currmove " << move
942 << " currmovenumber " << moveCount << endl;
945 // At Root and at first iteration do a PV search on all the moves to score root moves
946 isPvMove = (PvNode && moveCount <= (RootNode ? depth <= ONE_PLY ? 1000 : MultiPV : 1));
947 givesCheck = pos.move_gives_check(move, ci);
948 captureOrPromotion = pos.move_is_capture(move) || move_is_promotion(move);
950 // Step 11. Decide the new search depth
951 ext = extension<PvNode>(pos, move, captureOrPromotion, givesCheck, &dangerous);
953 // Singular extension search. If all moves but one fail low on a search of
954 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
955 // is singular and should be extended. To verify this we do a reduced search
956 // on all the other moves but the ttMove, if result is lower than ttValue minus
957 // a margin then we extend ttMove.
958 if ( singularExtensionNode
960 && pos.pl_move_is_legal(move, pinned)
963 Value ttValue = value_from_tt(tte->value(), ss->ply);
965 if (abs(ttValue) < VALUE_KNOWN_WIN)
967 Value rBeta = ttValue - int(depth);
968 ss->excludedMove = move;
969 ss->skipNullMove = true;
970 Value v = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2);
971 ss->skipNullMove = false;
972 ss->excludedMove = MOVE_NONE;
973 ss->bestMove = MOVE_NONE;
979 // Update current move (this must be done after singular extension search)
980 newDepth = depth - ONE_PLY + ext;
982 // Step 12. Futility pruning (is omitted in PV nodes)
984 && !captureOrPromotion
988 && !move_is_castle(move))
990 // Move count based pruning
991 if ( moveCount >= futility_move_count(depth)
992 && (!threatMove || !connected_threat(pos, move, threatMove))
993 && bestValue > VALUE_MATED_IN_PLY_MAX) // FIXME bestValue is racy
996 lock_grab(&(sp->lock));
1001 // Value based pruning
1002 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
1003 // but fixing this made program slightly weaker.
1004 Depth predictedDepth = newDepth - reduction<PvNode>(depth, moveCount);
1005 futilityValueScaled = futilityBase + futility_margin(predictedDepth, moveCount)
1006 + H.gain(pos.piece_on(move_from(move)), move_to(move));
1008 if (futilityValueScaled < beta)
1012 lock_grab(&(sp->lock));
1013 if (futilityValueScaled > sp->bestValue)
1014 sp->bestValue = bestValue = futilityValueScaled;
1016 else if (futilityValueScaled > bestValue)
1017 bestValue = futilityValueScaled;
1022 // Prune moves with negative SEE at low depths
1023 if ( predictedDepth < 2 * ONE_PLY
1024 && bestValue > VALUE_MATED_IN_PLY_MAX
1025 && pos.see_sign(move) < 0)
1028 lock_grab(&(sp->lock));
1034 // Check for legality only before to do the move
1035 if (!pos.pl_move_is_legal(move, pinned))
1041 ss->currentMove = move;
1043 // Step 13. Make the move
1044 pos.do_move(move, st, ci, givesCheck);
1046 if (!SpNode && !captureOrPromotion)
1047 movesSearched[playedMoveCount++] = move;
1049 // Step extra. pv search (only in PV nodes)
1050 // The first move in list is the expected PV
1053 // Aspiration window is disabled in multi-pv case
1054 if (RootNode && MultiPV > 1)
1055 alpha = -VALUE_INFINITE;
1057 value = newDepth < ONE_PLY ? -qsearch<PV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
1058 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
1062 // Step 14. Reduced depth search
1063 // If the move fails high will be re-searched at full depth.
1064 bool doFullDepthSearch = true;
1065 alpha = SpNode ? sp->alpha : alpha;
1067 if ( depth >= 3 * ONE_PLY
1068 && !captureOrPromotion
1070 && !move_is_castle(move)
1071 && ss->killers[0] != move
1072 && ss->killers[1] != move)
1074 ss->reduction = reduction<PvNode>(depth, moveCount);
1077 Depth d = newDepth - ss->reduction;
1078 value = d < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
1079 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d);
1080 doFullDepthSearch = (value > alpha);
1082 ss->reduction = DEPTH_ZERO; // Restore original reduction
1085 // Probcut search for bad captures. If a reduced search returns a value
1086 // very below beta then we can (almost) safely prune the bad capture.
1087 if ( depth >= 3 * ONE_PLY
1088 && depth < 8 * ONE_PLY
1089 && mp.isBadCapture()
1092 && !move_is_promotion(move)
1093 && abs(alpha) < VALUE_MATE_IN_PLY_MAX)
1095 ss->reduction = 3 * ONE_PLY;
1096 Value rAlpha = alpha - 300;
1097 Depth d = newDepth - ss->reduction;
1098 value = d < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(rAlpha+1), -rAlpha, DEPTH_ZERO)
1099 : - search<NonPV>(pos, ss+1, -(rAlpha+1), -rAlpha, d);
1100 doFullDepthSearch = (value > rAlpha);
1101 ss->reduction = DEPTH_ZERO; // Restore original reduction
1104 // Step 15. Full depth search
1105 if (doFullDepthSearch)
1107 alpha = SpNode ? sp->alpha : alpha;
1108 value = newDepth < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
1109 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth);
1111 // Step extra. pv search (only in PV nodes)
1112 // Search only for possible new PV nodes, if instead value >= beta then
1113 // parent node fails low with value <= alpha and tries another move.
1114 if (PvNode && value > alpha && (RootNode || value < beta))
1115 value = newDepth < ONE_PLY ? -qsearch<PV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
1116 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
1120 // Step 16. Undo move
1121 pos.undo_move(move);
1123 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1125 // Step 17. Check for new best move
1128 lock_grab(&(sp->lock));
1129 bestValue = sp->bestValue;
1133 if (value > bestValue && !(SpNode && Threads[threadID].cutoff_occurred()))
1138 sp->bestValue = value;
1140 if (!RootNode && value > alpha)
1142 if (PvNode && value < beta) // We want always alpha < beta
1150 sp->is_betaCutoff = true;
1152 ss->bestMove = move;
1155 sp->ss->bestMove = move;
1161 // Finished searching the move. If StopRequest is true, the search
1162 // was aborted because the user interrupted the search or because we
1163 // ran out of time. In this case, the return value of the search cannot
1164 // be trusted, and we break out of the loop without updating the best
1169 // Remember searched nodes counts for this move
1170 mp.rm->nodes += pos.nodes_searched() - nodes;
1172 // PV move or new best move ?
1173 if (isPvMove || value > alpha)
1176 ss->bestMove = move;
1177 mp.rm->pv_score = value;
1178 mp.rm->extract_pv_from_tt(pos);
1180 // We record how often the best move has been changed in each
1181 // iteration. This information is used for time management: When
1182 // the best move changes frequently, we allocate some more time.
1183 if (!isPvMove && MultiPV == 1)
1184 Rml.bestMoveChanges++;
1186 Rml.sort_multipv(moveCount);
1188 // Update alpha. In multi-pv we don't use aspiration window, so
1189 // set alpha equal to minimum score among the PV lines.
1191 alpha = Rml[Min(moveCount, MultiPV) - 1].pv_score; // FIXME why moveCount?
1192 else if (value > alpha)
1196 mp.rm->pv_score = -VALUE_INFINITE;
1200 // Step 18. Check for split
1203 && depth >= Threads.min_split_depth()
1205 && Threads.available_slave_exists(threadID)
1207 && !Threads[threadID].cutoff_occurred())
1208 Threads.split<FakeSplit>(pos, ss, &alpha, beta, &bestValue, depth,
1209 threatMove, moveCount, &mp, PvNode);
1212 // Step 19. Check for mate and stalemate
1213 // All legal moves have been searched and if there are
1214 // no legal moves, it must be mate or stalemate.
1215 // If one move was excluded return fail low score.
1216 if (!SpNode && !moveCount)
1217 return excludedMove ? oldAlpha : inCheck ? value_mated_in(ss->ply) : VALUE_DRAW;
1219 // Step 20. Update tables
1220 // If the search is not aborted, update the transposition table,
1221 // history counters, and killer moves.
1222 if (!SpNode && !StopRequest && !Threads[threadID].cutoff_occurred())
1224 move = bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove;
1225 vt = bestValue <= oldAlpha ? VALUE_TYPE_UPPER
1226 : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT;
1228 TT.store(posKey, value_to_tt(bestValue, ss->ply), vt, depth, move, ss->eval, ss->evalMargin);
1230 // Update killers and history only for non capture moves that fails high
1231 if ( bestValue >= beta
1232 && !pos.move_is_capture(move)
1233 && !move_is_promotion(move))
1235 if (move != ss->killers[0])
1237 ss->killers[1] = ss->killers[0];
1238 ss->killers[0] = move;
1240 update_history(pos, move, depth, movesSearched, playedMoveCount);
1246 // Here we have the lock still grabbed
1247 sp->is_slave[threadID] = false;
1248 sp->nodes += pos.nodes_searched();
1249 lock_release(&(sp->lock));
1252 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1257 // qsearch() is the quiescence search function, which is called by the main
1258 // search function when the remaining depth is zero (or, to be more precise,
1259 // less than ONE_PLY).
1261 template <NodeType NT>
1262 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth) {
1264 const bool PvNode = (NT == PV);
1266 assert(NT == PV || NT == NonPV);
1267 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1268 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1269 assert(PvNode || alpha == beta - 1);
1271 assert(pos.thread() >= 0 && pos.thread() < Threads.size());
1275 Value bestValue, value, evalMargin, futilityValue, futilityBase;
1276 bool inCheck, enoughMaterial, givesCheck, evasionPrunable;
1279 Value oldAlpha = alpha;
1281 ss->bestMove = ss->currentMove = MOVE_NONE;
1282 ss->ply = (ss-1)->ply + 1;
1284 // Check for an instant draw or maximum ply reached
1285 if (ss->ply > PLY_MAX || pos.is_draw())
1288 // Decide whether or not to include checks, this fixes also the type of
1289 // TT entry depth that we are going to use. Note that in qsearch we use
1290 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1291 inCheck = pos.in_check();
1292 ttDepth = (inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS : DEPTH_QS_NO_CHECKS);
1294 // Transposition table lookup. At PV nodes, we don't use the TT for
1295 // pruning, but only for move ordering.
1296 tte = TT.probe(pos.get_key());
1297 ttMove = (tte ? tte->move() : MOVE_NONE);
1299 if (!PvNode && tte && ok_to_use_TT(tte, ttDepth, beta, ss->ply))
1301 ss->bestMove = ttMove; // Can be MOVE_NONE
1302 return value_from_tt(tte->value(), ss->ply);
1305 // Evaluate the position statically
1308 bestValue = futilityBase = -VALUE_INFINITE;
1309 ss->eval = evalMargin = VALUE_NONE;
1310 enoughMaterial = false;
1316 assert(tte->static_value() != VALUE_NONE);
1318 evalMargin = tte->static_value_margin();
1319 ss->eval = bestValue = tte->static_value();
1322 ss->eval = bestValue = evaluate(pos, evalMargin);
1324 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
1326 // Stand pat. Return immediately if static value is at least beta
1327 if (bestValue >= beta)
1330 TT.store(pos.get_key(), value_to_tt(bestValue, ss->ply), VALUE_TYPE_LOWER, DEPTH_NONE, MOVE_NONE, ss->eval, evalMargin);
1335 if (PvNode && bestValue > alpha)
1338 // Futility pruning parameters, not needed when in check
1339 futilityBase = ss->eval + evalMargin + FutilityMarginQS;
1340 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1343 // Initialize a MovePicker object for the current position, and prepare
1344 // to search the moves. Because the depth is <= 0 here, only captures,
1345 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1347 MovePicker mp(pos, ttMove, depth, H);
1349 Bitboard pinned = pos.pinned_pieces(pos.side_to_move());
1351 // Loop through the moves until no moves remain or a beta cutoff occurs
1352 while ( alpha < beta
1353 && (move = mp.get_next_move()) != MOVE_NONE)
1355 assert(move_is_ok(move));
1357 givesCheck = pos.move_gives_check(move, ci);
1365 && !move_is_promotion(move)
1366 && !pos.move_is_passed_pawn_push(move))
1368 futilityValue = futilityBase
1369 + pos.endgame_value_of_piece_on(move_to(move))
1370 + (move_is_ep(move) ? PawnValueEndgame : VALUE_ZERO);
1372 if (futilityValue < alpha)
1374 if (futilityValue > bestValue)
1375 bestValue = futilityValue;
1379 // Prune moves with negative or equal SEE
1380 if ( futilityBase < beta
1381 && depth < DEPTH_ZERO
1382 && pos.see(move) <= 0)
1386 // Detect non-capture evasions that are candidate to be pruned
1387 evasionPrunable = !PvNode
1389 && bestValue > VALUE_MATED_IN_PLY_MAX
1390 && !pos.move_is_capture(move)
1391 && !pos.can_castle(pos.side_to_move());
1393 // Don't search moves with negative SEE values
1395 && (!inCheck || evasionPrunable)
1397 && !move_is_promotion(move)
1398 && pos.see_sign(move) < 0)
1401 // Don't search useless checks
1406 && !pos.move_is_capture(move)
1407 && !move_is_promotion(move)
1408 && ss->eval + PawnValueMidgame / 4 < beta
1409 && !check_is_dangerous(pos, move, futilityBase, beta, &bestValue))
1411 if (ss->eval + PawnValueMidgame / 4 > bestValue)
1412 bestValue = ss->eval + PawnValueMidgame / 4;
1417 // Check for legality only before to do the move
1418 if (!pos.pl_move_is_legal(move, pinned))
1421 // Update current move
1422 ss->currentMove = move;
1424 // Make and search the move
1425 pos.do_move(move, st, ci, givesCheck);
1426 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth-ONE_PLY);
1427 pos.undo_move(move);
1429 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1432 if (value > bestValue)
1438 ss->bestMove = move;
1443 // All legal moves have been searched. A special case: If we're in check
1444 // and no legal moves were found, it is checkmate.
1445 if (inCheck && bestValue == -VALUE_INFINITE)
1446 return value_mated_in(ss->ply);
1448 // Update transposition table
1449 ValueType vt = (bestValue <= oldAlpha ? VALUE_TYPE_UPPER : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT);
1450 TT.store(pos.get_key(), value_to_tt(bestValue, ss->ply), vt, ttDepth, ss->bestMove, ss->eval, evalMargin);
1452 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1458 // check_is_dangerous() tests if a checking move can be pruned in qsearch().
1459 // bestValue is updated only when returning false because in that case move
1462 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bestValue)
1464 Bitboard b, occ, oldAtt, newAtt, kingAtt;
1465 Square from, to, ksq, victimSq;
1468 Value futilityValue, bv = *bestValue;
1470 from = move_from(move);
1472 them = opposite_color(pos.side_to_move());
1473 ksq = pos.king_square(them);
1474 kingAtt = pos.attacks_from<KING>(ksq);
1475 pc = pos.piece_on(from);
1477 occ = pos.occupied_squares() & ~(1ULL << from) & ~(1ULL << ksq);
1478 oldAtt = pos.attacks_from(pc, from, occ);
1479 newAtt = pos.attacks_from(pc, to, occ);
1481 // Rule 1. Checks which give opponent's king at most one escape square are dangerous
1482 b = kingAtt & ~pos.pieces_of_color(them) & ~newAtt & ~(1ULL << to);
1484 if (!(b && (b & (b - 1))))
1487 // Rule 2. Queen contact check is very dangerous
1488 if ( type_of_piece(pc) == QUEEN
1489 && bit_is_set(kingAtt, to))
1492 // Rule 3. Creating new double threats with checks
1493 b = pos.pieces_of_color(them) & newAtt & ~oldAtt & ~(1ULL << ksq);
1497 victimSq = pop_1st_bit(&b);
1498 futilityValue = futilityBase + pos.endgame_value_of_piece_on(victimSq);
1500 // Note that here we generate illegal "double move"!
1501 if ( futilityValue >= beta
1502 && pos.see_sign(make_move(from, victimSq)) >= 0)
1505 if (futilityValue > bv)
1509 // Update bestValue only if check is not dangerous (because we will prune the move)
1515 // connected_moves() tests whether two moves are 'connected' in the sense
1516 // that the first move somehow made the second move possible (for instance
1517 // if the moving piece is the same in both moves). The first move is assumed
1518 // to be the move that was made to reach the current position, while the
1519 // second move is assumed to be a move from the current position.
1521 bool connected_moves(const Position& pos, Move m1, Move m2) {
1523 Square f1, t1, f2, t2;
1526 assert(m1 && move_is_ok(m1));
1527 assert(m2 && move_is_ok(m2));
1529 // Case 1: The moving piece is the same in both moves
1535 // Case 2: The destination square for m2 was vacated by m1
1541 // Case 3: Moving through the vacated square
1542 if ( piece_is_slider(pos.piece_on(f2))
1543 && bit_is_set(squares_between(f2, t2), f1))
1546 // Case 4: The destination square for m2 is defended by the moving piece in m1
1547 p = pos.piece_on(t1);
1548 if (bit_is_set(pos.attacks_from(p, t1), t2))
1551 // Case 5: Discovered check, checking piece is the piece moved in m1
1552 if ( piece_is_slider(p)
1553 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
1554 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
1556 // discovered_check_candidates() works also if the Position's side to
1557 // move is the opposite of the checking piece.
1558 Color them = opposite_color(pos.side_to_move());
1559 Bitboard dcCandidates = pos.discovered_check_candidates(them);
1561 if (bit_is_set(dcCandidates, f2))
1568 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1569 // "plies to mate from the current ply". Non-mate scores are unchanged.
1570 // The function is called before storing a value to the transposition table.
1572 Value value_to_tt(Value v, int ply) {
1574 if (v >= VALUE_MATE_IN_PLY_MAX)
1577 if (v <= VALUE_MATED_IN_PLY_MAX)
1584 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score from
1585 // the transposition table to a mate score corrected for the current ply.
1587 Value value_from_tt(Value v, int ply) {
1589 if (v >= VALUE_MATE_IN_PLY_MAX)
1592 if (v <= VALUE_MATED_IN_PLY_MAX)
1599 // extension() decides whether a move should be searched with normal depth,
1600 // or with extended depth. Certain classes of moves (checking moves, in
1601 // particular) are searched with bigger depth than ordinary moves and in
1602 // any case are marked as 'dangerous'. Note that also if a move is not
1603 // extended, as example because the corresponding UCI option is set to zero,
1604 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
1605 template <bool PvNode>
1606 Depth extension(const Position& pos, Move m, bool captureOrPromotion,
1607 bool moveIsCheck, bool* dangerous) {
1609 assert(m != MOVE_NONE);
1611 Depth result = DEPTH_ZERO;
1612 *dangerous = moveIsCheck;
1614 if (moveIsCheck && pos.see_sign(m) >= 0)
1615 result += CheckExtension[PvNode];
1617 if (pos.type_of_piece_on(move_from(m)) == PAWN)
1619 Color c = pos.side_to_move();
1620 if (relative_rank(c, move_to(m)) == RANK_7)
1622 result += PawnPushTo7thExtension[PvNode];
1625 if (pos.pawn_is_passed(c, move_to(m)))
1627 result += PassedPawnExtension[PvNode];
1632 if ( captureOrPromotion
1633 && pos.type_of_piece_on(move_to(m)) != PAWN
1634 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
1635 - pos.midgame_value_of_piece_on(move_to(m)) == VALUE_ZERO)
1636 && !move_is_special(m))
1638 result += PawnEndgameExtension[PvNode];
1642 return Min(result, ONE_PLY);
1646 // connected_threat() tests whether it is safe to forward prune a move or if
1647 // is somehow connected to the threat move returned by null search.
1649 bool connected_threat(const Position& pos, Move m, Move threat) {
1651 assert(move_is_ok(m));
1652 assert(threat && move_is_ok(threat));
1653 assert(!pos.move_gives_check(m));
1654 assert(!pos.move_is_capture(m) && !move_is_promotion(m));
1655 assert(!pos.move_is_passed_pawn_push(m));
1657 Square mfrom, mto, tfrom, tto;
1659 mfrom = move_from(m);
1661 tfrom = move_from(threat);
1662 tto = move_to(threat);
1664 // Case 1: Don't prune moves which move the threatened piece
1668 // Case 2: If the threatened piece has value less than or equal to the
1669 // value of the threatening piece, don't prune moves which defend it.
1670 if ( pos.move_is_capture(threat)
1671 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
1672 || pos.type_of_piece_on(tfrom) == KING)
1673 && pos.move_attacks_square(m, tto))
1676 // Case 3: If the moving piece in the threatened move is a slider, don't
1677 // prune safe moves which block its ray.
1678 if ( piece_is_slider(pos.piece_on(tfrom))
1679 && bit_is_set(squares_between(tfrom, tto), mto)
1680 && pos.see_sign(m) >= 0)
1687 // ok_to_use_TT() returns true if a transposition table score
1688 // can be used at a given point in search.
1690 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
1692 Value v = value_from_tt(tte->value(), ply);
1694 return ( tte->depth() >= depth
1695 || v >= Max(VALUE_MATE_IN_PLY_MAX, beta)
1696 || v < Min(VALUE_MATED_IN_PLY_MAX, beta))
1698 && ( ((tte->type() & VALUE_TYPE_LOWER) && v >= beta)
1699 || ((tte->type() & VALUE_TYPE_UPPER) && v < beta));
1703 // refine_eval() returns the transposition table score if
1704 // possible otherwise falls back on static position evaluation.
1706 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
1710 Value v = value_from_tt(tte->value(), ply);
1712 if ( ((tte->type() & VALUE_TYPE_LOWER) && v >= defaultEval)
1713 || ((tte->type() & VALUE_TYPE_UPPER) && v < defaultEval))
1720 // update_history() registers a good move that produced a beta-cutoff
1721 // in history and marks as failures all the other moves of that ply.
1723 void update_history(const Position& pos, Move move, Depth depth,
1724 Move movesSearched[], int moveCount) {
1726 Value bonus = Value(int(depth) * int(depth));
1728 H.update(pos.piece_on(move_from(move)), move_to(move), bonus);
1730 for (int i = 0; i < moveCount - 1; i++)
1732 m = movesSearched[i];
1736 H.update(pos.piece_on(move_from(m)), move_to(m), -bonus);
1741 // update_gains() updates the gains table of a non-capture move given
1742 // the static position evaluation before and after the move.
1744 void update_gains(const Position& pos, Move m, Value before, Value after) {
1747 && before != VALUE_NONE
1748 && after != VALUE_NONE
1749 && pos.captured_piece_type() == PIECE_TYPE_NONE
1750 && !move_is_special(m))
1751 H.update_gain(pos.piece_on(move_to(m)), move_to(m), -(before + after));
1755 // current_search_time() returns the number of milliseconds which have passed
1756 // since the beginning of the current search.
1758 int current_search_time(int set) {
1760 static int searchStartTime;
1763 searchStartTime = set;
1765 return get_system_time() - searchStartTime;
1769 // value_to_uci() converts a value to a string suitable for use with the UCI
1770 // protocol specifications:
1772 // cp <x> The score from the engine's point of view in centipawns.
1773 // mate <y> Mate in y moves, not plies. If the engine is getting mated
1774 // use negative values for y.
1776 std::string value_to_uci(Value v) {
1778 std::stringstream s;
1780 if (abs(v) < VALUE_MATE - PLY_MAX * ONE_PLY)
1781 s << "cp " << int(v) * 100 / int(PawnValueMidgame); // Scale to centipawns
1783 s << "mate " << (v > 0 ? VALUE_MATE - v + 1 : -VALUE_MATE - v) / 2;
1789 // speed_to_uci() returns a string with time stats of current search suitable
1790 // to be sent to UCI gui.
1792 std::string speed_to_uci(int64_t nodes) {
1794 std::stringstream s;
1795 int t = current_search_time();
1797 s << " nodes " << nodes
1798 << " nps " << (t > 0 ? int(nodes * 1000 / t) : 0)
1805 // poll() performs two different functions: It polls for user input, and it
1806 // looks at the time consumed so far and decides if it's time to abort the
1809 void poll(const Position& pos) {
1811 static int lastInfoTime;
1812 int t = current_search_time();
1815 if (input_available())
1817 // We are line oriented, don't read single chars
1818 std::string command;
1820 if (!std::getline(std::cin, command) || command == "quit")
1822 // Quit the program as soon as possible
1823 Limits.ponder = false;
1824 QuitRequest = StopRequest = true;
1827 else if (command == "stop")
1829 // Stop calculating as soon as possible, but still send the "bestmove"
1830 // and possibly the "ponder" token when finishing the search.
1831 Limits.ponder = false;
1834 else if (command == "ponderhit")
1836 // The opponent has played the expected move. GUI sends "ponderhit" if
1837 // we were told to ponder on the same move the opponent has played. We
1838 // should continue searching but switching from pondering to normal search.
1839 Limits.ponder = false;
1841 if (StopOnPonderhit)
1846 // Print search information
1850 else if (lastInfoTime > t)
1851 // HACK: Must be a new search where we searched less than
1852 // NodesBetweenPolls nodes during the first second of search.
1855 else if (t - lastInfoTime >= 1000)
1860 dbg_print_hit_rate();
1862 // Send info on searched nodes as soon as we return to root
1863 SendSearchedNodes = true;
1866 // Should we stop the search?
1870 bool stillAtFirstMove = FirstRootMove
1871 && !AspirationFailLow
1872 && t > TimeMgr.available_time();
1874 bool noMoreTime = t > TimeMgr.maximum_time()
1875 || stillAtFirstMove;
1877 if ( (Limits.useTimeManagement() && noMoreTime)
1878 || (Limits.maxTime && t >= Limits.maxTime)
1879 || (Limits.maxNodes && pos.nodes_searched() >= Limits.maxNodes)) // FIXME
1884 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
1885 // while the program is pondering. The point is to work around a wrinkle in
1886 // the UCI protocol: When pondering, the engine is not allowed to give a
1887 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
1888 // We simply wait here until one of these commands is sent, and return,
1889 // after which the bestmove and pondermove will be printed.
1891 void wait_for_stop_or_ponderhit() {
1893 std::string command;
1895 // Wait for a command from stdin
1896 while ( std::getline(std::cin, command)
1897 && command != "ponderhit" && command != "stop" && command != "quit") {};
1899 if (command != "ponderhit" && command != "stop")
1900 QuitRequest = true; // Must be "quit" or getline() returned false
1904 // When playing with strength handicap choose best move among the MultiPV set
1905 // using a statistical rule dependent on SkillLevel. Idea by Heinz van Saanen.
1906 void do_skill_level(Move* best, Move* ponder) {
1908 assert(MultiPV > 1);
1912 // Rml list is already sorted by pv_score in descending order
1914 int max_s = -VALUE_INFINITE;
1915 int size = Min(MultiPV, (int)Rml.size());
1916 int max = Rml[0].pv_score;
1917 int var = Min(max - Rml[size - 1].pv_score, PawnValueMidgame);
1918 int wk = 120 - 2 * SkillLevel;
1920 // PRNG sequence should be non deterministic
1921 for (int i = abs(get_system_time() % 50); i > 0; i--)
1922 rk.rand<unsigned>();
1924 // Choose best move. For each move's score we add two terms both dependent
1925 // on wk, one deterministic and bigger for weaker moves, and one random,
1926 // then we choose the move with the resulting highest score.
1927 for (int i = 0; i < size; i++)
1929 s = Rml[i].pv_score;
1931 // Don't allow crazy blunders even at very low skills
1932 if (i > 0 && Rml[i-1].pv_score > s + EasyMoveMargin)
1935 // This is our magical formula
1936 s += ((max - s) * wk + var * (rk.rand<unsigned>() % wk)) / 128;
1941 *best = Rml[i].pv[0];
1942 *ponder = Rml[i].pv[1];
1948 /// RootMove and RootMoveList method's definitions
1950 RootMove::RootMove() {
1953 pv_score = non_pv_score = -VALUE_INFINITE;
1957 RootMove& RootMove::operator=(const RootMove& rm) {
1959 const Move* src = rm.pv;
1962 // Avoid a costly full rm.pv[] copy
1963 do *dst++ = *src; while (*src++ != MOVE_NONE);
1966 pv_score = rm.pv_score;
1967 non_pv_score = rm.non_pv_score;
1971 void RootMoveList::init(Position& pos, Move searchMoves[]) {
1973 MoveStack mlist[MAX_MOVES];
1977 bestMoveChanges = 0;
1979 // Generate all legal moves and add them to RootMoveList
1980 MoveStack* last = generate<MV_LEGAL>(pos, mlist);
1981 for (MoveStack* cur = mlist; cur != last; cur++)
1983 // If we have a searchMoves[] list then verify cur->move
1984 // is in the list before to add it.
1985 for (sm = searchMoves; *sm && *sm != cur->move; sm++) {}
1987 if (searchMoves[0] && *sm != cur->move)
1991 rm.pv[0] = cur->move;
1992 rm.pv[1] = MOVE_NONE;
1993 rm.pv_score = -VALUE_INFINITE;
1998 // extract_pv_from_tt() builds a PV by adding moves from the transposition table.
1999 // We consider also failing high nodes and not only VALUE_TYPE_EXACT nodes. This
2000 // allow to always have a ponder move even when we fail high at root and also a
2001 // long PV to print that is important for position analysis.
2003 void RootMove::extract_pv_from_tt(Position& pos) {
2005 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2009 assert(pv[0] != MOVE_NONE && pos.move_is_pl(pv[0]));
2011 pos.do_move(pv[0], *st++);
2013 while ( (tte = TT.probe(pos.get_key())) != NULL
2014 && tte->move() != MOVE_NONE
2015 && pos.move_is_pl(tte->move())
2016 && pos.pl_move_is_legal(tte->move(), pos.pinned_pieces(pos.side_to_move()))
2018 && (!pos.is_draw() || ply < 2))
2020 pv[ply] = tte->move();
2021 pos.do_move(pv[ply++], *st++);
2023 pv[ply] = MOVE_NONE;
2025 do pos.undo_move(pv[--ply]); while (ply);
2028 // insert_pv_in_tt() is called at the end of a search iteration, and inserts
2029 // the PV back into the TT. This makes sure the old PV moves are searched
2030 // first, even if the old TT entries have been overwritten.
2032 void RootMove::insert_pv_in_tt(Position& pos) {
2034 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2037 Value v, m = VALUE_NONE;
2040 assert(pv[0] != MOVE_NONE && pos.move_is_pl(pv[0]));
2046 // Don't overwrite existing correct entries
2047 if (!tte || tte->move() != pv[ply])
2049 v = (pos.in_check() ? VALUE_NONE : evaluate(pos, m));
2050 TT.store(k, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, pv[ply], v, m);
2052 pos.do_move(pv[ply], *st++);
2054 } while (pv[++ply] != MOVE_NONE);
2056 do pos.undo_move(pv[--ply]); while (ply);
2059 // pv_info_to_uci() returns a string with information on the current PV line
2060 // formatted according to UCI specification.
2062 std::string RootMove::pv_info_to_uci(Position& pos, int depth, int selDepth, Value alpha,
2063 Value beta, int pvIdx) {
2064 std::stringstream s;
2066 s << "info depth " << depth
2067 << " seldepth " << selDepth
2068 << " multipv " << pvIdx + 1
2069 << " score " << value_to_uci(pv_score)
2070 << (pv_score >= beta ? " lowerbound" : pv_score <= alpha ? " upperbound" : "")
2071 << speed_to_uci(pos.nodes_searched())
2074 for (Move* m = pv; *m != MOVE_NONE; m++)
2080 // Specializations for MovePickerExt in case of Root node
2081 MovePickerExt<Root>::MovePickerExt(const Position& p, Move ttm, Depth d,
2082 const History& h, SearchStack* ss, Value b)
2083 : MovePicker(p, ttm, d, h, ss, b), firstCall(true) {
2085 Value score = VALUE_ZERO;
2087 // Score root moves using standard ordering used in main search, the moves
2088 // are scored according to the order in which they are returned by MovePicker.
2089 // This is the second order score that is used to compare the moves when
2090 // the first orders pv_score of both moves are equal.
2091 while ((move = MovePicker::get_next_move()) != MOVE_NONE)
2092 for (rm = Rml.begin(); rm != Rml.end(); ++rm)
2093 if (rm->pv[0] == move)
2095 rm->non_pv_score = score--;
2103 Move MovePickerExt<Root>::get_next_move() {
2110 return rm != Rml.end() ? rm->pv[0] : MOVE_NONE;
2116 // ThreadsManager::idle_loop() is where the threads are parked when they have no work
2117 // to do. The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint
2118 // object for which the current thread is the master.
2120 void ThreadsManager::idle_loop(int threadID, SplitPoint* sp) {
2122 assert(threadID >= 0 && threadID < MAX_THREADS);
2129 // Slave threads can exit as soon as AllThreadsShouldExit raises,
2130 // master should exit as last one.
2131 if (allThreadsShouldExit)
2134 threads[threadID].state = Thread::TERMINATED;
2138 // If we are not thinking, wait for a condition to be signaled
2139 // instead of wasting CPU time polling for work.
2140 while ( threadID >= activeThreads
2141 || threads[threadID].state == Thread::INITIALIZING
2142 || (useSleepingThreads && threads[threadID].state == Thread::AVAILABLE))
2144 assert(!sp || useSleepingThreads);
2145 assert(threadID != 0 || useSleepingThreads);
2147 if (threads[threadID].state == Thread::INITIALIZING)
2148 threads[threadID].state = Thread::AVAILABLE;
2150 // Grab the lock to avoid races with Thread::wake_up()
2151 lock_grab(&threads[threadID].sleepLock);
2153 // If we are master and all slaves have finished do not go to sleep
2154 for (i = 0; sp && i < activeThreads && !sp->is_slave[i]; i++) {}
2155 allFinished = (i == activeThreads);
2157 if (allFinished || allThreadsShouldExit)
2159 lock_release(&threads[threadID].sleepLock);
2163 // Do sleep here after retesting sleep conditions
2164 if (threadID >= activeThreads || threads[threadID].state == Thread::AVAILABLE)
2165 cond_wait(&threads[threadID].sleepCond, &threads[threadID].sleepLock);
2167 lock_release(&threads[threadID].sleepLock);
2170 // If this thread has been assigned work, launch a search
2171 if (threads[threadID].state == Thread::WORKISWAITING)
2173 assert(!allThreadsShouldExit);
2175 threads[threadID].state = Thread::SEARCHING;
2177 // Copy split point position and search stack and call search()
2178 // with SplitPoint template parameter set to true.
2179 SearchStack ss[PLY_MAX_PLUS_2];
2180 SplitPoint* tsp = threads[threadID].splitPoint;
2181 Position pos(*tsp->pos, threadID);
2183 memcpy(ss, tsp->ss - 1, 4 * sizeof(SearchStack));
2187 search<SplitPointPV>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2189 search<SplitPointNonPV>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2191 assert(threads[threadID].state == Thread::SEARCHING);
2193 threads[threadID].state = Thread::AVAILABLE;
2195 // Wake up master thread so to allow it to return from the idle loop in
2196 // case we are the last slave of the split point.
2197 if ( useSleepingThreads
2198 && threadID != tsp->master
2199 && threads[tsp->master].state == Thread::AVAILABLE)
2200 threads[tsp->master].wake_up();
2203 // If this thread is the master of a split point and all slaves have
2204 // finished their work at this split point, return from the idle loop.
2205 for (i = 0; sp && i < activeThreads && !sp->is_slave[i]; i++) {}
2206 allFinished = (i == activeThreads);
2210 // Because sp->slaves[] is reset under lock protection,
2211 // be sure sp->lock has been released before to return.
2212 lock_grab(&(sp->lock));
2213 lock_release(&(sp->lock));
2215 // In helpful master concept a master can help only a sub-tree, and
2216 // because here is all finished is not possible master is booked.
2217 assert(threads[threadID].state == Thread::AVAILABLE);
2219 threads[threadID].state = Thread::SEARCHING;