2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
40 #include "ucioption.h"
48 // Set to true to force running with one thread. Used for debugging
49 const bool FakeSplit = false;
51 // Different node types, used as template parameter
52 enum NodeType { Root, PV, NonPV, SplitPointRoot, SplitPointPV, SplitPointNonPV };
54 // RootMove struct is used for moves at the root of the tree. For each root
55 // move, we store a score, a node count, and a PV (really a refutation
56 // in the case of moves which fail low). Score is normally set at
57 // -VALUE_INFINITE for all non-pv moves.
60 // RootMove::operator<() is the comparison function used when
61 // sorting the moves. A move m1 is considered to be better
62 // than a move m2 if it has an higher score
63 bool operator<(const RootMove& m) const { return score < m.score; }
65 void extract_pv_from_tt(Position& pos);
66 void insert_pv_in_tt(Position& pos);
74 // RootMoveList struct is mainly a std::vector of RootMove objects
75 struct RootMoveList : public std::vector<RootMove> {
77 void init(Position& pos, Move searchMoves[]);
78 RootMove* find(const Move& m, int startIndex = 0);
86 // Lookup table to check if a Piece is a slider and its access function
87 const bool Slidings[18] = { 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1 };
88 inline bool piece_is_slider(Piece p) { return Slidings[p]; }
92 // Maximum depth for razoring
93 const Depth RazorDepth = 4 * ONE_PLY;
95 // Dynamic razoring margin based on depth
96 inline Value razor_margin(Depth d) { return Value(0x200 + 0x10 * int(d)); }
98 // Maximum depth for use of dynamic threat detection when null move fails low
99 const Depth ThreatDepth = 5 * ONE_PLY;
101 // Step 9. Internal iterative deepening
103 // Minimum depth for use of internal iterative deepening
104 const Depth IIDDepth[] = { 8 * ONE_PLY, 5 * ONE_PLY };
106 // At Non-PV nodes we do an internal iterative deepening search
107 // when the static evaluation is bigger then beta - IIDMargin.
108 const Value IIDMargin = Value(0x100);
110 // Step 11. Decide the new search depth
112 // Extensions. Array index 0 is used for non-PV nodes, index 1 for PV nodes
113 const Depth CheckExtension[] = { ONE_PLY / 2, ONE_PLY / 1 };
114 const Depth PawnEndgameExtension[] = { ONE_PLY / 1, ONE_PLY / 1 };
115 const Depth PawnPushTo7thExtension[] = { ONE_PLY / 2, ONE_PLY / 2 };
116 const Depth PassedPawnExtension[] = { DEPTH_ZERO, ONE_PLY / 2 };
118 // Minimum depth for use of singular extension
119 const Depth SingularExtensionDepth[] = { 8 * ONE_PLY, 6 * ONE_PLY };
121 // Step 12. Futility pruning
123 // Futility margin for quiescence search
124 const Value FutilityMarginQS = Value(0x80);
126 // Futility lookup tables (initialized at startup) and their access functions
127 Value FutilityMargins[16][64]; // [depth][moveNumber]
128 int FutilityMoveCounts[32]; // [depth]
130 inline Value futility_margin(Depth d, int mn) {
132 return d < 7 * ONE_PLY ? FutilityMargins[Max(d, 1)][Min(mn, 63)]
133 : 2 * VALUE_INFINITE;
136 inline int futility_move_count(Depth d) {
138 return d < 16 * ONE_PLY ? FutilityMoveCounts[d] : MAX_MOVES;
141 // Step 14. Reduced search
143 // Reduction lookup tables (initialized at startup) and their access function
144 int8_t Reductions[2][64][64]; // [pv][depth][moveNumber]
146 template <bool PvNode> inline Depth reduction(Depth d, int mn) {
148 return (Depth) Reductions[PvNode][Min(d / ONE_PLY, 63)][Min(mn, 63)];
151 // Easy move margin. An easy move candidate must be at least this much
152 // better than the second best move.
153 const Value EasyMoveMargin = Value(0x200);
156 /// Namespace variables
162 int MultiPV, UCIMultiPV, MultiPVIteration;
164 // Time management variables
165 bool StopOnPonderhit, FirstRootMove, StopRequest, QuitRequest, AspirationFailLow;
170 std::ofstream LogFile;
172 // Skill level adjustment
174 bool SkillLevelEnabled;
176 // Node counters, used only by thread[0] but try to keep in different cache
177 // lines (64 bytes each) from the heavy multi-thread read accessed variables.
178 bool SendSearchedNodes;
180 int NodesBetweenPolls = 30000;
188 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove);
190 template <NodeType NT>
191 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth);
193 template <NodeType NT>
194 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth);
196 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bValue);
197 bool connected_moves(const Position& pos, Move m1, Move m2);
198 Value value_to_tt(Value v, int ply);
199 Value value_from_tt(Value v, int ply);
200 bool can_return_tt(const TTEntry* tte, Depth depth, Value beta, int ply);
201 bool connected_threat(const Position& pos, Move m, Move threat);
202 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply);
203 void update_history(const Position& pos, Move move, Depth depth, Move movesSearched[], int moveCount);
204 void update_gains(const Position& pos, Move move, Value before, Value after);
205 void do_skill_level(Move* best, Move* ponder);
207 int current_search_time(int set = 0);
208 string score_to_uci(Value v, Value alpha = -VALUE_INFINITE, Value beta = VALUE_INFINITE);
209 string speed_to_uci(int64_t nodes);
210 string pv_to_uci(const Move pv[], int pvNum, bool chess960);
211 string pretty_pv(Position& pos, int depth, Value score, int time, Move pv[]);
212 string depth_to_uci(Depth depth);
213 void poll(const Position& pos);
214 void wait_for_stop_or_ponderhit();
216 // MovePickerExt template class extends MovePicker and allows to choose at compile
217 // time the proper moves source according to the type of node. In the default case
218 // we simply create and use a standard MovePicker object.
219 template<bool SpNode> struct MovePickerExt : public MovePicker {
221 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
222 : MovePicker(p, ttm, d, h, ss, b) {}
225 // In case of a SpNode we use split point's shared MovePicker object as moves source
226 template<> struct MovePickerExt<true> : 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), mp(ss->sp->mp) {}
231 Move get_next_move() { return mp->get_next_move(); }
235 // Overload operator<<() to make it easier to print moves in a coordinate
236 // notation compatible with UCI protocol.
237 std::ostream& operator<<(std::ostream& os, Move m) {
239 bool chess960 = (os.iword(0) != 0); // See set960()
240 return os << move_to_uci(m, chess960);
243 // When formatting a move for std::cout we must know if we are in Chess960
244 // or not. To keep using the handy operator<<() on the move the trick is to
245 // embed this flag in the stream itself. Function-like named enum set960 is
246 // used as a custom manipulator and the stream internal general-purpose array,
247 // accessed through ios_base::iword(), is used to pass the flag to the move's
248 // operator<<() that will read it to properly format castling moves.
251 std::ostream& operator<< (std::ostream& os, const set960& f) {
253 os.iword(0) = int(f);
257 // extension() decides whether a move should be searched with normal depth,
258 // or with extended depth. Certain classes of moves (checking moves, in
259 // particular) are searched with bigger depth than ordinary moves and in
260 // any case are marked as 'dangerous'. Note that also if a move is not
261 // extended, as example because the corresponding UCI option is set to zero,
262 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
263 template <bool PvNode>
264 FORCE_INLINE Depth extension(const Position& pos, Move m, bool captureOrPromotion,
265 bool moveIsCheck, bool* dangerous) {
266 assert(m != MOVE_NONE);
268 Depth result = DEPTH_ZERO;
269 *dangerous = moveIsCheck;
271 if (moveIsCheck && pos.see_sign(m) >= 0)
272 result += CheckExtension[PvNode];
274 if (piece_type(pos.piece_on(move_from(m))) == PAWN)
276 Color c = pos.side_to_move();
277 if (relative_rank(c, move_to(m)) == RANK_7)
279 result += PawnPushTo7thExtension[PvNode];
282 if (pos.pawn_is_passed(c, move_to(m)))
284 result += PassedPawnExtension[PvNode];
289 if ( captureOrPromotion
290 && piece_type(pos.piece_on(move_to(m))) != PAWN
291 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
292 - piece_value_midgame(pos.piece_on(move_to(m))) == VALUE_ZERO)
293 && !move_is_special(m))
295 result += PawnEndgameExtension[PvNode];
299 return Min(result, ONE_PLY);
305 /// init_search() is called during startup to initialize various lookup tables
309 int d; // depth (ONE_PLY == 2)
310 int hd; // half depth (ONE_PLY == 1)
313 // Init reductions array
314 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
316 double pvRed = log(double(hd)) * log(double(mc)) / 3.0;
317 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
318 Reductions[1][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
319 Reductions[0][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
322 // Init futility margins array
323 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
324 FutilityMargins[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
326 // Init futility move count array
327 for (d = 0; d < 32; d++)
328 FutilityMoveCounts[d] = int(3.001 + 0.25 * pow(d, 2.0));
332 /// perft() is our utility to verify move generation. All the leaf nodes up to
333 /// the given depth are generated and counted and the sum returned.
335 int64_t perft(Position& pos, Depth depth) {
340 // Generate all legal moves
341 MoveList<MV_LEGAL> ml(pos);
343 // If we are at the last ply we don't need to do and undo
344 // the moves, just to count them.
345 if (depth <= ONE_PLY)
348 // Loop through all legal moves
350 for ( ; !ml.end(); ++ml)
352 pos.do_move(ml.move(), st, ci, pos.move_gives_check(ml.move(), ci));
353 sum += perft(pos, depth - ONE_PLY);
354 pos.undo_move(ml.move());
360 /// think() is the external interface to Stockfish's search, and is called when
361 /// the program receives the UCI 'go' command. It initializes various global
362 /// variables, and calls id_loop(). It returns false when a "quit" command is
363 /// received during the search.
365 bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]) {
369 // Initialize global search-related variables
370 StopOnPonderhit = StopRequest = QuitRequest = AspirationFailLow = SendSearchedNodes = false;
372 current_search_time(get_system_time());
374 TimeMgr.init(Limits, pos.startpos_ply_counter());
376 // Set output steram in normal or chess960 mode
377 cout << set960(pos.is_chess960());
379 // Set best NodesBetweenPolls interval to avoid lagging under time pressure
381 NodesBetweenPolls = Min(Limits.maxNodes, 30000);
382 else if (Limits.time && Limits.time < 1000)
383 NodesBetweenPolls = 1000;
384 else if (Limits.time && Limits.time < 5000)
385 NodesBetweenPolls = 5000;
387 NodesBetweenPolls = 30000;
389 // Look for a book move
390 if (Options["OwnBook"].value<bool>())
392 if (Options["Book File"].value<string>() != book.name())
393 book.open(Options["Book File"].value<string>());
395 Move bookMove = book.get_move(pos, Options["Best Book Move"].value<bool>());
396 if (bookMove != MOVE_NONE)
399 wait_for_stop_or_ponderhit();
401 cout << "bestmove " << bookMove << endl;
407 UCIMultiPV = Options["MultiPV"].value<int>();
408 SkillLevel = Options["Skill Level"].value<int>();
410 read_evaluation_uci_options(pos.side_to_move());
411 Threads.read_uci_options();
413 // If needed allocate pawn and material hash tables and adjust TT size
414 Threads.init_hash_tables();
415 TT.set_size(Options["Hash"].value<int>());
417 if (Options["Clear Hash"].value<bool>())
419 Options["Clear Hash"].set_value("false");
423 // Do we have to play with skill handicap? In this case enable MultiPV that
424 // we will use behind the scenes to retrieve a set of possible moves.
425 SkillLevelEnabled = (SkillLevel < 20);
426 MultiPV = (SkillLevelEnabled ? Max(UCIMultiPV, 4) : UCIMultiPV);
428 // Wake up needed threads and reset maxPly counter
429 for (int i = 0; i < Threads.size(); i++)
431 Threads[i].wake_up();
432 Threads[i].maxPly = 0;
435 // Write to log file and keep it open to be accessed during the search
436 if (Options["Use Search Log"].value<bool>())
438 string name = Options["Search Log Filename"].value<string>();
439 LogFile.open(name.c_str(), std::ios::out | std::ios::app);
441 if (LogFile.is_open())
442 LogFile << "\nSearching: " << pos.to_fen()
443 << "\ninfinite: " << Limits.infinite
444 << " ponder: " << Limits.ponder
445 << " time: " << Limits.time
446 << " increment: " << Limits.increment
447 << " moves to go: " << Limits.movesToGo
451 // We're ready to start thinking. Call the iterative deepening loop function
452 Move ponderMove = MOVE_NONE;
453 Move bestMove = id_loop(pos, searchMoves, &ponderMove);
455 // Write final search statistics and close log file
456 if (LogFile.is_open())
458 int t = current_search_time();
460 LogFile << "Nodes: " << pos.nodes_searched()
461 << "\nNodes/second: " << (t > 0 ? pos.nodes_searched() * 1000 / t : 0)
462 << "\nBest move: " << move_to_san(pos, bestMove);
465 pos.do_move(bestMove, st);
466 LogFile << "\nPonder move: " << move_to_san(pos, ponderMove) << endl;
467 pos.undo_move(bestMove); // Return from think() with unchanged position
471 // This makes all the threads to go to sleep
474 // If we are pondering or in infinite search, we shouldn't print the
475 // best move before we are told to do so.
476 if (!StopRequest && (Limits.ponder || Limits.infinite))
477 wait_for_stop_or_ponderhit();
479 // Could be MOVE_NONE when searching on a stalemate position
480 cout << "bestmove " << bestMove;
482 // UCI protol is not clear on allowing sending an empty ponder move, instead
483 // it is clear that ponder move is optional. So skip it if empty.
484 if (ponderMove != MOVE_NONE)
485 cout << " ponder " << ponderMove;
495 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
496 // with increasing depth until the allocated thinking time has been consumed,
497 // user stops the search, or the maximum search depth is reached.
499 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove) {
501 SearchStack ss[PLY_MAX_PLUS_2];
502 Value bestValues[PLY_MAX_PLUS_2];
503 int bestMoveChanges[PLY_MAX_PLUS_2];
504 int depth, aspirationDelta;
505 Value value, alpha, beta;
506 Move bestMove, easyMove, skillBest, skillPonder;
508 // Initialize stuff before a new search
509 memset(ss, 0, 4 * sizeof(SearchStack));
512 *ponderMove = bestMove = easyMove = skillBest = skillPonder = MOVE_NONE;
513 depth = aspirationDelta = 0;
514 value = alpha = -VALUE_INFINITE, beta = VALUE_INFINITE;
515 ss->currentMove = MOVE_NULL; // Hack to skip update_gains()
517 // Moves to search are verified and copied
518 Rml.init(pos, searchMoves);
520 // Handle special case of searching on a mate/stalemate position
523 cout << "info" << depth_to_uci(DEPTH_ZERO)
524 << score_to_uci(pos.in_check() ? -VALUE_MATE : VALUE_DRAW, alpha, beta) << endl;
529 // Iterative deepening loop until requested to stop or target depth reached
530 while (!StopRequest && ++depth <= PLY_MAX && (!Limits.maxDepth || depth <= Limits.maxDepth))
532 // Save last iteration's scores, this needs to be done now, because in
533 // the following MultiPV loop Rml moves could be reordered.
534 for (size_t i = 0; i < Rml.size(); i++)
535 Rml[i].prevScore = Rml[i].score;
537 Rml.bestMoveChanges = 0;
539 // MultiPV iteration loop
540 for (MultiPVIteration = 0; MultiPVIteration < Min(MultiPV, (int)Rml.size()); MultiPVIteration++)
542 // Calculate dynamic aspiration window based on previous iterations
543 if (depth >= 5 && abs(Rml[MultiPVIteration].prevScore) < VALUE_KNOWN_WIN)
545 int prevDelta1 = bestValues[depth - 1] - bestValues[depth - 2];
546 int prevDelta2 = bestValues[depth - 2] - bestValues[depth - 3];
548 aspirationDelta = Min(Max(abs(prevDelta1) + abs(prevDelta2) / 2, 16), 24);
549 aspirationDelta = (aspirationDelta + 7) / 8 * 8; // Round to match grainSize
551 alpha = Max(Rml[MultiPVIteration].prevScore - aspirationDelta, -VALUE_INFINITE);
552 beta = Min(Rml[MultiPVIteration].prevScore + aspirationDelta, VALUE_INFINITE);
556 alpha = -VALUE_INFINITE;
557 beta = VALUE_INFINITE;
560 // Start with a small aspiration window and, in case of fail high/low,
561 // research with bigger window until not failing high/low anymore.
563 // Search starting from ss+1 to allow calling update_gains()
564 value = search<Root>(pos, ss+1, alpha, beta, depth * ONE_PLY);
566 // It is critical that sorting is done with a stable algorithm
567 // because all the values but the first are usually set to
568 // -VALUE_INFINITE and we want to keep the same order for all
569 // the moves but the new PV that goes to head.
570 sort<RootMove>(Rml.begin() + MultiPVIteration, Rml.end());
572 // In case we have found an exact score reorder the PV moves
573 // before leaving the fail high/low loop, otherwise leave the
574 // last PV move in its position so to be searched again.
575 if (value > alpha && value < beta)
576 sort<RootMove>(Rml.begin(), Rml.begin() + MultiPVIteration);
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 <= MultiPVIteration; 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, MultiPVIteration + 1); i++)
592 << depth_to_uci(depth * ONE_PLY)
593 << (i == MultiPVIteration ? score_to_uci(Rml[i].score, alpha, beta) :
594 score_to_uci(Rml[i].score))
595 << speed_to_uci(pos.nodes_searched())
596 << pv_to_uci(&Rml[i].pv[0], i + 1, pos.is_chess960())
599 // In case of failing high/low increase aspiration window and research,
600 // otherwise exit the fail high/low loop.
603 beta = Min(beta + aspirationDelta, VALUE_INFINITE);
604 aspirationDelta += aspirationDelta / 2;
606 else if (value <= alpha)
608 AspirationFailLow = true;
609 StopOnPonderhit = false;
611 alpha = Max(alpha - aspirationDelta, -VALUE_INFINITE);
612 aspirationDelta += aspirationDelta / 2;
617 } while (abs(value) < VALUE_KNOWN_WIN);
620 // Collect info about search result
621 bestMove = Rml[0].pv[0];
622 *ponderMove = Rml[0].pv[1];
623 bestValues[depth] = value;
624 bestMoveChanges[depth] = Rml.bestMoveChanges;
626 // Do we need to pick now the best and the ponder moves ?
627 if (SkillLevelEnabled && depth == 1 + SkillLevel)
628 do_skill_level(&skillBest, &skillPonder);
630 if (LogFile.is_open())
631 LogFile << pretty_pv(pos, depth, value, current_search_time(), &Rml[0].pv[0]) << endl;
633 // Init easyMove after first iteration or drop if differs from the best move
634 if (depth == 1 && (Rml.size() == 1 || Rml[0].score > Rml[1].score + EasyMoveMargin))
636 else if (bestMove != easyMove)
637 easyMove = MOVE_NONE;
639 // Check for some early stop condition
640 if (!StopRequest && Limits.useTimeManagement())
642 // Stop search early if one move seems to be much better than the
643 // others or if there is only a single legal move. Also in the latter
644 // case we search up to some depth anyway to get a proper score.
646 && easyMove == bestMove
648 ||( Rml[0].nodes > (pos.nodes_searched() * 85) / 100
649 && current_search_time() > TimeMgr.available_time() / 16)
650 ||( Rml[0].nodes > (pos.nodes_searched() * 98) / 100
651 && current_search_time() > TimeMgr.available_time() / 32)))
654 // Take in account some extra time if the best move has changed
655 if (depth > 4 && depth < 50)
656 TimeMgr.pv_instability(bestMoveChanges[depth], bestMoveChanges[depth - 1]);
658 // Stop search if most of available time is already consumed. We probably don't
659 // have enough time to search the first move at the next iteration anyway.
660 if (current_search_time() > (TimeMgr.available_time() * 62) / 100)
663 // If we are allowed to ponder do not stop the search now but keep pondering
664 if (StopRequest && Limits.ponder)
667 StopOnPonderhit = true;
672 // When using skills overwrite best and ponder moves with the sub-optimal ones
673 if (SkillLevelEnabled)
675 if (skillBest == MOVE_NONE) // Still unassigned ?
676 do_skill_level(&skillBest, &skillPonder);
678 bestMove = skillBest;
679 *ponderMove = skillPonder;
686 // search<>() is the main search function for both PV and non-PV nodes and for
687 // normal and SplitPoint nodes. When called just after a split point the search
688 // is simpler because we have already probed the hash table, done a null move
689 // search, and searched the first move before splitting, we don't have to repeat
690 // all this work again. We also don't need to store anything to the hash table
691 // here: This is taken care of after we return from the split point.
693 template <NodeType NT>
694 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth) {
696 const bool PvNode = (NT == PV || NT == Root || NT == SplitPointPV || NT == SplitPointRoot);
697 const bool SpNode = (NT == SplitPointPV || NT == SplitPointNonPV || NT == SplitPointRoot);
698 const bool RootNode = (NT == Root || NT == SplitPointRoot);
700 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
701 assert(beta > alpha && beta <= VALUE_INFINITE);
702 assert(PvNode || alpha == beta - 1);
703 assert(pos.thread() >= 0 && pos.thread() < Threads.size());
705 Move movesSearched[MAX_MOVES];
710 Move ttMove, move, excludedMove, threatMove;
713 Value bestValue, value, oldAlpha;
714 Value refinedValue, nullValue, futilityBase, futilityValueScaled; // Non-PV specific
715 bool isPvMove, inCheck, singularExtensionNode, givesCheck, captureOrPromotion, dangerous;
716 int moveCount = 0, playedMoveCount = 0;
717 Thread& thread = Threads[pos.thread()];
718 SplitPoint* sp = NULL;
720 refinedValue = bestValue = value = -VALUE_INFINITE;
722 inCheck = pos.in_check();
723 ss->ply = (ss-1)->ply + 1;
725 // Used to send selDepth info to GUI
726 if (PvNode && thread.maxPly < ss->ply)
727 thread.maxPly = ss->ply;
729 // Step 1. Initialize node and poll. Polling can abort search
732 ss->currentMove = ss->bestMove = threatMove = (ss+1)->excludedMove = MOVE_NONE;
733 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
734 (ss+2)->killers[0] = (ss+2)->killers[1] = MOVE_NONE;
740 ttMove = excludedMove = MOVE_NONE;
741 threatMove = sp->threatMove;
742 goto split_point_start;
745 if (pos.thread() == 0 && ++NodesSincePoll > NodesBetweenPolls)
751 // Step 2. Check for aborted search and immediate draw
753 || pos.is_draw<false>()
754 || ss->ply > PLY_MAX) && !RootNode)
757 // Step 3. Mate distance pruning
760 alpha = Max(value_mated_in(ss->ply), alpha);
761 beta = Min(value_mate_in(ss->ply+1), beta);
766 // Step 4. Transposition table lookup
767 // We don't want the score of a partial search to overwrite a previous full search
768 // TT value, so we use a different position key in case of an excluded move.
769 excludedMove = ss->excludedMove;
770 posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
771 tte = TT.probe(posKey);
772 ttMove = RootNode ? Rml[MultiPVIteration].pv[0] : tte ? tte->move() : MOVE_NONE;
774 // At PV nodes we check for exact scores, while at non-PV nodes we check for
775 // a fail high/low. Biggest advantage at probing at PV nodes is to have a
776 // smooth experience in analysis mode. We don't probe at Root nodes otherwise
777 // we should also update RootMoveList to avoid bogus output.
778 if (!RootNode && tte && (PvNode ? tte->depth() >= depth && tte->type() == VALUE_TYPE_EXACT
779 : can_return_tt(tte, depth, beta, ss->ply)))
782 ss->bestMove = ttMove; // Can be MOVE_NONE
783 return value_from_tt(tte->value(), ss->ply);
786 // Step 5. Evaluate the position statically and update parent's gain statistics
788 ss->eval = ss->evalMargin = VALUE_NONE;
791 assert(tte->static_value() != VALUE_NONE);
793 ss->eval = tte->static_value();
794 ss->evalMargin = tte->static_value_margin();
795 refinedValue = refine_eval(tte, ss->eval, ss->ply);
799 refinedValue = ss->eval = evaluate(pos, ss->evalMargin);
800 TT.store(posKey, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, MOVE_NONE, ss->eval, ss->evalMargin);
803 // Save gain for the parent non-capture move
804 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
806 // Step 6. Razoring (is omitted in PV nodes)
808 && depth < RazorDepth
810 && refinedValue + razor_margin(depth) < beta
811 && ttMove == MOVE_NONE
812 && abs(beta) < VALUE_MATE_IN_PLY_MAX
813 && !pos.has_pawn_on_7th(pos.side_to_move()))
815 Value rbeta = beta - razor_margin(depth);
816 Value v = qsearch<NonPV>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO);
818 // Logically we should return (v + razor_margin(depth)), but
819 // surprisingly this did slightly weaker in tests.
823 // Step 7. Static null move pruning (is omitted in PV nodes)
824 // We're betting that the opponent doesn't have a move that will reduce
825 // the score by more than futility_margin(depth) if we do a null move.
828 && depth < RazorDepth
830 && refinedValue - futility_margin(depth, 0) >= beta
831 && abs(beta) < VALUE_MATE_IN_PLY_MAX
832 && pos.non_pawn_material(pos.side_to_move()))
833 return refinedValue - futility_margin(depth, 0);
835 // Step 8. Null move search with verification search (is omitted in PV nodes)
840 && refinedValue >= beta
841 && abs(beta) < VALUE_MATE_IN_PLY_MAX
842 && pos.non_pawn_material(pos.side_to_move()))
844 ss->currentMove = MOVE_NULL;
846 // Null move dynamic reduction based on depth
847 int R = 3 + (depth >= 5 * ONE_PLY ? depth / 8 : 0);
849 // Null move dynamic reduction based on value
850 if (refinedValue - PawnValueMidgame > beta)
853 pos.do_null_move(st);
854 (ss+1)->skipNullMove = true;
855 nullValue = depth-R*ONE_PLY < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
856 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R*ONE_PLY);
857 (ss+1)->skipNullMove = false;
858 pos.undo_null_move();
860 if (nullValue >= beta)
862 // Do not return unproven mate scores
863 if (nullValue >= VALUE_MATE_IN_PLY_MAX)
866 if (depth < 6 * ONE_PLY)
869 // Do verification search at high depths
870 ss->skipNullMove = true;
871 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R*ONE_PLY);
872 ss->skipNullMove = false;
879 // The null move failed low, which means that we may be faced with
880 // some kind of threat. If the previous move was reduced, check if
881 // the move that refuted the null move was somehow connected to the
882 // move which was reduced. If a connection is found, return a fail
883 // low score (which will cause the reduced move to fail high in the
884 // parent node, which will trigger a re-search with full depth).
885 threatMove = (ss+1)->bestMove;
887 if ( depth < ThreatDepth
889 && threatMove != MOVE_NONE
890 && connected_moves(pos, (ss-1)->currentMove, threatMove))
895 // Step 9. ProbCut (is omitted in PV nodes)
896 // If we have a very good capture (i.e. SEE > seeValues[captured_piece_type])
897 // and a reduced search returns a value much above beta, we can (almost) safely
898 // prune the previous move.
900 && depth >= RazorDepth + ONE_PLY
903 && excludedMove == MOVE_NONE
904 && abs(beta) < VALUE_MATE_IN_PLY_MAX)
906 Value rbeta = beta + 200;
907 Depth rdepth = depth - ONE_PLY - 3 * ONE_PLY;
909 assert(rdepth >= ONE_PLY);
911 MovePicker mp(pos, ttMove, H, pos.captured_piece_type());
914 while ((move = mp.get_next_move()) != MOVE_NONE)
915 if (pos.pl_move_is_legal(move, ci.pinned))
917 pos.do_move(move, st, ci, pos.move_gives_check(move, ci));
918 value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, rdepth);
925 // Step 10. Internal iterative deepening
926 if ( depth >= IIDDepth[PvNode]
927 && ttMove == MOVE_NONE
928 && (PvNode || (!inCheck && ss->eval + IIDMargin >= beta)))
930 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
932 ss->skipNullMove = true;
933 search<PvNode ? PV : NonPV>(pos, ss, alpha, beta, d);
934 ss->skipNullMove = false;
936 tte = TT.probe(posKey);
937 ttMove = tte ? tte->move() : MOVE_NONE;
940 split_point_start: // At split points actual search starts from here
942 // Initialize a MovePicker object for the current position
943 MovePickerExt<SpNode> mp(pos, ttMove, depth, H, ss, PvNode ? -VALUE_INFINITE : beta);
945 ss->bestMove = MOVE_NONE;
946 futilityBase = ss->eval + ss->evalMargin;
947 singularExtensionNode = !RootNode
949 && depth >= SingularExtensionDepth[PvNode]
950 && ttMove != MOVE_NONE
951 && !excludedMove // Do not allow recursive singular extension search
952 && (tte->type() & VALUE_TYPE_LOWER)
953 && tte->depth() >= depth - 3 * ONE_PLY;
956 lock_grab(&(sp->lock));
957 bestValue = sp->bestValue;
960 // Step 11. Loop through moves
961 // Loop through all pseudo-legal moves until no moves remain or a beta cutoff occurs
962 while ( bestValue < beta
963 && (move = mp.get_next_move()) != MOVE_NONE
964 && !thread.cutoff_occurred())
966 assert(move_is_ok(move));
968 if (move == excludedMove)
971 // At root obey the "searchmoves" option and skip moves not listed in Root Move List.
972 // Also in MultiPV mode we skip moves which already have got an exact score
973 // in previous MultiPV Iteration. Finally any illegal move is skipped here.
974 if (RootNode && !Rml.find(move, MultiPVIteration))
977 // At PV and SpNode nodes we want all moves to be legal since the beginning
978 if ((PvNode || SpNode) && !pos.pl_move_is_legal(move, ci.pinned))
983 moveCount = ++sp->moveCount;
984 lock_release(&(sp->lock));
991 // This is used by time management
992 FirstRootMove = (moveCount == 1);
994 // Save the current node count before the move is searched
995 nodes = pos.nodes_searched();
997 // If it's time to send nodes info, do it here where we have the
998 // correct accumulated node counts searched by each thread.
999 if (!SpNode && SendSearchedNodes)
1001 SendSearchedNodes = false;
1002 cout << "info" << speed_to_uci(pos.nodes_searched()) << endl;
1005 // For long searches send current move info to GUI
1006 if (pos.thread() == 0 && current_search_time() > 2000)
1007 cout << "info" << depth_to_uci(depth)
1008 << " currmove " << move
1009 << " currmovenumber " << moveCount + MultiPVIteration << endl;
1012 // At Root and at first iteration do a PV search on all the moves to score root moves
1013 isPvMove = (PvNode && moveCount <= (RootNode && depth <= ONE_PLY ? MAX_MOVES : 1));
1014 givesCheck = pos.move_gives_check(move, ci);
1015 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1017 // Step 12. Decide the new search depth
1018 ext = extension<PvNode>(pos, move, captureOrPromotion, givesCheck, &dangerous);
1020 // Singular extension search. If all moves but one fail low on a search of
1021 // (alpha-s, beta-s), and just one fails high on (alpha, beta), then that move
1022 // is singular and should be extended. To verify this we do a reduced search
1023 // on all the other moves but the ttMove, if result is lower than ttValue minus
1024 // a margin then we extend ttMove.
1025 if ( singularExtensionNode
1027 && pos.pl_move_is_legal(move, ci.pinned)
1030 Value ttValue = value_from_tt(tte->value(), ss->ply);
1032 if (abs(ttValue) < VALUE_KNOWN_WIN)
1034 Value rBeta = ttValue - int(depth);
1035 ss->excludedMove = move;
1036 ss->skipNullMove = true;
1037 Value v = search<NonPV>(pos, ss, rBeta - 1, rBeta, depth / 2);
1038 ss->skipNullMove = false;
1039 ss->excludedMove = MOVE_NONE;
1040 ss->bestMove = MOVE_NONE;
1046 // Update current move (this must be done after singular extension search)
1047 newDepth = depth - ONE_PLY + ext;
1049 // Step 13. Futility pruning (is omitted in PV nodes)
1051 && !captureOrPromotion
1055 && !move_is_castle(move))
1057 // Move count based pruning
1058 if ( moveCount >= futility_move_count(depth)
1059 && (!threatMove || !connected_threat(pos, move, threatMove))
1060 && bestValue > VALUE_MATED_IN_PLY_MAX) // FIXME bestValue is racy
1063 lock_grab(&(sp->lock));
1068 // Value based pruning
1069 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
1070 // but fixing this made program slightly weaker.
1071 Depth predictedDepth = newDepth - reduction<PvNode>(depth, moveCount);
1072 futilityValueScaled = futilityBase + futility_margin(predictedDepth, moveCount)
1073 + H.gain(pos.piece_on(move_from(move)), move_to(move));
1075 if (futilityValueScaled < beta)
1079 lock_grab(&(sp->lock));
1080 if (futilityValueScaled > sp->bestValue)
1081 sp->bestValue = bestValue = futilityValueScaled;
1083 else if (futilityValueScaled > bestValue)
1084 bestValue = futilityValueScaled;
1089 // Prune moves with negative SEE at low depths
1090 if ( predictedDepth < 2 * ONE_PLY
1091 && bestValue > VALUE_MATED_IN_PLY_MAX
1092 && pos.see_sign(move) < 0)
1095 lock_grab(&(sp->lock));
1101 // Check for legality only before to do the move
1102 if (!pos.pl_move_is_legal(move, ci.pinned))
1108 ss->currentMove = move;
1109 if (!SpNode && !captureOrPromotion)
1110 movesSearched[playedMoveCount++] = move;
1112 // Step 14. Make the move
1113 pos.do_move(move, st, ci, givesCheck);
1115 // Step extra. pv search (only in PV nodes)
1116 // The first move in list is the expected PV
1118 value = newDepth < ONE_PLY ? -qsearch<PV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
1119 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
1122 // Step 15. Reduced depth search
1123 // If the move fails high will be re-searched at full depth.
1124 bool doFullDepthSearch = true;
1126 if ( depth > 3 * ONE_PLY
1127 && !captureOrPromotion
1129 && !move_is_castle(move)
1130 && ss->killers[0] != move
1131 && ss->killers[1] != move
1132 && (ss->reduction = reduction<PvNode>(depth, moveCount)) != DEPTH_ZERO)
1134 Depth d = newDepth - ss->reduction;
1135 alpha = SpNode ? sp->alpha : alpha;
1137 value = d < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
1138 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d);
1140 ss->reduction = DEPTH_ZERO;
1141 doFullDepthSearch = (value > alpha);
1144 // Step 16. Full depth search
1145 if (doFullDepthSearch)
1147 alpha = SpNode ? sp->alpha : alpha;
1148 value = newDepth < ONE_PLY ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, DEPTH_ZERO)
1149 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth);
1151 // Step extra. pv search (only in PV nodes)
1152 // Search only for possible new PV nodes, if instead value >= beta then
1153 // parent node fails low with value <= alpha and tries another move.
1154 if (PvNode && value > alpha && (RootNode || value < beta))
1155 value = newDepth < ONE_PLY ? -qsearch<PV>(pos, ss+1, -beta, -alpha, DEPTH_ZERO)
1156 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth);
1160 // Step 17. Undo move
1161 pos.undo_move(move);
1163 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1165 // Step 18. Check for new best move
1168 lock_grab(&(sp->lock));
1169 bestValue = sp->bestValue;
1176 // Finished searching the move. If StopRequest is true, the search
1177 // was aborted because the user interrupted the search or because we
1178 // ran out of time. In this case, the return value of the search cannot
1179 // be trusted, and we break out of the loop without updating the best
1184 // Remember searched nodes counts for this move
1185 RootMove* rm = Rml.find(move);
1186 rm->nodes += pos.nodes_searched() - nodes;
1188 // PV move or new best move ?
1189 if (isPvMove || value > alpha)
1193 rm->extract_pv_from_tt(pos);
1195 // We record how often the best move has been changed in each
1196 // iteration. This information is used for time management: When
1197 // the best move changes frequently, we allocate some more time.
1198 if (!isPvMove && MultiPV == 1)
1199 Rml.bestMoveChanges++;
1202 // All other moves but the PV are set to the lowest value, this
1203 // is not a problem when sorting becuase sort is stable and move
1204 // position in the list is preserved, just the PV is pushed up.
1205 rm->score = -VALUE_INFINITE;
1209 if (value > bestValue)
1212 ss->bestMove = move;
1216 && value < beta) // We want always alpha < beta
1219 if (SpNode && !thread.cutoff_occurred())
1221 sp->bestValue = value;
1222 sp->ss->bestMove = move;
1224 sp->is_betaCutoff = (value >= beta);
1228 // Step 19. Check for split
1231 && depth >= Threads.min_split_depth()
1233 && Threads.available_slave_exists(pos.thread())
1235 && !thread.cutoff_occurred())
1236 Threads.split<FakeSplit>(pos, ss, &alpha, beta, &bestValue, depth,
1237 threatMove, moveCount, &mp, PvNode);
1240 // Step 20. Check for mate and stalemate
1241 // All legal moves have been searched and if there are
1242 // no legal moves, it must be mate or stalemate.
1243 // If one move was excluded return fail low score.
1244 if (!SpNode && !moveCount)
1245 return excludedMove ? oldAlpha : inCheck ? value_mated_in(ss->ply) : VALUE_DRAW;
1247 // Step 21. Update tables
1248 // If the search is not aborted, update the transposition table,
1249 // history counters, and killer moves.
1250 if (!SpNode && !StopRequest && !thread.cutoff_occurred())
1252 move = bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove;
1253 vt = bestValue <= oldAlpha ? VALUE_TYPE_UPPER
1254 : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT;
1256 TT.store(posKey, value_to_tt(bestValue, ss->ply), vt, depth, move, ss->eval, ss->evalMargin);
1258 // Update killers and history only for non capture moves that fails high
1259 if ( bestValue >= beta
1260 && !pos.move_is_capture_or_promotion(move))
1262 if (move != ss->killers[0])
1264 ss->killers[1] = ss->killers[0];
1265 ss->killers[0] = move;
1267 update_history(pos, move, depth, movesSearched, playedMoveCount);
1273 // Here we have the lock still grabbed
1274 sp->is_slave[pos.thread()] = false;
1275 sp->nodes += pos.nodes_searched();
1276 lock_release(&(sp->lock));
1279 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1284 // qsearch() is the quiescence search function, which is called by the main
1285 // search function when the remaining depth is zero (or, to be more precise,
1286 // less than ONE_PLY).
1288 template <NodeType NT>
1289 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth) {
1291 const bool PvNode = (NT == PV);
1293 assert(NT == PV || NT == NonPV);
1294 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1295 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1296 assert(PvNode || alpha == beta - 1);
1298 assert(pos.thread() >= 0 && pos.thread() < Threads.size());
1302 Value bestValue, value, evalMargin, futilityValue, futilityBase;
1303 bool inCheck, enoughMaterial, givesCheck, evasionPrunable;
1306 Value oldAlpha = alpha;
1308 ss->bestMove = ss->currentMove = MOVE_NONE;
1309 ss->ply = (ss-1)->ply + 1;
1311 // Check for an instant draw or maximum ply reached
1312 if (pos.is_draw<true>() || ss->ply > PLY_MAX)
1315 // Decide whether or not to include checks, this fixes also the type of
1316 // TT entry depth that we are going to use. Note that in qsearch we use
1317 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1318 inCheck = pos.in_check();
1319 ttDepth = (inCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS : DEPTH_QS_NO_CHECKS);
1321 // Transposition table lookup. At PV nodes, we don't use the TT for
1322 // pruning, but only for move ordering.
1323 tte = TT.probe(pos.get_key());
1324 ttMove = (tte ? tte->move() : MOVE_NONE);
1326 if (!PvNode && tte && can_return_tt(tte, ttDepth, beta, ss->ply))
1328 ss->bestMove = ttMove; // Can be MOVE_NONE
1329 return value_from_tt(tte->value(), ss->ply);
1332 // Evaluate the position statically
1335 bestValue = futilityBase = -VALUE_INFINITE;
1336 ss->eval = evalMargin = VALUE_NONE;
1337 enoughMaterial = false;
1343 assert(tte->static_value() != VALUE_NONE);
1345 evalMargin = tte->static_value_margin();
1346 ss->eval = bestValue = tte->static_value();
1349 ss->eval = bestValue = evaluate(pos, evalMargin);
1351 // Stand pat. Return immediately if static value is at least beta
1352 if (bestValue >= beta)
1355 TT.store(pos.get_key(), value_to_tt(bestValue, ss->ply), VALUE_TYPE_LOWER, DEPTH_NONE, MOVE_NONE, ss->eval, evalMargin);
1360 if (PvNode && bestValue > alpha)
1363 // Futility pruning parameters, not needed when in check
1364 futilityBase = ss->eval + evalMargin + FutilityMarginQS;
1365 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1368 // Initialize a MovePicker object for the current position, and prepare
1369 // to search the moves. Because the depth is <= 0 here, only captures,
1370 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1372 MovePicker mp(pos, ttMove, depth, H, move_to((ss-1)->currentMove));
1375 // Loop through the moves until no moves remain or a beta cutoff occurs
1376 while ( alpha < beta
1377 && (move = mp.get_next_move()) != MOVE_NONE)
1379 assert(move_is_ok(move));
1381 givesCheck = pos.move_gives_check(move, ci);
1389 && !move_is_promotion(move)
1390 && !pos.move_is_passed_pawn_push(move))
1392 futilityValue = futilityBase
1393 + piece_value_endgame(pos.piece_on(move_to(move)))
1394 + (move_is_ep(move) ? PawnValueEndgame : VALUE_ZERO);
1396 if (futilityValue < alpha)
1398 if (futilityValue > bestValue)
1399 bestValue = futilityValue;
1403 // Prune moves with negative or equal SEE
1404 if ( futilityBase < beta
1405 && depth < DEPTH_ZERO
1406 && pos.see(move) <= 0)
1410 // Detect non-capture evasions that are candidate to be pruned
1411 evasionPrunable = !PvNode
1413 && bestValue > VALUE_MATED_IN_PLY_MAX
1414 && !pos.move_is_capture(move)
1415 && !pos.can_castle(pos.side_to_move());
1417 // Don't search moves with negative SEE values
1419 && (!inCheck || evasionPrunable)
1421 && !move_is_promotion(move)
1422 && pos.see_sign(move) < 0)
1425 // Don't search useless checks
1430 && !pos.move_is_capture_or_promotion(move)
1431 && ss->eval + PawnValueMidgame / 4 < beta
1432 && !check_is_dangerous(pos, move, futilityBase, beta, &bestValue))
1434 if (ss->eval + PawnValueMidgame / 4 > bestValue)
1435 bestValue = ss->eval + PawnValueMidgame / 4;
1440 // Check for legality only before to do the move
1441 if (!pos.pl_move_is_legal(move, ci.pinned))
1444 // Update current move
1445 ss->currentMove = move;
1447 // Make and search the move
1448 pos.do_move(move, st, ci, givesCheck);
1449 value = -qsearch<NT>(pos, ss+1, -beta, -alpha, depth-ONE_PLY);
1450 pos.undo_move(move);
1452 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1455 if (value > bestValue)
1461 ss->bestMove = move;
1466 // All legal moves have been searched. A special case: If we're in check
1467 // and no legal moves were found, it is checkmate.
1468 if (inCheck && bestValue == -VALUE_INFINITE)
1469 return value_mated_in(ss->ply);
1471 // Update transposition table
1472 ValueType vt = (bestValue <= oldAlpha ? VALUE_TYPE_UPPER : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT);
1473 TT.store(pos.get_key(), value_to_tt(bestValue, ss->ply), vt, ttDepth, ss->bestMove, ss->eval, evalMargin);
1475 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1481 // check_is_dangerous() tests if a checking move can be pruned in qsearch().
1482 // bestValue is updated only when returning false because in that case move
1485 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bestValue)
1487 Bitboard b, occ, oldAtt, newAtt, kingAtt;
1488 Square from, to, ksq, victimSq;
1491 Value futilityValue, bv = *bestValue;
1493 from = move_from(move);
1495 them = opposite_color(pos.side_to_move());
1496 ksq = pos.king_square(them);
1497 kingAtt = pos.attacks_from<KING>(ksq);
1498 pc = pos.piece_on(from);
1500 occ = pos.occupied_squares() & ~(1ULL << from) & ~(1ULL << ksq);
1501 oldAtt = pos.attacks_from(pc, from, occ);
1502 newAtt = pos.attacks_from(pc, to, occ);
1504 // Rule 1. Checks which give opponent's king at most one escape square are dangerous
1505 b = kingAtt & ~pos.pieces(them) & ~newAtt & ~(1ULL << to);
1507 if (!(b && (b & (b - 1))))
1510 // Rule 2. Queen contact check is very dangerous
1511 if ( piece_type(pc) == QUEEN
1512 && bit_is_set(kingAtt, to))
1515 // Rule 3. Creating new double threats with checks
1516 b = pos.pieces(them) & newAtt & ~oldAtt & ~(1ULL << ksq);
1520 victimSq = pop_1st_bit(&b);
1521 futilityValue = futilityBase + piece_value_endgame(pos.piece_on(victimSq));
1523 // Note that here we generate illegal "double move"!
1524 if ( futilityValue >= beta
1525 && pos.see_sign(make_move(from, victimSq)) >= 0)
1528 if (futilityValue > bv)
1532 // Update bestValue only if check is not dangerous (because we will prune the move)
1538 // connected_moves() tests whether two moves are 'connected' in the sense
1539 // that the first move somehow made the second move possible (for instance
1540 // if the moving piece is the same in both moves). The first move is assumed
1541 // to be the move that was made to reach the current position, while the
1542 // second move is assumed to be a move from the current position.
1544 bool connected_moves(const Position& pos, Move m1, Move m2) {
1546 Square f1, t1, f2, t2;
1550 assert(m1 && move_is_ok(m1));
1551 assert(m2 && move_is_ok(m2));
1553 // Case 1: The moving piece is the same in both moves
1559 // Case 2: The destination square for m2 was vacated by m1
1565 // Case 3: Moving through the vacated square
1566 p2 = pos.piece_on(f2);
1567 if ( piece_is_slider(p2)
1568 && bit_is_set(squares_between(f2, t2), f1))
1571 // Case 4: The destination square for m2 is defended by the moving piece in m1
1572 p1 = pos.piece_on(t1);
1573 if (bit_is_set(pos.attacks_from(p1, t1), t2))
1576 // Case 5: Discovered check, checking piece is the piece moved in m1
1577 ksq = pos.king_square(pos.side_to_move());
1578 if ( piece_is_slider(p1)
1579 && bit_is_set(squares_between(t1, ksq), f2))
1581 Bitboard occ = pos.occupied_squares();
1582 clear_bit(&occ, f2);
1583 if (bit_is_set(pos.attacks_from(p1, t1, occ), ksq))
1590 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1591 // "plies to mate from the current ply". Non-mate scores are unchanged.
1592 // The function is called before storing a value to the transposition table.
1594 Value value_to_tt(Value v, int ply) {
1596 if (v >= VALUE_MATE_IN_PLY_MAX)
1599 if (v <= VALUE_MATED_IN_PLY_MAX)
1606 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score from
1607 // the transposition table to a mate score corrected for the current ply.
1609 Value value_from_tt(Value v, int ply) {
1611 if (v >= VALUE_MATE_IN_PLY_MAX)
1614 if (v <= VALUE_MATED_IN_PLY_MAX)
1621 // connected_threat() tests whether it is safe to forward prune a move or if
1622 // is somehow connected to the threat move returned by null search.
1624 bool connected_threat(const Position& pos, Move m, Move threat) {
1626 assert(move_is_ok(m));
1627 assert(threat && move_is_ok(threat));
1628 assert(!pos.move_is_capture_or_promotion(m));
1629 assert(!pos.move_is_passed_pawn_push(m));
1631 Square mfrom, mto, tfrom, tto;
1633 mfrom = move_from(m);
1635 tfrom = move_from(threat);
1636 tto = move_to(threat);
1638 // Case 1: Don't prune moves which move the threatened piece
1642 // Case 2: If the threatened piece has value less than or equal to the
1643 // value of the threatening piece, don't prune moves which defend it.
1644 if ( pos.move_is_capture(threat)
1645 && ( piece_value_midgame(pos.piece_on(tfrom)) >= piece_value_midgame(pos.piece_on(tto))
1646 || piece_type(pos.piece_on(tfrom)) == KING)
1647 && pos.move_attacks_square(m, tto))
1650 // Case 3: If the moving piece in the threatened move is a slider, don't
1651 // prune safe moves which block its ray.
1652 if ( piece_is_slider(pos.piece_on(tfrom))
1653 && bit_is_set(squares_between(tfrom, tto), mto)
1654 && pos.see_sign(m) >= 0)
1661 // can_return_tt() returns true if a transposition table score
1662 // can be used to cut-off at a given point in search.
1664 bool can_return_tt(const TTEntry* tte, Depth depth, Value beta, int ply) {
1666 Value v = value_from_tt(tte->value(), ply);
1668 return ( tte->depth() >= depth
1669 || v >= Max(VALUE_MATE_IN_PLY_MAX, beta)
1670 || v < Min(VALUE_MATED_IN_PLY_MAX, beta))
1672 && ( ((tte->type() & VALUE_TYPE_LOWER) && v >= beta)
1673 || ((tte->type() & VALUE_TYPE_UPPER) && v < beta));
1677 // refine_eval() returns the transposition table score if
1678 // possible otherwise falls back on static position evaluation.
1680 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
1684 Value v = value_from_tt(tte->value(), ply);
1686 if ( ((tte->type() & VALUE_TYPE_LOWER) && v >= defaultEval)
1687 || ((tte->type() & VALUE_TYPE_UPPER) && v < defaultEval))
1694 // update_history() registers a good move that produced a beta-cutoff
1695 // in history and marks as failures all the other moves of that ply.
1697 void update_history(const Position& pos, Move move, Depth depth,
1698 Move movesSearched[], int moveCount) {
1700 Value bonus = Value(int(depth) * int(depth));
1702 H.update(pos.piece_on(move_from(move)), move_to(move), bonus);
1704 for (int i = 0; i < moveCount - 1; i++)
1706 m = movesSearched[i];
1710 H.update(pos.piece_on(move_from(m)), move_to(m), -bonus);
1715 // update_gains() updates the gains table of a non-capture move given
1716 // the static position evaluation before and after the move.
1718 void update_gains(const Position& pos, Move m, Value before, Value after) {
1721 && before != VALUE_NONE
1722 && after != VALUE_NONE
1723 && pos.captured_piece_type() == PIECE_TYPE_NONE
1724 && !move_is_special(m))
1725 H.update_gain(pos.piece_on(move_to(m)), move_to(m), -(before + after));
1729 // current_search_time() returns the number of milliseconds which have passed
1730 // since the beginning of the current search.
1732 int current_search_time(int set) {
1734 static int searchStartTime;
1737 searchStartTime = set;
1739 return get_system_time() - searchStartTime;
1743 // score_to_uci() converts a value to a string suitable for use with the UCI
1744 // protocol specifications:
1746 // cp <x> The score from the engine's point of view in centipawns.
1747 // mate <y> Mate in y moves, not plies. If the engine is getting mated
1748 // use negative values for y.
1750 string score_to_uci(Value v, Value alpha, Value beta) {
1752 std::stringstream s;
1754 if (abs(v) < VALUE_MATE - PLY_MAX * ONE_PLY)
1755 s << " score cp " << int(v) * 100 / int(PawnValueMidgame); // Scale to centipawns
1757 s << " score mate " << (v > 0 ? VALUE_MATE - v + 1 : -VALUE_MATE - v) / 2;
1759 s << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
1765 // speed_to_uci() returns a string with time stats of current search suitable
1766 // to be sent to UCI gui.
1768 string speed_to_uci(int64_t nodes) {
1770 std::stringstream s;
1771 int t = current_search_time();
1773 s << " nodes " << nodes
1774 << " nps " << (t > 0 ? int(nodes * 1000 / t) : 0)
1780 // pv_to_uci() returns a string with information on the current PV line
1781 // formatted according to UCI specification.
1783 string pv_to_uci(const Move pv[], int pvNum, bool chess960) {
1785 std::stringstream s;
1787 s << " multipv " << pvNum << " pv " << set960(chess960);
1789 for ( ; *pv != MOVE_NONE; pv++)
1795 // depth_to_uci() returns a string with information on the current depth and
1796 // seldepth formatted according to UCI specification.
1798 string depth_to_uci(Depth depth) {
1800 std::stringstream s;
1802 // Retrieve max searched depth among threads
1804 for (int i = 0; i < Threads.size(); i++)
1805 if (Threads[i].maxPly > selDepth)
1806 selDepth = Threads[i].maxPly;
1808 s << " depth " << depth / ONE_PLY << " seldepth " << selDepth;
1813 string time_to_string(int millisecs) {
1815 const int MSecMinute = 1000 * 60;
1816 const int MSecHour = 1000 * 60 * 60;
1818 int hours = millisecs / MSecHour;
1819 int minutes = (millisecs % MSecHour) / MSecMinute;
1820 int seconds = ((millisecs % MSecHour) % MSecMinute) / 1000;
1822 std::stringstream s;
1827 s << std::setfill('0') << std::setw(2) << minutes << ':' << std::setw(2) << seconds;
1831 string score_to_string(Value v) {
1833 std::stringstream s;
1835 if (v >= VALUE_MATE_IN_PLY_MAX)
1836 s << "#" << (VALUE_MATE - v + 1) / 2;
1837 else if (v <= VALUE_MATED_IN_PLY_MAX)
1838 s << "-#" << (VALUE_MATE + v) / 2;
1840 s << std::setprecision(2) << std::fixed << std::showpos << float(v) / PawnValueMidgame;
1845 // pretty_pv() creates a human-readable string from a position and a PV.
1846 // It is used to write search information to the log file (which is created
1847 // when the UCI parameter "Use Search Log" is "true").
1849 string pretty_pv(Position& pos, int depth, Value value, int time, Move pv[]) {
1851 const int64_t K = 1000;
1852 const int64_t M = 1000000;
1853 const int startColumn = 28;
1854 const size_t maxLength = 80 - startColumn;
1856 StateInfo state[PLY_MAX_PLUS_2], *st = state;
1859 std::stringstream s;
1862 // First print depth, score, time and searched nodes...
1863 s << set960(pos.is_chess960())
1864 << std::setw(2) << depth
1865 << std::setw(8) << score_to_string(value)
1866 << std::setw(8) << time_to_string(time);
1868 if (pos.nodes_searched() < M)
1869 s << std::setw(8) << pos.nodes_searched() / 1 << " ";
1870 else if (pos.nodes_searched() < K * M)
1871 s << std::setw(7) << pos.nodes_searched() / K << "K ";
1873 s << std::setw(7) << pos.nodes_searched() / M << "M ";
1875 // ...then print the full PV line in short algebraic notation
1876 while (*m != MOVE_NONE)
1878 san = move_to_san(pos, *m);
1879 length += san.length() + 1;
1881 if (length > maxLength)
1883 length = san.length() + 1;
1884 s << "\n" + string(startColumn, ' ');
1888 pos.do_move(*m++, *st++);
1891 // Restore original position before to leave
1892 while (m != pv) pos.undo_move(*--m);
1897 // poll() performs two different functions: It polls for user input, and it
1898 // looks at the time consumed so far and decides if it's time to abort the
1901 void poll(const Position& pos) {
1903 static int lastInfoTime;
1904 int t = current_search_time();
1907 if (input_available())
1909 // We are line oriented, don't read single chars
1912 if (!std::getline(std::cin, command) || command == "quit")
1914 // Quit the program as soon as possible
1915 Limits.ponder = false;
1916 QuitRequest = StopRequest = true;
1919 else if (command == "stop")
1921 // Stop calculating as soon as possible, but still send the "bestmove"
1922 // and possibly the "ponder" token when finishing the search.
1923 Limits.ponder = false;
1926 else if (command == "ponderhit")
1928 // The opponent has played the expected move. GUI sends "ponderhit" if
1929 // we were told to ponder on the same move the opponent has played. We
1930 // should continue searching but switching from pondering to normal search.
1931 Limits.ponder = false;
1933 if (StopOnPonderhit)
1938 // Print search information
1942 else if (lastInfoTime > t)
1943 // HACK: Must be a new search where we searched less than
1944 // NodesBetweenPolls nodes during the first second of search.
1947 else if (t - lastInfoTime >= 1000)
1952 dbg_print_hit_rate();
1954 // Send info on searched nodes as soon as we return to root
1955 SendSearchedNodes = true;
1958 // Should we stop the search?
1962 bool stillAtFirstMove = FirstRootMove
1963 && !AspirationFailLow
1964 && t > TimeMgr.available_time();
1966 bool noMoreTime = t > TimeMgr.maximum_time()
1967 || stillAtFirstMove;
1969 if ( (Limits.useTimeManagement() && noMoreTime)
1970 || (Limits.maxTime && t >= Limits.maxTime)
1971 || (Limits.maxNodes && pos.nodes_searched() >= Limits.maxNodes)) // FIXME
1976 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
1977 // while the program is pondering. The point is to work around a wrinkle in
1978 // the UCI protocol: When pondering, the engine is not allowed to give a
1979 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
1980 // We simply wait here until one of these commands is sent, and return,
1981 // after which the bestmove and pondermove will be printed.
1983 void wait_for_stop_or_ponderhit() {
1987 // Wait for a command from stdin
1988 while ( std::getline(std::cin, command)
1989 && command != "ponderhit" && command != "stop" && command != "quit") {};
1991 if (command != "ponderhit" && command != "stop")
1992 QuitRequest = true; // Must be "quit" or getline() returned false
1996 // When playing with strength handicap choose best move among the MultiPV set
1997 // using a statistical rule dependent on SkillLevel. Idea by Heinz van Saanen.
1998 void do_skill_level(Move* best, Move* ponder) {
2000 assert(MultiPV > 1);
2004 // Rml list is already sorted by score in descending order
2006 int max_s = -VALUE_INFINITE;
2007 int size = Min(MultiPV, (int)Rml.size());
2008 int max = Rml[0].score;
2009 int var = Min(max - Rml[size - 1].score, PawnValueMidgame);
2010 int wk = 120 - 2 * SkillLevel;
2012 // PRNG sequence should be non deterministic
2013 for (int i = abs(get_system_time() % 50); i > 0; i--)
2014 rk.rand<unsigned>();
2016 // Choose best move. For each move's score we add two terms both dependent
2017 // on wk, one deterministic and bigger for weaker moves, and one random,
2018 // then we choose the move with the resulting highest score.
2019 for (int i = 0; i < size; i++)
2023 // Don't allow crazy blunders even at very low skills
2024 if (i > 0 && Rml[i-1].score > s + EasyMoveMargin)
2027 // This is our magical formula
2028 s += ((max - s) * wk + var * (rk.rand<unsigned>() % wk)) / 128;
2033 *best = Rml[i].pv[0];
2034 *ponder = Rml[i].pv[1];
2040 /// RootMove and RootMoveList method's definitions
2042 void RootMoveList::init(Position& pos, Move searchMoves[]) {
2045 bestMoveChanges = 0;
2048 // Generate all legal moves and add them to RootMoveList
2049 for (MoveList<MV_LEGAL> ml(pos); !ml.end(); ++ml)
2051 // If we have a searchMoves[] list then verify the move
2052 // is in the list before to add it.
2053 for (sm = searchMoves; *sm && *sm != ml.move(); sm++) {}
2055 if (sm != searchMoves && *sm != ml.move())
2059 rm.pv.push_back(ml.move());
2060 rm.pv.push_back(MOVE_NONE);
2061 rm.score = rm.prevScore = -VALUE_INFINITE;
2067 RootMove* RootMoveList::find(const Move& m, int startIndex) {
2069 for (size_t i = startIndex; i < size(); i++)
2070 if ((*this)[i].pv[0] == m)
2076 // extract_pv_from_tt() builds a PV by adding moves from the transposition table.
2077 // We consider also failing high nodes and not only VALUE_TYPE_EXACT nodes. This
2078 // allow to always have a ponder move even when we fail high at root and also a
2079 // long PV to print that is important for position analysis.
2081 void RootMove::extract_pv_from_tt(Position& pos) {
2083 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2088 assert(m != MOVE_NONE && pos.move_is_pl(m));
2092 pos.do_move(m, *st++);
2094 while ( (tte = TT.probe(pos.get_key())) != NULL
2095 && tte->move() != MOVE_NONE
2096 && pos.move_is_pl(tte->move())
2097 && pos.pl_move_is_legal(tte->move(), pos.pinned_pieces())
2099 && (!pos.is_draw<false>() || ply < 2))
2101 pv.push_back(tte->move());
2102 pos.do_move(tte->move(), *st++);
2105 pv.push_back(MOVE_NONE);
2107 do pos.undo_move(pv[--ply]); while (ply);
2110 // insert_pv_in_tt() is called at the end of a search iteration, and inserts
2111 // the PV back into the TT. This makes sure the old PV moves are searched
2112 // first, even if the old TT entries have been overwritten.
2114 void RootMove::insert_pv_in_tt(Position& pos) {
2116 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2119 Value v, m = VALUE_NONE;
2122 assert(pv[0] != MOVE_NONE && pos.move_is_pl(pv[0]));
2128 // Don't overwrite existing correct entries
2129 if (!tte || tte->move() != pv[ply])
2131 v = (pos.in_check() ? VALUE_NONE : evaluate(pos, m));
2132 TT.store(k, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, pv[ply], v, m);
2134 pos.do_move(pv[ply], *st++);
2136 } while (pv[++ply] != MOVE_NONE);
2138 do pos.undo_move(pv[--ply]); while (ply);
2143 // ThreadsManager::idle_loop() is where the threads are parked when they have no work
2144 // to do. The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint
2145 // object for which the current thread is the master.
2147 void ThreadsManager::idle_loop(int threadID, SplitPoint* sp) {
2149 assert(threadID >= 0 && threadID < MAX_THREADS);
2156 // Slave threads can exit as soon as AllThreadsShouldExit raises,
2157 // master should exit as last one.
2158 if (allThreadsShouldExit)
2161 threads[threadID].state = Thread::TERMINATED;
2165 // If we are not thinking, wait for a condition to be signaled
2166 // instead of wasting CPU time polling for work.
2167 while ( threadID >= activeThreads
2168 || threads[threadID].state == Thread::INITIALIZING
2169 || (useSleepingThreads && threads[threadID].state == Thread::AVAILABLE))
2171 assert(!sp || useSleepingThreads);
2172 assert(threadID != 0 || useSleepingThreads);
2174 if (threads[threadID].state == Thread::INITIALIZING)
2175 threads[threadID].state = Thread::AVAILABLE;
2177 // Grab the lock to avoid races with Thread::wake_up()
2178 lock_grab(&threads[threadID].sleepLock);
2180 // If we are master and all slaves have finished do not go to sleep
2181 for (i = 0; sp && i < activeThreads && !sp->is_slave[i]; i++) {}
2182 allFinished = (i == activeThreads);
2184 if (allFinished || allThreadsShouldExit)
2186 lock_release(&threads[threadID].sleepLock);
2190 // Do sleep here after retesting sleep conditions
2191 if (threadID >= activeThreads || threads[threadID].state == Thread::AVAILABLE)
2192 cond_wait(&threads[threadID].sleepCond, &threads[threadID].sleepLock);
2194 lock_release(&threads[threadID].sleepLock);
2197 // If this thread has been assigned work, launch a search
2198 if (threads[threadID].state == Thread::WORKISWAITING)
2200 assert(!allThreadsShouldExit);
2202 threads[threadID].state = Thread::SEARCHING;
2204 // Copy split point position and search stack and call search()
2205 // with SplitPoint template parameter set to true.
2206 SearchStack ss[PLY_MAX_PLUS_2];
2207 SplitPoint* tsp = threads[threadID].splitPoint;
2208 Position pos(*tsp->pos, threadID);
2210 memcpy(ss, tsp->ss - 1, 4 * sizeof(SearchStack));
2214 search<SplitPointPV>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2216 search<SplitPointNonPV>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth);
2218 assert(threads[threadID].state == Thread::SEARCHING);
2220 threads[threadID].state = Thread::AVAILABLE;
2222 // Wake up master thread so to allow it to return from the idle loop in
2223 // case we are the last slave of the split point.
2224 if ( useSleepingThreads
2225 && threadID != tsp->master
2226 && threads[tsp->master].state == Thread::AVAILABLE)
2227 threads[tsp->master].wake_up();
2230 // If this thread is the master of a split point and all slaves have
2231 // finished their work at this split point, return from the idle loop.
2232 for (i = 0; sp && i < activeThreads && !sp->is_slave[i]; i++) {}
2233 allFinished = (i == activeThreads);
2237 // Because sp->slaves[] is reset under lock protection,
2238 // be sure sp->lock has been released before to return.
2239 lock_grab(&(sp->lock));
2240 lock_release(&(sp->lock));
2242 // In helpful master concept a master can help only a sub-tree, and
2243 // because here is all finished is not possible master is booked.
2244 assert(threads[threadID].state == Thread::AVAILABLE);
2246 threads[threadID].state = Thread::SEARCHING;