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;
129 void set_pv(const Move newPv[]);
132 Value pv_score, non_pv_score;
133 Move move, pv[PLY_MAX_PLUS_2];
136 RootMove::RootMove() : nodes(0) {
138 pv_score = non_pv_score = -VALUE_INFINITE;
139 move = pv[0] = MOVE_NONE;
142 RootMove& RootMove::operator=(const RootMove& rm) {
144 pv_score = rm.pv_score; non_pv_score = rm.non_pv_score;
145 nodes = rm.nodes; move = rm.move;
146 set_pv(rm.pv); // Skip costly full pv[] copy
150 void RootMove::set_pv(const Move newPv[]) {
154 while (*newPv != MOVE_NONE)
161 // RootMoveList struct is essentially a std::vector<> of RootMove objects,
162 // with an handful of methods above the standard ones.
164 struct RootMoveList : public std::vector<RootMove> {
166 typedef std::vector<RootMove> Base;
168 RootMoveList(Position& pos, Move searchMoves[]);
169 void set_non_pv_scores(const Position& pos);
171 void sort() { insertion_sort<RootMove, Base::iterator>(begin(), end()); }
172 void sort_multipv(int n) { insertion_sort<RootMove, Base::iterator>(begin(), begin() + n); }
176 // When formatting a move for std::cout we must know if we are in Chess960
177 // or not. To keep using the handy operator<<() on the move the trick is to
178 // embed this flag in the stream itself. Function-like named enum set960 is
179 // used as a custom manipulator and the stream internal general-purpose array,
180 // accessed through ios_base::iword(), is used to pass the flag to the move's
181 // operator<<() that will use it to properly format castling moves.
184 std::ostream& operator<< (std::ostream& os, const set960& m) {
186 os.iword(0) = int(m);
195 // Maximum depth for razoring
196 const Depth RazorDepth = 4 * ONE_PLY;
198 // Dynamic razoring margin based on depth
199 inline Value razor_margin(Depth d) { return Value(0x200 + 0x10 * int(d)); }
201 // Maximum depth for use of dynamic threat detection when null move fails low
202 const Depth ThreatDepth = 5 * ONE_PLY;
204 // Step 9. Internal iterative deepening
206 // Minimum depth for use of internal iterative deepening
207 const Depth IIDDepth[2] = { 8 * ONE_PLY /* non-PV */, 5 * ONE_PLY /* PV */};
209 // At Non-PV nodes we do an internal iterative deepening search
210 // when the static evaluation is bigger then beta - IIDMargin.
211 const Value IIDMargin = Value(0x100);
213 // Step 11. Decide the new search depth
215 // Extensions. Configurable UCI options
216 // Array index 0 is used at non-PV nodes, index 1 at PV nodes.
217 Depth CheckExtension[2], SingleEvasionExtension[2], PawnPushTo7thExtension[2];
218 Depth PassedPawnExtension[2], PawnEndgameExtension[2], MateThreatExtension[2];
220 // Minimum depth for use of singular extension
221 const Depth SingularExtensionDepth[2] = { 8 * ONE_PLY /* non-PV */, 6 * ONE_PLY /* PV */};
223 // If the TT move is at least SingularExtensionMargin better then the
224 // remaining ones we will extend it.
225 const Value SingularExtensionMargin = Value(0x20);
227 // Step 12. Futility pruning
229 // Futility margin for quiescence search
230 const Value FutilityMarginQS = Value(0x80);
232 // Futility lookup tables (initialized at startup) and their getter functions
233 Value FutilityMarginsMatrix[16][64]; // [depth][moveNumber]
234 int FutilityMoveCountArray[32]; // [depth]
236 inline Value futility_margin(Depth d, int mn) { return d < 7 * ONE_PLY ? FutilityMarginsMatrix[Max(d, 1)][Min(mn, 63)] : 2 * VALUE_INFINITE; }
237 inline int futility_move_count(Depth d) { return d < 16 * ONE_PLY ? FutilityMoveCountArray[d] : 512; }
239 // Step 14. Reduced search
241 // Reduction lookup tables (initialized at startup) and their getter functions
242 int8_t ReductionMatrix[2][64][64]; // [pv][depth][moveNumber]
244 template <NodeType PV>
245 inline Depth reduction(Depth d, int mn) { return (Depth) ReductionMatrix[PV][Min(d / 2, 63)][Min(mn, 63)]; }
247 // Common adjustments
249 // Search depth at iteration 1
250 const Depth InitialDepth = ONE_PLY;
252 // Easy move margin. An easy move candidate must be at least this much
253 // better than the second best move.
254 const Value EasyMoveMargin = Value(0x200);
257 /// Namespace variables
265 // Scores and number of times the best move changed for each iteration
266 Value ValueByIteration[PLY_MAX_PLUS_2];
267 int BestMoveChangesByIteration[PLY_MAX_PLUS_2];
269 // Search window management
275 // Time managment variables
276 int SearchStartTime, MaxNodes, MaxDepth, ExactMaxTime;
277 bool UseTimeManagement, InfiniteSearch, PonderSearch, StopOnPonderhit;
278 bool FirstRootMove, AbortSearch, Quit, AspirationFailLow;
283 std::ofstream LogFile;
285 // Multi-threads manager object
286 ThreadsManager ThreadsMgr;
288 // Node counters, used only by thread[0] but try to keep in different cache
289 // lines (64 bytes each) from the heavy multi-thread read accessed variables.
291 int NodesBetweenPolls = 30000;
298 Value id_loop(Position& pos, Move searchMoves[]);
299 Value root_search(Position& pos, SearchStack* ss, Move* pv, RootMoveList& rml, Value* alphaPtr, Value* betaPtr);
301 template <NodeType PvNode, bool SpNode>
302 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply);
304 template <NodeType PvNode>
305 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply);
307 template <NodeType PvNode>
308 inline Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply) {
310 return depth < ONE_PLY ? qsearch<PvNode>(pos, ss, alpha, beta, DEPTH_ZERO, ply)
311 : search<PvNode, false>(pos, ss, alpha, beta, depth, ply);
314 template <NodeType PvNode>
315 Depth extension(const Position& pos, Move m, bool captureOrPromotion, bool moveIsCheck, bool singleEvasion, bool mateThreat, bool* dangerous);
317 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bValue);
318 bool connected_moves(const Position& pos, Move m1, Move m2);
319 bool value_is_mate(Value value);
320 Value value_to_tt(Value v, int ply);
321 Value value_from_tt(Value v, int ply);
322 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply);
323 bool connected_threat(const Position& pos, Move m, Move threat);
324 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply);
325 void update_history(const Position& pos, Move move, Depth depth, Move movesSearched[], int moveCount);
326 void update_killers(Move m, SearchStack* ss);
327 void update_gains(const Position& pos, Move move, Value before, Value after);
329 int current_search_time();
330 std::string value_to_uci(Value v);
331 int nps(const Position& pos);
332 void poll(const Position& pos);
334 void wait_for_stop_or_ponderhit();
335 void init_ss_array(SearchStack* ss, int size);
336 void print_pv_info(const Position& pos, Move pv[], Value alpha, Value beta, Value value);
337 void insert_pv_in_tt(const Position& pos, Move pv[]);
338 void extract_pv_from_tt(const Position& pos, Move bestMove, Move pv[]);
340 #if !defined(_MSC_VER)
341 void* init_thread(void* threadID);
343 DWORD WINAPI init_thread(LPVOID threadID);
353 /// init_threads(), exit_threads() and nodes_searched() are helpers to
354 /// give accessibility to some TM methods from outside of current file.
356 void init_threads() { ThreadsMgr.init_threads(); }
357 void exit_threads() { ThreadsMgr.exit_threads(); }
360 /// init_search() is called during startup. It initializes various lookup tables
364 int d; // depth (ONE_PLY == 2)
365 int hd; // half depth (ONE_PLY == 1)
368 // Init reductions array
369 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
371 double pvRed = log(double(hd)) * log(double(mc)) / 3.0;
372 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
373 ReductionMatrix[PV][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(ONE_PLY)) : 0);
374 ReductionMatrix[NonPV][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(ONE_PLY)) : 0);
377 // Init futility margins array
378 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
379 FutilityMarginsMatrix[d][mc] = Value(112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45);
381 // Init futility move count array
382 for (d = 0; d < 32; d++)
383 FutilityMoveCountArray[d] = int(3.001 + 0.25 * pow(d, 2.0));
387 /// perft() is our utility to verify move generation is bug free. All the legal
388 /// moves up to given depth are generated and counted and the sum returned.
390 int perft(Position& pos, Depth depth)
392 MoveStack mlist[MOVES_MAX];
397 // Generate all legal moves
398 MoveStack* last = generate_moves(pos, mlist);
400 // If we are at the last ply we don't need to do and undo
401 // the moves, just to count them.
402 if (depth <= ONE_PLY)
403 return int(last - mlist);
405 // Loop through all legal moves
407 for (MoveStack* cur = mlist; cur != last; cur++)
410 pos.do_move(m, st, ci, pos.move_is_check(m, ci));
411 sum += perft(pos, depth - ONE_PLY);
418 /// think() is the external interface to Stockfish's search, and is called when
419 /// the program receives the UCI 'go' command. It initializes various
420 /// search-related global variables, and calls root_search(). It returns false
421 /// when a quit command is received during the search.
423 bool think(Position& pos, bool infinite, bool ponder, int time[], int increment[],
424 int movesToGo, int maxDepth, int maxNodes, int maxTime, Move searchMoves[]) {
426 // Initialize global search variables
427 StopOnPonderhit = AbortSearch = Quit = AspirationFailLow = false;
429 SearchStartTime = get_system_time();
430 ExactMaxTime = maxTime;
433 InfiniteSearch = infinite;
434 PonderSearch = ponder;
435 UseTimeManagement = !ExactMaxTime && !MaxDepth && !MaxNodes && !InfiniteSearch;
437 // Look for a book move, only during games, not tests
438 if (UseTimeManagement && Options["OwnBook"].value<bool>())
440 if (Options["Book File"].value<std::string>() != OpeningBook.file_name())
441 OpeningBook.open(Options["Book File"].value<std::string>());
443 Move bookMove = OpeningBook.get_move(pos, Options["Best Book Move"].value<bool>());
444 if (bookMove != MOVE_NONE)
447 wait_for_stop_or_ponderhit();
449 cout << "bestmove " << bookMove << endl;
454 // Read UCI option values
455 TT.set_size(Options["Hash"].value<int>());
456 if (Options["Clear Hash"].value<bool>())
458 Options["Clear Hash"].set_value("false");
462 CheckExtension[1] = Options["Check Extension (PV nodes)"].value<Depth>();
463 CheckExtension[0] = Options["Check Extension (non-PV nodes)"].value<Depth>();
464 SingleEvasionExtension[1] = Options["Single Evasion Extension (PV nodes)"].value<Depth>();
465 SingleEvasionExtension[0] = Options["Single Evasion Extension (non-PV nodes)"].value<Depth>();
466 PawnPushTo7thExtension[1] = Options["Pawn Push to 7th Extension (PV nodes)"].value<Depth>();
467 PawnPushTo7thExtension[0] = Options["Pawn Push to 7th Extension (non-PV nodes)"].value<Depth>();
468 PassedPawnExtension[1] = Options["Passed Pawn Extension (PV nodes)"].value<Depth>();
469 PassedPawnExtension[0] = Options["Passed Pawn Extension (non-PV nodes)"].value<Depth>();
470 PawnEndgameExtension[1] = Options["Pawn Endgame Extension (PV nodes)"].value<Depth>();
471 PawnEndgameExtension[0] = Options["Pawn Endgame Extension (non-PV nodes)"].value<Depth>();
472 MateThreatExtension[1] = Options["Mate Threat Extension (PV nodes)"].value<Depth>();
473 MateThreatExtension[0] = Options["Mate Threat Extension (non-PV nodes)"].value<Depth>();
474 MultiPV = Options["MultiPV"].value<int>();
475 UseLogFile = Options["Use Search Log"].value<bool>();
478 LogFile.open(Options["Search Log Filename"].value<std::string>().c_str(), std::ios::out | std::ios::app);
480 read_weights(pos.side_to_move());
482 // Set the number of active threads
483 ThreadsMgr.read_uci_options();
484 init_eval(ThreadsMgr.active_threads());
486 // Wake up needed threads
487 for (int i = 1; i < ThreadsMgr.active_threads(); i++)
488 ThreadsMgr.wake_sleeping_thread(i);
491 int myTime = time[pos.side_to_move()];
492 int myIncrement = increment[pos.side_to_move()];
493 if (UseTimeManagement)
494 TimeMgr.init(myTime, myIncrement, movesToGo, pos.startpos_ply_counter());
496 // Set best NodesBetweenPolls interval to avoid lagging under
497 // heavy time pressure.
499 NodesBetweenPolls = Min(MaxNodes, 30000);
500 else if (myTime && myTime < 1000)
501 NodesBetweenPolls = 1000;
502 else if (myTime && myTime < 5000)
503 NodesBetweenPolls = 5000;
505 NodesBetweenPolls = 30000;
507 // Write search information to log file
509 LogFile << "Searching: " << pos.to_fen() << endl
510 << "infinite: " << infinite
511 << " ponder: " << ponder
512 << " time: " << myTime
513 << " increment: " << myIncrement
514 << " moves to go: " << movesToGo << endl;
516 // We're ready to start thinking. Call the iterative deepening loop function
517 id_loop(pos, searchMoves);
522 // This makes all the threads to go to sleep
523 ThreadsMgr.set_active_threads(1);
531 // id_loop() is the main iterative deepening loop. It calls root_search
532 // repeatedly with increasing depth until the allocated thinking time has
533 // been consumed, the user stops the search, or the maximum search depth is
536 Value id_loop(Position& pos, Move searchMoves[]) {
538 SearchStack ss[PLY_MAX_PLUS_2];
539 Move pv[PLY_MAX_PLUS_2];
540 Move EasyMove = MOVE_NONE;
541 Value value, alpha = -VALUE_INFINITE, beta = VALUE_INFINITE;
543 // Moves to search are verified, copied, scored and sorted
544 RootMoveList rml(pos, searchMoves);
546 // Handle special case of searching on a mate/stale position
550 wait_for_stop_or_ponderhit();
552 return pos.is_check() ? -VALUE_MATE : VALUE_DRAW;
555 // Print RootMoveList startup scoring to the standard output,
556 // so to output information also for iteration 1.
557 cout << set960(pos.is_chess960()) // Is enough to set once at the beginning
558 << "info depth " << 1
559 << "\ninfo depth " << 1
560 << " score " << value_to_uci(rml[0].pv_score)
561 << " time " << current_search_time()
562 << " nodes " << pos.nodes_searched()
563 << " nps " << nps(pos)
564 << " pv " << rml[0].move << "\n";
569 init_ss_array(ss, PLY_MAX_PLUS_2);
570 pv[0] = pv[1] = MOVE_NONE;
571 ValueByIteration[1] = rml[0].pv_score;
574 // Is one move significantly better than others after initial scoring ?
576 || rml[0].pv_score > rml[1].pv_score + EasyMoveMargin)
577 EasyMove = rml[0].move;
579 // Iterative deepening loop
580 while (Iteration < PLY_MAX)
582 // Initialize iteration
584 BestMoveChangesByIteration[Iteration] = 0;
586 cout << "info depth " << Iteration << endl;
588 // Calculate dynamic aspiration window based on previous iterations
589 if (MultiPV == 1 && Iteration >= 6 && abs(ValueByIteration[Iteration - 1]) < VALUE_KNOWN_WIN)
591 int prevDelta1 = ValueByIteration[Iteration - 1] - ValueByIteration[Iteration - 2];
592 int prevDelta2 = ValueByIteration[Iteration - 2] - ValueByIteration[Iteration - 3];
594 AspirationDelta = Max(abs(prevDelta1) + abs(prevDelta2) / 2, 16);
595 AspirationDelta = (AspirationDelta + 7) / 8 * 8; // Round to match grainSize
597 alpha = Max(ValueByIteration[Iteration - 1] - AspirationDelta, -VALUE_INFINITE);
598 beta = Min(ValueByIteration[Iteration - 1] + AspirationDelta, VALUE_INFINITE);
601 // Search to the current depth, rml is updated and sorted, alpha and beta could change
602 value = root_search(pos, ss, pv, rml, &alpha, &beta);
604 // Write PV to transposition table, in case the relevant entries have
605 // been overwritten during the search.
606 insert_pv_in_tt(pos, pv);
609 break; // Value cannot be trusted. Break out immediately!
611 //Save info about search result
612 ValueByIteration[Iteration] = value;
614 // Drop the easy move if differs from the new best move
615 if (pv[0] != EasyMove)
616 EasyMove = MOVE_NONE;
618 if (UseTimeManagement)
621 bool stopSearch = false;
623 // Stop search early if there is only a single legal move,
624 // we search up to Iteration 6 anyway to get a proper score.
625 if (Iteration >= 6 && rml.size() == 1)
628 // Stop search early when the last two iterations returned a mate score
630 && abs(ValueByIteration[Iteration]) >= abs(VALUE_MATE) - 100
631 && abs(ValueByIteration[Iteration-1]) >= abs(VALUE_MATE) - 100)
634 // Stop search early if one move seems to be much better than the others
637 && ( ( rml[0].nodes > (pos.nodes_searched() * 85) / 100
638 && current_search_time() > TimeMgr.available_time() / 16)
639 ||( rml[0].nodes > (pos.nodes_searched() * 98) / 100
640 && current_search_time() > TimeMgr.available_time() / 32)))
643 // Add some extra time if the best move has changed during the last two iterations
644 if (Iteration > 5 && Iteration <= 50)
645 TimeMgr.pv_instability(BestMoveChangesByIteration[Iteration],
646 BestMoveChangesByIteration[Iteration-1]);
648 // Stop search if most of MaxSearchTime is consumed at the end of the
649 // iteration. We probably don't have enough time to search the first
650 // move at the next iteration anyway.
651 if (current_search_time() > (TimeMgr.available_time() * 80) / 128)
657 StopOnPonderhit = true;
663 if (MaxDepth && Iteration >= MaxDepth)
667 // If we are pondering or in infinite search, we shouldn't print the
668 // best move before we are told to do so.
669 if (!AbortSearch && (PonderSearch || InfiniteSearch))
670 wait_for_stop_or_ponderhit();
672 // Print final search statistics
673 cout << "info nodes " << pos.nodes_searched()
674 << " nps " << nps(pos)
675 << " time " << current_search_time() << endl;
677 // Print the best move and the ponder move to the standard output
678 if (pv[0] == MOVE_NONE || MultiPV > 1)
684 assert(pv[0] != MOVE_NONE);
686 cout << "bestmove " << pv[0];
688 if (pv[1] != MOVE_NONE)
689 cout << " ponder " << pv[1];
696 dbg_print_mean(LogFile);
698 if (dbg_show_hit_rate)
699 dbg_print_hit_rate(LogFile);
701 LogFile << "\nNodes: " << pos.nodes_searched()
702 << "\nNodes/second: " << nps(pos)
703 << "\nBest move: " << move_to_san(pos, pv[0]);
706 pos.do_move(pv[0], st);
707 LogFile << "\nPonder move: "
708 << move_to_san(pos, pv[1]) // Works also with MOVE_NONE
711 return rml[0].pv_score;
715 // root_search() is the function which searches the root node. It is
716 // similar to search_pv except that it uses a different move ordering
717 // scheme, prints some information to the standard output and handles
718 // the fail low/high loops.
720 Value root_search(Position& pos, SearchStack* ss, Move* pv, RootMoveList& rml, Value* alphaPtr, Value* betaPtr) {
726 Depth depth, ext, newDepth;
727 Value value, alpha, beta;
728 bool isCheck, moveIsCheck, captureOrPromotion, dangerous;
729 int researchCountFH, researchCountFL;
731 researchCountFH = researchCountFL = 0;
734 isCheck = pos.is_check();
735 depth = (Iteration - 2) * ONE_PLY + InitialDepth;
737 // Step 1. Initialize node (polling is omitted at root)
738 ss->currentMove = ss->bestMove = MOVE_NONE;
740 // Step 2. Check for aborted search (omitted at root)
741 // Step 3. Mate distance pruning (omitted at root)
742 // Step 4. Transposition table lookup (omitted at root)
744 // Step 5. Evaluate the position statically
745 // At root we do this only to get reference value for child nodes
746 ss->evalMargin = VALUE_NONE;
747 ss->eval = isCheck ? VALUE_NONE : evaluate(pos, ss->evalMargin);
749 // Step 6. Razoring (omitted at root)
750 // Step 7. Static null move pruning (omitted at root)
751 // Step 8. Null move search with verification search (omitted at root)
752 // Step 9. Internal iterative deepening (omitted at root)
754 // Step extra. Fail low loop
755 // We start with small aspiration window and in case of fail low, we research
756 // with bigger window until we are not failing low anymore.
759 // Sort the moves before to (re)search
760 rml.set_non_pv_scores(pos);
763 // Step 10. Loop through all moves in the root move list
764 for (int i = 0; i < (int)rml.size() && !AbortSearch; i++)
766 // This is used by time management
767 FirstRootMove = (i == 0);
769 // Save the current node count before the move is searched
770 nodes = pos.nodes_searched();
772 // Pick the next root move, and print the move and the move number to
773 // the standard output.
774 move = ss->currentMove = rml[i].move;
776 if (current_search_time() >= 1000)
777 cout << "info currmove " << move
778 << " currmovenumber " << i + 1 << endl;
780 moveIsCheck = pos.move_is_check(move);
781 captureOrPromotion = pos.move_is_capture_or_promotion(move);
783 // Step 11. Decide the new search depth
784 ext = extension<PV>(pos, move, captureOrPromotion, moveIsCheck, false, false, &dangerous);
785 newDepth = depth + ext;
787 // Step 12. Futility pruning (omitted at root)
789 // Step extra. Fail high loop
790 // If move fails high, we research with bigger window until we are not failing
792 value = -VALUE_INFINITE;
796 // Step 13. Make the move
797 pos.do_move(move, st, ci, moveIsCheck);
799 // Step extra. pv search
800 // We do pv search for first moves (i < MultiPV)
801 // and for fail high research (value > alpha)
802 if (i < MultiPV || value > alpha)
804 // Aspiration window is disabled in multi-pv case
806 alpha = -VALUE_INFINITE;
808 // Full depth PV search, done on first move or after a fail high
809 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, 1);
813 // Step 14. Reduced search
814 // if the move fails high will be re-searched at full depth
815 bool doFullDepthSearch = true;
817 if ( depth >= 3 * ONE_PLY
819 && !captureOrPromotion
820 && !move_is_castle(move))
822 ss->reduction = reduction<PV>(depth, i - MultiPV + 2);
825 assert(newDepth-ss->reduction >= ONE_PLY);
827 // Reduced depth non-pv search using alpha as upperbound
828 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth-ss->reduction, 1);
829 doFullDepthSearch = (value > alpha);
831 ss->reduction = DEPTH_ZERO; // Restore original reduction
834 // Step 15. Full depth search
835 if (doFullDepthSearch)
837 // Full depth non-pv search using alpha as upperbound
838 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, 1);
840 // If we are above alpha then research at same depth but as PV
841 // to get a correct score or eventually a fail high above beta.
843 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, 1);
847 // Step 16. Undo move
850 // Can we exit fail high loop ?
851 if (AbortSearch || value < beta)
854 // We are failing high and going to do a research. It's important to update
855 // the score before research in case we run out of time while researching.
856 rml[i].pv_score = value;
858 extract_pv_from_tt(pos, move, pv);
861 // Print information to the standard output
862 print_pv_info(pos, pv, alpha, beta, value);
864 // Prepare for a research after a fail high, each time with a wider window
865 *betaPtr = beta = Min(beta + AspirationDelta * (1 << researchCountFH), VALUE_INFINITE);
868 } // End of fail high loop
870 // Finished searching the move. If AbortSearch is true, the search
871 // was aborted because the user interrupted the search or because we
872 // ran out of time. In this case, the return value of the search cannot
873 // be trusted, and we break out of the loop without updating the best
878 // Remember searched nodes counts for this move
879 rml[i].nodes += pos.nodes_searched() - nodes;
881 assert(value >= -VALUE_INFINITE && value <= VALUE_INFINITE);
882 assert(value < beta);
884 // Step 17. Check for new best move
885 if (value <= alpha && i >= MultiPV)
886 rml[i].pv_score = -VALUE_INFINITE;
889 // PV move or new best move!
892 rml[i].pv_score = value;
894 extract_pv_from_tt(pos, move, pv);
899 // We record how often the best move has been changed in each
900 // iteration. This information is used for time managment: When
901 // the best move changes frequently, we allocate some more time.
903 BestMoveChangesByIteration[Iteration]++;
905 // Print information to the standard output
906 print_pv_info(pos, pv, alpha, beta, value);
908 // Raise alpha to setup proper non-pv search upper bound
915 for (int j = 0; j < Min(MultiPV, (int)rml.size()); j++)
917 cout << "info multipv " << j + 1
918 << " score " << value_to_uci(rml[j].pv_score)
919 << " depth " << (j <= i ? Iteration : Iteration - 1)
920 << " time " << current_search_time()
921 << " nodes " << pos.nodes_searched()
922 << " nps " << nps(pos)
925 for (int k = 0; rml[j].pv[k] != MOVE_NONE && k < PLY_MAX; k++)
926 cout << rml[j].pv[k] << " ";
930 alpha = rml[Min(i, MultiPV - 1)].pv_score;
932 } // PV move or new best move
934 assert(alpha >= *alphaPtr);
936 AspirationFailLow = (alpha == *alphaPtr);
938 if (AspirationFailLow && StopOnPonderhit)
939 StopOnPonderhit = false;
942 // Can we exit fail low loop ?
943 if (AbortSearch || !AspirationFailLow)
946 // Prepare for a research after a fail low, each time with a wider window
947 *alphaPtr = alpha = Max(alpha - AspirationDelta * (1 << researchCountFL), -VALUE_INFINITE);
952 // Sort the moves before to return
959 // search<>() is the main search function for both PV and non-PV nodes and for
960 // normal and SplitPoint nodes. When called just after a split point the search
961 // is simpler because we have already probed the hash table, done a null move
962 // search, and searched the first move before splitting, we don't have to repeat
963 // all this work again. We also don't need to store anything to the hash table
964 // here: This is taken care of after we return from the split point.
966 template <NodeType PvNode, bool SpNode>
967 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply) {
969 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
970 assert(beta > alpha && beta <= VALUE_INFINITE);
971 assert(PvNode || alpha == beta - 1);
972 assert(ply > 0 && ply < PLY_MAX);
973 assert(pos.thread() >= 0 && pos.thread() < ThreadsMgr.active_threads());
975 Move movesSearched[MOVES_MAX];
979 Move ttMove, move, excludedMove, threatMove;
982 Value bestValue, value, oldAlpha;
983 Value refinedValue, nullValue, futilityBase, futilityValueScaled; // Non-PV specific
984 bool isCheck, singleEvasion, singularExtensionNode, moveIsCheck, captureOrPromotion, dangerous;
985 bool mateThreat = false;
987 int threadID = pos.thread();
988 SplitPoint* sp = NULL;
989 refinedValue = bestValue = value = -VALUE_INFINITE;
991 isCheck = pos.is_check();
997 ttMove = excludedMove = MOVE_NONE;
998 threatMove = sp->threatMove;
999 mateThreat = sp->mateThreat;
1000 goto split_point_start;
1002 else {} // Hack to fix icc's "statement is unreachable" warning
1004 // Step 1. Initialize node and poll. Polling can abort search
1005 ss->currentMove = ss->bestMove = threatMove = MOVE_NONE;
1006 (ss+2)->killers[0] = (ss+2)->killers[1] = (ss+2)->mateKiller = MOVE_NONE;
1008 if (threadID == 0 && ++NodesSincePoll > NodesBetweenPolls)
1014 // Step 2. Check for aborted search and immediate draw
1016 || ThreadsMgr.cutoff_at_splitpoint(threadID)
1018 || ply >= PLY_MAX - 1)
1021 // Step 3. Mate distance pruning
1022 alpha = Max(value_mated_in(ply), alpha);
1023 beta = Min(value_mate_in(ply+1), beta);
1027 // Step 4. Transposition table lookup
1029 // We don't want the score of a partial search to overwrite a previous full search
1030 // TT value, so we use a different position key in case of an excluded move exists.
1031 excludedMove = ss->excludedMove;
1032 posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
1034 tte = TT.retrieve(posKey);
1035 ttMove = tte ? tte->move() : MOVE_NONE;
1037 // At PV nodes, we don't use the TT for pruning, but only for move ordering.
1038 // This is to avoid problems in the following areas:
1040 // * Repetition draw detection
1041 // * Fifty move rule detection
1042 // * Searching for a mate
1043 // * Printing of full PV line
1044 if (!PvNode && tte && ok_to_use_TT(tte, depth, beta, ply))
1047 ss->bestMove = ttMove; // Can be MOVE_NONE
1048 return value_from_tt(tte->value(), ply);
1051 // Step 5. Evaluate the position statically and
1052 // update gain statistics of parent move.
1054 ss->eval = ss->evalMargin = VALUE_NONE;
1057 assert(tte->static_value() != VALUE_NONE);
1059 ss->eval = tte->static_value();
1060 ss->evalMargin = tte->static_value_margin();
1061 refinedValue = refine_eval(tte, ss->eval, ply);
1065 refinedValue = ss->eval = evaluate(pos, ss->evalMargin);
1066 TT.store(posKey, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, MOVE_NONE, ss->eval, ss->evalMargin);
1069 // Save gain for the parent non-capture move
1070 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
1072 // Step 6. Razoring (is omitted in PV nodes)
1074 && depth < RazorDepth
1076 && refinedValue < beta - razor_margin(depth)
1077 && ttMove == MOVE_NONE
1078 && !value_is_mate(beta)
1079 && !pos.has_pawn_on_7th(pos.side_to_move()))
1081 Value rbeta = beta - razor_margin(depth);
1082 Value v = qsearch<NonPV>(pos, ss, rbeta-1, rbeta, DEPTH_ZERO, ply);
1084 // Logically we should return (v + razor_margin(depth)), but
1085 // surprisingly this did slightly weaker in tests.
1089 // Step 7. Static null move pruning (is omitted in PV nodes)
1090 // We're betting that the opponent doesn't have a move that will reduce
1091 // the score by more than futility_margin(depth) if we do a null move.
1093 && !ss->skipNullMove
1094 && depth < RazorDepth
1096 && refinedValue >= beta + futility_margin(depth, 0)
1097 && !value_is_mate(beta)
1098 && pos.non_pawn_material(pos.side_to_move()))
1099 return refinedValue - futility_margin(depth, 0);
1101 // Step 8. Null move search with verification search (is omitted in PV nodes)
1103 && !ss->skipNullMove
1106 && refinedValue >= beta
1107 && !value_is_mate(beta)
1108 && pos.non_pawn_material(pos.side_to_move()))
1110 ss->currentMove = MOVE_NULL;
1112 // Null move dynamic reduction based on depth
1113 int R = 3 + (depth >= 5 * ONE_PLY ? depth / 8 : 0);
1115 // Null move dynamic reduction based on value
1116 if (refinedValue - beta > PawnValueMidgame)
1119 pos.do_null_move(st);
1120 (ss+1)->skipNullMove = true;
1121 nullValue = -search<NonPV>(pos, ss+1, -beta, -alpha, depth-R*ONE_PLY, ply+1);
1122 (ss+1)->skipNullMove = false;
1123 pos.undo_null_move();
1125 if (nullValue >= beta)
1127 // Do not return unproven mate scores
1128 if (nullValue >= value_mate_in(PLY_MAX))
1131 if (depth < 6 * ONE_PLY)
1134 // Do verification search at high depths
1135 ss->skipNullMove = true;
1136 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R*ONE_PLY, ply);
1137 ss->skipNullMove = false;
1144 // The null move failed low, which means that we may be faced with
1145 // some kind of threat. If the previous move was reduced, check if
1146 // the move that refuted the null move was somehow connected to the
1147 // move which was reduced. If a connection is found, return a fail
1148 // low score (which will cause the reduced move to fail high in the
1149 // parent node, which will trigger a re-search with full depth).
1150 if (nullValue == value_mated_in(ply + 2))
1153 threatMove = (ss+1)->bestMove;
1154 if ( depth < ThreatDepth
1155 && (ss-1)->reduction
1156 && threatMove != MOVE_NONE
1157 && connected_moves(pos, (ss-1)->currentMove, threatMove))
1162 // Step 9. Internal iterative deepening
1163 if ( depth >= IIDDepth[PvNode]
1164 && ttMove == MOVE_NONE
1165 && (PvNode || (!isCheck && ss->eval >= beta - IIDMargin)))
1167 Depth d = (PvNode ? depth - 2 * ONE_PLY : depth / 2);
1169 ss->skipNullMove = true;
1170 search<PvNode>(pos, ss, alpha, beta, d, ply);
1171 ss->skipNullMove = false;
1173 ttMove = ss->bestMove;
1174 tte = TT.retrieve(posKey);
1177 // Expensive mate threat detection (only for PV nodes)
1179 mateThreat = pos.has_mate_threat();
1181 split_point_start: // At split points actual search starts from here
1183 // Initialize a MovePicker object for the current position
1184 // FIXME currently MovePicker() c'tor is needless called also in SplitPoint
1185 MovePicker mpBase(pos, ttMove, depth, H, ss, (PvNode ? -VALUE_INFINITE : beta));
1186 MovePicker& mp = SpNode ? *sp->mp : mpBase;
1188 ss->bestMove = MOVE_NONE;
1189 singleEvasion = !SpNode && isCheck && mp.number_of_evasions() == 1;
1190 futilityBase = ss->eval + ss->evalMargin;
1191 singularExtensionNode = !SpNode
1192 && depth >= SingularExtensionDepth[PvNode]
1195 && !excludedMove // Do not allow recursive singular extension search
1196 && (tte->type() & VALUE_TYPE_LOWER)
1197 && tte->depth() >= depth - 3 * ONE_PLY;
1200 lock_grab(&(sp->lock));
1201 bestValue = sp->bestValue;
1204 // Step 10. Loop through moves
1205 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1206 while ( bestValue < beta
1207 && (move = mp.get_next_move()) != MOVE_NONE
1208 && !ThreadsMgr.cutoff_at_splitpoint(threadID))
1210 assert(move_is_ok(move));
1214 moveCount = ++sp->moveCount;
1215 lock_release(&(sp->lock));
1217 else if (move == excludedMove)
1220 movesSearched[moveCount++] = move;
1222 moveIsCheck = pos.move_is_check(move, ci);
1223 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1225 // Step 11. Decide the new search depth
1226 ext = extension<PvNode>(pos, move, captureOrPromotion, moveIsCheck, singleEvasion, mateThreat, &dangerous);
1228 // Singular extension search. If all moves but one fail low on a search of (alpha-s, beta-s),
1229 // and just one fails high on (alpha, beta), then that move is singular and should be extended.
1230 // To verify this we do a reduced search on all the other moves but the ttMove, if result is
1231 // lower then ttValue minus a margin then we extend ttMove.
1232 if ( singularExtensionNode
1233 && move == tte->move()
1236 Value ttValue = value_from_tt(tte->value(), ply);
1238 if (abs(ttValue) < VALUE_KNOWN_WIN)
1240 Value b = ttValue - SingularExtensionMargin;
1241 ss->excludedMove = move;
1242 ss->skipNullMove = true;
1243 Value v = search<NonPV>(pos, ss, b - 1, b, depth / 2, ply);
1244 ss->skipNullMove = false;
1245 ss->excludedMove = MOVE_NONE;
1246 ss->bestMove = MOVE_NONE;
1252 // Update current move (this must be done after singular extension search)
1253 ss->currentMove = move;
1254 newDepth = depth - ONE_PLY + ext;
1256 // Step 12. Futility pruning (is omitted in PV nodes)
1258 && !captureOrPromotion
1262 && !move_is_castle(move))
1264 // Move count based pruning
1265 if ( moveCount >= futility_move_count(depth)
1266 && !(threatMove && connected_threat(pos, move, threatMove))
1267 && bestValue > value_mated_in(PLY_MAX)) // FIXME bestValue is racy
1270 lock_grab(&(sp->lock));
1275 // Value based pruning
1276 // We illogically ignore reduction condition depth >= 3*ONE_PLY for predicted depth,
1277 // but fixing this made program slightly weaker.
1278 Depth predictedDepth = newDepth - reduction<NonPV>(depth, moveCount);
1279 futilityValueScaled = futilityBase + futility_margin(predictedDepth, moveCount)
1280 + H.gain(pos.piece_on(move_from(move)), move_to(move));
1282 if (futilityValueScaled < beta)
1286 lock_grab(&(sp->lock));
1287 if (futilityValueScaled > sp->bestValue)
1288 sp->bestValue = bestValue = futilityValueScaled;
1290 else if (futilityValueScaled > bestValue)
1291 bestValue = futilityValueScaled;
1296 // Prune moves with negative SEE at low depths
1297 if ( predictedDepth < 2 * ONE_PLY
1298 && bestValue > value_mated_in(PLY_MAX)
1299 && pos.see_sign(move) < 0)
1302 lock_grab(&(sp->lock));
1308 // Step 13. Make the move
1309 pos.do_move(move, st, ci, moveIsCheck);
1311 // Step extra. pv search (only in PV nodes)
1312 // The first move in list is the expected PV
1313 if (PvNode && moveCount == 1)
1314 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, ply+1);
1317 // Step 14. Reduced depth search
1318 // If the move fails high will be re-searched at full depth.
1319 bool doFullDepthSearch = true;
1321 if ( depth >= 3 * ONE_PLY
1322 && !captureOrPromotion
1324 && !move_is_castle(move)
1325 && ss->killers[0] != move
1326 && ss->killers[1] != move)
1328 ss->reduction = reduction<PvNode>(depth, moveCount);
1332 alpha = SpNode ? sp->alpha : alpha;
1333 Depth d = newDepth - ss->reduction;
1334 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, ply+1);
1336 doFullDepthSearch = (value > alpha);
1338 ss->reduction = DEPTH_ZERO; // Restore original reduction
1341 // Step 15. Full depth search
1342 if (doFullDepthSearch)
1344 alpha = SpNode ? sp->alpha : alpha;
1345 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, ply+1);
1347 // Step extra. pv search (only in PV nodes)
1348 // Search only for possible new PV nodes, if instead value >= beta then
1349 // parent node fails low with value <= alpha and tries another move.
1350 if (PvNode && value > alpha && value < beta)
1351 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, ply+1);
1355 // Step 16. Undo move
1356 pos.undo_move(move);
1358 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1360 // Step 17. Check for new best move
1363 lock_grab(&(sp->lock));
1364 bestValue = sp->bestValue;
1368 if (value > bestValue && !(SpNode && ThreadsMgr.cutoff_at_splitpoint(threadID)))
1373 sp->bestValue = value;
1377 if (PvNode && value < beta) // We want always alpha < beta
1385 sp->betaCutoff = true;
1387 if (value == value_mate_in(ply + 1))
1388 ss->mateKiller = move;
1390 ss->bestMove = move;
1393 sp->parentSstack->bestMove = move;
1397 // Step 18. Check for split
1399 && depth >= ThreadsMgr.min_split_depth()
1400 && ThreadsMgr.active_threads() > 1
1402 && ThreadsMgr.available_thread_exists(threadID)
1404 && !ThreadsMgr.cutoff_at_splitpoint(threadID)
1406 ThreadsMgr.split<FakeSplit>(pos, ss, ply, &alpha, beta, &bestValue, depth,
1407 threatMove, mateThreat, moveCount, &mp, PvNode);
1410 // Step 19. Check for mate and stalemate
1411 // All legal moves have been searched and if there are
1412 // no legal moves, it must be mate or stalemate.
1413 // If one move was excluded return fail low score.
1414 if (!SpNode && !moveCount)
1415 return excludedMove ? oldAlpha : isCheck ? value_mated_in(ply) : VALUE_DRAW;
1417 // Step 20. Update tables
1418 // If the search is not aborted, update the transposition table,
1419 // history counters, and killer moves.
1420 if (!SpNode && !AbortSearch && !ThreadsMgr.cutoff_at_splitpoint(threadID))
1422 move = bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove;
1423 vt = bestValue <= oldAlpha ? VALUE_TYPE_UPPER
1424 : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT;
1426 TT.store(posKey, value_to_tt(bestValue, ply), vt, depth, move, ss->eval, ss->evalMargin);
1428 // Update killers and history only for non capture moves that fails high
1429 if ( bestValue >= beta
1430 && !pos.move_is_capture_or_promotion(move))
1432 update_history(pos, move, depth, movesSearched, moveCount);
1433 update_killers(move, ss);
1439 // Here we have the lock still grabbed
1440 sp->slaves[threadID] = 0;
1441 sp->nodes += pos.nodes_searched();
1442 lock_release(&(sp->lock));
1445 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1450 // qsearch() is the quiescence search function, which is called by the main
1451 // search function when the remaining depth is zero (or, to be more precise,
1452 // less than ONE_PLY).
1454 template <NodeType PvNode>
1455 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply) {
1457 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1458 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1459 assert(PvNode || alpha == beta - 1);
1461 assert(ply > 0 && ply < PLY_MAX);
1462 assert(pos.thread() >= 0 && pos.thread() < ThreadsMgr.active_threads());
1466 Value bestValue, value, evalMargin, futilityValue, futilityBase;
1467 bool isCheck, enoughMaterial, moveIsCheck, evasionPrunable;
1470 Value oldAlpha = alpha;
1472 ss->bestMove = ss->currentMove = MOVE_NONE;
1474 // Check for an instant draw or maximum ply reached
1475 if (pos.is_draw() || ply >= PLY_MAX - 1)
1478 // Decide whether or not to include checks, this fixes also the type of
1479 // TT entry depth that we are going to use. Note that in qsearch we use
1480 // only two types of depth in TT: DEPTH_QS_CHECKS or DEPTH_QS_NO_CHECKS.
1481 isCheck = pos.is_check();
1482 ttDepth = (isCheck || depth >= DEPTH_QS_CHECKS ? DEPTH_QS_CHECKS : DEPTH_QS_NO_CHECKS);
1484 // Transposition table lookup. At PV nodes, we don't use the TT for
1485 // pruning, but only for move ordering.
1486 tte = TT.retrieve(pos.get_key());
1487 ttMove = (tte ? tte->move() : MOVE_NONE);
1489 if (!PvNode && tte && ok_to_use_TT(tte, ttDepth, beta, ply))
1491 ss->bestMove = ttMove; // Can be MOVE_NONE
1492 return value_from_tt(tte->value(), ply);
1495 // Evaluate the position statically
1498 bestValue = futilityBase = -VALUE_INFINITE;
1499 ss->eval = evalMargin = VALUE_NONE;
1500 enoughMaterial = false;
1506 assert(tte->static_value() != VALUE_NONE);
1508 evalMargin = tte->static_value_margin();
1509 ss->eval = bestValue = tte->static_value();
1512 ss->eval = bestValue = evaluate(pos, evalMargin);
1514 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
1516 // Stand pat. Return immediately if static value is at least beta
1517 if (bestValue >= beta)
1520 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, DEPTH_NONE, MOVE_NONE, ss->eval, evalMargin);
1525 if (PvNode && bestValue > alpha)
1528 // Futility pruning parameters, not needed when in check
1529 futilityBase = ss->eval + evalMargin + FutilityMarginQS;
1530 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1533 // Initialize a MovePicker object for the current position, and prepare
1534 // to search the moves. Because the depth is <= 0 here, only captures,
1535 // queen promotions and checks (only if depth >= DEPTH_QS_CHECKS) will
1537 MovePicker mp(pos, ttMove, depth, H);
1540 // Loop through the moves until no moves remain or a beta cutoff occurs
1541 while ( alpha < beta
1542 && (move = mp.get_next_move()) != MOVE_NONE)
1544 assert(move_is_ok(move));
1546 moveIsCheck = pos.move_is_check(move, ci);
1554 && !move_is_promotion(move)
1555 && !pos.move_is_passed_pawn_push(move))
1557 futilityValue = futilityBase
1558 + pos.endgame_value_of_piece_on(move_to(move))
1559 + (move_is_ep(move) ? PawnValueEndgame : VALUE_ZERO);
1561 if (futilityValue < alpha)
1563 if (futilityValue > bestValue)
1564 bestValue = futilityValue;
1569 // Detect non-capture evasions that are candidate to be pruned
1570 evasionPrunable = isCheck
1571 && bestValue > value_mated_in(PLY_MAX)
1572 && !pos.move_is_capture(move)
1573 && !pos.can_castle(pos.side_to_move());
1575 // Don't search moves with negative SEE values
1577 && (!isCheck || evasionPrunable)
1579 && !move_is_promotion(move)
1580 && pos.see_sign(move) < 0)
1583 // Don't search useless checks
1588 && !pos.move_is_capture_or_promotion(move)
1589 && ss->eval + PawnValueMidgame / 4 < beta
1590 && !check_is_dangerous(pos, move, futilityBase, beta, &bestValue))
1592 if (ss->eval + PawnValueMidgame / 4 > bestValue)
1593 bestValue = ss->eval + PawnValueMidgame / 4;
1598 // Update current move
1599 ss->currentMove = move;
1601 // Make and search the move
1602 pos.do_move(move, st, ci, moveIsCheck);
1603 value = -qsearch<PvNode>(pos, ss+1, -beta, -alpha, depth-ONE_PLY, ply+1);
1604 pos.undo_move(move);
1606 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1609 if (value > bestValue)
1615 ss->bestMove = move;
1620 // All legal moves have been searched. A special case: If we're in check
1621 // and no legal moves were found, it is checkmate.
1622 if (isCheck && bestValue == -VALUE_INFINITE)
1623 return value_mated_in(ply);
1625 // Update transposition table
1626 ValueType vt = (bestValue <= oldAlpha ? VALUE_TYPE_UPPER : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT);
1627 TT.store(pos.get_key(), value_to_tt(bestValue, ply), vt, ttDepth, ss->bestMove, ss->eval, evalMargin);
1629 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1635 // check_is_dangerous() tests if a checking move can be pruned in qsearch().
1636 // bestValue is updated only when returning false because in that case move
1639 bool check_is_dangerous(Position &pos, Move move, Value futilityBase, Value beta, Value *bestValue)
1641 Bitboard b, occ, oldAtt, newAtt, kingAtt;
1642 Square from, to, ksq, victimSq;
1645 Value futilityValue, bv = *bestValue;
1647 from = move_from(move);
1649 them = opposite_color(pos.side_to_move());
1650 ksq = pos.king_square(them);
1651 kingAtt = pos.attacks_from<KING>(ksq);
1652 pc = pos.piece_on(from);
1654 occ = pos.occupied_squares() & ~(1ULL << from) & ~(1ULL << ksq);
1655 oldAtt = pos.attacks_from(pc, from, occ);
1656 newAtt = pos.attacks_from(pc, to, occ);
1658 // Rule 1. Checks which give opponent's king at most one escape square are dangerous
1659 b = kingAtt & ~pos.pieces_of_color(them) & ~newAtt & ~(1ULL << to);
1661 if (!(b && (b & (b - 1))))
1664 // Rule 2. Queen contact check is very dangerous
1665 if ( type_of_piece(pc) == QUEEN
1666 && bit_is_set(kingAtt, to))
1669 // Rule 3. Creating new double threats with checks
1670 b = pos.pieces_of_color(them) & newAtt & ~oldAtt & ~(1ULL << ksq);
1674 victimSq = pop_1st_bit(&b);
1675 futilityValue = futilityBase + pos.endgame_value_of_piece_on(victimSq);
1677 // Note that here we generate illegal "double move"!
1678 if ( futilityValue >= beta
1679 && pos.see_sign(make_move(from, victimSq)) >= 0)
1682 if (futilityValue > bv)
1686 // Update bestValue only if check is not dangerous (because we will prune the move)
1692 // connected_moves() tests whether two moves are 'connected' in the sense
1693 // that the first move somehow made the second move possible (for instance
1694 // if the moving piece is the same in both moves). The first move is assumed
1695 // to be the move that was made to reach the current position, while the
1696 // second move is assumed to be a move from the current position.
1698 bool connected_moves(const Position& pos, Move m1, Move m2) {
1700 Square f1, t1, f2, t2;
1703 assert(m1 && move_is_ok(m1));
1704 assert(m2 && move_is_ok(m2));
1706 // Case 1: The moving piece is the same in both moves
1712 // Case 2: The destination square for m2 was vacated by m1
1718 // Case 3: Moving through the vacated square
1719 if ( piece_is_slider(pos.piece_on(f2))
1720 && bit_is_set(squares_between(f2, t2), f1))
1723 // Case 4: The destination square for m2 is defended by the moving piece in m1
1724 p = pos.piece_on(t1);
1725 if (bit_is_set(pos.attacks_from(p, t1), t2))
1728 // Case 5: Discovered check, checking piece is the piece moved in m1
1729 if ( piece_is_slider(p)
1730 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
1731 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
1733 // discovered_check_candidates() works also if the Position's side to
1734 // move is the opposite of the checking piece.
1735 Color them = opposite_color(pos.side_to_move());
1736 Bitboard dcCandidates = pos.discovered_check_candidates(them);
1738 if (bit_is_set(dcCandidates, f2))
1745 // value_is_mate() checks if the given value is a mate one eventually
1746 // compensated for the ply.
1748 bool value_is_mate(Value value) {
1750 assert(abs(value) <= VALUE_INFINITE);
1752 return value <= value_mated_in(PLY_MAX)
1753 || value >= value_mate_in(PLY_MAX);
1757 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1758 // "plies to mate from the current ply". Non-mate scores are unchanged.
1759 // The function is called before storing a value to the transposition table.
1761 Value value_to_tt(Value v, int ply) {
1763 if (v >= value_mate_in(PLY_MAX))
1766 if (v <= value_mated_in(PLY_MAX))
1773 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score from
1774 // the transposition table to a mate score corrected for the current ply.
1776 Value value_from_tt(Value v, int ply) {
1778 if (v >= value_mate_in(PLY_MAX))
1781 if (v <= value_mated_in(PLY_MAX))
1788 // extension() decides whether a move should be searched with normal depth,
1789 // or with extended depth. Certain classes of moves (checking moves, in
1790 // particular) are searched with bigger depth than ordinary moves and in
1791 // any case are marked as 'dangerous'. Note that also if a move is not
1792 // extended, as example because the corresponding UCI option is set to zero,
1793 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
1794 template <NodeType PvNode>
1795 Depth extension(const Position& pos, Move m, bool captureOrPromotion, bool moveIsCheck,
1796 bool singleEvasion, bool mateThreat, bool* dangerous) {
1798 assert(m != MOVE_NONE);
1800 Depth result = DEPTH_ZERO;
1801 *dangerous = moveIsCheck | singleEvasion | mateThreat;
1805 if (moveIsCheck && pos.see_sign(m) >= 0)
1806 result += CheckExtension[PvNode];
1809 result += SingleEvasionExtension[PvNode];
1812 result += MateThreatExtension[PvNode];
1815 if (pos.type_of_piece_on(move_from(m)) == PAWN)
1817 Color c = pos.side_to_move();
1818 if (relative_rank(c, move_to(m)) == RANK_7)
1820 result += PawnPushTo7thExtension[PvNode];
1823 if (pos.pawn_is_passed(c, move_to(m)))
1825 result += PassedPawnExtension[PvNode];
1830 if ( captureOrPromotion
1831 && pos.type_of_piece_on(move_to(m)) != PAWN
1832 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
1833 - pos.midgame_value_of_piece_on(move_to(m)) == VALUE_ZERO)
1834 && !move_is_promotion(m)
1837 result += PawnEndgameExtension[PvNode];
1842 && captureOrPromotion
1843 && pos.type_of_piece_on(move_to(m)) != PAWN
1844 && pos.see_sign(m) >= 0)
1846 result += ONE_PLY / 2;
1850 return Min(result, ONE_PLY);
1854 // connected_threat() tests whether it is safe to forward prune a move or if
1855 // is somehow coonected to the threat move returned by null search.
1857 bool connected_threat(const Position& pos, Move m, Move threat) {
1859 assert(move_is_ok(m));
1860 assert(threat && move_is_ok(threat));
1861 assert(!pos.move_is_check(m));
1862 assert(!pos.move_is_capture_or_promotion(m));
1863 assert(!pos.move_is_passed_pawn_push(m));
1865 Square mfrom, mto, tfrom, tto;
1867 mfrom = move_from(m);
1869 tfrom = move_from(threat);
1870 tto = move_to(threat);
1872 // Case 1: Don't prune moves which move the threatened piece
1876 // Case 2: If the threatened piece has value less than or equal to the
1877 // value of the threatening piece, don't prune move which defend it.
1878 if ( pos.move_is_capture(threat)
1879 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
1880 || pos.type_of_piece_on(tfrom) == KING)
1881 && pos.move_attacks_square(m, tto))
1884 // Case 3: If the moving piece in the threatened move is a slider, don't
1885 // prune safe moves which block its ray.
1886 if ( piece_is_slider(pos.piece_on(tfrom))
1887 && bit_is_set(squares_between(tfrom, tto), mto)
1888 && pos.see_sign(m) >= 0)
1895 // ok_to_use_TT() returns true if a transposition table score
1896 // can be used at a given point in search.
1898 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
1900 Value v = value_from_tt(tte->value(), ply);
1902 return ( tte->depth() >= depth
1903 || v >= Max(value_mate_in(PLY_MAX), beta)
1904 || v < Min(value_mated_in(PLY_MAX), beta))
1906 && ( ((tte->type() & VALUE_TYPE_LOWER) && v >= beta)
1907 || ((tte->type() & VALUE_TYPE_UPPER) && v < beta));
1911 // refine_eval() returns the transposition table score if
1912 // possible otherwise falls back on static position evaluation.
1914 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
1918 Value v = value_from_tt(tte->value(), ply);
1920 if ( ((tte->type() & VALUE_TYPE_LOWER) && v >= defaultEval)
1921 || ((tte->type() & VALUE_TYPE_UPPER) && v < defaultEval))
1928 // update_history() registers a good move that produced a beta-cutoff
1929 // in history and marks as failures all the other moves of that ply.
1931 void update_history(const Position& pos, Move move, Depth depth,
1932 Move movesSearched[], int moveCount) {
1935 H.success(pos.piece_on(move_from(move)), move_to(move), depth);
1937 for (int i = 0; i < moveCount - 1; i++)
1939 m = movesSearched[i];
1943 if (!pos.move_is_capture_or_promotion(m))
1944 H.failure(pos.piece_on(move_from(m)), move_to(m), depth);
1949 // update_killers() add a good move that produced a beta-cutoff
1950 // among the killer moves of that ply.
1952 void update_killers(Move m, SearchStack* ss) {
1954 if (m == ss->killers[0])
1957 ss->killers[1] = ss->killers[0];
1962 // update_gains() updates the gains table of a non-capture move given
1963 // the static position evaluation before and after the move.
1965 void update_gains(const Position& pos, Move m, Value before, Value after) {
1968 && before != VALUE_NONE
1969 && after != VALUE_NONE
1970 && pos.captured_piece_type() == PIECE_TYPE_NONE
1971 && !move_is_special(m))
1972 H.set_gain(pos.piece_on(move_to(m)), move_to(m), -(before + after));
1976 // current_search_time() returns the number of milliseconds which have passed
1977 // since the beginning of the current search.
1979 int current_search_time() {
1981 return get_system_time() - SearchStartTime;
1985 // value_to_uci() converts a value to a string suitable for use with the UCI protocol
1987 std::string value_to_uci(Value v) {
1989 std::stringstream s;
1991 if (abs(v) < VALUE_MATE - PLY_MAX * ONE_PLY)
1992 s << "cp " << int(v) * 100 / int(PawnValueMidgame); // Scale to pawn = 100
1994 s << "mate " << (v > 0 ? (VALUE_MATE - v + 1) / 2 : -(VALUE_MATE + v) / 2 );
1999 // nps() computes the current nodes/second count.
2001 int nps(const Position& pos) {
2003 int t = current_search_time();
2004 return (t > 0 ? int((pos.nodes_searched() * 1000) / t) : 0);
2008 // poll() performs two different functions: It polls for user input, and it
2009 // looks at the time consumed so far and decides if it's time to abort the
2012 void poll(const Position& pos) {
2014 static int lastInfoTime;
2015 int t = current_search_time();
2018 if (data_available())
2020 // We are line oriented, don't read single chars
2021 std::string command;
2023 if (!std::getline(std::cin, command))
2026 if (command == "quit")
2029 PonderSearch = false;
2033 else if (command == "stop")
2036 PonderSearch = false;
2038 else if (command == "ponderhit")
2042 // Print search information
2046 else if (lastInfoTime > t)
2047 // HACK: Must be a new search where we searched less than
2048 // NodesBetweenPolls nodes during the first second of search.
2051 else if (t - lastInfoTime >= 1000)
2058 if (dbg_show_hit_rate)
2059 dbg_print_hit_rate();
2061 cout << "info nodes " << pos.nodes_searched() << " nps " << nps(pos)
2062 << " time " << t << endl;
2065 // Should we stop the search?
2069 bool stillAtFirstMove = FirstRootMove
2070 && !AspirationFailLow
2071 && t > TimeMgr.available_time();
2073 bool noMoreTime = t > TimeMgr.maximum_time()
2074 || stillAtFirstMove;
2076 if ( (Iteration >= 3 && UseTimeManagement && noMoreTime)
2077 || (ExactMaxTime && t >= ExactMaxTime)
2078 || (Iteration >= 3 && MaxNodes && pos.nodes_searched() >= MaxNodes))
2083 // ponderhit() is called when the program is pondering (i.e. thinking while
2084 // it's the opponent's turn to move) in order to let the engine know that
2085 // it correctly predicted the opponent's move.
2089 int t = current_search_time();
2090 PonderSearch = false;
2092 bool stillAtFirstMove = FirstRootMove
2093 && !AspirationFailLow
2094 && t > TimeMgr.available_time();
2096 bool noMoreTime = t > TimeMgr.maximum_time()
2097 || stillAtFirstMove;
2099 if (Iteration >= 3 && UseTimeManagement && (noMoreTime || StopOnPonderhit))
2104 // init_ss_array() does a fast reset of the first entries of a SearchStack
2105 // array and of all the excludedMove and skipNullMove entries.
2107 void init_ss_array(SearchStack* ss, int size) {
2109 for (int i = 0; i < size; i++, ss++)
2111 ss->excludedMove = MOVE_NONE;
2112 ss->skipNullMove = false;
2113 ss->reduction = DEPTH_ZERO;
2117 ss->killers[0] = ss->killers[1] = ss->mateKiller = MOVE_NONE;
2122 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2123 // while the program is pondering. The point is to work around a wrinkle in
2124 // the UCI protocol: When pondering, the engine is not allowed to give a
2125 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2126 // We simply wait here until one of these commands is sent, and return,
2127 // after which the bestmove and pondermove will be printed (in id_loop()).
2129 void wait_for_stop_or_ponderhit() {
2131 std::string command;
2135 if (!std::getline(std::cin, command))
2138 if (command == "quit")
2143 else if (command == "ponderhit" || command == "stop")
2149 // print_pv_info() prints to standard output and eventually to log file information on
2150 // the current PV line. It is called at each iteration or after a new pv is found.
2152 void print_pv_info(const Position& pos, Move pv[], Value alpha, Value beta, Value value) {
2154 cout << "info depth " << Iteration
2155 << " score " << value_to_uci(value)
2156 << (value >= beta ? " lowerbound" : value <= alpha ? " upperbound" : "")
2157 << " time " << current_search_time()
2158 << " nodes " << pos.nodes_searched()
2159 << " nps " << nps(pos)
2162 for (Move* m = pv; *m != MOVE_NONE; m++)
2169 ValueType t = value >= beta ? VALUE_TYPE_LOWER :
2170 value <= alpha ? VALUE_TYPE_UPPER : VALUE_TYPE_EXACT;
2172 LogFile << pretty_pv(pos, current_search_time(), Iteration, value, t, pv) << endl;
2177 // insert_pv_in_tt() is called at the end of a search iteration, and inserts
2178 // the PV back into the TT. This makes sure the old PV moves are searched
2179 // first, even if the old TT entries have been overwritten.
2181 void insert_pv_in_tt(const Position& pos, Move pv[]) {
2185 Position p(pos, pos.thread());
2186 Value v, m = VALUE_NONE;
2188 for (int i = 0; pv[i] != MOVE_NONE; i++)
2190 tte = TT.retrieve(p.get_key());
2191 if (!tte || tte->move() != pv[i])
2193 v = (p.is_check() ? VALUE_NONE : evaluate(p, m));
2194 TT.store(p.get_key(), VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, pv[i], v, m);
2196 p.do_move(pv[i], st);
2201 // extract_pv_from_tt() builds a PV by adding moves from the transposition table.
2202 // We consider also failing high nodes and not only VALUE_TYPE_EXACT nodes. This
2203 // allow to always have a ponder move even when we fail high at root and also a
2204 // long PV to print that is important for position analysis.
2206 void extract_pv_from_tt(const Position& pos, Move bestMove, Move pv[]) {
2210 Position p(pos, pos.thread());
2213 assert(bestMove != MOVE_NONE);
2216 p.do_move(pv[ply++], st);
2218 while ( (tte = TT.retrieve(p.get_key())) != NULL
2219 && tte->move() != MOVE_NONE
2220 && move_is_legal(p, tte->move())
2222 && (!p.is_draw() || ply < 2))
2224 pv[ply] = tte->move();
2225 p.do_move(pv[ply++], st);
2227 pv[ply] = MOVE_NONE;
2231 // init_thread() is the function which is called when a new thread is
2232 // launched. It simply calls the idle_loop() function with the supplied
2233 // threadID. There are two versions of this function; one for POSIX
2234 // threads and one for Windows threads.
2236 #if !defined(_MSC_VER)
2238 void* init_thread(void* threadID) {
2240 ThreadsMgr.idle_loop(*(int*)threadID, NULL);
2246 DWORD WINAPI init_thread(LPVOID threadID) {
2248 ThreadsMgr.idle_loop(*(int*)threadID, NULL);
2255 /// The ThreadsManager class
2258 // read_uci_options() updates number of active threads and other internal
2259 // parameters according to the UCI options values. It is called before
2260 // to start a new search.
2262 void ThreadsManager::read_uci_options() {
2264 maxThreadsPerSplitPoint = Options["Maximum Number of Threads per Split Point"].value<int>();
2265 minimumSplitDepth = Options["Minimum Split Depth"].value<int>() * ONE_PLY;
2266 useSleepingThreads = Options["Use Sleeping Threads"].value<bool>();
2267 activeThreads = Options["Threads"].value<int>();
2271 // idle_loop() is where the threads are parked when they have no work to do.
2272 // The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint
2273 // object for which the current thread is the master.
2275 void ThreadsManager::idle_loop(int threadID, SplitPoint* sp) {
2277 assert(threadID >= 0 && threadID < MAX_THREADS);
2280 bool allFinished = false;
2284 // Slave threads can exit as soon as AllThreadsShouldExit raises,
2285 // master should exit as last one.
2286 if (allThreadsShouldExit)
2289 threads[threadID].state = THREAD_TERMINATED;
2293 // If we are not thinking, wait for a condition to be signaled
2294 // instead of wasting CPU time polling for work.
2295 while ( threadID >= activeThreads || threads[threadID].state == THREAD_INITIALIZING
2296 || (useSleepingThreads && threads[threadID].state == THREAD_AVAILABLE))
2298 assert(!sp || useSleepingThreads);
2299 assert(threadID != 0 || useSleepingThreads);
2301 if (threads[threadID].state == THREAD_INITIALIZING)
2302 threads[threadID].state = THREAD_AVAILABLE;
2304 // Grab the lock to avoid races with wake_sleeping_thread()
2305 lock_grab(&sleepLock[threadID]);
2307 // If we are master and all slaves have finished do not go to sleep
2308 for (i = 0; sp && i < activeThreads && !sp->slaves[i]; i++) {}
2309 allFinished = (i == activeThreads);
2311 if (allFinished || allThreadsShouldExit)
2313 lock_release(&sleepLock[threadID]);
2317 // Do sleep here after retesting sleep conditions
2318 if (threadID >= activeThreads || threads[threadID].state == THREAD_AVAILABLE)
2319 cond_wait(&sleepCond[threadID], &sleepLock[threadID]);
2321 lock_release(&sleepLock[threadID]);
2324 // If this thread has been assigned work, launch a search
2325 if (threads[threadID].state == THREAD_WORKISWAITING)
2327 assert(!allThreadsShouldExit);
2329 threads[threadID].state = THREAD_SEARCHING;
2331 // Here we call search() with SplitPoint template parameter set to true
2332 SplitPoint* tsp = threads[threadID].splitPoint;
2333 Position pos(*tsp->pos, threadID);
2334 SearchStack* ss = tsp->sstack[threadID] + 1;
2338 search<PV, true>(pos, ss, tsp->alpha, tsp->beta, tsp->depth, tsp->ply);
2340 search<NonPV, true>(pos, ss, tsp->alpha, tsp->beta, tsp->depth, tsp->ply);
2342 assert(threads[threadID].state == THREAD_SEARCHING);
2344 threads[threadID].state = THREAD_AVAILABLE;
2346 // Wake up master thread so to allow it to return from the idle loop in
2347 // case we are the last slave of the split point.
2348 if (useSleepingThreads && threadID != tsp->master && threads[tsp->master].state == THREAD_AVAILABLE)
2349 wake_sleeping_thread(tsp->master);
2352 // If this thread is the master of a split point and all slaves have
2353 // finished their work at this split point, return from the idle loop.
2354 for (i = 0; sp && i < activeThreads && !sp->slaves[i]; i++) {}
2355 allFinished = (i == activeThreads);
2359 // Because sp->slaves[] is reset under lock protection,
2360 // be sure sp->lock has been released before to return.
2361 lock_grab(&(sp->lock));
2362 lock_release(&(sp->lock));
2364 // In helpful master concept a master can help only a sub-tree, and
2365 // because here is all finished is not possible master is booked.
2366 assert(threads[threadID].state == THREAD_AVAILABLE);
2368 threads[threadID].state = THREAD_SEARCHING;
2375 // init_threads() is called during startup. It launches all helper threads,
2376 // and initializes the split point stack and the global locks and condition
2379 void ThreadsManager::init_threads() {
2381 int i, arg[MAX_THREADS];
2384 // Initialize global locks
2387 for (i = 0; i < MAX_THREADS; i++)
2389 lock_init(&sleepLock[i]);
2390 cond_init(&sleepCond[i]);
2393 // Initialize splitPoints[] locks
2394 for (i = 0; i < MAX_THREADS; i++)
2395 for (int j = 0; j < MAX_ACTIVE_SPLIT_POINTS; j++)
2396 lock_init(&(threads[i].splitPoints[j].lock));
2398 // Will be set just before program exits to properly end the threads
2399 allThreadsShouldExit = false;
2401 // Threads will be put all threads to sleep as soon as created
2404 // All threads except the main thread should be initialized to THREAD_INITIALIZING
2405 threads[0].state = THREAD_SEARCHING;
2406 for (i = 1; i < MAX_THREADS; i++)
2407 threads[i].state = THREAD_INITIALIZING;
2409 // Launch the helper threads
2410 for (i = 1; i < MAX_THREADS; i++)
2414 #if !defined(_MSC_VER)
2415 pthread_t pthread[1];
2416 ok = (pthread_create(pthread, NULL, init_thread, (void*)(&arg[i])) == 0);
2417 pthread_detach(pthread[0]);
2419 ok = (CreateThread(NULL, 0, init_thread, (LPVOID)(&arg[i]), 0, NULL) != NULL);
2423 cout << "Failed to create thread number " << i << endl;
2427 // Wait until the thread has finished launching and is gone to sleep
2428 while (threads[i].state == THREAD_INITIALIZING) {}
2433 // exit_threads() is called when the program exits. It makes all the
2434 // helper threads exit cleanly.
2436 void ThreadsManager::exit_threads() {
2438 allThreadsShouldExit = true; // Let the woken up threads to exit idle_loop()
2440 // Wake up all the threads and waits for termination
2441 for (int i = 1; i < MAX_THREADS; i++)
2443 wake_sleeping_thread(i);
2444 while (threads[i].state != THREAD_TERMINATED) {}
2447 // Now we can safely destroy the locks
2448 for (int i = 0; i < MAX_THREADS; i++)
2449 for (int j = 0; j < MAX_ACTIVE_SPLIT_POINTS; j++)
2450 lock_destroy(&(threads[i].splitPoints[j].lock));
2452 lock_destroy(&mpLock);
2454 // Now we can safely destroy the wait conditions
2455 for (int i = 0; i < MAX_THREADS; i++)
2457 lock_destroy(&sleepLock[i]);
2458 cond_destroy(&sleepCond[i]);
2463 // cutoff_at_splitpoint() checks whether a beta cutoff has occurred in
2464 // the thread's currently active split point, or in some ancestor of
2465 // the current split point.
2467 bool ThreadsManager::cutoff_at_splitpoint(int threadID) const {
2469 assert(threadID >= 0 && threadID < activeThreads);
2471 SplitPoint* sp = threads[threadID].splitPoint;
2473 for ( ; sp && !sp->betaCutoff; sp = sp->parent) {}
2478 // thread_is_available() checks whether the thread with threadID "slave" is
2479 // available to help the thread with threadID "master" at a split point. An
2480 // obvious requirement is that "slave" must be idle. With more than two
2481 // threads, this is not by itself sufficient: If "slave" is the master of
2482 // some active split point, it is only available as a slave to the other
2483 // threads which are busy searching the split point at the top of "slave"'s
2484 // split point stack (the "helpful master concept" in YBWC terminology).
2486 bool ThreadsManager::thread_is_available(int slave, int master) const {
2488 assert(slave >= 0 && slave < activeThreads);
2489 assert(master >= 0 && master < activeThreads);
2490 assert(activeThreads > 1);
2492 if (threads[slave].state != THREAD_AVAILABLE || slave == master)
2495 // Make a local copy to be sure doesn't change under our feet
2496 int localActiveSplitPoints = threads[slave].activeSplitPoints;
2498 // No active split points means that the thread is available as
2499 // a slave for any other thread.
2500 if (localActiveSplitPoints == 0 || activeThreads == 2)
2503 // Apply the "helpful master" concept if possible. Use localActiveSplitPoints
2504 // that is known to be > 0, instead of threads[slave].activeSplitPoints that
2505 // could have been set to 0 by another thread leading to an out of bound access.
2506 if (threads[slave].splitPoints[localActiveSplitPoints - 1].slaves[master])
2513 // available_thread_exists() tries to find an idle thread which is available as
2514 // a slave for the thread with threadID "master".
2516 bool ThreadsManager::available_thread_exists(int master) const {
2518 assert(master >= 0 && master < activeThreads);
2519 assert(activeThreads > 1);
2521 for (int i = 0; i < activeThreads; i++)
2522 if (thread_is_available(i, master))
2529 // split() does the actual work of distributing the work at a node between
2530 // several available threads. If it does not succeed in splitting the
2531 // node (because no idle threads are available, or because we have no unused
2532 // split point objects), the function immediately returns. If splitting is
2533 // possible, a SplitPoint object is initialized with all the data that must be
2534 // copied to the helper threads and we tell our helper threads that they have
2535 // been assigned work. This will cause them to instantly leave their idle loops and
2536 // call search().When all threads have returned from search() then split() returns.
2538 template <bool Fake>
2539 void ThreadsManager::split(Position& pos, SearchStack* ss, int ply, Value* alpha,
2540 const Value beta, Value* bestValue, Depth depth, Move threatMove,
2541 bool mateThreat, int moveCount, MovePicker* mp, bool pvNode) {
2542 assert(pos.is_ok());
2543 assert(ply > 0 && ply < PLY_MAX);
2544 assert(*bestValue >= -VALUE_INFINITE);
2545 assert(*bestValue <= *alpha);
2546 assert(*alpha < beta);
2547 assert(beta <= VALUE_INFINITE);
2548 assert(depth > DEPTH_ZERO);
2549 assert(pos.thread() >= 0 && pos.thread() < activeThreads);
2550 assert(activeThreads > 1);
2552 int i, master = pos.thread();
2553 Thread& masterThread = threads[master];
2557 // If no other thread is available to help us, or if we have too many
2558 // active split points, don't split.
2559 if ( !available_thread_exists(master)
2560 || masterThread.activeSplitPoints >= MAX_ACTIVE_SPLIT_POINTS)
2562 lock_release(&mpLock);
2566 // Pick the next available split point object from the split point stack
2567 SplitPoint& splitPoint = masterThread.splitPoints[masterThread.activeSplitPoints++];
2569 // Initialize the split point object
2570 splitPoint.parent = masterThread.splitPoint;
2571 splitPoint.master = master;
2572 splitPoint.betaCutoff = false;
2573 splitPoint.ply = ply;
2574 splitPoint.depth = depth;
2575 splitPoint.threatMove = threatMove;
2576 splitPoint.mateThreat = mateThreat;
2577 splitPoint.alpha = *alpha;
2578 splitPoint.beta = beta;
2579 splitPoint.pvNode = pvNode;
2580 splitPoint.bestValue = *bestValue;
2582 splitPoint.moveCount = moveCount;
2583 splitPoint.pos = &pos;
2584 splitPoint.nodes = 0;
2585 splitPoint.parentSstack = ss;
2586 for (i = 0; i < activeThreads; i++)
2587 splitPoint.slaves[i] = 0;
2589 masterThread.splitPoint = &splitPoint;
2591 // If we are here it means we are not available
2592 assert(masterThread.state != THREAD_AVAILABLE);
2594 int workersCnt = 1; // At least the master is included
2596 // Allocate available threads setting state to THREAD_BOOKED
2597 for (i = 0; !Fake && i < activeThreads && workersCnt < maxThreadsPerSplitPoint; i++)
2598 if (thread_is_available(i, master))
2600 threads[i].state = THREAD_BOOKED;
2601 threads[i].splitPoint = &splitPoint;
2602 splitPoint.slaves[i] = 1;
2606 assert(Fake || workersCnt > 1);
2608 // We can release the lock because slave threads are already booked and master is not available
2609 lock_release(&mpLock);
2611 // Tell the threads that they have work to do. This will make them leave
2612 // their idle loop. But before copy search stack tail for each thread.
2613 for (i = 0; i < activeThreads; i++)
2614 if (i == master || splitPoint.slaves[i])
2616 memcpy(splitPoint.sstack[i], ss - 1, 4 * sizeof(SearchStack));
2618 assert(i == master || threads[i].state == THREAD_BOOKED);
2620 threads[i].state = THREAD_WORKISWAITING; // This makes the slave to exit from idle_loop()
2622 if (useSleepingThreads && i != master)
2623 wake_sleeping_thread(i);
2626 // Everything is set up. The master thread enters the idle loop, from
2627 // which it will instantly launch a search, because its state is
2628 // THREAD_WORKISWAITING. We send the split point as a second parameter to the
2629 // idle loop, which means that the main thread will return from the idle
2630 // loop when all threads have finished their work at this split point.
2631 idle_loop(master, &splitPoint);
2633 // We have returned from the idle loop, which means that all threads are
2634 // finished. Update alpha and bestValue, and return.
2637 *alpha = splitPoint.alpha;
2638 *bestValue = splitPoint.bestValue;
2639 masterThread.activeSplitPoints--;
2640 masterThread.splitPoint = splitPoint.parent;
2641 pos.set_nodes_searched(pos.nodes_searched() + splitPoint.nodes);
2643 lock_release(&mpLock);
2647 // wake_sleeping_thread() wakes up the thread with the given threadID
2648 // when it is time to start a new search.
2650 void ThreadsManager::wake_sleeping_thread(int threadID) {
2652 lock_grab(&sleepLock[threadID]);
2653 cond_signal(&sleepCond[threadID]);
2654 lock_release(&sleepLock[threadID]);
2658 /// The RootMoveList class
2660 // RootMoveList c'tor
2662 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) {
2664 SearchStack ss[PLY_MAX_PLUS_2];
2665 MoveStack mlist[MOVES_MAX];
2667 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
2669 // Initialize search stack
2670 init_ss_array(ss, PLY_MAX_PLUS_2);
2671 ss[0].eval = ss[0].evalMargin = VALUE_NONE;
2673 // Generate all legal moves
2674 MoveStack* last = generate_moves(pos, mlist);
2676 // Add each move to the moves[] array
2677 for (MoveStack* cur = mlist; cur != last; cur++)
2679 bool includeMove = includeAllMoves;
2681 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
2682 includeMove = (searchMoves[k] == cur->move);
2687 // Find a quick score for the move and add to the list
2689 rm.move = ss[0].currentMove = rm.pv[0] = cur->move;
2690 rm.pv[1] = MOVE_NONE;
2691 pos.do_move(cur->move, st);
2692 rm.pv_score = -qsearch<PV>(pos, ss+1, -VALUE_INFINITE, VALUE_INFINITE, DEPTH_ZERO, 1);
2693 pos.undo_move(cur->move);
2699 // Score root moves using the standard way used in main search, the moves
2700 // are scored according to the order in which are returned by MovePicker.
2701 // This is the second order score that is used to compare the moves when
2702 // the first order pv scores of both moves are equal.
2704 void RootMoveList::set_non_pv_scores(const Position& pos)
2707 Value score = VALUE_ZERO;
2708 MovePicker mp(pos, MOVE_NONE, ONE_PLY, H);
2710 while ((move = mp.get_next_move()) != MOVE_NONE)
2711 for (Base::iterator it = begin(); it != end(); ++it)
2712 if (it->move == move)
2714 it->non_pv_score = score--;