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/>.
45 #include "ucioption.h"
51 //// Local definitions
57 enum NodeType { NonPV, PV };
59 // Set to true to force running with one thread.
60 // Used for debugging SMP code.
61 const bool FakeSplit = false;
63 // Fast lookup table of sliding pieces indexed by Piece
64 const bool Slidings[18] = { 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1 };
65 inline bool piece_is_slider(Piece p) { return Slidings[p]; }
67 // ThreadsManager class is used to handle all the threads related stuff in search,
68 // init, starting, parking and, the most important, launching a slave thread at a
69 // split point are what this class does. All the access to shared thread data is
70 // done through this class, so that we avoid using global variables instead.
72 class ThreadsManager {
73 /* As long as the single ThreadsManager object is defined as a global we don't
74 need to explicitly initialize to zero its data members because variables with
75 static storage duration are automatically set to zero before enter main()
81 int min_split_depth() const { return minimumSplitDepth; }
82 int active_threads() const { return activeThreads; }
83 void set_active_threads(int cnt) { activeThreads = cnt; }
85 void read_uci_options();
86 bool available_thread_exists(int master) const;
87 bool thread_is_available(int slave, int master) const;
88 bool cutoff_at_splitpoint(int threadID) const;
89 void wake_sleeping_thread(int threadID);
90 void idle_loop(int threadID, SplitPoint* sp);
93 void split(Position& pos, SearchStack* ss, int ply, Value* alpha, const Value beta, Value* bestValue,
94 Depth depth, Move threatMove, bool mateThreat, int moveCount, MovePicker* mp, bool pvNode);
97 Depth minimumSplitDepth;
98 int maxThreadsPerSplitPoint;
99 bool useSleepingThreads;
101 volatile bool allThreadsShouldExit;
102 Thread threads[MAX_THREADS];
103 Lock mpLock, sleepLock[MAX_THREADS];
104 WaitCondition sleepCond[MAX_THREADS];
108 // RootMove struct is used for moves at the root at the tree. For each root
109 // move, we store two scores, a node count, and a PV (really a refutation
110 // in the case of moves which fail low). Value pv_score is normally set at
111 // -VALUE_INFINITE for all non-pv moves, while non_pv_score is computed
112 // according to the order in which moves are returned by MovePicker.
117 RootMove(const RootMove& rm) { *this = rm; }
118 RootMove& operator=(const RootMove& rm);
120 // RootMove::operator<() is the comparison function used when
121 // sorting the moves. A move m1 is considered to be better
122 // than a move m2 if it has an higher pv_score, or if it has
123 // equal pv_score but m1 has the higher non_pv_score. In this
124 // way we are guaranteed that PV moves are always sorted as first.
125 bool operator<(const RootMove& m) const {
126 return pv_score != m.pv_score ? pv_score < m.pv_score
127 : non_pv_score < m.non_pv_score;
130 void extract_pv_from_tt(Position& pos);
131 void insert_pv_in_tt(Position& pos);
132 std::string pv_info_to_uci(Position& pos, int depth, Value alpha, Value beta, int pvLine);
137 Move pv[PLY_MAX_PLUS_2];
141 // RootMoveList struct is essentially a std::vector<> of RootMove objects,
142 // with an handful of methods above the standard ones.
144 struct RootMoveList : public std::vector<RootMove> {
146 typedef std::vector<RootMove> Base;
148 void init(Position& pos, Move searchMoves[]);
149 void sort() { insertion_sort<RootMove, Base::iterator>(begin(), end()); }
150 void sort_multipv(int n) { insertion_sort<RootMove, Base::iterator>(begin(), begin() + n); }
156 // When formatting a move for std::cout we must know if we are in Chess960
157 // or not. To keep using the handy operator<<() on the move the trick is to
158 // embed this flag in the stream itself. Function-like named enum set960 is
159 // used as a custom manipulator and the stream internal general-purpose array,
160 // accessed through ios_base::iword(), is used to pass the flag to the move's
161 // operator<<() that will use it to properly format castling moves.
164 std::ostream& operator<< (std::ostream& os, const set960& f) {
166 os.iword(0) = int(f);
171 // Overload operator << for moves to make it easier to print moves in
172 // coordinate notation compatible with UCI protocol.
173 std::ostream& operator<<(std::ostream& os, Move m) {
175 bool chess960 = (os.iword(0) != 0); // See set960()
176 return os << move_to_uci(m, chess960);
184 // Maximum depth for razoring
185 const Depth RazorDepth = 4 * ONE_PLY;
187 // Dynamic razoring margin based on depth
188 inline Value razor_margin(Depth d) { return Value(0x200 + 0x10 * int(d)); }
190 // Maximum depth for use of dynamic threat detection when null move fails low
191 const Depth ThreatDepth = 5 * ONE_PLY;
193 // Step 9. Internal iterative deepening
195 // Minimum depth for use of internal iterative deepening
196 const Depth IIDDepth[2] = { 8 * ONE_PLY /* non-PV */, 5 * ONE_PLY /* PV */};
198 // At Non-PV nodes we do an internal iterative deepening search
199 // when the static evaluation is bigger then beta - IIDMargin.
200 const Value IIDMargin = Value(0x100);
202 // Step 11. Decide the new search depth
204 // Extensions. Configurable UCI options
205 // Array index 0 is used at non-PV nodes, index 1 at PV nodes.
206 Depth CheckExtension[2], PawnPushTo7thExtension[2], PassedPawnExtension[2];
207 Depth PawnEndgameExtension[2], MateThreatExtension[2];
209 // Minimum depth for use of singular extension
210 const Depth SingularExtensionDepth[2] = { 8 * ONE_PLY /* non-PV */, 6 * ONE_PLY /* PV */};
212 // Step 12. Futility pruning
214 // Futility margin for quiescence search
215 const Value FutilityMarginQS = Value(0x80);
217 // Futility lookup tables (initialized at startup) and their getter functions
218 Value FutilityMarginsMatrix[16][64]; // [depth][moveNumber]
219 int FutilityMoveCountArray[32]; // [depth]
221 inline Value futility_margin(Depth d, int mn) { return d < 7 * ONE_PLY ? FutilityMarginsMatrix[Max(d, 1)][Min(mn, 63)] : 2 * VALUE_INFINITE; }
222 inline int futility_move_count(Depth d) { return d < 16 * ONE_PLY ? FutilityMoveCountArray[d] : 512; }
224 // Step 14. Reduced search
226 // Reduction lookup tables (initialized at startup) and their getter functions
227 int8_t ReductionMatrix[2][64][64]; // [pv][depth][moveNumber]
229 template <NodeType PV>
230 inline Depth reduction(Depth d, int mn) { return (Depth) ReductionMatrix[PV][Min(d / 2, 63)][Min(mn, 63)]; }
232 // Easy move margin. An easy move candidate must be at least this much
233 // better than the second best move.
234 const Value EasyMoveMargin = Value(0x200);
237 /// Namespace variables
246 int MultiPV, UCIMultiPV;
248 // Time management variables
249 int SearchStartTime, MaxNodes, MaxDepth, ExactMaxTime;
250 bool UseTimeManagement, InfiniteSearch, Pondering, StopOnPonderhit;
251 bool FirstRootMove, StopRequest, QuitRequest, AspirationFailLow;
256 std::ofstream LogFile;
258 // Skill level adjustment
262 // Multi-threads manager object
263 ThreadsManager ThreadsMgr;
265 // Node counters, used only by thread[0] but try to keep in different cache
266 // lines (64 bytes each) from the heavy multi-thread read accessed variables.
267 bool SendSearchedNodes;
269 int NodesBetweenPolls = 30000;
276 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove);
278 template <NodeType PvNode, bool SpNode, bool Root>
279 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply);
281 template <NodeType PvNode>
282 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply);
284 template <NodeType PvNode>
285 inline Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply) {
287 return depth < ONE_PLY ? qsearch<PvNode>(pos, ss, alpha, beta, DEPTH_ZERO, ply)
288 : search<PvNode, false, false>(pos, ss, alpha, beta, depth, ply);
291 template <NodeType PvNode>
292 Depth extension(const Position& pos, Move m, bool captureOrPromotion, bool moveIsCheck, bool mateThreat, bool* dangerous);
294 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bValue);
295 bool connected_moves(const Position& pos, Move m1, Move m2);
296 Value value_to_tt(Value v, int ply);
297 Value value_from_tt(Value v, int ply);
298 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply);
299 bool connected_threat(const Position& pos, Move m, Move threat);
300 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply);
301 void update_history(const Position& pos, Move move, Depth depth, Move movesSearched[], int moveCount);
302 void update_gains(const Position& pos, Move move, Value before, Value after);
304 int current_search_time();
305 std::string value_to_uci(Value v);
306 std::string speed_to_uci(int64_t nodes);
307 void poll(const Position& pos);
308 void wait_for_stop_or_ponderhit();
310 #if !defined(_MSC_VER)
311 void* init_thread(void* threadID);
313 DWORD WINAPI init_thread(LPVOID threadID);
317 // MovePickerExt is an extended MovePicker used to choose at compile time
318 // the proper move source according to the type of node.
319 template<bool SpNode, bool Root> struct MovePickerExt;
321 // In Root nodes use RootMoveList Rml as source. Score and sort the root moves
322 // before to search them.
323 template<> struct MovePickerExt<false, true> : public MovePicker {
325 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h, SearchStack* ss, Value b)
326 : MovePicker(p, ttm, d, h, ss, b), firstCall(true) {
328 Value score = VALUE_ZERO;
330 // Score root moves using the standard way used in main search, the moves
331 // are scored according to the order in which they are returned by MovePicker.
332 // This is the second order score that is used to compare the moves when
333 // the first order pv scores of both moves are equal.
334 while ((move = MovePicker::get_next_move()) != MOVE_NONE)
335 for (rm = Rml.begin(); rm != Rml.end(); ++rm)
336 if (rm->pv[0] == move)
338 rm->non_pv_score = score--;
346 Move get_next_move() {
353 return rm != Rml.end() ? rm->pv[0] : MOVE_NONE;
356 RootMoveList::iterator rm;
360 // In SpNodes use split point's shared MovePicker object as move source
361 template<> struct MovePickerExt<true, false> : public MovePicker {
363 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h,
364 SearchStack* ss, Value b) : MovePicker(p, ttm, d, h, ss, b),
367 Move get_next_move() { return mp->get_next_move(); }
369 RootMoveList::iterator rm; // Dummy, needed to compile
373 // Default case, create and use a MovePicker object as source
374 template<> struct MovePickerExt<false, false> : public MovePicker {
376 MovePickerExt(const Position& p, Move ttm, Depth d, const History& h,
377 SearchStack* ss, Value b) : MovePicker(p, ttm, d, h, ss, b) {}
379 RootMoveList::iterator rm; // Dummy, needed to compile
389 /// init_threads(), exit_threads() and nodes_searched() are helpers to
390 /// give accessibility to some TM methods from outside of current file.
392 void init_threads() { ThreadsMgr.init_threads(); }
393 void exit_threads() { ThreadsMgr.exit_threads(); }
396 /// init_search() is called during startup. It initializes various lookup tables
400 int d; // depth (ONE_PLY == 2)
401 int hd; // half depth (ONE_PLY == 1)
404 // Init reductions array
405 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
407 double pvRed = log(double(hd)) * log(double(mc)) / 3.0;
408 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
409 ReductionMatrix[PV][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
410 ReductionMatrix[NonPV][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
413 // Init futility margins array
414 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
415 FutilityMarginsMatrix[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
417 // Init futility move count array
418 for (d = 0; d < 32; d++)
419 FutilityMoveCountArray[d] = int(3.001 + 0.25 * pow(d, 2.0));
423 /// perft() is our utility to verify move generation is bug free. All the legal
424 /// moves up to given depth are generated and counted and the sum returned.
426 int64_t perft(Position& pos, Depth depth)
428 MoveStack mlist[MOVES_MAX];
433 // Generate all legal moves
434 MoveStack* last = generate<MV_LEGAL>(pos, mlist);
436 // If we are at the last ply we don't need to do and undo
437 // the moves, just to count them.
438 if (depth <= ONE_PLY)
439 return int(last - mlist);
441 // Loop through all legal moves
443 for (MoveStack* cur = mlist; cur != last; cur++)
446 pos.do_move(m, st, ci, pos.move_is_check(m, ci));
447 sum += perft(pos, depth - ONE_PLY);
454 /// think() is the external interface to Stockfish's search, and is called when
455 /// the program receives the UCI 'go' command. It initializes various
456 /// search-related global variables, and calls id_loop(). It returns false
457 /// when a quit command is received during the search.
459 bool think(Position& pos, bool infinite, bool ponder, int time[], int increment[],
460 int movesToGo, int maxDepth, int maxNodes, int maxTime, Move searchMoves[]) {
462 // Initialize global search variables
463 StopOnPonderhit = StopRequest = QuitRequest = AspirationFailLow = SendSearchedNodes = false;
465 SearchStartTime = get_system_time();
466 ExactMaxTime = maxTime;
469 InfiniteSearch = infinite;
471 UseTimeManagement = !ExactMaxTime && !MaxDepth && !MaxNodes && !InfiniteSearch;
473 // Look for a book move, only during games, not tests
474 if (UseTimeManagement && Options["OwnBook"].value<bool>())
476 if (Options["Book File"].value<std::string>() != OpeningBook.name())
477 OpeningBook.open(Options["Book File"].value<std::string>());
479 Move bookMove = OpeningBook.get_move(pos, Options["Best Book Move"].value<bool>());
480 if (bookMove != MOVE_NONE)
483 wait_for_stop_or_ponderhit();
485 cout << "bestmove " << bookMove << endl;
490 // Read UCI option values
491 TT.set_size(Options["Hash"].value<int>());
492 if (Options["Clear Hash"].value<bool>())
494 Options["Clear Hash"].set_value("false");
498 CheckExtension[1] = Options["Check Extension (PV nodes)"].value<Depth>();
499 CheckExtension[0] = Options["Check Extension (non-PV nodes)"].value<Depth>();
500 PawnPushTo7thExtension[1] = Options["Pawn Push to 7th Extension (PV nodes)"].value<Depth>();
501 PawnPushTo7thExtension[0] = Options["Pawn Push to 7th Extension (non-PV nodes)"].value<Depth>();
502 PassedPawnExtension[1] = Options["Passed Pawn Extension (PV nodes)"].value<Depth>();
503 PassedPawnExtension[0] = Options["Passed Pawn Extension (non-PV nodes)"].value<Depth>();
504 PawnEndgameExtension[1] = Options["Pawn Endgame Extension (PV nodes)"].value<Depth>();
505 PawnEndgameExtension[0] = Options["Pawn Endgame Extension (non-PV nodes)"].value<Depth>();
506 MateThreatExtension[1] = Options["Mate Threat Extension (PV nodes)"].value<Depth>();
507 MateThreatExtension[0] = Options["Mate Threat Extension (non-PV nodes)"].value<Depth>();
508 UCIMultiPV = Options["MultiPV"].value<int>();
509 SkillLevel = Options["Skill level"].value<int>();
510 UseLogFile = Options["Use Search Log"].value<bool>();
512 read_evaluation_uci_options(pos.side_to_move());
514 // Do we have to play with skill handicap? In this case enable MultiPV that
515 // we will use behind the scenes to retrieve a set of possible moves.
516 MultiPV = (SkillLevel < 20 ? Max(UCIMultiPV, 4) : UCIMultiPV);
518 // Set the number of active threads
519 ThreadsMgr.read_uci_options();
520 init_eval(ThreadsMgr.active_threads());
522 // Wake up needed threads
523 for (int i = 1; i < ThreadsMgr.active_threads(); i++)
524 ThreadsMgr.wake_sleeping_thread(i);
527 int myTime = time[pos.side_to_move()];
528 int myIncrement = increment[pos.side_to_move()];
529 if (UseTimeManagement)
530 TimeMgr.init(myTime, myIncrement, movesToGo, pos.startpos_ply_counter());
532 // Set best NodesBetweenPolls interval to avoid lagging under
533 // heavy time pressure.
535 NodesBetweenPolls = Min(MaxNodes, 30000);
536 else if (myTime && myTime < 1000)
537 NodesBetweenPolls = 1000;
538 else if (myTime && myTime < 5000)
539 NodesBetweenPolls = 5000;
541 NodesBetweenPolls = 30000;
543 // Write search information to log file
546 std::string name = Options["Search Log Filename"].value<std::string>();
547 LogFile.open(name.c_str(), std::ios::out | std::ios::app);
549 LogFile << "\nSearching: " << pos.to_fen()
550 << "\ninfinite: " << infinite
551 << " ponder: " << ponder
552 << " time: " << myTime
553 << " increment: " << myIncrement
554 << " moves to go: " << movesToGo
558 // We're ready to start thinking. Call the iterative deepening loop function
559 Move ponderMove = MOVE_NONE;
560 Move bestMove = id_loop(pos, searchMoves, &ponderMove);
562 // Print final search statistics
563 cout << "info" << speed_to_uci(pos.nodes_searched()) << endl;
567 int t = current_search_time();
569 LogFile << "Nodes: " << pos.nodes_searched()
570 << "\nNodes/second: " << (t > 0 ? int(pos.nodes_searched() * 1000 / t) : 0)
571 << "\nBest move: " << move_to_san(pos, bestMove);
574 pos.do_move(bestMove, st);
575 LogFile << "\nPonder move: " << move_to_san(pos, ponderMove) << endl;
576 pos.undo_move(bestMove); // Return from think() with unchanged position
580 // This makes all the threads to go to sleep
581 ThreadsMgr.set_active_threads(1);
583 // If we are pondering or in infinite search, we shouldn't print the
584 // best move before we are told to do so.
585 if (!StopRequest && (Pondering || InfiniteSearch))
586 wait_for_stop_or_ponderhit();
588 // Could be MOVE_NONE when searching on a stalemate position
589 cout << "bestmove " << bestMove;
591 // UCI protol is not clear on allowing sending an empty ponder move, instead
592 // it is clear that ponder move is optional. So skip it if empty.
593 if (ponderMove != MOVE_NONE)
594 cout << " ponder " << ponderMove;
604 // id_loop() is the main iterative deepening loop. It calls search() repeatedly
605 // with increasing depth until the allocated thinking time has been consumed,
606 // user stops the search, or the maximum search depth is reached.
608 Move id_loop(Position& pos, Move searchMoves[], Move* ponderMove) {
610 SearchStack ss[PLY_MAX_PLUS_2];
611 Value bestValues[PLY_MAX_PLUS_2];
612 int bestMoveChanges[PLY_MAX_PLUS_2];
613 int depth, aspirationDelta;
614 Value value, alpha, beta;
615 Move bestMove, easyMove;
617 // Initialize stuff before a new search
618 memset(ss, 0, 4 * sizeof(SearchStack));
621 *ponderMove = bestMove = easyMove = MOVE_NONE;
622 depth = aspirationDelta = 0;
623 alpha = -VALUE_INFINITE, beta = VALUE_INFINITE;
624 ss->currentMove = MOVE_NULL; // Hack to skip update_gains()
626 // Moves to search are verified and copied
627 Rml.init(pos, searchMoves);
629 // Handle special case of searching on a mate/stalemate position
632 cout << "info depth 0 score "
633 << value_to_uci(pos.is_check() ? -VALUE_MATE : VALUE_DRAW)
639 // Iterative deepening loop
640 while (++depth <= PLY_MAX && (!MaxDepth || depth <= MaxDepth) && !StopRequest)
642 Rml.bestMoveChanges = 0;
643 cout << set960(pos.is_chess960()) << "info depth " << depth << endl;
645 // Calculate dynamic aspiration window based on previous iterations
646 if (MultiPV == 1 && depth >= 5 && abs(bestValues[depth - 1]) < VALUE_KNOWN_WIN)
648 int prevDelta1 = bestValues[depth - 1] - bestValues[depth - 2];
649 int prevDelta2 = bestValues[depth - 2] - bestValues[depth - 3];
651 aspirationDelta = Min(Max(abs(prevDelta1) + abs(prevDelta2) / 2, 16), 24);
652 aspirationDelta = (aspirationDelta + 7) / 8 * 8; // Round to match grainSize
654 alpha = Max(bestValues[depth - 1] - aspirationDelta, -VALUE_INFINITE);
655 beta = Min(bestValues[depth - 1] + aspirationDelta, VALUE_INFINITE);
658 // Start with a small aspiration window and, in case of fail high/low,
659 // research with bigger window until not failing high/low anymore.
661 // Search starting from ss+1 to allow calling update_gains()
662 value = search<PV, false, true>(pos, ss+1, alpha, beta, depth * ONE_PLY, 0);
664 // Write PV back to transposition table in case the relevant entries
665 // have been overwritten during the search.
666 for (int i = 0; i < Min(MultiPV, (int)Rml.size()); i++)
667 Rml[i].insert_pv_in_tt(pos);
669 // Value cannot be trusted. Break out immediately!
673 assert(value >= alpha);
675 // In case of failing high/low increase aspiration window and research,
676 // otherwise exit the fail high/low loop.
679 beta = Min(beta + aspirationDelta, VALUE_INFINITE);
680 aspirationDelta += aspirationDelta / 2;
682 else if (value <= alpha)
684 AspirationFailLow = true;
685 StopOnPonderhit = false;
687 alpha = Max(alpha - aspirationDelta, -VALUE_INFINITE);
688 aspirationDelta += aspirationDelta / 2;
693 } while (abs(value) < VALUE_KNOWN_WIN);
695 // Collect info about search result
696 bestMove = Rml[0].pv[0];
697 *ponderMove = Rml[0].pv[1];
698 bestValues[depth] = value;
699 bestMoveChanges[depth] = Rml.bestMoveChanges;
701 // Send PV line to GUI and to log file
702 for (int i = 0; i < Min(UCIMultiPV, (int)Rml.size()); i++)
703 cout << Rml[i].pv_info_to_uci(pos, depth, alpha, beta, i) << endl;
706 LogFile << pretty_pv(pos, depth, value, current_search_time(), Rml[0].pv) << endl;
708 // Init easyMove after first iteration or drop if differs from the best move
709 if (depth == 1 && (Rml.size() == 1 || Rml[0].pv_score > Rml[1].pv_score + EasyMoveMargin))
711 else if (bestMove != easyMove)
712 easyMove = MOVE_NONE;
714 if (UseTimeManagement && !StopRequest)
717 bool noMoreTime = false;
719 // Stop search early when the last two iterations returned a mate score
721 && abs(bestValues[depth]) >= abs(VALUE_MATE) - 100
722 && abs(bestValues[depth - 1]) >= abs(VALUE_MATE) - 100)
725 // Stop search early if one move seems to be much better than the
726 // others or if there is only a single legal move. In this latter
727 // case we search up to Iteration 8 anyway to get a proper score.
729 && easyMove == bestMove
731 ||( Rml[0].nodes > (pos.nodes_searched() * 85) / 100
732 && current_search_time() > TimeMgr.available_time() / 16)
733 ||( Rml[0].nodes > (pos.nodes_searched() * 98) / 100
734 && current_search_time() > TimeMgr.available_time() / 32)))
737 // Add some extra time if the best move has changed during the last two iterations
738 if (depth > 4 && depth < 50)
739 TimeMgr.pv_instability(bestMoveChanges[depth], bestMoveChanges[depth-1]);
741 // Stop search if most of MaxSearchTime is consumed at the end of the
742 // iteration. We probably don't have enough time to search the first
743 // move at the next iteration anyway.
744 if (current_search_time() > (TimeMgr.available_time() * 80) / 128)
750 StopOnPonderhit = true;
757 // When playing with strength handicap choose best move among the MultiPV set
758 // using a statistical rule dependent on SkillLevel. Idea by Heinz van Saanen.
763 // Rml list is already sorted by pv_score in descending order
765 int max_s = -VALUE_INFINITE;
766 int size = Min(MultiPV, (int)Rml.size());
767 int max = Rml[0].pv_score;
768 int var = Min(max - Rml[size - 1].pv_score, PawnValueMidgame);
769 int wk = 120 - 2 * SkillLevel;
771 // PRNG sequence should be non deterministic
772 for (int i = abs(get_system_time() % 50); i > 0; i--)
775 // Choose best move. For each move's score we add two terms both dependent
776 // on wk, one deterministic and bigger for weaker moves, and one random,
777 // then we choose the move with the resulting highest score.
778 for (int i = 0; i < size; i++)
782 // Don't allow crazy blunders even at very low skills
783 if (i > 0 && Rml[i-1].pv_score > s + EasyMoveMargin)
786 // This is our magical formula
787 s += ((max - s) * wk + var * (RK.rand<unsigned>() % wk)) / 128;
792 bestMove = Rml[i].pv[0];
793 *ponderMove = Rml[i].pv[1];
802 // search<>() is the main search function for both PV and non-PV nodes and for
803 // normal and SplitPoint nodes. When called just after a split point the search
804 // is simpler because we have already probed the hash table, done a null move
805 // search, and searched the first move before splitting, we don't have to repeat
806 // all this work again. We also don't need to store anything to the hash table
807 // here: This is taken care of after we return from the split point.
809 template <NodeType PvNode, bool SpNode, bool Root>
810 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply) {
812 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
813 assert(beta > alpha && beta <= VALUE_INFINITE);
814 assert(PvNode || alpha == beta - 1);
815 assert((Root || ply > 0) && ply < PLY_MAX);
816 assert(pos.thread() >= 0 && pos.thread() < ThreadsMgr.active_threads());
818 Move movesSearched[MOVES_MAX];
823 Move ttMove, move, excludedMove, threatMove;
826 Value bestValue, value, oldAlpha;
827 Value refinedValue, nullValue, futilityBase, futilityValueScaled; // Non-PV specific
828 bool isPvMove, isCheck, singularExtensionNode, moveIsCheck, captureOrPromotion, dangerous, isBadCap;
829 bool mateThreat = false;
830 int moveCount = 0, playedMoveCount = 0;
831 int threadID = pos.thread();
832 SplitPoint* sp = NULL;
834 refinedValue = bestValue = value = -VALUE_INFINITE;
836 isCheck = pos.is_check();
842 ttMove = excludedMove = MOVE_NONE;
843 threatMove = sp->threatMove;
844 mateThreat = sp->mateThreat;
845 goto split_point_start;
850 // Step 1. Initialize node and poll. Polling can abort search
851 ss->currentMove = ss->bestMove = threatMove = (ss+1)->excludedMove = MOVE_NONE;
852 (ss+1)->skipNullMove = false; (ss+1)->reduction = DEPTH_ZERO;
853 (ss+2)->killers[0] = (ss+2)->killers[1] = (ss+2)->mateKiller = MOVE_NONE;
855 if (threadID == 0 && ++NodesSincePoll > NodesBetweenPolls)
861 // Step 2. Check for aborted search and immediate draw
863 || ThreadsMgr.cutoff_at_splitpoint(threadID)
865 || ply >= PLY_MAX - 1) && !Root)
868 // Step 3. Mate distance pruning
869 alpha = Max(value_mated_in(ply), alpha);
870 beta = Min(value_mate_in(ply+1), beta);
874 // Step 4. Transposition table lookup
875 // We don't want the score of a partial search to overwrite a previous full search
876 // TT value, so we use a different position key in case of an excluded move.
877 excludedMove = ss->excludedMove;
878 posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
880 tte = TT.retrieve(posKey);
881 ttMove = tte ? tte->move() : MOVE_NONE;
883 // At PV nodes we check for exact scores, while at non-PV nodes we check for
884 // and return a fail high/low. Biggest advantage at probing at PV nodes is
885 // to have a smooth experience in analysis mode.
888 && (PvNode ? tte->depth() >= depth && tte->type() == VALUE_TYPE_EXACT
889 : ok_to_use_TT(tte, depth, beta, ply)))
892 ss->bestMove = ttMove; // Can be MOVE_NONE
893 return value_from_tt(tte->value(), ply);
896 // Step 5. Evaluate the position statically and
897 // update gain statistics of parent move.
899 ss->eval = ss->evalMargin = VALUE_NONE;
902 assert(tte->static_value() != VALUE_NONE);
904 ss->eval = tte->static_value();
905 ss->evalMargin = tte->static_value_margin();
906 refinedValue = refine_eval(tte, ss->eval, ply);
910 refinedValue = ss->eval = evaluate(pos, ss->evalMargin);
911 TT.store(posKey, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, MOVE_NONE, ss->eval, ss->evalMargin);
914 // Save gain for the parent non-capture move
915 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
917 // Step 6. Razoring (is omitted in PV nodes)
919 && depth < RazorDepth
921 && refinedValue < beta - razor_margin(depth)
922 && ttMove == MOVE_NONE
923 && abs(beta) < VALUE_MATE_IN_PLY_MAX
924 && !pos.has_pawn_on_7th(pos.side_to_move()))
926 Value rbeta = beta - razor_margin(depth);
927 Value v = qsearch<NonPV>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO, ply);
929 // Logically we should return (v + razor_margin(depth)), but
930 // surprisingly this did slightly weaker in tests.
934 // Step 7. Static null move pruning (is omitted in PV nodes)
935 // We're betting that the opponent doesn't have a move that will reduce
936 // the score by more than futility_margin(depth) if we do a null move.
939 && depth < RazorDepth
941 && refinedValue >= beta + futility_margin(depth, 0)
942 && abs(beta) < VALUE_MATE_IN_PLY_MAX
943 && pos.non_pawn_material(pos.side_to_move()))
944 return refinedValue - futility_margin(depth, 0);
946 // Step 8. Null move search with verification search (is omitted in PV nodes)
951 && refinedValue >= beta
952 && abs(beta) < VALUE_MATE_IN_PLY_MAX
953 && pos.non_pawn_material(pos.side_to_move()))
955 ss->currentMove = MOVE_NULL;
957 // Null move dynamic reduction based on depth
958 int R = 3 + (depth >= 5 * ONE_PLY ? depth / 8 : 0);
960 // Null move dynamic reduction based on value
961 if (refinedValue - beta > PawnValueMidgame)
964 pos.do_null_move(st);
965 (ss+1)->skipNullMove = true;
966 nullValue = -search<NonPV>(pos, ss+1, -beta, -alpha, depth-R*ONE_PLY, ply+1);
967 (ss+1)->skipNullMove = false;
968 pos.undo_null_move();
970 if (nullValue >= beta)
972 // Do not return unproven mate scores
973 if (nullValue >= VALUE_MATE_IN_PLY_MAX)
976 if (depth < 6 * ONE_PLY)
979 // Do verification search at high depths
980 ss->skipNullMove = true;
981 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R*ONE_PLY, ply);
982 ss->skipNullMove = false;
989 // The null move failed low, which means that we may be faced with
990 // some kind of threat. If the previous move was reduced, check if
991 // the move that refuted the null move was somehow connected to the
992 // move which was reduced. If a connection is found, return a fail
993 // low score (which will cause the reduced move to fail high in the
994 // parent node, which will trigger a re-search with full depth).
995 if (nullValue == value_mated_in(ply + 2))
998 threatMove = (ss+1)->bestMove;
999 if ( depth < ThreatDepth
1000 && (ss-1)->reduction
1001 && threatMove != MOVE_NONE
1002 && connected_moves(pos, (ss-1)->currentMove, threatMove))
1007 // Step 9. Internal iterative deepening
1008 if ( depth >= IIDDepth[PvNode]
1009 && ttMove == MOVE_NONE
1010 && (PvNode || (!isCheck && ss->eval >= beta - IIDMargin)))
1012 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
1014 ss->skipNullMove = true;
1015 search<PvNode>(pos, ss, alpha, beta, d, ply);
1016 ss->skipNullMove = false;
1018 ttMove = ss->bestMove;
1019 tte = TT.retrieve(posKey);
1022 // Expensive mate threat detection (only for PV nodes)
1024 mateThreat = pos.has_mate_threat();
1026 split_point_start: // At split points actual search starts from here
1028 // Initialize a MovePicker object for the current position
1029 MovePickerExt<SpNode, Root> mp(pos, ttMove, depth, H, ss, (PvNode ? -VALUE_INFINITE : beta));
1031 ss->bestMove = MOVE_NONE;
1032 futilityBase = ss->eval + ss->evalMargin;
1033 singularExtensionNode = !Root
1035 && depth >= SingularExtensionDepth[PvNode]
1038 && !excludedMove // Do not allow recursive singular extension search
1039 && (tte->type() & VALUE_TYPE_LOWER)
1040 && tte->depth() >= depth - 3 * ONE_PLY;
1043 lock_grab(&(sp->lock));
1044 bestValue = sp->bestValue;
1047 // Step 10. Loop through moves
1048 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1049 while ( bestValue < beta
1050 && (move = mp.get_next_move()) != MOVE_NONE
1051 && !ThreadsMgr.cutoff_at_splitpoint(threadID))
1053 assert(move_is_ok(move));
1057 moveCount = ++sp->moveCount;
1058 lock_release(&(sp->lock));
1060 else if (move == excludedMove)
1067 // This is used by time management
1068 FirstRootMove = (moveCount == 1);
1070 // Save the current node count before the move is searched
1071 nodes = pos.nodes_searched();
1073 // If it's time to send nodes info, do it here where we have the
1074 // correct accumulated node counts searched by each thread.
1075 if (SendSearchedNodes)
1077 SendSearchedNodes = false;
1078 cout << "info" << speed_to_uci(pos.nodes_searched()) << endl;
1081 if (current_search_time() >= 1000)
1082 cout << "info currmove " << move
1083 << " currmovenumber " << moveCount << endl;
1086 // At Root and at first iteration do a PV search on all the moves
1087 // to score root moves. Otherwise only the first one is the PV.
1088 isPvMove = (PvNode && moveCount <= (Root ? MultiPV + 1000 * (depth <= ONE_PLY) : 1));
1089 moveIsCheck = pos.move_is_check(move, ci);
1090 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1092 // Step 11. Decide the new search depth
1093 ext = extension<PvNode>(pos, move, captureOrPromotion, moveIsCheck, mateThreat, &dangerous);
1095 // Singular extension search. If all moves but one fail low on a search of (alpha-s, beta-s),
1096 // and just one fails high on (alpha, beta), then that move is singular and should be extended.
1097 // To verify this we do a reduced search on all the other moves but the ttMove, if result is
1098 // lower than ttValue minus a margin then we extend ttMove.
1099 if ( singularExtensionNode
1100 && move == tte->move()
1103 Value ttValue = value_from_tt(tte->value(), ply);
1105 if (abs(ttValue) < VALUE_KNOWN_WIN)
1107 Value b = ttValue - int(depth);
1108 ss->excludedMove = move;
1109 ss->skipNullMove = true;
1110 Value v = search<NonPV>(pos, ss, b - 1, b, depth / 2, ply);
1111 ss->skipNullMove = false;
1112 ss->excludedMove = MOVE_NONE;
1113 ss->bestMove = MOVE_NONE;
1119 // Update current move (this must be done after singular extension search)
1120 ss->currentMove = move;
1121 newDepth = depth - ONE_PLY + ext;
1123 // Step 12. Futility pruning (is omitted in PV nodes)
1125 && !captureOrPromotion
1129 && !move_is_castle(move))
1131 // Move count based pruning
1132 if ( moveCount >= futility_move_count(depth)
1133 && !(threatMove && connected_threat(pos, move, threatMove))
1134 && bestValue > VALUE_MATED_IN_PLY_MAX) // FIXME bestValue is racy
1137 lock_grab(&(sp->lock));
1142 // Value based pruning
1143 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
1144 // but fixing this made program slightly weaker.
1145 Depth predictedDepth = newDepth - reduction<NonPV>(depth, moveCount);
1146 futilityValueScaled = futilityBase + futility_margin(predictedDepth, moveCount)
1147 + H.gain(pos.piece_on(move_from(move)), move_to(move));
1149 if (futilityValueScaled < beta)
1153 lock_grab(&(sp->lock));
1154 if (futilityValueScaled > sp->bestValue)
1155 sp->bestValue = bestValue = futilityValueScaled;
1157 else if (futilityValueScaled > bestValue)
1158 bestValue = futilityValueScaled;
1163 // Prune moves with negative SEE at low depths
1164 if ( predictedDepth < 2 * ONE_PLY
1165 && bestValue > VALUE_MATED_IN_PLY_MAX
1166 && pos.see_sign(move) < 0)
1169 lock_grab(&(sp->lock));
1175 // Bad capture detection. Will be used by prob-cut search
1176 isBadCap = depth >= 3 * ONE_PLY
1177 && depth < 8 * ONE_PLY
1178 && captureOrPromotion
1181 && !move_is_promotion(move)
1182 && abs(alpha) < VALUE_MATE_IN_PLY_MAX
1183 && pos.see_sign(move) < 0;
1185 // Step 13. Make the move
1186 pos.do_move(move, st, ci, moveIsCheck);
1188 if (!SpNode && !captureOrPromotion)
1189 movesSearched[playedMoveCount++] = move;
1191 // Step extra. pv search (only in PV nodes)
1192 // The first move in list is the expected PV
1195 // Aspiration window is disabled in multi-pv case
1196 if (Root && MultiPV > 1)
1197 alpha = -VALUE_INFINITE;
1199 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, ply+1);
1203 // Step 14. Reduced depth search
1204 // If the move fails high will be re-searched at full depth.
1205 bool doFullDepthSearch = true;
1206 alpha = SpNode ? sp->alpha : alpha;
1208 if ( depth >= 3 * ONE_PLY
1209 && !captureOrPromotion
1211 && !move_is_castle(move)
1212 && ss->killers[0] != move
1213 && ss->killers[1] != move)
1215 ss->reduction = reduction<PvNode>(depth, moveCount);
1218 alpha = SpNode ? sp->alpha : alpha;
1219 Depth d = newDepth - ss->reduction;
1220 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, ply+1);
1222 doFullDepthSearch = (value > alpha);
1224 ss->reduction = DEPTH_ZERO; // Restore original reduction
1227 // Probcut search for bad captures. If a reduced search returns a value
1228 // very below beta then we can (almost) safely prune the bad capture.
1231 ss->reduction = 3 * ONE_PLY;
1232 Value redAlpha = alpha - 300;
1233 Depth d = newDepth - ss->reduction;
1234 value = -search<NonPV>(pos, ss+1, -(redAlpha+1), -redAlpha, d, ply+1);
1235 doFullDepthSearch = (value > redAlpha);
1236 ss->reduction = DEPTH_ZERO; // Restore original reduction
1239 // Step 15. Full depth search
1240 if (doFullDepthSearch)
1242 alpha = SpNode ? sp->alpha : alpha;
1243 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, ply+1);
1245 // Step extra. pv search (only in PV nodes)
1246 // Search only for possible new PV nodes, if instead value >= beta then
1247 // parent node fails low with value <= alpha and tries another move.
1248 if (PvNode && value > alpha && (Root || value < beta))
1249 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, ply+1);
1253 // Step 16. Undo move
1254 pos.undo_move(move);
1256 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1258 // Step 17. Check for new best move
1261 lock_grab(&(sp->lock));
1262 bestValue = sp->bestValue;
1266 if (value > bestValue && !(SpNode && ThreadsMgr.cutoff_at_splitpoint(threadID)))
1271 sp->bestValue = value;
1273 if (!Root && value > alpha)
1275 if (PvNode && value < beta) // We want always alpha < beta
1283 sp->betaCutoff = true;
1285 if (value == value_mate_in(ply + 1))
1286 ss->mateKiller = move;
1288 ss->bestMove = move;
1291 sp->ss->bestMove = move;
1297 // Finished searching the move. If StopRequest is true, the search
1298 // was aborted because the user interrupted the search or because we
1299 // ran out of time. In this case, the return value of the search cannot
1300 // be trusted, and we break out of the loop without updating the best
1305 // Remember searched nodes counts for this move
1306 mp.rm->nodes += pos.nodes_searched() - nodes;
1308 // PV move or new best move ?
1309 if (isPvMove || value > alpha)
1312 ss->bestMove = move;
1313 mp.rm->pv_score = value;
1314 mp.rm->extract_pv_from_tt(pos);
1316 // We record how often the best move has been changed in each
1317 // iteration. This information is used for time management: When
1318 // the best move changes frequently, we allocate some more time.
1319 if (!isPvMove && MultiPV == 1)
1320 Rml.bestMoveChanges++;
1322 Rml.sort_multipv(moveCount);
1324 // Update alpha. In multi-pv we don't use aspiration window, so
1325 // set alpha equal to minimum score among the PV lines.
1327 alpha = Rml[Min(moveCount, MultiPV) - 1].pv_score; // FIXME why moveCount?
1328 else if (value > alpha)
1332 mp.rm->pv_score = -VALUE_INFINITE;
1336 // Step 18. Check for split
1339 && depth >= ThreadsMgr.min_split_depth()
1340 && ThreadsMgr.active_threads() > 1
1342 && ThreadsMgr.available_thread_exists(threadID)
1344 && !ThreadsMgr.cutoff_at_splitpoint(threadID))
1345 ThreadsMgr.split<FakeSplit>(pos, ss, ply, &alpha, beta, &bestValue, depth,
1346 threatMove, mateThreat, moveCount, &mp, PvNode);
1349 // Step 19. Check for mate and stalemate
1350 // All legal moves have been searched and if there are
1351 // no legal moves, it must be mate or stalemate.
1352 // If one move was excluded return fail low score.
1353 if (!SpNode && !moveCount)
1354 return excludedMove ? oldAlpha : isCheck ? value_mated_in(ply) : VALUE_DRAW;
1356 // Step 20. Update tables
1357 // If the search is not aborted, update the transposition table,
1358 // history counters, and killer moves.
1359 if (!SpNode && !StopRequest && !ThreadsMgr.cutoff_at_splitpoint(threadID))
1361 move = bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove;
1362 vt = bestValue <= oldAlpha ? VALUE_TYPE_UPPER
1363 : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT;
1365 TT.store(posKey, value_to_tt(bestValue, ply), vt, depth, move, ss->eval, ss->evalMargin);
1367 // Update killers and history only for non capture moves that fails high
1368 if ( bestValue >= beta
1369 && !pos.move_is_capture_or_promotion(move))
1371 if (move != ss->killers[0])
1373 ss->killers[1] = ss->killers[0];
1374 ss->killers[0] = move;
1376 update_history(pos, move, depth, movesSearched, playedMoveCount);
1382 // Here we have the lock still grabbed
1383 sp->slaves[threadID] = 0;
1384 sp->nodes += pos.nodes_searched();
1385 lock_release(&(sp->lock));
1388 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1393 // qsearch() is the quiescence search function, which is called by the main
1394 // search function when the remaining depth is zero (or, to be more precise,
1395 // less than ONE_PLY).
1397 template <NodeType PvNode>
1398 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply) {
1400 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1401 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1402 assert(PvNode || alpha == beta - 1);
1404 assert(ply > 0 && ply < PLY_MAX);
1405 assert(pos.thread() >= 0 && pos.thread() < ThreadsMgr.active_threads());
1409 Value bestValue, value, evalMargin, futilityValue, futilityBase;
1410 bool isCheck, enoughMaterial, moveIsCheck, evasionPrunable;
1413 Value oldAlpha = alpha;
1415 ss->bestMove = ss->currentMove = MOVE_NONE;
1417 // Check for an instant draw or maximum ply reached
1418 if (pos.is_draw() || ply >= PLY_MAX - 1)
1421 // Decide whether or not to include checks, this fixes also the type of
1422 // TT entry depth that we are going to use. Note that in qsearch we use
1423 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1424 isCheck = pos.is_check();
1425 ttDepth = (isCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS : DEPTH_QS_NO_CHECKS);
1427 // Transposition table lookup. At PV nodes, we don't use the TT for
1428 // pruning, but only for move ordering.
1429 tte = TT.retrieve(pos.get_key());
1430 ttMove = (tte ? tte->move() : MOVE_NONE);
1432 if (!PvNode && tte && ok_to_use_TT(tte, ttDepth, beta, ply))
1434 ss->bestMove = ttMove; // Can be MOVE_NONE
1435 return value_from_tt(tte->value(), ply);
1438 // Evaluate the position statically
1441 bestValue = futilityBase = -VALUE_INFINITE;
1442 ss->eval = evalMargin = VALUE_NONE;
1443 enoughMaterial = false;
1449 assert(tte->static_value() != VALUE_NONE);
1451 evalMargin = tte->static_value_margin();
1452 ss->eval = bestValue = tte->static_value();
1455 ss->eval = bestValue = evaluate(pos, evalMargin);
1457 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
1459 // Stand pat. Return immediately if static value is at least beta
1460 if (bestValue >= beta)
1463 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, DEPTH_NONE, MOVE_NONE, ss->eval, evalMargin);
1468 if (PvNode && bestValue > alpha)
1471 // Futility pruning parameters, not needed when in check
1472 futilityBase = ss->eval + evalMargin + FutilityMarginQS;
1473 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1476 // Initialize a MovePicker object for the current position, and prepare
1477 // to search the moves. Because the depth is <= 0 here, only captures,
1478 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1480 MovePicker mp(pos, ttMove, depth, H);
1483 // Loop through the moves until no moves remain or a beta cutoff occurs
1484 while ( alpha < beta
1485 && (move = mp.get_next_move()) != MOVE_NONE)
1487 assert(move_is_ok(move));
1489 moveIsCheck = pos.move_is_check(move, ci);
1497 && !move_is_promotion(move)
1498 && !pos.move_is_passed_pawn_push(move))
1500 futilityValue = futilityBase
1501 + pos.endgame_value_of_piece_on(move_to(move))
1502 + (move_is_ep(move) ? PawnValueEndgame : VALUE_ZERO);
1504 if (futilityValue < alpha)
1506 if (futilityValue > bestValue)
1507 bestValue = futilityValue;
1511 // Prune moves with negative or equal SEE
1512 if ( futilityBase < beta
1513 && depth < DEPTH_ZERO
1514 && pos.see(move) <= 0)
1518 // Detect non-capture evasions that are candidate to be pruned
1519 evasionPrunable = isCheck
1520 && bestValue > VALUE_MATED_IN_PLY_MAX
1521 && !pos.move_is_capture(move)
1522 && !pos.can_castle(pos.side_to_move());
1524 // Don't search moves with negative SEE values
1526 && (!isCheck || evasionPrunable)
1528 && !move_is_promotion(move)
1529 && pos.see_sign(move) < 0)
1532 // Don't search useless checks
1537 && !pos.move_is_capture_or_promotion(move)
1538 && ss->eval + PawnValueMidgame / 4 < beta
1539 && !check_is_dangerous(pos, move, futilityBase, beta, &bestValue))
1541 if (ss->eval + PawnValueMidgame / 4 > bestValue)
1542 bestValue = ss->eval + PawnValueMidgame / 4;
1547 // Update current move
1548 ss->currentMove = move;
1550 // Make and search the move
1551 pos.do_move(move, st, ci, moveIsCheck);
1552 value = -qsearch<PvNode>(pos, ss+1, -beta, -alpha, depth-ONE_PLY, ply+1);
1553 pos.undo_move(move);
1555 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1558 if (value > bestValue)
1564 ss->bestMove = move;
1569 // All legal moves have been searched. A special case: If we're in check
1570 // and no legal moves were found, it is checkmate.
1571 if (isCheck && bestValue == -VALUE_INFINITE)
1572 return value_mated_in(ply);
1574 // Update transposition table
1575 ValueType vt = (bestValue <= oldAlpha ? VALUE_TYPE_UPPER : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT);
1576 TT.store(pos.get_key(), value_to_tt(bestValue, ply), vt, ttDepth, ss->bestMove, ss->eval, evalMargin);
1578 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1584 // check_is_dangerous() tests if a checking move can be pruned in qsearch().
1585 // bestValue is updated only when returning false because in that case move
1588 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bestValue)
1590 Bitboard b, occ, oldAtt, newAtt, kingAtt;
1591 Square from, to, ksq, victimSq;
1594 Value futilityValue, bv = *bestValue;
1596 from = move_from(move);
1598 them = opposite_color(pos.side_to_move());
1599 ksq = pos.king_square(them);
1600 kingAtt = pos.attacks_from<KING>(ksq);
1601 pc = pos.piece_on(from);
1603 occ = pos.occupied_squares() & ~(1ULL << from) & ~(1ULL << ksq);
1604 oldAtt = pos.attacks_from(pc, from, occ);
1605 newAtt = pos.attacks_from(pc, to, occ);
1607 // Rule 1. Checks which give opponent's king at most one escape square are dangerous
1608 b = kingAtt & ~pos.pieces_of_color(them) & ~newAtt & ~(1ULL << to);
1610 if (!(b && (b & (b - 1))))
1613 // Rule 2. Queen contact check is very dangerous
1614 if ( type_of_piece(pc) == QUEEN
1615 && bit_is_set(kingAtt, to))
1618 // Rule 3. Creating new double threats with checks
1619 b = pos.pieces_of_color(them) & newAtt & ~oldAtt & ~(1ULL << ksq);
1623 victimSq = pop_1st_bit(&b);
1624 futilityValue = futilityBase + pos.endgame_value_of_piece_on(victimSq);
1626 // Note that here we generate illegal "double move"!
1627 if ( futilityValue >= beta
1628 && pos.see_sign(make_move(from, victimSq)) >= 0)
1631 if (futilityValue > bv)
1635 // Update bestValue only if check is not dangerous (because we will prune the move)
1641 // connected_moves() tests whether two moves are 'connected' in the sense
1642 // that the first move somehow made the second move possible (for instance
1643 // if the moving piece is the same in both moves). The first move is assumed
1644 // to be the move that was made to reach the current position, while the
1645 // second move is assumed to be a move from the current position.
1647 bool connected_moves(const Position& pos, Move m1, Move m2) {
1649 Square f1, t1, f2, t2;
1652 assert(m1 && move_is_ok(m1));
1653 assert(m2 && move_is_ok(m2));
1655 // Case 1: The moving piece is the same in both moves
1661 // Case 2: The destination square for m2 was vacated by m1
1667 // Case 3: Moving through the vacated square
1668 if ( piece_is_slider(pos.piece_on(f2))
1669 && bit_is_set(squares_between(f2, t2), f1))
1672 // Case 4: The destination square for m2 is defended by the moving piece in m1
1673 p = pos.piece_on(t1);
1674 if (bit_is_set(pos.attacks_from(p, t1), t2))
1677 // Case 5: Discovered check, checking piece is the piece moved in m1
1678 if ( piece_is_slider(p)
1679 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
1680 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
1682 // discovered_check_candidates() works also if the Position's side to
1683 // move is the opposite of the checking piece.
1684 Color them = opposite_color(pos.side_to_move());
1685 Bitboard dcCandidates = pos.discovered_check_candidates(them);
1687 if (bit_is_set(dcCandidates, f2))
1694 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1695 // "plies to mate from the current ply". Non-mate scores are unchanged.
1696 // The function is called before storing a value to the transposition table.
1698 Value value_to_tt(Value v, int ply) {
1700 if (v >= VALUE_MATE_IN_PLY_MAX)
1703 if (v <= VALUE_MATED_IN_PLY_MAX)
1710 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score from
1711 // the transposition table to a mate score corrected for the current ply.
1713 Value value_from_tt(Value v, int ply) {
1715 if (v >= VALUE_MATE_IN_PLY_MAX)
1718 if (v <= VALUE_MATED_IN_PLY_MAX)
1725 // extension() decides whether a move should be searched with normal depth,
1726 // or with extended depth. Certain classes of moves (checking moves, in
1727 // particular) are searched with bigger depth than ordinary moves and in
1728 // any case are marked as 'dangerous'. Note that also if a move is not
1729 // extended, as example because the corresponding UCI option is set to zero,
1730 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
1731 template <NodeType PvNode>
1732 Depth extension(const Position& pos, Move m, bool captureOrPromotion,
1733 bool moveIsCheck, bool mateThreat, bool* dangerous) {
1735 assert(m != MOVE_NONE);
1737 Depth result = DEPTH_ZERO;
1738 *dangerous = moveIsCheck | mateThreat;
1742 if (moveIsCheck && pos.see_sign(m) >= 0)
1743 result += CheckExtension[PvNode];
1746 result += MateThreatExtension[PvNode];
1749 if (pos.type_of_piece_on(move_from(m)) == PAWN)
1751 Color c = pos.side_to_move();
1752 if (relative_rank(c, move_to(m)) == RANK_7)
1754 result += PawnPushTo7thExtension[PvNode];
1757 if (pos.pawn_is_passed(c, move_to(m)))
1759 result += PassedPawnExtension[PvNode];
1764 if ( captureOrPromotion
1765 && pos.type_of_piece_on(move_to(m)) != PAWN
1766 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
1767 - pos.midgame_value_of_piece_on(move_to(m)) == VALUE_ZERO)
1768 && !move_is_promotion(m)
1771 result += PawnEndgameExtension[PvNode];
1775 return Min(result, ONE_PLY);
1779 // connected_threat() tests whether it is safe to forward prune a move or if
1780 // is somehow connected to the threat move returned by null search.
1782 bool connected_threat(const Position& pos, Move m, Move threat) {
1784 assert(move_is_ok(m));
1785 assert(threat && move_is_ok(threat));
1786 assert(!pos.move_is_check(m));
1787 assert(!pos.move_is_capture_or_promotion(m));
1788 assert(!pos.move_is_passed_pawn_push(m));
1790 Square mfrom, mto, tfrom, tto;
1792 mfrom = move_from(m);
1794 tfrom = move_from(threat);
1795 tto = move_to(threat);
1797 // Case 1: Don't prune moves which move the threatened piece
1801 // Case 2: If the threatened piece has value less than or equal to the
1802 // value of the threatening piece, don't prune moves which defend it.
1803 if ( pos.move_is_capture(threat)
1804 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
1805 || pos.type_of_piece_on(tfrom) == KING)
1806 && pos.move_attacks_square(m, tto))
1809 // Case 3: If the moving piece in the threatened move is a slider, don't
1810 // prune safe moves which block its ray.
1811 if ( piece_is_slider(pos.piece_on(tfrom))
1812 && bit_is_set(squares_between(tfrom, tto), mto)
1813 && pos.see_sign(m) >= 0)
1820 // ok_to_use_TT() returns true if a transposition table score
1821 // can be used at a given point in search.
1823 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
1825 Value v = value_from_tt(tte->value(), ply);
1827 return ( tte->depth() >= depth
1828 || v >= Max(VALUE_MATE_IN_PLY_MAX, beta)
1829 || v < Min(VALUE_MATED_IN_PLY_MAX, beta))
1831 && ( ((tte->type() & VALUE_TYPE_LOWER) && v >= beta)
1832 || ((tte->type() & VALUE_TYPE_UPPER) && v < beta));
1836 // refine_eval() returns the transposition table score if
1837 // possible otherwise falls back on static position evaluation.
1839 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
1843 Value v = value_from_tt(tte->value(), ply);
1845 if ( ((tte->type() & VALUE_TYPE_LOWER) && v >= defaultEval)
1846 || ((tte->type() & VALUE_TYPE_UPPER) && v < defaultEval))
1853 // update_history() registers a good move that produced a beta-cutoff
1854 // in history and marks as failures all the other moves of that ply.
1856 void update_history(const Position& pos, Move move, Depth depth,
1857 Move movesSearched[], int moveCount) {
1859 Value bonus = Value(int(depth) * int(depth));
1861 H.update(pos.piece_on(move_from(move)), move_to(move), bonus);
1863 for (int i = 0; i < moveCount - 1; i++)
1865 m = movesSearched[i];
1869 H.update(pos.piece_on(move_from(m)), move_to(m), -bonus);
1874 // update_gains() updates the gains table of a non-capture move given
1875 // the static position evaluation before and after the move.
1877 void update_gains(const Position& pos, Move m, Value before, Value after) {
1880 && before != VALUE_NONE
1881 && after != VALUE_NONE
1882 && pos.captured_piece_type() == PIECE_TYPE_NONE
1883 && !move_is_special(m))
1884 H.update_gain(pos.piece_on(move_to(m)), move_to(m), -(before + after));
1888 // current_search_time() returns the number of milliseconds which have passed
1889 // since the beginning of the current search.
1891 int current_search_time() {
1893 return get_system_time() - SearchStartTime;
1897 // value_to_uci() converts a value to a string suitable for use with the UCI
1898 // protocol specifications:
1900 // cp <x> The score from the engine's point of view in centipawns.
1901 // mate <y> Mate in y moves, not plies. If the engine is getting mated
1902 // use negative values for y.
1904 std::string value_to_uci(Value v) {
1906 std::stringstream s;
1908 if (abs(v) < VALUE_MATE - PLY_MAX * ONE_PLY)
1909 s << "cp " << int(v) * 100 / int(PawnValueMidgame); // Scale to centipawns
1911 s << "mate " << (v > 0 ? VALUE_MATE - v + 1 : -VALUE_MATE - v) / 2;
1917 // speed_to_uci() returns a string with time stats of current search suitable
1918 // to be sent to UCI gui.
1920 std::string speed_to_uci(int64_t nodes) {
1922 std::stringstream s;
1923 int t = current_search_time();
1925 s << " nodes " << nodes
1926 << " nps " << (t > 0 ? int(nodes * 1000 / t) : 0)
1933 // poll() performs two different functions: It polls for user input, and it
1934 // looks at the time consumed so far and decides if it's time to abort the
1937 void poll(const Position& pos) {
1939 static int lastInfoTime;
1940 int t = current_search_time();
1943 if (input_available())
1945 // We are line oriented, don't read single chars
1946 std::string command;
1948 if (!std::getline(std::cin, command) || command == "quit")
1950 // Quit the program as soon as possible
1952 QuitRequest = StopRequest = true;
1955 else if (command == "stop")
1957 // Stop calculating as soon as possible, but still send the "bestmove"
1958 // and possibly the "ponder" token when finishing the search.
1962 else if (command == "ponderhit")
1964 // The opponent has played the expected move. GUI sends "ponderhit" if
1965 // we were told to ponder on the same move the opponent has played. We
1966 // should continue searching but switching from pondering to normal search.
1969 if (StopOnPonderhit)
1974 // Print search information
1978 else if (lastInfoTime > t)
1979 // HACK: Must be a new search where we searched less than
1980 // NodesBetweenPolls nodes during the first second of search.
1983 else if (t - lastInfoTime >= 1000)
1990 if (dbg_show_hit_rate)
1991 dbg_print_hit_rate();
1993 // Send info on searched nodes as soon as we return to root
1994 SendSearchedNodes = true;
1997 // Should we stop the search?
2001 bool stillAtFirstMove = FirstRootMove
2002 && !AspirationFailLow
2003 && t > TimeMgr.available_time();
2005 bool noMoreTime = t > TimeMgr.maximum_time()
2006 || stillAtFirstMove;
2008 if ( (UseTimeManagement && noMoreTime)
2009 || (ExactMaxTime && t >= ExactMaxTime)
2010 || (MaxNodes && pos.nodes_searched() >= MaxNodes)) // FIXME
2015 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2016 // while the program is pondering. The point is to work around a wrinkle in
2017 // the UCI protocol: When pondering, the engine is not allowed to give a
2018 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2019 // We simply wait here until one of these commands is sent, and return,
2020 // after which the bestmove and pondermove will be printed.
2022 void wait_for_stop_or_ponderhit() {
2024 std::string command;
2026 // Wait for a command from stdin
2027 while ( std::getline(std::cin, command)
2028 && command != "ponderhit" && command != "stop" && command != "quit") {};
2030 if (command != "ponderhit" && command != "stop")
2031 QuitRequest = true; // Must be "quit" or getline() returned false
2035 // init_thread() is the function which is called when a new thread is
2036 // launched. It simply calls the idle_loop() function with the supplied
2037 // threadID. There are two versions of this function; one for POSIX
2038 // threads and one for Windows threads.
2040 #if !defined(_MSC_VER)
2042 void* init_thread(void* threadID) {
2044 ThreadsMgr.idle_loop(*(int*)threadID, NULL);
2050 DWORD WINAPI init_thread(LPVOID threadID) {
2052 ThreadsMgr.idle_loop(*(int*)threadID, NULL);
2059 /// The ThreadsManager class
2062 // read_uci_options() updates number of active threads and other internal
2063 // parameters according to the UCI options values. It is called before
2064 // to start a new search.
2066 void ThreadsManager::read_uci_options() {
2068 maxThreadsPerSplitPoint = Options["Maximum Number of Threads per Split Point"].value<int>();
2069 minimumSplitDepth = Options["Minimum Split Depth"].value<int>() * ONE_PLY;
2070 useSleepingThreads = Options["Use Sleeping Threads"].value<bool>();
2071 activeThreads = Options["Threads"].value<int>();
2075 // idle_loop() is where the threads are parked when they have no work to do.
2076 // The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint
2077 // object for which the current thread is the master.
2079 void ThreadsManager::idle_loop(int threadID, SplitPoint* sp) {
2081 assert(threadID >= 0 && threadID < MAX_THREADS);
2084 bool allFinished = false;
2088 // Slave threads can exit as soon as AllThreadsShouldExit raises,
2089 // master should exit as last one.
2090 if (allThreadsShouldExit)
2093 threads[threadID].state = THREAD_TERMINATED;
2097 // If we are not thinking, wait for a condition to be signaled
2098 // instead of wasting CPU time polling for work.
2099 while ( threadID >= activeThreads || threads[threadID].state == THREAD_INITIALIZING
2100 || (useSleepingThreads && threads[threadID].state == THREAD_AVAILABLE))
2102 assert(!sp || useSleepingThreads);
2103 assert(threadID != 0 || useSleepingThreads);
2105 if (threads[threadID].state == THREAD_INITIALIZING)
2106 threads[threadID].state = THREAD_AVAILABLE;
2108 // Grab the lock to avoid races with wake_sleeping_thread()
2109 lock_grab(&sleepLock[threadID]);
2111 // If we are master and all slaves have finished do not go to sleep
2112 for (i = 0; sp && i < activeThreads && !sp->slaves[i]; i++) {}
2113 allFinished = (i == activeThreads);
2115 if (allFinished || allThreadsShouldExit)
2117 lock_release(&sleepLock[threadID]);
2121 // Do sleep here after retesting sleep conditions
2122 if (threadID >= activeThreads || threads[threadID].state == THREAD_AVAILABLE)
2123 cond_wait(&sleepCond[threadID], &sleepLock[threadID]);
2125 lock_release(&sleepLock[threadID]);
2128 // If this thread has been assigned work, launch a search
2129 if (threads[threadID].state == THREAD_WORKISWAITING)
2131 assert(!allThreadsShouldExit);
2133 threads[threadID].state = THREAD_SEARCHING;
2135 // Copy SplitPoint position and search stack and call search()
2136 // with SplitPoint template parameter set to true.
2137 SearchStack ss[PLY_MAX_PLUS_2];
2138 SplitPoint* tsp = threads[threadID].splitPoint;
2139 Position pos(*tsp->pos, threadID);
2141 memcpy(ss, tsp->ss - 1, 4 * sizeof(SearchStack));
2145 search<PV, true, false>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth, tsp->ply);
2147 search<NonPV, true, false>(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth, tsp->ply);
2149 assert(threads[threadID].state == THREAD_SEARCHING);
2151 threads[threadID].state = THREAD_AVAILABLE;
2153 // Wake up master thread so to allow it to return from the idle loop in
2154 // case we are the last slave of the split point.
2155 if (useSleepingThreads && threadID != tsp->master && threads[tsp->master].state == THREAD_AVAILABLE)
2156 wake_sleeping_thread(tsp->master);
2159 // If this thread is the master of a split point and all slaves have
2160 // finished their work at this split point, return from the idle loop.
2161 for (i = 0; sp && i < activeThreads && !sp->slaves[i]; i++) {}
2162 allFinished = (i == activeThreads);
2166 // Because sp->slaves[] is reset under lock protection,
2167 // be sure sp->lock has been released before to return.
2168 lock_grab(&(sp->lock));
2169 lock_release(&(sp->lock));
2171 // In helpful master concept a master can help only a sub-tree, and
2172 // because here is all finished is not possible master is booked.
2173 assert(threads[threadID].state == THREAD_AVAILABLE);
2175 threads[threadID].state = THREAD_SEARCHING;
2182 // init_threads() is called during startup. It launches all helper threads,
2183 // and initializes the split point stack and the global locks and condition
2186 void ThreadsManager::init_threads() {
2188 int i, arg[MAX_THREADS];
2191 // Initialize global locks
2194 for (i = 0; i < MAX_THREADS; i++)
2196 lock_init(&sleepLock[i]);
2197 cond_init(&sleepCond[i]);
2200 // Initialize splitPoints[] locks
2201 for (i = 0; i < MAX_THREADS; i++)
2202 for (int j = 0; j < MAX_ACTIVE_SPLIT_POINTS; j++)
2203 lock_init(&(threads[i].splitPoints[j].lock));
2205 // Will be set just before program exits to properly end the threads
2206 allThreadsShouldExit = false;
2208 // Threads will be put all threads to sleep as soon as created
2211 // All threads except the main thread should be initialized to THREAD_INITIALIZING
2212 threads[0].state = THREAD_SEARCHING;
2213 for (i = 1; i < MAX_THREADS; i++)
2214 threads[i].state = THREAD_INITIALIZING;
2216 // Launch the helper threads
2217 for (i = 1; i < MAX_THREADS; i++)
2221 #if !defined(_MSC_VER)
2222 pthread_t pthread[1];
2223 ok = (pthread_create(pthread, NULL, init_thread, (void*)(&arg[i])) == 0);
2224 pthread_detach(pthread[0]);
2226 ok = (CreateThread(NULL, 0, init_thread, (LPVOID)(&arg[i]), 0, NULL) != NULL);
2230 cout << "Failed to create thread number " << i << endl;
2234 // Wait until the thread has finished launching and is gone to sleep
2235 while (threads[i].state == THREAD_INITIALIZING) {}
2240 // exit_threads() is called when the program exits. It makes all the
2241 // helper threads exit cleanly.
2243 void ThreadsManager::exit_threads() {
2245 allThreadsShouldExit = true; // Let the woken up threads to exit idle_loop()
2247 // Wake up all the threads and waits for termination
2248 for (int i = 1; i < MAX_THREADS; i++)
2250 wake_sleeping_thread(i);
2251 while (threads[i].state != THREAD_TERMINATED) {}
2254 // Now we can safely destroy the locks
2255 for (int i = 0; i < MAX_THREADS; i++)
2256 for (int j = 0; j < MAX_ACTIVE_SPLIT_POINTS; j++)
2257 lock_destroy(&(threads[i].splitPoints[j].lock));
2259 lock_destroy(&mpLock);
2261 // Now we can safely destroy the wait conditions
2262 for (int i = 0; i < MAX_THREADS; i++)
2264 lock_destroy(&sleepLock[i]);
2265 cond_destroy(&sleepCond[i]);
2270 // cutoff_at_splitpoint() checks whether a beta cutoff has occurred in
2271 // the thread's currently active split point, or in some ancestor of
2272 // the current split point.
2274 bool ThreadsManager::cutoff_at_splitpoint(int threadID) const {
2276 assert(threadID >= 0 && threadID < activeThreads);
2278 SplitPoint* sp = threads[threadID].splitPoint;
2280 for ( ; sp && !sp->betaCutoff; sp = sp->parent) {}
2285 // thread_is_available() checks whether the thread with threadID "slave" is
2286 // available to help the thread with threadID "master" at a split point. An
2287 // obvious requirement is that "slave" must be idle. With more than two
2288 // threads, this is not by itself sufficient: If "slave" is the master of
2289 // some active split point, it is only available as a slave to the other
2290 // threads which are busy searching the split point at the top of "slave"'s
2291 // split point stack (the "helpful master concept" in YBWC terminology).
2293 bool ThreadsManager::thread_is_available(int slave, int master) const {
2295 assert(slave >= 0 && slave < activeThreads);
2296 assert(master >= 0 && master < activeThreads);
2297 assert(activeThreads > 1);
2299 if (threads[slave].state != THREAD_AVAILABLE || slave == master)
2302 // Make a local copy to be sure doesn't change under our feet
2303 int localActiveSplitPoints = threads[slave].activeSplitPoints;
2305 // No active split points means that the thread is available as
2306 // a slave for any other thread.
2307 if (localActiveSplitPoints == 0 || activeThreads == 2)
2310 // Apply the "helpful master" concept if possible. Use localActiveSplitPoints
2311 // that is known to be > 0, instead of threads[slave].activeSplitPoints that
2312 // could have been set to 0 by another thread leading to an out of bound access.
2313 if (threads[slave].splitPoints[localActiveSplitPoints - 1].slaves[master])
2320 // available_thread_exists() tries to find an idle thread which is available as
2321 // a slave for the thread with threadID "master".
2323 bool ThreadsManager::available_thread_exists(int master) const {
2325 assert(master >= 0 && master < activeThreads);
2326 assert(activeThreads > 1);
2328 for (int i = 0; i < activeThreads; i++)
2329 if (thread_is_available(i, master))
2336 // split() does the actual work of distributing the work at a node between
2337 // several available threads. If it does not succeed in splitting the
2338 // node (because no idle threads are available, or because we have no unused
2339 // split point objects), the function immediately returns. If splitting is
2340 // possible, a SplitPoint object is initialized with all the data that must be
2341 // copied to the helper threads and we tell our helper threads that they have
2342 // been assigned work. This will cause them to instantly leave their idle loops and
2343 // call search().When all threads have returned from search() then split() returns.
2345 template <bool Fake>
2346 void ThreadsManager::split(Position& pos, SearchStack* ss, int ply, Value* alpha,
2347 const Value beta, Value* bestValue, Depth depth, Move threatMove,
2348 bool mateThreat, int moveCount, MovePicker* mp, bool pvNode) {
2349 assert(pos.is_ok());
2350 assert(ply > 0 && ply < PLY_MAX);
2351 assert(*bestValue >= -VALUE_INFINITE);
2352 assert(*bestValue <= *alpha);
2353 assert(*alpha < beta);
2354 assert(beta <= VALUE_INFINITE);
2355 assert(depth > DEPTH_ZERO);
2356 assert(pos.thread() >= 0 && pos.thread() < activeThreads);
2357 assert(activeThreads > 1);
2359 int i, master = pos.thread();
2360 Thread& masterThread = threads[master];
2364 // If no other thread is available to help us, or if we have too many
2365 // active split points, don't split.
2366 if ( !available_thread_exists(master)
2367 || masterThread.activeSplitPoints >= MAX_ACTIVE_SPLIT_POINTS)
2369 lock_release(&mpLock);
2373 // Pick the next available split point object from the split point stack
2374 SplitPoint& splitPoint = masterThread.splitPoints[masterThread.activeSplitPoints++];
2376 // Initialize the split point object
2377 splitPoint.parent = masterThread.splitPoint;
2378 splitPoint.master = master;
2379 splitPoint.betaCutoff = false;
2380 splitPoint.ply = ply;
2381 splitPoint.depth = depth;
2382 splitPoint.threatMove = threatMove;
2383 splitPoint.mateThreat = mateThreat;
2384 splitPoint.alpha = *alpha;
2385 splitPoint.beta = beta;
2386 splitPoint.pvNode = pvNode;
2387 splitPoint.bestValue = *bestValue;
2389 splitPoint.moveCount = moveCount;
2390 splitPoint.pos = &pos;
2391 splitPoint.nodes = 0;
2393 for (i = 0; i < activeThreads; i++)
2394 splitPoint.slaves[i] = 0;
2396 masterThread.splitPoint = &splitPoint;
2398 // If we are here it means we are not available
2399 assert(masterThread.state != THREAD_AVAILABLE);
2401 int workersCnt = 1; // At least the master is included
2403 // Allocate available threads setting state to THREAD_BOOKED
2404 for (i = 0; !Fake && i < activeThreads && workersCnt < maxThreadsPerSplitPoint; i++)
2405 if (thread_is_available(i, master))
2407 threads[i].state = THREAD_BOOKED;
2408 threads[i].splitPoint = &splitPoint;
2409 splitPoint.slaves[i] = 1;
2413 assert(Fake || workersCnt > 1);
2415 // We can release the lock because slave threads are already booked and master is not available
2416 lock_release(&mpLock);
2418 // Tell the threads that they have work to do. This will make them leave
2420 for (i = 0; i < activeThreads; i++)
2421 if (i == master || splitPoint.slaves[i])
2423 assert(i == master || threads[i].state == THREAD_BOOKED);
2425 threads[i].state = THREAD_WORKISWAITING; // This makes the slave to exit from idle_loop()
2427 if (useSleepingThreads && i != master)
2428 wake_sleeping_thread(i);
2431 // Everything is set up. The master thread enters the idle loop, from
2432 // which it will instantly launch a search, because its state is
2433 // THREAD_WORKISWAITING. We send the split point as a second parameter to the
2434 // idle loop, which means that the main thread will return from the idle
2435 // loop when all threads have finished their work at this split point.
2436 idle_loop(master, &splitPoint);
2438 // We have returned from the idle loop, which means that all threads are
2439 // finished. Update alpha and bestValue, and return.
2442 *alpha = splitPoint.alpha;
2443 *bestValue = splitPoint.bestValue;
2444 masterThread.activeSplitPoints--;
2445 masterThread.splitPoint = splitPoint.parent;
2446 pos.set_nodes_searched(pos.nodes_searched() + splitPoint.nodes);
2448 lock_release(&mpLock);
2452 // wake_sleeping_thread() wakes up the thread with the given threadID
2453 // when it is time to start a new search.
2455 void ThreadsManager::wake_sleeping_thread(int threadID) {
2457 lock_grab(&sleepLock[threadID]);
2458 cond_signal(&sleepCond[threadID]);
2459 lock_release(&sleepLock[threadID]);
2463 /// RootMove and RootMoveList method's definitions
2465 RootMove::RootMove() {
2468 pv_score = non_pv_score = -VALUE_INFINITE;
2472 RootMove& RootMove::operator=(const RootMove& rm) {
2474 const Move* src = rm.pv;
2477 // Avoid a costly full rm.pv[] copy
2478 do *dst++ = *src; while (*src++ != MOVE_NONE);
2481 pv_score = rm.pv_score;
2482 non_pv_score = rm.non_pv_score;
2486 // extract_pv_from_tt() builds a PV by adding moves from the transposition table.
2487 // We consider also failing high nodes and not only VALUE_TYPE_EXACT nodes. This
2488 // allow to always have a ponder move even when we fail high at root and also a
2489 // long PV to print that is important for position analysis.
2491 void RootMove::extract_pv_from_tt(Position& pos) {
2493 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2497 assert(pv[0] != MOVE_NONE && move_is_legal(pos, pv[0]));
2499 pos.do_move(pv[0], *st++);
2501 while ( (tte = TT.retrieve(pos.get_key())) != NULL
2502 && tte->move() != MOVE_NONE
2503 && move_is_legal(pos, tte->move())
2505 && (!pos.is_draw() || ply < 2))
2507 pv[ply] = tte->move();
2508 pos.do_move(pv[ply++], *st++);
2510 pv[ply] = MOVE_NONE;
2512 do pos.undo_move(pv[--ply]); while (ply);
2515 // insert_pv_in_tt() is called at the end of a search iteration, and inserts
2516 // the PV back into the TT. This makes sure the old PV moves are searched
2517 // first, even if the old TT entries have been overwritten.
2519 void RootMove::insert_pv_in_tt(Position& pos) {
2521 StateInfo state[PLY_MAX_PLUS_2], *st = state;
2524 Value v, m = VALUE_NONE;
2527 assert(pv[0] != MOVE_NONE && move_is_legal(pos, pv[0]));
2531 tte = TT.retrieve(k);
2533 // Don't overwrite existing correct entries
2534 if (!tte || tte->move() != pv[ply])
2536 v = (pos.is_check() ? VALUE_NONE : evaluate(pos, m));
2537 TT.store(k, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, pv[ply], v, m);
2539 pos.do_move(pv[ply], *st++);
2541 } while (pv[++ply] != MOVE_NONE);
2543 do pos.undo_move(pv[--ply]); while (ply);
2546 // pv_info_to_uci() returns a string with information on the current PV line
2547 // formatted according to UCI specification. It is called at each iteration
2548 // or after a new pv is found.
2550 std::string RootMove::pv_info_to_uci(Position& pos, int depth, Value alpha, Value beta, int pvLine) {
2552 std::stringstream s, l;
2555 while (*m != MOVE_NONE)
2558 s << "info depth " << depth
2559 << " seldepth " << int(m - pv)
2560 << " multipv " << pvLine + 1
2561 << " score " << value_to_uci(pv_score)
2562 << (pv_score >= beta ? " lowerbound" : pv_score <= alpha ? " upperbound" : "")
2563 << speed_to_uci(pos.nodes_searched())
2564 << " pv " << l.str();
2570 void RootMoveList::init(Position& pos, Move searchMoves[]) {
2572 MoveStack mlist[MOVES_MAX];
2576 bestMoveChanges = 0;
2578 // Generate all legal moves and add them to RootMoveList
2579 MoveStack* last = generate<MV_LEGAL>(pos, mlist);
2580 for (MoveStack* cur = mlist; cur != last; cur++)
2582 // If we have a searchMoves[] list then verify cur->move
2583 // is in the list before to add it.
2584 for (sm = searchMoves; *sm && *sm != cur->move; sm++) {}
2586 if (searchMoves[0] && *sm != cur->move)
2590 rm.pv[0] = cur->move;
2591 rm.pv[1] = MOVE_NONE;
2592 rm.pv_score = -VALUE_INFINITE;