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, SplitPointPV, SplitPointNonPV };
54 // RootMove struct is used for moves at the root of the tree. For each root
55 // move, we store two scores, a node count, and a PV (really a refutation
56 // in the case of moves which fail low). Value pv_score is normally set at
57 // -VALUE_INFINITE for all non-pv moves, while non_pv_score is computed
58 // according to the order in which moves are returned by MovePicker.
62 RootMove(const RootMove& rm) { *this = rm; }
63 RootMove& operator=(const RootMove& rm);
65 // RootMove::operator<() is the comparison function used when
66 // sorting the moves. A move m1 is considered to be better
67 // than a move m2 if it has an higher pv_score, or if it has
68 // equal pv_score but m1 has the higher non_pv_score. In this way
69 // we are guaranteed that PV moves are always sorted as first.
70 bool operator<(const RootMove& m) const {
71 return pv_score != m.pv_score ? pv_score < m.pv_score
72 : non_pv_score < m.non_pv_score;
75 void extract_pv_from_tt(Position& pos);
76 void insert_pv_in_tt(Position& pos);
81 Move pv[PLY_MAX_PLUS_2];
84 // RootMoveList struct is mainly a std::vector of RootMove objects
85 struct RootMoveList : public std::vector<RootMove> {
86 void init(Position& pos, Move searchMoves[]);
93 // Lookup table to check if a Piece is a slider and its access function
94 const bool Slidings[18] = { 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1 };
95 inline bool piece_is_slider(Piece p) { return Slidings[p]; }
99 // Maximum depth for razoring
100 const Depth RazorDepth = 4 * ONE_PLY;
102 // Dynamic razoring margin based on depth
103 inline Value razor_margin(Depth d) { return Value(0x200 + 0x10 * int(d)); }
105 // Maximum depth for use of dynamic threat detection when null move fails low
106 const Depth ThreatDepth = 5 * ONE_PLY;
108 // Step 9. Internal iterative deepening
110 // Minimum depth for use of internal iterative deepening
111 const Depth IIDDepth[] = { 8 * ONE_PLY, 5 * ONE_PLY };
113 // At Non-PV nodes we do an internal iterative deepening search
114 // when the static evaluation is bigger then beta - IIDMargin.
115 const Value IIDMargin = Value(0x100);
117 // Step 11. Decide the new search depth
119 // Extensions. Array index 0 is used for non-PV nodes, index 1 for PV nodes
120 const Depth CheckExtension[] = { ONE_PLY / 2, ONE_PLY / 1 };
121 const Depth PawnEndgameExtension[] = { ONE_PLY / 1, ONE_PLY / 1 };
122 const Depth PawnPushTo7thExtension[] = { ONE_PLY / 2, ONE_PLY / 2 };
123 const Depth PassedPawnExtension[] = { DEPTH_ZERO, ONE_PLY / 2 };
125 // Minimum depth for use of singular extension
126 const Depth SingularExtensionDepth[] = { 8 * ONE_PLY, 6 * ONE_PLY };
128 // Step 12. Futility pruning
130 // Futility margin for quiescence search
131 const Value FutilityMarginQS = Value(0x80);
133 // Futility lookup tables (initialized at startup) and their access functions
134 Value FutilityMargins[16][64]; // [depth][moveNumber]
135 int FutilityMoveCounts[32]; // [depth]
137 inline Value futility_margin(Depth d, int mn) {
139 return d < 7 * ONE_PLY ? FutilityMargins[Max(d, 1)][Min(mn, 63)]
140 : 2 * VALUE_INFINITE;
143 inline int futility_move_count(Depth d) {
145 return d < 16 * ONE_PLY ? FutilityMoveCounts[d] : MAX_MOVES;
148 // Step 14. Reduced search
150 // Reduction lookup tables (initialized at startup) and their access function
151 int8_t Reductions[2][64][64]; // [pv][depth][moveNumber]
153 template <bool PvNode> inline Depth reduction(Depth d, int mn) {
155 return (Depth) Reductions[PvNode][Min(d / ONE_PLY, 63)][Min(mn, 63)];
158 // Easy move margin. An easy move candidate must be at least this much
159 // better than the second best move.
160 const Value EasyMoveMargin = Value(0x200);
163 /// Namespace variables
169 int MultiPV, UCIMultiPV;
171 // Time management variables
172 bool StopOnPonderhit, FirstRootMove, StopRequest, QuitRequest, AspirationFailLow;
177 std::ofstream LogFile;
179 // Skill level adjustment
181 bool SkillLevelEnabled;
183 // Node counters, used only by thread[0] but try to keep in different cache
184 // lines (64 bytes each) from the heavy multi-thread read accessed variables.
185 bool SendSearchedNodes;
187 int NodesBetweenPolls = 30000;
195 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove);
197 template <NodeType NT>
198 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth);
200 template <NodeType NT>
201 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth);
203 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bValue);
204 bool connected_moves(const Position& pos, Move m1, Move m2);
205 Value value_to_tt(Value v, int ply);
206 Value value_from_tt(Value v, int ply);
207 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply);
208 bool connected_threat(const Position& pos, Move m, Move threat);
209 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply);
210 void update_history(const Position& pos, Move move, Depth depth, Move movesSearched[], int moveCount);
211 void update_gains(const Position& pos, Move move, Value before, Value after);
212 void do_skill_level(Move* best, Move* ponder);
214 int current_search_time(int set = 0);
215 string score_to_uci(Value v, Value alpha, Value beta);
216 string speed_to_uci(int64_t nodes);
217 string pv_to_uci(Move pv[], int pvNum, bool chess960);
218 string pretty_pv(Position& pos, int depth, Value score, int time, Move pv[]);
219 string depth_to_uci(Depth depth);
220 void poll(const Position& pos);
221 void wait_for_stop_or_ponderhit();
223 // MovePickerExt template class extends MovePicker and allows to choose at compile
224 // time the proper moves source according to the type of node. In the default case
225 // we simply create and use a standard MovePicker object.
226 template<NodeType> struct MovePickerExt : public MovePicker {
228 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
229 : MovePicker(p, ttm, d, h, ss, b) {}
231 RootMove& current() { assert(false); return Rml[0]; } // Dummy, needed to compile
234 // In case of a SpNode we use split point's shared MovePicker object as moves source
235 template<> struct MovePickerExt<SplitPointNonPV> : public MovePickerExt<NonPV> {
237 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
238 : MovePickerExt<NonPV>(p, ttm, d, h, ss, b), mp(ss->sp->mp) {}
240 Move get_next_move() { return mp->get_next_move(); }
244 template<> struct MovePickerExt<SplitPointPV> : public MovePickerExt<SplitPointNonPV> {
246 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
247 : MovePickerExt<SplitPointNonPV>(p, ttm, d, h, ss, b) {}
250 // In case of a Root node we use RootMoveList as moves source
251 template<> struct MovePickerExt<Root> : public MovePicker {
253 MovePickerExt(const Position&, Move, Depth, const History&, SearchStack*, Value);
254 RootMove& current() { return Rml[cur]; }
255 Move get_next_move() { return ++cur < (int)Rml.size() ? Rml[cur].pv[0] : MOVE_NONE; }
260 // Overload operator<<() to make it easier to print moves in a coordinate
261 // notation compatible with UCI protocol.
262 std::ostream& operator<<(std::ostream& os, Move m) {
264 bool chess960 = (os.iword(0) != 0); // See set960()
265 return os << move_to_uci(m, chess960);
268 // When formatting a move for std::cout we must know if we are in Chess960
269 // or not. To keep using the handy operator<<() on the move the trick is to
270 // embed this flag in the stream itself. Function-like named enum set960 is
271 // used as a custom manipulator and the stream internal general-purpose array,
272 // accessed through ios_base::iword(), is used to pass the flag to the move's
273 // operator<<() that will read it to properly format castling moves.
276 std::ostream& operator<< (std::ostream& os, const set960& f) {
278 os.iword(0) = int(f);
282 // extension() decides whether a move should be searched with normal depth,
283 // or with extended depth. Certain classes of moves (checking moves, in
284 // particular) are searched with bigger depth than ordinary moves and in
285 // any case are marked as 'dangerous'. Note that also if a move is not
286 // extended, as example because the corresponding UCI option is set to zero,
287 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
288 template <bool PvNode>
289 FORCE_INLINE Depth extension(const Position& pos, Move m, bool captureOrPromotion,
290 bool moveIsCheck, bool* dangerous) {
291 assert(m != MOVE_NONE);
293 Depth result = DEPTH_ZERO;
294 *dangerous = moveIsCheck;
296 if (moveIsCheck && pos.see_sign(m) >= 0)
297 result += CheckExtension[PvNode];
299 if (piece_type(pos.piece_on(move_from(m))) == PAWN)
301 Color c = pos.side_to_move();
302 if (relative_rank(c, move_to(m)) == RANK_7)
304 result += PawnPushTo7thExtension[PvNode];
307 if (pos.pawn_is_passed(c, move_to(m)))
309 result += PassedPawnExtension[PvNode];
314 if ( captureOrPromotion
315 && piece_type(pos.piece_on(move_to(m))) != PAWN
316 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
317 - piece_value_midgame(pos.piece_on(move_to(m))) == VALUE_ZERO)
318 && !move_is_special(m))
320 result += PawnEndgameExtension[PvNode];
324 return Min(result, ONE_PLY);
330 /// init_search() is called during startup to initialize various lookup tables
334 int d; // depth (ONE_PLY == 2)
335 int hd; // half depth (ONE_PLY == 1)
338 // Init reductions array
339 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
341 double pvRed = log(double(hd)) * log(double(mc)) / 3.0;
342 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
343 Reductions[1][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
344 Reductions[0][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
347 // Init futility margins array
348 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
349 FutilityMargins[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
351 // Init futility move count array
352 for (d = 0; d < 32; d++)
353 FutilityMoveCounts[d] = int(3.001 + 0.25 * pow(d, 2.0));
357 /// perft() is our utility to verify move generation. All the leaf nodes up to
358 /// the given depth are generated and counted and the sum returned.
360 int64_t perft(Position& pos, Depth depth) {
365 // Generate all legal moves
366 MoveList<MV_LEGAL> ml(pos);
368 // If we are at the last ply we don't need to do and undo
369 // the moves, just to count them.
370 if (depth <= ONE_PLY)
373 // Loop through all legal moves
375 for ( ; !ml.end(); ++ml)
377 pos.do_move(ml.move(), st, ci, pos.move_gives_check(ml.move(), ci));
378 sum += perft(pos, depth - ONE_PLY);
379 pos.undo_move(ml.move());
385 /// think() is the external interface to Stockfish's search, and is called when
386 /// the program receives the UCI 'go' command. It initializes various global
387 /// variables, and calls id_loop(). It returns false when a "quit" command is
388 /// received during the search.
390 bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]) {
394 // Initialize global search-related variables
395 StopOnPonderhit = StopRequest = QuitRequest = AspirationFailLow = SendSearchedNodes = false;
397 current_search_time(get_system_time());
399 TimeMgr.init(Limits, pos.startpos_ply_counter());
401 // Set output steram in normal or chess960 mode
402 cout << set960(pos.is_chess960());
404 // Set best NodesBetweenPolls interval to avoid lagging under time pressure
406 NodesBetweenPolls = Min(Limits.maxNodes, 30000);
407 else if (Limits.time && Limits.time < 1000)
408 NodesBetweenPolls = 1000;
409 else if (Limits.time && Limits.time < 5000)
410 NodesBetweenPolls = 5000;
412 NodesBetweenPolls = 30000;
414 // Look for a book move
415 if (Options["OwnBook"].value<bool>())
417 if (Options["Book File"].value<string>() != book.name())
418 book.open(Options["Book File"].value<string>());
420 Move bookMove = book.get_move(pos, Options["Best Book Move"].value<bool>());
421 if (bookMove != MOVE_NONE)
424 wait_for_stop_or_ponderhit();
426 cout << "bestmove " << bookMove << endl;
432 UCIMultiPV = Options["MultiPV"].value<int>();
433 SkillLevel = Options["Skill Level"].value<int>();
435 read_evaluation_uci_options(pos.side_to_move());
436 Threads.read_uci_options();
438 // If needed allocate pawn and material hash tables and adjust TT size
439 Threads.init_hash_tables();
440 TT.set_size(Options["Hash"].value<int>());
442 if (Options["Clear Hash"].value<bool>())
444 Options["Clear Hash"].set_value("false");
448 // Do we have to play with skill handicap? In this case enable MultiPV that
449 // we will use behind the scenes to retrieve a set of possible moves.
450 SkillLevelEnabled = (SkillLevel < 20);
451 MultiPV = (SkillLevelEnabled ? Max(UCIMultiPV, 4) : UCIMultiPV);
453 // Wake up needed threads and reset maxPly counter
454 for (int i = 0; i < Threads.size(); i++)
456 Threads[i].wake_up();
457 Threads[i].maxPly = 0;
460 // Write to log file and keep it open to be accessed during the search
461 if (Options["Use Search Log"].value<bool>())
463 string name = Options["Search Log Filename"].value<string>();
464 LogFile.open(name.c_str(), std::ios::out | std::ios::app);
466 if (LogFile.is_open())
467 LogFile << "\nSearching: " << pos.to_fen()
468 << "\ninfinite: " << Limits.infinite
469 << " ponder: " << Limits.ponder
470 << " time: " << Limits.time
471 << " increment: " << Limits.increment
472 << " moves to go: " << Limits.movesToGo
476 // We're ready to start thinking. Call the iterative deepening loop function
477 Move ponderMove = MOVE_NONE;
478 Move bestMove = id_loop(pos, searchMoves, &ponderMove);
480 // Write final search statistics and close log file
481 if (LogFile.is_open())
483 int t = current_search_time();
485 LogFile << "Nodes: " << pos.nodes_searched()
486 << "\nNodes/second: " << (t > 0 ? pos.nodes_searched() * 1000 / t : 0)
487 << "\nBest move: " << move_to_san(pos, bestMove);
490 pos.do_move(bestMove, st);
491 LogFile << "\nPonder move: " << move_to_san(pos, ponderMove) << endl;
492 pos.undo_move(bestMove); // Return from think() with unchanged position
496 // This makes all the threads to go to sleep
499 // If we are pondering or in infinite search, we shouldn't print the
500 // best move before we are told to do so.
501 if (!StopRequest && (Limits.ponder || Limits.infinite))
502 wait_for_stop_or_ponderhit();
504 // Could be MOVE_NONE when searching on a stalemate position
505 cout << "bestmove " << bestMove;
507 // UCI protol is not clear on allowing sending an empty ponder move, instead
508 // it is clear that ponder move is optional. So skip it if empty.
509 if (ponderMove != MOVE_NONE)
510 cout << " ponder " << ponderMove;
520 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
521 // with increasing depth until the allocated thinking time has been consumed,
522 // user stops the search, or the maximum search depth is reached.
524 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove) {
526 SearchStack ss[PLY_MAX_PLUS_2];
527 Value bestValues[PLY_MAX_PLUS_2];
528 int bestMoveChanges[PLY_MAX_PLUS_2];
529 int depth, aspirationDelta;
530 Value value, alpha, beta;
531 Move bestMove, easyMove, skillBest, skillPonder;
533 // Initialize stuff before a new search
534 memset(ss, 0, 4 * sizeof(SearchStack));
537 *ponderMove = bestMove = easyMove = skillBest = skillPonder = MOVE_NONE;
538 depth = aspirationDelta = 0;
539 alpha = -VALUE_INFINITE, beta = VALUE_INFINITE;
540 ss->currentMove = MOVE_NULL; // Hack to skip update_gains()
542 // Moves to search are verified and copied
543 Rml.init(pos, searchMoves);
545 // Handle special case of searching on a mate/stalemate position
548 cout << "info" << depth_to_uci(DEPTH_ZERO)
549 << score_to_uci(pos.in_check() ? -VALUE_MATE : VALUE_DRAW, alpha, beta) << endl;
554 // Iterative deepening loop until requested to stop or target depth reached
555 while (!StopRequest && ++depth <= PLY_MAX && (!Limits.maxDepth || depth <= Limits.maxDepth))
557 Rml.bestMoveChanges = 0;
559 // Calculate dynamic aspiration window based on previous iterations
560 if (MultiPV == 1 && depth >= 5 && abs(bestValues[depth - 1]) < VALUE_KNOWN_WIN)
562 int prevDelta1 = bestValues[depth - 1] - bestValues[depth - 2];
563 int prevDelta2 = bestValues[depth - 2] - bestValues[depth - 3];
565 aspirationDelta = Min(Max(abs(prevDelta1) + abs(prevDelta2) / 2, 16), 24);
566 aspirationDelta = (aspirationDelta + 7) / 8 * 8; // Round to match grainSize
568 alpha = Max(bestValues[depth - 1] - aspirationDelta, -VALUE_INFINITE);
569 beta = Min(bestValues[depth - 1] + aspirationDelta, VALUE_INFINITE);
572 // Start with a small aspiration window and, in case of fail high/low,
573 // research with bigger window until not failing high/low anymore.
575 // Search starting from ss+1 to allow calling update_gains()
576 value = search<Root>(pos, ss+1, alpha, beta, depth * ONE_PLY);
578 // Write PV back to transposition table in case the relevant entries
579 // have been overwritten during the search.
580 for (int i = 0; i < Min(MultiPV, (int)Rml.size()); i++)
581 Rml[i].insert_pv_in_tt(pos);
583 // Value cannot be trusted. Break out immediately!
587 // Send full PV info to GUI if we are going to leave the loop or
588 // if we have a fail high/low and we are deep in the search.
589 if ((value > alpha && value < beta) || current_search_time() > 2000)
590 for (int i = 0; i < Min(UCIMultiPV, (int)Rml.size()); i++)
592 << depth_to_uci(depth * ONE_PLY)
593 << score_to_uci(Rml[i].pv_score, alpha, beta)
594 << speed_to_uci(pos.nodes_searched())
595 << pv_to_uci(Rml[i].pv, i + 1, pos.is_chess960()) << endl;
597 // In case of failing high/low increase aspiration window and research,
598 // otherwise exit the fail high/low loop.
601 beta = Min(beta + aspirationDelta, VALUE_INFINITE);
602 aspirationDelta += aspirationDelta / 2;
604 else if (value <= alpha)
606 AspirationFailLow = true;
607 StopOnPonderhit = false;
609 alpha = Max(alpha - aspirationDelta, -VALUE_INFINITE);
610 aspirationDelta += aspirationDelta / 2;
615 } while (abs(value) < VALUE_KNOWN_WIN);
617 // Collect info about search result
618 bestMove = Rml[0].pv[0];
619 *ponderMove = Rml[0].pv[1];
620 bestValues[depth] = value;
621 bestMoveChanges[depth] = Rml.bestMoveChanges;
623 // Do we need to pick now the best and the ponder moves ?
624 if (SkillLevelEnabled && depth == 1 + SkillLevel)
625 do_skill_level(&skillBest, &skillPonder);
627 if (LogFile.is_open())
628 LogFile << pretty_pv(pos, depth, value, current_search_time(), Rml[0].pv) << endl;
630 // Init easyMove after first iteration or drop if differs from the best move
631 if (depth == 1 && (Rml.size() == 1 || Rml[0].pv_score > Rml[1].pv_score + EasyMoveMargin))
633 else if (bestMove != easyMove)
634 easyMove = MOVE_NONE;
636 // Check for some early stop condition
637 if (!StopRequest && Limits.useTimeManagement())
639 // Stop search early if one move seems to be much better than the
640 // others or if there is only a single legal move. Also in the latter
641 // case we search up to some depth anyway to get a proper score.
643 && easyMove == bestMove
645 ||( Rml[0].nodes > (pos.nodes_searched() * 85) / 100
646 && current_search_time() > TimeMgr.available_time() / 16)
647 ||( Rml[0].nodes > (pos.nodes_searched() * 98) / 100
648 && current_search_time() > TimeMgr.available_time() / 32)))
651 // Take in account some extra time if the best move has changed
652 if (depth > 4 && depth < 50)
653 TimeMgr.pv_instability(bestMoveChanges[depth], bestMoveChanges[depth - 1]);
655 // Stop search if most of available time is already consumed. We probably don't
656 // have enough time to search the first move at the next iteration anyway.
657 if (current_search_time() > (TimeMgr.available_time() * 62) / 100)
660 // If we are allowed to ponder do not stop the search now but keep pondering
661 if (StopRequest && Limits.ponder)
664 StopOnPonderhit = true;
669 // When using skills overwrite best and ponder moves with the sub-optimal ones
670 if (SkillLevelEnabled)
672 if (skillBest == MOVE_NONE) // Still unassigned ?
673 do_skill_level(&skillBest, &skillPonder);
675 bestMove = skillBest;
676 *ponderMove = skillPonder;
683 // search<>() is the main search function for both PV and non-PV nodes and for
684 // normal and SplitPoint nodes. When called just after a split point the search
685 // is simpler because we have already probed the hash table, done a null move
686 // search, and searched the first move before splitting, we don't have to repeat
687 // all this work again. We also don't need to store anything to the hash table
688 // here: This is taken care of after we return from the split point.
690 template <NodeType NT>
691 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth) {
693 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV);
694 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV);
695 const bool RootNode = (NT == Root);
697 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
698 assert(beta > alpha && beta <= VALUE_INFINITE);
699 assert(PvNode || alpha == beta - 1);
700 assert(pos.thread() >= 0 && pos.thread() < Threads.size());
702 Move movesSearched[MAX_MOVES];
707 Move ttMove, move, excludedMove, threatMove;
710 Value bestValue, value, oldAlpha;
711 Value refinedValue, nullValue, futilityBase, futilityValueScaled; // Non-PV specific
712 bool isPvMove, inCheck, singularExtensionNode, givesCheck, captureOrPromotion, dangerous;
713 int moveCount = 0, playedMoveCount = 0;
714 Thread& thread = Threads[pos.thread()];
715 SplitPoint* sp = NULL;
717 refinedValue = bestValue = value = -VALUE_INFINITE;
719 inCheck = pos.in_check();
720 ss->ply = (ss-1)->ply + 1;
722 // Used to send selDepth info to GUI
723 if (PvNode && thread.maxPly < ss->ply)
724 thread.maxPly = ss->ply;
726 // Step 1. Initialize node and poll. Polling can abort search
729 ss->currentMove = ss->bestMove = threatMove = (ss+1)->excludedMove = MOVE_NONE;
730 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
731 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
737 ttMove = excludedMove = MOVE_NONE;
738 threatMove = sp->threatMove;
739 goto split_point_start;
742 if (pos.thread() == 0 && ++NodesSincePoll > NodesBetweenPolls)
748 // Step 2. Check for aborted search and immediate draw
750 || pos.is_draw<false>()
751 || ss->ply > PLY_MAX) && !RootNode)
754 // Step 3. Mate distance pruning
757 alpha = Max(value_mated_in(ss->ply), alpha);
758 beta = Min(value_mate_in(ss->ply+1), beta);
763 // Step 4. Transposition table lookup
764 // We don't want the score of a partial search to overwrite a previous full search
765 // TT value, so we use a different position key in case of an excluded move.
766 excludedMove = ss->excludedMove;
767 posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
768 tte = TT.probe(posKey);
769 ttMove = tte ? tte->move() : MOVE_NONE;
771 // At PV nodes we check for exact scores, while at non-PV nodes we check for
772 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
773 // smooth experience in analysis mode.
774 if (tte && (PvNode ? tte->depth() >= depth && tte->type() == VALUE_TYPE_EXACT
775 : ok_to_use_TT(tte, depth, beta, ss->ply)))
778 ss->bestMove = ttMove; // Can be MOVE_NONE
779 return value_from_tt(tte->value(), ss->ply);
782 // Step 5. Evaluate the position statically and update parent's gain statistics
784 ss->eval = ss->evalMargin = VALUE_NONE;
787 assert(tte->static_value() != VALUE_NONE);
789 ss->eval = tte->static_value();
790 ss->evalMargin = tte->static_value_margin();
791 refinedValue = refine_eval(tte, ss->eval, ss->ply);
795 refinedValue = ss->eval = evaluate(pos, ss->evalMargin);
796 TT.store(posKey, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, MOVE_NONE, ss->eval, ss->evalMargin);
799 // Save gain for the parent non-capture move
800 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
802 // Step 6. Razoring (is omitted in PV nodes)
804 && depth < RazorDepth
806 && refinedValue + razor_margin(depth) < beta
807 && ttMove == MOVE_NONE
808 && abs(beta) < VALUE_MATE_IN_PLY_MAX
809 && !pos.has_pawn_on_7th(pos.side_to_move()))
811 Value rbeta = beta - razor_margin(depth);
812 Value v = qsearch<NonPV>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
814 // Logically we should return (v + razor_margin(depth)), but
815 // surprisingly this did slightly weaker in tests.
819 // Step 7. Static null move pruning (is omitted in PV nodes)
820 // We're betting that the opponent doesn't have a move that will reduce
821 // the score by more than futility_margin(depth) if we do a null move.
824 && depth < RazorDepth
826 && refinedValue - futility_margin(depth, 0) >= beta
827 && abs(beta) < VALUE_MATE_IN_PLY_MAX
828 && pos.non_pawn_material(pos.side_to_move()))
829 return refinedValue - futility_margin(depth, 0);
831 // Step 8. Null move search with verification search (is omitted in PV nodes)
836 && refinedValue >= beta
837 && abs(beta) < VALUE_MATE_IN_PLY_MAX
838 && pos.non_pawn_material(pos.side_to_move()))
840 ss->currentMove = MOVE_NULL;
842 // Null move dynamic reduction based on depth
843 int R = 3 + (depth >= 5 * ONE_PLY ? depth / 8 : 0);
845 // Null move dynamic reduction based on value
846 if (refinedValue - PawnValueMidgame > beta)
849 pos.do_null_move(st);
850 (ss+1)->skipNullMove = true;
851 nullValue = depth-R*ONE_PLY < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
852 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R*ONE_PLY);
853 (ss+1)->skipNullMove = false;
854 pos.undo_null_move();
856 if (nullValue >= beta)
858 // Do not return unproven mate scores
859 if (nullValue >= VALUE_MATE_IN_PLY_MAX)
862 if (depth < 6 * ONE_PLY)
865 // Do verification search at high depths
866 ss->skipNullMove = true;
867 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R*ONE_PLY);
868 ss->skipNullMove = false;
875 // The null move failed low, which means that we may be faced with
876 // some kind of threat. If the previous move was reduced, check if
877 // the move that refuted the null move was somehow connected to the
878 // move which was reduced. If a connection is found, return a fail
879 // low score (which will cause the reduced move to fail high in the
880 // parent node, which will trigger a re-search with full depth).
881 threatMove = (ss+1)->bestMove;
883 if ( depth < ThreatDepth
885 && threatMove != MOVE_NONE
886 && connected_moves(pos, (ss-1)->currentMove, threatMove))
891 // Step 9. ProbCut (is omitted in PV nodes)
892 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
893 // and a reduced search returns a value much above beta, we can (almost) safely
894 // prune the previous move.
896 && depth >= RazorDepth + ONE_PLY
899 && excludedMove == MOVE_NONE
900 && abs(beta) < VALUE_MATE_IN_PLY_MAX)
902 Value rbeta = beta + 200;
903 Depth rdepth = depth - ONE_PLY - 3 * ONE_PLY;
905 assert(rdepth >= ONE_PLY);
907 MovePicker mp(pos, ttMove, H, pos.captured_piece_type());
910 while ((move = mp.get_next_move()) != MOVE_NONE)
911 if (pos.pl_move_is_legal(move, ci.pinned))
913 pos.do_move(move, st, ci, pos.move_gives_check(move, ci));
914 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth);
921 // Step 10. Internal iterative deepening
922 if ( depth >= IIDDepth[PvNode]
923 && ttMove == MOVE_NONE
924 && (PvNode || (!inCheck && ss->eval + IIDMargin >= beta)))
926 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
928 ss->skipNullMove = true;
929 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d);
930 ss->skipNullMove = false;
932 tte = TT.probe(posKey);
933 ttMove = tte ? tte->move() : MOVE_NONE;
936 split_point_start: // At split points actual search starts from here
938 // Initialize a MovePicker object for the current position
939 MovePickerExt<NT> mp(pos, ttMove, depth, H, ss, PvNode ? -VALUE_INFINITE : beta);
941 ss->bestMove = MOVE_NONE;
942 futilityBase = ss->eval + ss->evalMargin;
943 singularExtensionNode = !RootNode
945 && depth >= SingularExtensionDepth[PvNode]
946 && ttMove != MOVE_NONE
947 && !excludedMove // Do not allow recursive singular extension search
948 && (tte->type() & VALUE_TYPE_LOWER)
949 && tte->depth() >= depth - 3 * ONE_PLY;
952 lock_grab(&(sp->lock));
953 bestValue = sp->bestValue;
956 // Step 11. Loop through moves
957 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
958 while ( bestValue < beta
959 && (move = mp.get_next_move()) != MOVE_NONE
960 && !thread.cutoff_occurred())
962 assert(move_is_ok(move));
964 if (move == excludedMove)
967 // At PV and SpNode nodes we want all moves to be legal since the beginning
968 if ((PvNode || SpNode) && !pos.pl_move_is_legal(move, ci.pinned))
973 moveCount = ++sp->moveCount;
974 lock_release(&(sp->lock));
981 // This is used by time management
982 FirstRootMove = (moveCount == 1);
984 // Save the current node count before the move is searched
985 nodes = pos.nodes_searched();
987 // If it's time to send nodes info, do it here where we have the
988 // correct accumulated node counts searched by each thread.
989 if (SendSearchedNodes)
991 SendSearchedNodes = false;
992 cout << "info" << speed_to_uci(pos.nodes_searched()) << endl;
995 // For long searches send current move info to GUI
996 if (current_search_time() > 2000)
997 cout << "info" << depth_to_uci(depth)
998 << " currmove " << move << " currmovenumber " << moveCount << endl;
1001 // At Root and at first iteration do a PV search on all the moves to score root moves
1002 isPvMove = (PvNode && moveCount <= (!RootNode ? 1 : depth <= ONE_PLY ? MAX_MOVES : MultiPV));
1003 givesCheck = pos.move_gives_check(move, ci);
1004 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1006 // Step 12. Decide the new search depth
1007 ext = extension<PvNode>(pos, move, captureOrPromotion, givesCheck, &dangerous);
1009 // Singular extension search. If all moves but one fail low on a search of
1010 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
1011 // is singular and should be extended. To verify this we do a reduced search
1012 // on all the other moves but the ttMove, if result is lower than ttValue minus
1013 // a margin then we extend ttMove.
1014 if ( singularExtensionNode
1016 && pos.pl_move_is_legal(move, ci.pinned)
1019 Value ttValue = value_from_tt(tte->value(), ss->ply);
1021 if (abs(ttValue) < VALUE_KNOWN_WIN)
1023 Value rBeta = ttValue - int(depth);
1024 ss->excludedMove = move;
1025 ss->skipNullMove = true;
1026 Value v = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2);
1027 ss->skipNullMove = false;
1028 ss->excludedMove = MOVE_NONE;
1029 ss->bestMove = MOVE_NONE;
1035 // Update current move (this must be done after singular extension search)
1036 newDepth = depth - ONE_PLY + ext;
1038 // Step 13. Futility pruning (is omitted in PV nodes)
1040 && !captureOrPromotion
1044 && !move_is_castle(move))
1046 // Move count based pruning
1047 if ( moveCount >= futility_move_count(depth)
1048 && (!threatMove || !connected_threat(pos, move, threatMove))
1049 && bestValue > VALUE_MATED_IN_PLY_MAX) // FIXME bestValue is racy
1052 lock_grab(&(sp->lock));
1057 // Value based pruning
1058 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
1059 // but fixing this made program slightly weaker.
1060 Depth predictedDepth = newDepth - reduction<PvNode>(depth, moveCount);
1061 futilityValueScaled = futilityBase + futility_margin(predictedDepth, moveCount)
1062 + H.gain(pos.piece_on(move_from(move)), move_to(move));
1064 if (futilityValueScaled < beta)
1068 lock_grab(&(sp->lock));
1069 if (futilityValueScaled > sp->bestValue)
1070 sp->bestValue = bestValue = futilityValueScaled;
1072 else if (futilityValueScaled > bestValue)
1073 bestValue = futilityValueScaled;
1078 // Prune moves with negative SEE at low depths
1079 if ( predictedDepth < 2 * ONE_PLY
1080 && bestValue > VALUE_MATED_IN_PLY_MAX
1081 && pos.see_sign(move) < 0)
1084 lock_grab(&(sp->lock));
1090 // Check for legality only before to do the move
1091 if (!pos.pl_move_is_legal(move, ci.pinned))
1097 ss->currentMove = move;
1098 if (!SpNode && !captureOrPromotion)
1099 movesSearched[playedMoveCount++] = move;
1101 // Step 14. Make the move
1102 pos.do_move(move, st, ci, givesCheck);
1104 // Step extra. pv search (only in PV nodes)
1105 // The first move in list is the expected PV
1107 value = newDepth < ONE_PLY ? -qsearch<PV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
1108 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
1111 // Step 15. Reduced depth search
1112 // If the move fails high will be re-searched at full depth.
1113 bool doFullDepthSearch = true;
1115 if ( depth > 3 * ONE_PLY
1116 && !captureOrPromotion
1118 && !move_is_castle(move)
1119 && ss->killers[0] != move
1120 && ss->killers[1] != move
1121 && (ss->reduction = reduction<PvNode>(depth, moveCount)) != DEPTH_ZERO)
1123 Depth d = newDepth - ss->reduction;
1124 alpha = SpNode ? sp->alpha : alpha;
1126 value = d < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
1127 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d);
1129 ss->reduction = DEPTH_ZERO;
1130 doFullDepthSearch = (value > alpha);
1133 // Step 16. Full depth search
1134 if (doFullDepthSearch)
1136 alpha = SpNode ? sp->alpha : alpha;
1137 value = newDepth < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
1138 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth);
1140 // Step extra. pv search (only in PV nodes)
1141 // Search only for possible new PV nodes, if instead value >= beta then
1142 // parent node fails low with value <= alpha and tries another move.
1143 if (PvNode && value > alpha && (RootNode || value < beta))
1144 value = newDepth < ONE_PLY ? -qsearch<PV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
1145 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
1149 // Step 17. Undo move
1150 pos.undo_move(move);
1152 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1154 // Step 18. Check for new best move
1157 lock_grab(&(sp->lock));
1158 bestValue = sp->bestValue;
1162 if (value > bestValue)
1165 ss->bestMove = move;
1170 && value < beta) // We want always alpha < beta
1173 if (SpNode && !thread.cutoff_occurred())
1175 sp->bestValue = value;
1176 sp->ss->bestMove = move;
1178 sp->is_betaCutoff = (value >= beta);
1184 // Finished searching the move. If StopRequest is true, the search
1185 // was aborted because the user interrupted the search or because we
1186 // ran out of time. In this case, the return value of the search cannot
1187 // be trusted, and we break out of the loop without updating the best
1192 // Remember searched nodes counts for this move
1193 mp.current().nodes += pos.nodes_searched() - nodes;
1195 // PV move or new best move ?
1196 if (isPvMove || value > alpha)
1199 mp.current().pv_score = value;
1200 mp.current().extract_pv_from_tt(pos);
1202 // We record how often the best move has been changed in each
1203 // iteration. This information is used for time management: When
1204 // the best move changes frequently, we allocate some more time.
1205 if (!isPvMove && MultiPV == 1)
1206 Rml.bestMoveChanges++;
1208 // It is critical that sorting is done with a stable algorithm
1209 // because all the values but the first are usually set to
1210 // -VALUE_INFINITE and we want to keep the same order for all
1211 // the moves but the new PV that goes to head.
1212 sort<RootMove>(Rml.begin(), Rml.begin() + moveCount);
1214 // Update alpha. In multi-pv we don't use aspiration window, so set
1215 // alpha equal to minimum score among the PV lines searched so far.
1217 alpha = Rml[Min(moveCount, MultiPV) - 1].pv_score;
1218 else if (value > alpha)
1222 // All other moves but the PV are set to the lowest value, this
1223 // is not a problem when sorting becuase sort is stable and move
1224 // position in the list is preserved, just the PV is pushed up.
1225 mp.current().pv_score = -VALUE_INFINITE;
1229 // Step 19. Check for split
1232 && depth >= Threads.min_split_depth()
1234 && Threads.available_slave_exists(pos.thread())
1236 && !thread.cutoff_occurred())
1237 Threads.split<FakeSplit>(pos, ss, &alpha, beta, &bestValue, depth,
1238 threatMove, moveCount, &mp, PvNode);
1241 // Step 20. Check for mate and stalemate
1242 // All legal moves have been searched and if there are
1243 // no legal moves, it must be mate or stalemate.
1244 // If one move was excluded return fail low score.
1245 if (!SpNode && !moveCount)
1246 return excludedMove ? oldAlpha : inCheck ? value_mated_in(ss->ply) : VALUE_DRAW;
1248 // Step 21. Update tables
1249 // If the search is not aborted, update the transposition table,
1250 // history counters, and killer moves.
1251 if (!SpNode && !StopRequest && !thread.cutoff_occurred())
1253 move = bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove;
1254 vt = bestValue <= oldAlpha ? VALUE_TYPE_UPPER
1255 : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT;
1257 TT.store(posKey, value_to_tt(bestValue, ss->ply), vt, depth, move, ss->eval, ss->evalMargin);
1259 // Update killers and history only for non capture moves that fails high
1260 if ( bestValue >= beta
1261 && !pos.move_is_capture_or_promotion(move))
1263 if (move != ss->killers[0])
1265 ss->killers[1] = ss->killers[0];
1266 ss->killers[0] = move;
1268 update_history(pos, move, depth, movesSearched, playedMoveCount);
1274 // Here we have the lock still grabbed
1275 sp->is_slave[pos.thread()] = false;
1276 sp->nodes += pos.nodes_searched();
1277 lock_release(&(sp->lock));
1280 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1285 // qsearch() is the quiescence search function, which is called by the main
1286 // search function when the remaining depth is zero (or, to be more precise,
1287 // less than ONE_PLY).
1289 template <NodeType NT>
1290 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth) {
1292 const bool PvNode = (NT == PV);
1294 assert(NT == PV || NT == NonPV);
1295 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1296 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1297 assert(PvNode || alpha == beta - 1);
1299 assert(pos.thread() >= 0 && pos.thread() < Threads.size());
1303 Value bestValue, value, evalMargin, futilityValue, futilityBase;
1304 bool inCheck, enoughMaterial, givesCheck, evasionPrunable;
1307 Value oldAlpha = alpha;
1309 ss->bestMove = ss->currentMove = MOVE_NONE;
1310 ss->ply = (ss-1)->ply + 1;
1312 // Check for an instant draw or maximum ply reached
1313 if (pos.is_draw<true>() || ss->ply > PLY_MAX)
1316 // Decide whether or not to include checks, this fixes also the type of
1317 // TT entry depth that we are going to use. Note that in qsearch we use
1318 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1319 inCheck = pos.in_check();
1320 ttDepth = (inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS : DEPTH_QS_NO_CHECKS);
1322 // Transposition table lookup. At PV nodes, we don't use the TT for
1323 // pruning, but only for move ordering.
1324 tte = TT.probe(pos.get_key());
1325 ttMove = (tte ? tte->move() : MOVE_NONE);
1327 if (!PvNode && tte && ok_to_use_TT(tte, ttDepth, beta, ss->ply))
1329 ss->bestMove = ttMove; // Can be MOVE_NONE
1330 return value_from_tt(tte->value(), ss->ply);
1333 // Evaluate the position statically
1336 bestValue = futilityBase = -VALUE_INFINITE;
1337 ss->eval = evalMargin = VALUE_NONE;
1338 enoughMaterial = false;
1344 assert(tte->static_value() != VALUE_NONE);
1346 evalMargin = tte->static_value_margin();
1347 ss->eval = bestValue = tte->static_value();
1350 ss->eval = bestValue = evaluate(pos, evalMargin);
1352 // Stand pat. Return immediately if static value is at least beta
1353 if (bestValue >= beta)
1356 TT.store(pos.get_key(), value_to_tt(bestValue, ss->ply), VALUE_TYPE_LOWER, DEPTH_NONE, MOVE_NONE, ss->eval, evalMargin);
1361 if (PvNode && bestValue > alpha)
1364 // Futility pruning parameters, not needed when in check
1365 futilityBase = ss->eval + evalMargin + FutilityMarginQS;
1366 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1369 // Initialize a MovePicker object for the current position, and prepare
1370 // to search the moves. Because the depth is <= 0 here, only captures,
1371 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1373 MovePicker mp(pos, ttMove, depth, H, move_to((ss-1)->currentMove));
1376 // Loop through the moves until no moves remain or a beta cutoff occurs
1377 while ( alpha < beta
1378 && (move = mp.get_next_move()) != MOVE_NONE)
1380 assert(move_is_ok(move));
1382 givesCheck = pos.move_gives_check(move, ci);
1390 && !move_is_promotion(move)
1391 && !pos.move_is_passed_pawn_push(move))
1393 futilityValue = futilityBase
1394 + piece_value_endgame(pos.piece_on(move_to(move)))
1395 + (move_is_ep(move) ? PawnValueEndgame : VALUE_ZERO);
1397 if (futilityValue < alpha)
1399 if (futilityValue > bestValue)
1400 bestValue = futilityValue;
1404 // Prune moves with negative or equal SEE
1405 if ( futilityBase < beta
1406 && depth < DEPTH_ZERO
1407 && pos.see(move) <= 0)
1411 // Detect non-capture evasions that are candidate to be pruned
1412 evasionPrunable = !PvNode
1414 && bestValue > VALUE_MATED_IN_PLY_MAX
1415 && !pos.move_is_capture(move)
1416 && !pos.can_castle(pos.side_to_move());
1418 // Don't search moves with negative SEE values
1420 && (!inCheck || evasionPrunable)
1422 && !move_is_promotion(move)
1423 && pos.see_sign(move) < 0)
1426 // Don't search useless checks
1431 && !pos.move_is_capture_or_promotion(move)
1432 && ss->eval + PawnValueMidgame / 4 < beta
1433 && !check_is_dangerous(pos, move, futilityBase, beta, &bestValue))
1435 if (ss->eval + PawnValueMidgame / 4 > bestValue)
1436 bestValue = ss->eval + PawnValueMidgame / 4;
1441 // Check for legality only before to do the move
1442 if (!pos.pl_move_is_legal(move, ci.pinned))
1445 // Update current move
1446 ss->currentMove = move;
1448 // Make and search the move
1449 pos.do_move(move, st, ci, givesCheck);
1450 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth-ONE_PLY);
1451 pos.undo_move(move);
1453 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1456 if (value > bestValue)
1462 ss->bestMove = move;
1467 // All legal moves have been searched. A special case: If we're in check
1468 // and no legal moves were found, it is checkmate.
1469 if (inCheck && bestValue == -VALUE_INFINITE)
1470 return value_mated_in(ss->ply);
1472 // Update transposition table
1473 ValueType vt = (bestValue <= oldAlpha ? VALUE_TYPE_UPPER : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT);
1474 TT.store(pos.get_key(), value_to_tt(bestValue, ss->ply), vt, ttDepth, ss->bestMove, 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 = opposite_color(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 ( piece_type(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(m1 && move_is_ok(m1));
1552 assert(m2 && 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(threat && 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 || piece_type(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 // ok_to_use_TT() returns true if a transposition table score
1663 // can be used at a given point in search.
1665 bool ok_to_use_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(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();
1955 // Send info on searched nodes as soon as we return to root
1956 SendSearchedNodes = true;
1959 // Should we stop the search?
1963 bool stillAtFirstMove = FirstRootMove
1964 && !AspirationFailLow
1965 && t > TimeMgr.available_time();
1967 bool noMoreTime = t > TimeMgr.maximum_time()
1968 || stillAtFirstMove;
1970 if ( (Limits.useTimeManagement() && noMoreTime)
1971 || (Limits.maxTime && t >= Limits.maxTime)
1972 || (Limits.maxNodes && pos.nodes_searched() >= Limits.maxNodes)) // FIXME
1977 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
1978 // while the program is pondering. The point is to work around a wrinkle in
1979 // the UCI protocol: When pondering, the engine is not allowed to give a
1980 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
1981 // We simply wait here until one of these commands is sent, and return,
1982 // after which the bestmove and pondermove will be printed.
1984 void wait_for_stop_or_ponderhit() {
1988 // Wait for a command from stdin
1989 while ( std::getline(std::cin, command)
1990 && command != "ponderhit" && command != "stop" && command != "quit") {};
1992 if (command != "ponderhit" && command != "stop")
1993 QuitRequest = true; // Must be "quit" or getline() returned false
1997 // When playing with strength handicap choose best move among the MultiPV set
1998 // using a statistical rule dependent on SkillLevel. Idea by Heinz van Saanen.
1999 void do_skill_level(Move* best, Move* ponder) {
2001 assert(MultiPV > 1);
2005 // Rml list is already sorted by pv_score in descending order
2007 int max_s = -VALUE_INFINITE;
2008 int size = Min(MultiPV, (int)Rml.size());
2009 int max = Rml[0].pv_score;
2010 int var = Min(max - Rml[size - 1].pv_score, PawnValueMidgame);
2011 int wk = 120 - 2 * SkillLevel;
2013 // PRNG sequence should be non deterministic
2014 for (int i = abs(get_system_time() % 50); i > 0; i--)
2015 rk.rand<unsigned>();
2017 // Choose best move. For each move's score we add two terms both dependent
2018 // on wk, one deterministic and bigger for weaker moves, and one random,
2019 // then we choose the move with the resulting highest score.
2020 for (int i = 0; i < size; i++)
2022 s = Rml[i].pv_score;
2024 // Don't allow crazy blunders even at very low skills
2025 if (i > 0 && Rml[i-1].pv_score > s + EasyMoveMargin)
2028 // This is our magical formula
2029 s += ((max - s) * wk + var * (rk.rand<unsigned>() % wk)) / 128;
2034 *best = Rml[i].pv[0];
2035 *ponder = Rml[i].pv[1];
2041 /// RootMove and RootMoveList method's definitions
2043 RootMove::RootMove() {
2046 pv_score = non_pv_score = -VALUE_INFINITE;
2050 RootMove& RootMove::operator=(const RootMove& rm) {
2052 const Move* src = rm.pv;
2055 // Avoid a costly full rm.pv[] copy
2056 do *dst++ = *src; while (*src++ != MOVE_NONE);
2059 pv_score = rm.pv_score;
2060 non_pv_score = rm.non_pv_score;
2064 void RootMoveList::init(Position& pos, Move searchMoves[]) {
2067 bestMoveChanges = 0;
2070 // Generate all legal moves and add them to RootMoveList
2071 for (MoveList<MV_LEGAL> ml(pos); !ml.end(); ++ml)
2073 // If we have a searchMoves[] list then verify the move
2074 // is in the list before to add it.
2075 for (sm = searchMoves; *sm && *sm != ml.move(); sm++) {}
2077 if (sm != searchMoves && *sm != ml.move())
2081 rm.pv[0] = ml.move();
2082 rm.pv[1] = MOVE_NONE;
2083 rm.pv_score = -VALUE_INFINITE;
2088 // extract_pv_from_tt() builds a PV by adding moves from the transposition table.
2089 // We consider also failing high nodes and not only VALUE_TYPE_EXACT nodes. This
2090 // allow to always have a ponder move even when we fail high at root and also a
2091 // long PV to print that is important for position analysis.
2093 void RootMove::extract_pv_from_tt(Position& pos) {
2095 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2099 assert(pv[0] != MOVE_NONE && pos.move_is_pl(pv[0]));
2101 pos.do_move(pv[0], *st++);
2103 while ( (tte = TT.probe(pos.get_key())) != NULL
2104 && tte->move() != MOVE_NONE
2105 && pos.move_is_pl(tte->move())
2106 && pos.pl_move_is_legal(tte->move(), pos.pinned_pieces())
2108 && (!pos.is_draw<false>() || ply < 2))
2110 pv[ply] = tte->move();
2111 pos.do_move(pv[ply++], *st++);
2113 pv[ply] = MOVE_NONE;
2115 do pos.undo_move(pv[--ply]); while (ply);
2118 // insert_pv_in_tt() is called at the end of a search iteration, and inserts
2119 // the PV back into the TT. This makes sure the old PV moves are searched
2120 // first, even if the old TT entries have been overwritten.
2122 void RootMove::insert_pv_in_tt(Position& pos) {
2124 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2127 Value v, m = VALUE_NONE;
2130 assert(pv[0] != MOVE_NONE && pos.move_is_pl(pv[0]));
2136 // Don't overwrite existing correct entries
2137 if (!tte || tte->move() != pv[ply])
2139 v = (pos.in_check() ? VALUE_NONE : evaluate(pos, m));
2140 TT.store(k, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, pv[ply], v, m);
2142 pos.do_move(pv[ply], *st++);
2144 } while (pv[++ply] != MOVE_NONE);
2146 do pos.undo_move(pv[--ply]); while (ply);
2149 // Specializations for MovePickerExt in case of Root node
2150 MovePickerExt<Root>::MovePickerExt(const Position& p, Move ttm, Depth d,
2151 const History& h, SearchStack* ss, Value b)
2152 : MovePicker(p, ttm, d, h, ss, b), cur(-1) {
2154 Value score = VALUE_ZERO;
2156 // Score root moves using standard ordering used in main search, the moves
2157 // are scored according to the order in which they are returned by MovePicker.
2158 // This is the second order score that is used to compare the moves when
2159 // the first orders pv_score of both moves are equal.
2160 while ((move = MovePicker::get_next_move()) != MOVE_NONE)
2161 for (RootMoveList::iterator rm = Rml.begin(); rm != Rml.end(); ++rm)
2162 if (rm->pv[0] == move)
2164 rm->non_pv_score = score--;
2168 sort<RootMove>(Rml.begin(), Rml.end());
2174 // ThreadsManager::idle_loop() is where the threads are parked when they have no work
2175 // to do. The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint
2176 // object for which the current thread is the master.
2178 void ThreadsManager::idle_loop(int threadID, SplitPoint* sp) {
2180 assert(threadID >= 0 && threadID < MAX_THREADS);
2187 // Slave threads can exit as soon as AllThreadsShouldExit raises,
2188 // master should exit as last one.
2189 if (allThreadsShouldExit)
2192 threads[threadID].state = Thread::TERMINATED;
2196 // If we are not thinking, wait for a condition to be signaled
2197 // instead of wasting CPU time polling for work.
2198 while ( threadID >= activeThreads
2199 || threads[threadID].state == Thread::INITIALIZING
2200 || (useSleepingThreads && threads[threadID].state == Thread::AVAILABLE))
2202 assert(!sp || useSleepingThreads);
2203 assert(threadID != 0 || useSleepingThreads);
2205 if (threads[threadID].state == Thread::INITIALIZING)
2206 threads[threadID].state = Thread::AVAILABLE;
2208 // Grab the lock to avoid races with Thread::wake_up()
2209 lock_grab(&threads[threadID].sleepLock);
2211 // If we are master and all slaves have finished do not go to sleep
2212 for (i = 0; sp && i < activeThreads && !sp->is_slave[i]; i++) {}
2213 allFinished = (i == activeThreads);
2215 if (allFinished || allThreadsShouldExit)
2217 lock_release(&threads[threadID].sleepLock);
2221 // Do sleep here after retesting sleep conditions
2222 if (threadID >= activeThreads || threads[threadID].state == Thread::AVAILABLE)
2223 cond_wait(&threads[threadID].sleepCond, &threads[threadID].sleepLock);
2225 lock_release(&threads[threadID].sleepLock);
2228 // If this thread has been assigned work, launch a search
2229 if (threads[threadID].state == Thread::WORKISWAITING)
2231 assert(!allThreadsShouldExit);
2233 threads[threadID].state = Thread::SEARCHING;
2235 // Copy split point position and search stack and call search()
2236 // with SplitPoint template parameter set to true.
2237 SearchStack ss[PLY_MAX_PLUS_2];
2238 SplitPoint* tsp = threads[threadID].splitPoint;
2239 Position pos(*tsp->pos, threadID);
2241 memcpy(ss, tsp->ss - 1, 4 * sizeof(SearchStack));
2245 search<SplitPointPV>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2247 search<SplitPointNonPV>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2249 assert(threads[threadID].state == Thread::SEARCHING);
2251 threads[threadID].state = Thread::AVAILABLE;
2253 // Wake up master thread so to allow it to return from the idle loop in
2254 // case we are the last slave of the split point.
2255 if ( useSleepingThreads
2256 && threadID != tsp->master
2257 && threads[tsp->master].state == Thread::AVAILABLE)
2258 threads[tsp->master].wake_up();
2261 // If this thread is the master of a split point and all slaves have
2262 // finished their work at this split point, return from the idle loop.
2263 for (i = 0; sp && i < activeThreads && !sp->is_slave[i]; i++) {}
2264 allFinished = (i == activeThreads);
2268 // Because sp->slaves[] is reset under lock protection,
2269 // be sure sp->lock has been released before to return.
2270 lock_grab(&(sp->lock));
2271 lock_release(&(sp->lock));
2273 // In helpful master concept a master can help only a sub-tree, and
2274 // because here is all finished is not possible master is booked.
2275 assert(threads[threadID].state == Thread::AVAILABLE);
2277 threads[threadID].state = Thread::SEARCHING;