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/>.
44 #include "ucioption.h"
50 //// Local definitions
56 enum NodeType { NonPV, PV };
58 // Set to true to force running with one thread.
59 // Used for debugging SMP code.
60 const bool FakeSplit = false;
62 // ThreadsManager class is used to handle all the threads related stuff in search,
63 // init, starting, parking and, the most important, launching a slave thread at a
64 // split point are what this class does. All the access to shared thread data is
65 // done through this class, so that we avoid using global variables instead.
67 class ThreadsManager {
68 /* As long as the single ThreadsManager object is defined as a global we don't
69 need to explicitly initialize to zero its data members because variables with
70 static storage duration are automatically set to zero before enter main()
76 int active_threads() const { return ActiveThreads; }
77 void set_active_threads(int newActiveThreads) { ActiveThreads = newActiveThreads; }
78 void incrementNodeCounter(int threadID) { threads[threadID].nodes++; }
79 void incrementBetaCounter(Color us, Depth d, int threadID) { threads[threadID].betaCutOffs[us] += unsigned(d); }
81 void resetNodeCounters();
82 void resetBetaCounters();
83 int64_t nodes_searched() const;
84 void get_beta_counters(Color us, int64_t& our, int64_t& their) const;
85 bool available_thread_exists(int master) const;
86 bool thread_is_available(int slave, int master) const;
87 bool thread_should_stop(int threadID) const;
88 void wake_sleeping_threads();
89 void put_threads_to_sleep();
90 void idle_loop(int threadID, SplitPoint* sp);
93 void split(const 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);
100 volatile bool AllThreadsShouldExit, AllThreadsShouldSleep;
101 Thread threads[MAX_THREADS];
103 Lock MPLock, WaitLock;
105 #if !defined(_MSC_VER)
106 pthread_cond_t WaitCond;
108 HANDLE SitIdleEvent[MAX_THREADS];
114 // RootMove struct is used for moves at the root at the tree. For each
115 // root move, we store a score, a node count, and a PV (really a refutation
116 // in the case of moves which fail low).
120 RootMove() { nodes = cumulativeNodes = ourBeta = theirBeta = 0ULL; }
122 // RootMove::operator<() is the comparison function used when
123 // sorting the moves. A move m1 is considered to be better
124 // than a move m2 if it has a higher score, or if the moves
125 // have equal score but m1 has the higher beta cut-off count.
126 bool operator<(const RootMove& m) const {
128 return score != m.score ? score < m.score : theirBeta <= m.theirBeta;
133 int64_t nodes, cumulativeNodes, ourBeta, theirBeta;
134 Move pv[PLY_MAX_PLUS_2];
138 // The RootMoveList class is essentially an array of RootMove objects, with
139 // a handful of methods for accessing the data in the individual moves.
144 RootMoveList(Position& pos, Move searchMoves[]);
146 int move_count() const { return count; }
147 Move get_move(int moveNum) const { return moves[moveNum].move; }
148 Value get_move_score(int moveNum) const { return moves[moveNum].score; }
149 void set_move_score(int moveNum, Value score) { moves[moveNum].score = score; }
150 Move get_move_pv(int moveNum, int i) const { return moves[moveNum].pv[i]; }
151 int64_t get_move_cumulative_nodes(int moveNum) const { return moves[moveNum].cumulativeNodes; }
153 void set_move_nodes(int moveNum, int64_t nodes);
154 void set_beta_counters(int moveNum, int64_t our, int64_t their);
155 void set_move_pv(int moveNum, const Move pv[]);
157 void sort_multipv(int n);
160 static const int MaxRootMoves = 500;
161 RootMove moves[MaxRootMoves];
170 // Maximum depth for razoring
171 const Depth RazorDepth = 4 * OnePly;
173 // Dynamic razoring margin based on depth
174 inline Value razor_margin(Depth d) { return Value(0x200 + 0x10 * int(d)); }
176 // Step 8. Null move search with verification search
178 // Null move margin. A null move search will not be done if the static
179 // evaluation of the position is more than NullMoveMargin below beta.
180 const Value NullMoveMargin = Value(0x200);
182 // Maximum depth for use of dynamic threat detection when null move fails low
183 const Depth ThreatDepth = 5 * OnePly;
185 // Step 9. Internal iterative deepening
187 // Minimum depth for use of internal iterative deepening
188 const Depth IIDDepth[2] = { 8 * OnePly /* non-PV */, 5 * OnePly /* PV */};
190 // At Non-PV nodes we do an internal iterative deepening search
191 // when the static evaluation is bigger then beta - IIDMargin.
192 const Value IIDMargin = Value(0x100);
194 // Step 11. Decide the new search depth
196 // Extensions. Configurable UCI options
197 // Array index 0 is used at non-PV nodes, index 1 at PV nodes.
198 Depth CheckExtension[2], SingleEvasionExtension[2], PawnPushTo7thExtension[2];
199 Depth PassedPawnExtension[2], PawnEndgameExtension[2], MateThreatExtension[2];
201 // Minimum depth for use of singular extension
202 const Depth SingularExtensionDepth[2] = { 7 * OnePly /* non-PV */, 6 * OnePly /* PV */};
204 // If the TT move is at least SingularExtensionMargin better then the
205 // remaining ones we will extend it.
206 const Value SingularExtensionMargin = Value(0x20);
208 // Step 12. Futility pruning
210 // Futility margin for quiescence search
211 const Value FutilityMarginQS = Value(0x80);
213 // Futility lookup tables (initialized at startup) and their getter functions
214 int32_t FutilityMarginsMatrix[16][64]; // [depth][moveNumber]
215 int FutilityMoveCountArray[32]; // [depth]
217 inline Value futility_margin(Depth d, int mn) { return Value(d < 7 * OnePly ? FutilityMarginsMatrix[Max(d, 1)][Min(mn, 63)] : 2 * VALUE_INFINITE); }
218 inline int futility_move_count(Depth d) { return d < 16 * OnePly ? FutilityMoveCountArray[d] : 512; }
220 // Step 14. Reduced search
222 // Reduction lookup tables (initialized at startup) and their getter functions
223 int8_t ReductionMatrix[2][64][64]; // [pv][depth][moveNumber]
225 template <NodeType PV>
226 inline Depth reduction(Depth d, int mn) { return (Depth) ReductionMatrix[PV][Min(d / 2, 63)][Min(mn, 63)]; }
228 // Common adjustments
230 // Search depth at iteration 1
231 const Depth InitialDepth = OnePly;
233 // Easy move margin. An easy move candidate must be at least this much
234 // better than the second best move.
235 const Value EasyMoveMargin = Value(0x200);
243 // Scores and number of times the best move changed for each iteration
244 Value ValueByIteration[PLY_MAX_PLUS_2];
245 int BestMoveChangesByIteration[PLY_MAX_PLUS_2];
247 // Search window management
253 // Time managment variables
254 int SearchStartTime, MaxNodes, MaxDepth, OptimumSearchTime;
255 int MaximumSearchTime, ExtraSearchTime, ExactMaxTime;
256 bool UseTimeManagement, InfiniteSearch, PonderSearch, StopOnPonderhit;
257 bool FirstRootMove, AbortSearch, Quit, AspirationFailLow;
261 std::ofstream LogFile;
263 // Multi-threads related variables
264 Depth MinimumSplitDepth;
265 int MaxThreadsPerSplitPoint;
268 // Node counters, used only by thread[0] but try to keep in different cache
269 // lines (64 bytes each) from the heavy multi-thread read accessed variables.
271 int NodesBetweenPolls = 30000;
278 Value id_loop(const Position& pos, Move searchMoves[]);
279 Value root_search(Position& pos, SearchStack* ss, Move* pv, RootMoveList& rml, Value* alphaPtr, Value* betaPtr);
281 template <NodeType PvNode>
282 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply);
284 template <NodeType PvNode>
285 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply);
287 template <NodeType PvNode>
288 void sp_search(SplitPoint* sp, int threadID);
290 template <NodeType PvNode>
291 Depth extension(const Position& pos, Move m, bool captureOrPromotion, bool moveIsCheck, bool singleEvasion, bool mateThreat, bool* dangerous);
293 bool connected_moves(const Position& pos, Move m1, Move m2);
294 bool value_is_mate(Value value);
295 Value value_to_tt(Value v, int ply);
296 Value value_from_tt(Value v, int ply);
297 bool move_is_killer(Move m, SearchStack* ss);
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_killers(Move m, SearchStack* ss);
303 void update_gains(const Position& pos, Move move, Value before, Value after);
305 int current_search_time();
306 std::string value_to_uci(Value v);
310 void wait_for_stop_or_ponderhit();
311 void init_ss_array(SearchStack* ss, int size);
312 void print_pv_info(const Position& pos, Move pv[], Value alpha, Value beta, Value value);
313 void insert_pv_in_tt(const Position& pos, Move pv[]);
314 void extract_pv_from_tt(const Position& pos, Move bestMove, Move pv[]);
316 #if !defined(_MSC_VER)
317 void *init_thread(void *threadID);
319 DWORD WINAPI init_thread(LPVOID threadID);
329 /// init_threads(), exit_threads() and nodes_searched() are helpers to
330 /// give accessibility to some TM methods from outside of current file.
332 void init_threads() { TM.init_threads(); }
333 void exit_threads() { TM.exit_threads(); }
334 int64_t nodes_searched() { return TM.nodes_searched(); }
337 /// init_search() is called during startup. It initializes various lookup tables
341 int d; // depth (OnePly == 2)
342 int hd; // half depth (OnePly == 1)
345 // Init reductions array
346 for (hd = 1; hd < 64; hd++) for (mc = 1; mc < 64; mc++)
348 double pvRed = 0.33 + log(double(hd)) * log(double(mc)) / 4.5;
349 double nonPVRed = 0.33 + log(double(hd)) * log(double(mc)) / 2.25;
350 ReductionMatrix[PV][hd][mc] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(OnePly)) : 0);
351 ReductionMatrix[NonPV][hd][mc] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(OnePly)) : 0);
354 // Init futility margins array
355 for (d = 1; d < 16; d++) for (mc = 0; mc < 64; mc++)
356 FutilityMarginsMatrix[d][mc] = 112 * int(log(double(d * d) / 2) / log(2.0) + 1.001) - 8 * mc + 45;
358 // Init futility move count array
359 for (d = 0; d < 32; d++)
360 FutilityMoveCountArray[d] = 3 + (1 << (3 * d / 8));
364 /// perft() is our utility to verify move generation is bug free. All the legal
365 /// moves up to given depth are generated and counted and the sum returned.
367 int perft(Position& pos, Depth depth)
372 MovePicker mp(pos, MOVE_NONE, depth, H);
374 // If we are at the last ply we don't need to do and undo
375 // the moves, just to count them.
376 if (depth <= OnePly) // Replace with '<' to test also qsearch
378 while (mp.get_next_move()) sum++;
382 // Loop through all legal moves
384 while ((move = mp.get_next_move()) != MOVE_NONE)
386 pos.do_move(move, st, ci, pos.move_is_check(move, ci));
387 sum += perft(pos, depth - OnePly);
394 /// think() is the external interface to Stockfish's search, and is called when
395 /// the program receives the UCI 'go' command. It initializes various
396 /// search-related global variables, and calls root_search(). It returns false
397 /// when a quit command is received during the search.
399 bool think(const Position& pos, bool infinite, bool ponder, int time[], int increment[],
400 int movesToGo, int maxDepth, int maxNodes, int maxTime, Move searchMoves[]) {
402 // Initialize global search variables
403 StopOnPonderhit = AbortSearch = Quit = AspirationFailLow = false;
404 OptimumSearchTime = MaximumSearchTime = ExtraSearchTime = 0;
406 TM.resetNodeCounters();
407 SearchStartTime = get_system_time();
408 ExactMaxTime = maxTime;
411 InfiniteSearch = infinite;
412 PonderSearch = ponder;
413 UseTimeManagement = !ExactMaxTime && !MaxDepth && !MaxNodes && !InfiniteSearch;
415 // Look for a book move, only during games, not tests
416 if (UseTimeManagement && get_option_value_bool("OwnBook"))
418 if (get_option_value_string("Book File") != OpeningBook.file_name())
419 OpeningBook.open(get_option_value_string("Book File"));
421 Move bookMove = OpeningBook.get_move(pos, get_option_value_bool("Best Book Move"));
422 if (bookMove != MOVE_NONE)
425 wait_for_stop_or_ponderhit();
427 cout << "bestmove " << bookMove << endl;
432 // Read UCI option values
433 TT.set_size(get_option_value_int("Hash"));
434 if (button_was_pressed("Clear Hash"))
437 CheckExtension[1] = Depth(get_option_value_int("Check Extension (PV nodes)"));
438 CheckExtension[0] = Depth(get_option_value_int("Check Extension (non-PV nodes)"));
439 SingleEvasionExtension[1] = Depth(get_option_value_int("Single Evasion Extension (PV nodes)"));
440 SingleEvasionExtension[0] = Depth(get_option_value_int("Single Evasion Extension (non-PV nodes)"));
441 PawnPushTo7thExtension[1] = Depth(get_option_value_int("Pawn Push to 7th Extension (PV nodes)"));
442 PawnPushTo7thExtension[0] = Depth(get_option_value_int("Pawn Push to 7th Extension (non-PV nodes)"));
443 PassedPawnExtension[1] = Depth(get_option_value_int("Passed Pawn Extension (PV nodes)"));
444 PassedPawnExtension[0] = Depth(get_option_value_int("Passed Pawn Extension (non-PV nodes)"));
445 PawnEndgameExtension[1] = Depth(get_option_value_int("Pawn Endgame Extension (PV nodes)"));
446 PawnEndgameExtension[0] = Depth(get_option_value_int("Pawn Endgame Extension (non-PV nodes)"));
447 MateThreatExtension[1] = Depth(get_option_value_int("Mate Threat Extension (PV nodes)"));
448 MateThreatExtension[0] = Depth(get_option_value_int("Mate Threat Extension (non-PV nodes)"));
450 MinimumSplitDepth = get_option_value_int("Minimum Split Depth") * OnePly;
451 MaxThreadsPerSplitPoint = get_option_value_int("Maximum Number of Threads per Split Point");
452 MultiPV = get_option_value_int("MultiPV");
453 Chess960 = get_option_value_bool("UCI_Chess960");
454 UseLogFile = get_option_value_bool("Use Search Log");
457 LogFile.open(get_option_value_string("Search Log Filename").c_str(), std::ios::out | std::ios::app);
459 read_weights(pos.side_to_move());
461 // Set the number of active threads
462 int newActiveThreads = get_option_value_int("Threads");
463 if (newActiveThreads != TM.active_threads())
465 TM.set_active_threads(newActiveThreads);
466 init_eval(TM.active_threads());
469 // Wake up sleeping threads
470 TM.wake_sleeping_threads();
473 int myTime = time[pos.side_to_move()];
474 int myIncrement = increment[pos.side_to_move()];
475 if (UseTimeManagement)
477 get_search_times(myTime, myIncrement, movesToGo, pos.startpos_ply_counter(),
478 &OptimumSearchTime, &MaximumSearchTime);
480 if (get_option_value_bool("Ponder"))
482 OptimumSearchTime += OptimumSearchTime / 4;
483 OptimumSearchTime = Min(OptimumSearchTime, MaximumSearchTime);
487 // Set best NodesBetweenPolls interval to avoid lagging under
488 // heavy time pressure.
490 NodesBetweenPolls = Min(MaxNodes, 30000);
491 else if (myTime && myTime < 1000)
492 NodesBetweenPolls = 1000;
493 else if (myTime && myTime < 5000)
494 NodesBetweenPolls = 5000;
496 NodesBetweenPolls = 30000;
498 // Write search information to log file
500 LogFile << "Searching: " << pos.to_fen() << endl
501 << "infinite: " << infinite
502 << " ponder: " << ponder
503 << " time: " << myTime
504 << " increment: " << myIncrement
505 << " moves to go: " << movesToGo << endl;
507 // We're ready to start thinking. Call the iterative deepening loop function
508 id_loop(pos, searchMoves);
513 TM.put_threads_to_sleep();
521 // id_loop() is the main iterative deepening loop. It calls root_search
522 // repeatedly with increasing depth until the allocated thinking time has
523 // been consumed, the user stops the search, or the maximum search depth is
526 Value id_loop(const Position& pos, Move searchMoves[]) {
528 Position p(pos, pos.thread());
529 SearchStack ss[PLY_MAX_PLUS_2];
530 Move pv[PLY_MAX_PLUS_2];
531 Move EasyMove = MOVE_NONE;
532 Value value, alpha = -VALUE_INFINITE, beta = VALUE_INFINITE;
534 // Moves to search are verified, copied, scored and sorted
535 RootMoveList rml(p, searchMoves);
537 // Handle special case of searching on a mate/stale position
538 if (rml.move_count() == 0)
541 wait_for_stop_or_ponderhit();
543 return pos.is_check() ? -VALUE_MATE : VALUE_DRAW;
546 // Print RootMoveList startup scoring to the standard output,
547 // so to output information also for iteration 1.
548 cout << "info depth " << 1
549 << "\ninfo depth " << 1
550 << " score " << value_to_uci(rml.get_move_score(0))
551 << " time " << current_search_time()
552 << " nodes " << TM.nodes_searched()
554 << " pv " << rml.get_move(0) << "\n";
559 init_ss_array(ss, PLY_MAX_PLUS_2);
560 pv[0] = pv[1] = MOVE_NONE;
561 ValueByIteration[1] = rml.get_move_score(0);
564 // Is one move significantly better than others after initial scoring ?
565 if ( rml.move_count() == 1
566 || rml.get_move_score(0) > rml.get_move_score(1) + EasyMoveMargin)
567 EasyMove = rml.get_move(0);
569 // Iterative deepening loop
570 while (Iteration < PLY_MAX)
572 // Initialize iteration
574 BestMoveChangesByIteration[Iteration] = 0;
576 cout << "info depth " << Iteration << endl;
578 // Calculate dynamic aspiration window based on previous iterations
579 if (MultiPV == 1 && Iteration >= 6 && abs(ValueByIteration[Iteration - 1]) < VALUE_KNOWN_WIN)
581 int prevDelta1 = ValueByIteration[Iteration - 1] - ValueByIteration[Iteration - 2];
582 int prevDelta2 = ValueByIteration[Iteration - 2] - ValueByIteration[Iteration - 3];
584 AspirationDelta = Max(abs(prevDelta1) + abs(prevDelta2) / 2, 16);
585 AspirationDelta = (AspirationDelta + 7) / 8 * 8; // Round to match grainSize
587 alpha = Max(ValueByIteration[Iteration - 1] - AspirationDelta, -VALUE_INFINITE);
588 beta = Min(ValueByIteration[Iteration - 1] + AspirationDelta, VALUE_INFINITE);
591 // Search to the current depth, rml is updated and sorted, alpha and beta could change
592 value = root_search(p, ss, pv, rml, &alpha, &beta);
594 // Write PV to transposition table, in case the relevant entries have
595 // been overwritten during the search.
596 insert_pv_in_tt(p, pv);
599 break; // Value cannot be trusted. Break out immediately!
601 //Save info about search result
602 ValueByIteration[Iteration] = value;
604 // Drop the easy move if differs from the new best move
605 if (pv[0] != EasyMove)
606 EasyMove = MOVE_NONE;
608 if (UseTimeManagement)
611 bool stopSearch = false;
613 // Stop search early if there is only a single legal move,
614 // we search up to Iteration 6 anyway to get a proper score.
615 if (Iteration >= 6 && rml.move_count() == 1)
618 // Stop search early when the last two iterations returned a mate score
620 && abs(ValueByIteration[Iteration]) >= abs(VALUE_MATE) - 100
621 && abs(ValueByIteration[Iteration-1]) >= abs(VALUE_MATE) - 100)
624 // Stop search early if one move seems to be much better than the others
625 int64_t nodes = TM.nodes_searched();
628 && ( ( rml.get_move_cumulative_nodes(0) > (nodes * 85) / 100
629 && current_search_time() > OptimumSearchTime / 16)
630 ||( rml.get_move_cumulative_nodes(0) > (nodes * 98) / 100
631 && current_search_time() > OptimumSearchTime / 32)))
634 // Add some extra time if the best move has changed during the last two iterations
635 if (Iteration > 5 && Iteration <= 50)
636 ExtraSearchTime = BestMoveChangesByIteration[Iteration] * (OptimumSearchTime / 2)
637 + BestMoveChangesByIteration[Iteration-1] * (OptimumSearchTime / 3);
639 // Stop search if most of MaxSearchTime is consumed at the end of the
640 // iteration. We probably don't have enough time to search the first
641 // move at the next iteration anyway.
642 if (current_search_time() > ((OptimumSearchTime + ExtraSearchTime) * 80) / 128)
648 StopOnPonderhit = true;
654 if (MaxDepth && Iteration >= MaxDepth)
658 // If we are pondering or in infinite search, we shouldn't print the
659 // best move before we are told to do so.
660 if (!AbortSearch && (PonderSearch || InfiniteSearch))
661 wait_for_stop_or_ponderhit();
663 // Print final search statistics
664 cout << "info nodes " << TM.nodes_searched()
666 << " time " << current_search_time() << endl;
668 // Print the best move and the ponder move to the standard output
669 if (pv[0] == MOVE_NONE)
671 pv[0] = rml.get_move(0);
675 assert(pv[0] != MOVE_NONE);
677 cout << "bestmove " << pv[0];
679 if (pv[1] != MOVE_NONE)
680 cout << " ponder " << pv[1];
687 dbg_print_mean(LogFile);
689 if (dbg_show_hit_rate)
690 dbg_print_hit_rate(LogFile);
692 LogFile << "\nNodes: " << TM.nodes_searched()
693 << "\nNodes/second: " << nps()
694 << "\nBest move: " << move_to_san(p, pv[0]);
697 p.do_move(pv[0], st);
698 LogFile << "\nPonder move: "
699 << move_to_san(p, pv[1]) // Works also with MOVE_NONE
702 return rml.get_move_score(0);
706 // root_search() is the function which searches the root node. It is
707 // similar to search_pv except that it uses a different move ordering
708 // scheme, prints some information to the standard output and handles
709 // the fail low/high loops.
711 Value root_search(Position& pos, SearchStack* ss, Move* pv, RootMoveList& rml, Value* alphaPtr, Value* betaPtr) {
718 Depth depth, ext, newDepth;
719 Value value, alpha, beta;
720 bool isCheck, moveIsCheck, captureOrPromotion, dangerous;
721 int researchCountFH, researchCountFL;
723 researchCountFH = researchCountFL = 0;
726 isCheck = pos.is_check();
728 // Step 1. Initialize node (polling is omitted at root)
729 ss->currentMove = ss->bestMove = MOVE_NONE;
731 // Step 2. Check for aborted search (omitted at root)
732 // Step 3. Mate distance pruning (omitted at root)
733 // Step 4. Transposition table lookup (omitted at root)
735 // Step 5. Evaluate the position statically
736 // At root we do this only to get reference value for child nodes
737 ss->eval = isCheck ? VALUE_NONE : evaluate(pos, ei);
739 // Step 6. Razoring (omitted at root)
740 // Step 7. Static null move pruning (omitted at root)
741 // Step 8. Null move search with verification search (omitted at root)
742 // Step 9. Internal iterative deepening (omitted at root)
744 // Step extra. Fail low loop
745 // We start with small aspiration window and in case of fail low, we research
746 // with bigger window until we are not failing low anymore.
749 // Sort the moves before to (re)search
752 // Step 10. Loop through all moves in the root move list
753 for (int i = 0; i < rml.move_count() && !AbortSearch; i++)
755 // This is used by time management
756 FirstRootMove = (i == 0);
758 // Save the current node count before the move is searched
759 nodes = TM.nodes_searched();
761 // Reset beta cut-off counters
762 TM.resetBetaCounters();
764 // Pick the next root move, and print the move and the move number to
765 // the standard output.
766 move = ss->currentMove = rml.get_move(i);
768 if (current_search_time() >= 1000)
769 cout << "info currmove " << move
770 << " currmovenumber " << i + 1 << endl;
772 moveIsCheck = pos.move_is_check(move);
773 captureOrPromotion = pos.move_is_capture_or_promotion(move);
775 // Step 11. Decide the new search depth
776 depth = (Iteration - 2) * OnePly + InitialDepth;
777 ext = extension<PV>(pos, move, captureOrPromotion, moveIsCheck, false, false, &dangerous);
778 newDepth = depth + ext;
780 // Step 12. Futility pruning (omitted at root)
782 // Step extra. Fail high loop
783 // If move fails high, we research with bigger window until we are not failing
785 value = - VALUE_INFINITE;
789 // Step 13. Make the move
790 pos.do_move(move, st, ci, moveIsCheck);
792 // Step extra. pv search
793 // We do pv search for first moves (i < MultiPV)
794 // and for fail high research (value > alpha)
795 if (i < MultiPV || value > alpha)
797 // Aspiration window is disabled in multi-pv case
799 alpha = -VALUE_INFINITE;
801 // Full depth PV search, done on first move or after a fail high
802 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, 1);
806 // Step 14. Reduced search
807 // if the move fails high will be re-searched at full depth
808 bool doFullDepthSearch = true;
810 if ( depth >= 3 * OnePly
812 && !captureOrPromotion
813 && !move_is_castle(move))
815 ss->reduction = reduction<PV>(depth, i - MultiPV + 2);
818 assert(newDepth-ss->reduction >= OnePly);
820 // Reduced depth non-pv search using alpha as upperbound
821 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth-ss->reduction, 1);
822 doFullDepthSearch = (value > alpha);
825 // The move failed high, but if reduction is very big we could
826 // face a false positive, retry with a less aggressive reduction,
827 // if the move fails high again then go with full depth search.
828 if (doFullDepthSearch && ss->reduction > 2 * OnePly)
830 assert(newDepth - OnePly >= OnePly);
832 ss->reduction = OnePly;
833 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth-ss->reduction, 1);
834 doFullDepthSearch = (value > alpha);
836 ss->reduction = Depth(0); // Restore original reduction
839 // Step 15. Full depth search
840 if (doFullDepthSearch)
842 // Full depth non-pv search using alpha as upperbound
843 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, 1);
845 // If we are above alpha then research at same depth but as PV
846 // to get a correct score or eventually a fail high above beta.
848 value = -search<PV>(pos, ss+1, -beta, -alpha, newDepth, 1);
852 // Step 16. Undo move
855 // Can we exit fail high loop ?
856 if (AbortSearch || value < beta)
859 // We are failing high and going to do a research. It's important to update
860 // the score before research in case we run out of time while researching.
861 rml.set_move_score(i, value);
863 extract_pv_from_tt(pos, move, pv);
864 rml.set_move_pv(i, pv);
866 // Print information to the standard output
867 print_pv_info(pos, pv, alpha, beta, value);
869 // Prepare for a research after a fail high, each time with a wider window
870 *betaPtr = beta = Min(beta + AspirationDelta * (1 << researchCountFH), VALUE_INFINITE);
873 } // End of fail high loop
875 // Finished searching the move. If AbortSearch is true, the search
876 // was aborted because the user interrupted the search or because we
877 // ran out of time. In this case, the return value of the search cannot
878 // be trusted, and we break out of the loop without updating the best
883 // Remember beta-cutoff and searched nodes counts for this move. The
884 // info is used to sort the root moves for the next iteration.
886 TM.get_beta_counters(pos.side_to_move(), our, their);
887 rml.set_beta_counters(i, our, their);
888 rml.set_move_nodes(i, TM.nodes_searched() - nodes);
890 assert(value >= -VALUE_INFINITE && value <= VALUE_INFINITE);
891 assert(value < beta);
893 // Step 17. Check for new best move
894 if (value <= alpha && i >= MultiPV)
895 rml.set_move_score(i, -VALUE_INFINITE);
898 // PV move or new best move!
901 rml.set_move_score(i, value);
903 extract_pv_from_tt(pos, move, pv);
904 rml.set_move_pv(i, pv);
908 // We record how often the best move has been changed in each
909 // iteration. This information is used for time managment: When
910 // the best move changes frequently, we allocate some more time.
912 BestMoveChangesByIteration[Iteration]++;
914 // Print information to the standard output
915 print_pv_info(pos, pv, alpha, beta, value);
917 // Raise alpha to setup proper non-pv search upper bound
924 for (int j = 0; j < Min(MultiPV, rml.move_count()); j++)
926 cout << "info multipv " << j + 1
927 << " score " << value_to_uci(rml.get_move_score(j))
928 << " depth " << (j <= i ? Iteration : Iteration - 1)
929 << " time " << current_search_time()
930 << " nodes " << TM.nodes_searched()
934 for (int k = 0; rml.get_move_pv(j, k) != MOVE_NONE && k < PLY_MAX; k++)
935 cout << rml.get_move_pv(j, k) << " ";
939 alpha = rml.get_move_score(Min(i, MultiPV - 1));
941 } // PV move or new best move
943 assert(alpha >= *alphaPtr);
945 AspirationFailLow = (alpha == *alphaPtr);
947 if (AspirationFailLow && StopOnPonderhit)
948 StopOnPonderhit = false;
951 // Can we exit fail low loop ?
952 if (AbortSearch || !AspirationFailLow)
955 // Prepare for a research after a fail low, each time with a wider window
956 *alphaPtr = alpha = Max(alpha - AspirationDelta * (1 << researchCountFL), -VALUE_INFINITE);
961 // Sort the moves before to return
968 // search<>() is the main search function for both PV and non-PV nodes
970 template <NodeType PvNode>
971 Value search(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply) {
973 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
974 assert(beta > alpha && beta <= VALUE_INFINITE);
975 assert(PvNode || alpha == beta - 1);
976 assert(ply > 0 && ply < PLY_MAX);
977 assert(pos.thread() >= 0 && pos.thread() < TM.active_threads());
979 Move movesSearched[256];
982 const TTEntry *tte, *ttx;
984 Move ttMove, move, excludedMove, threatMove;
986 Value bestValue, value, oldAlpha;
987 Value refinedValue, nullValue, futilityValueScaled; // Non-PV specific
988 bool isCheck, singleEvasion, singularExtensionNode, moveIsCheck, captureOrPromotion, dangerous;
989 bool mateThreat = false;
991 int threadID = pos.thread();
992 refinedValue = bestValue = value = -VALUE_INFINITE;
995 // Step 1. Initialize node and poll. Polling can abort search
996 TM.incrementNodeCounter(threadID);
997 ss->currentMove = ss->bestMove = threatMove = MOVE_NONE;
998 (ss+2)->killers[0] = (ss+2)->killers[1] = (ss+2)->mateKiller = MOVE_NONE;
1000 if (threadID == 0 && ++NodesSincePoll > NodesBetweenPolls)
1006 // Step 2. Check for aborted search and immediate draw
1007 if (AbortSearch || TM.thread_should_stop(threadID))
1010 if (pos.is_draw() || ply >= PLY_MAX - 1)
1013 // Step 3. Mate distance pruning
1014 alpha = Max(value_mated_in(ply), alpha);
1015 beta = Min(value_mate_in(ply+1), beta);
1019 // Step 4. Transposition table lookup
1021 // We don't want the score of a partial search to overwrite a previous full search
1022 // TT value, so we use a different position key in case of an excluded move exists.
1023 excludedMove = ss->excludedMove;
1024 posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
1026 tte = TT.retrieve(posKey);
1027 ttMove = (tte ? tte->move() : MOVE_NONE);
1029 // At PV nodes, we don't use the TT for pruning, but only for move ordering.
1030 // This is to avoid problems in the following areas:
1032 // * Repetition draw detection
1033 // * Fifty move rule detection
1034 // * Searching for a mate
1035 // * Printing of full PV line
1037 if (!PvNode && tte && ok_to_use_TT(tte, depth, beta, ply))
1039 // Refresh tte entry to avoid aging
1040 TT.store(posKey, tte->value(), tte->type(), tte->depth(), ttMove, tte->static_value(), tte->king_danger());
1042 ss->bestMove = ttMove; // Can be MOVE_NONE
1043 return value_from_tt(tte->value(), ply);
1046 // Step 5. Evaluate the position statically
1047 // At PV nodes we do this only to update gain statistics
1048 isCheck = pos.is_check();
1053 assert(tte->static_value() != VALUE_NONE);
1054 ss->eval = tte->static_value();
1055 ei.kingDanger[pos.side_to_move()] = tte->king_danger();
1059 ss->eval = evaluate(pos, ei);
1060 TT.store(posKey, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, MOVE_NONE, ss->eval, ei.kingDanger[pos.side_to_move()]);
1063 refinedValue = refine_eval(tte, ss->eval, ply); // Enhance accuracy with TT value if possible
1064 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
1067 ss->eval = VALUE_NONE;
1069 // Step 6. Razoring (is omitted in PV nodes)
1071 && depth < RazorDepth
1073 && refinedValue < beta - razor_margin(depth)
1074 && ttMove == MOVE_NONE
1075 && (ss-1)->currentMove != MOVE_NULL
1076 && !value_is_mate(beta)
1077 && !pos.has_pawn_on_7th(pos.side_to_move()))
1079 Value rbeta = beta - razor_margin(depth);
1080 Value v = qsearch<NonPV>(pos, ss, rbeta-1, rbeta, Depth(0), ply);
1082 // Logically we should return (v + razor_margin(depth)), but
1083 // surprisingly this did slightly weaker in tests.
1087 // Step 7. Static null move pruning (is omitted in PV nodes)
1088 // We're betting that the opponent doesn't have a move that will reduce
1089 // the score by more than futility_margin(depth) if we do a null move.
1091 && !ss->skipNullMove
1092 && depth < RazorDepth
1093 && refinedValue >= beta + futility_margin(depth, 0)
1095 && !value_is_mate(beta)
1096 && pos.non_pawn_material(pos.side_to_move()))
1097 return refinedValue - futility_margin(depth, 0);
1099 // Step 8. Null move search with verification search (is omitted in PV nodes)
1100 // When we jump directly to qsearch() we do a null move only if static value is
1101 // at least beta. Otherwise we do a null move if static value is not more than
1102 // NullMoveMargin under beta.
1104 && !ss->skipNullMove
1106 && refinedValue >= beta - (depth >= 4 * OnePly ? NullMoveMargin : 0)
1108 && !value_is_mate(beta)
1109 && pos.non_pawn_material(pos.side_to_move()))
1111 ss->currentMove = MOVE_NULL;
1113 // Null move dynamic reduction based on depth
1114 int R = 3 + (depth >= 5 * OnePly ? depth / 8 : 0);
1116 // Null move dynamic reduction based on value
1117 if (refinedValue - beta > PawnValueMidgame)
1120 pos.do_null_move(st);
1121 (ss+1)->skipNullMove = true;
1123 nullValue = depth-R*OnePly < OnePly ? -qsearch<NonPV>(pos, ss+1, -beta, -alpha, Depth(0), ply+1)
1124 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R*OnePly, ply+1);
1125 (ss+1)->skipNullMove = false;
1126 pos.undo_null_move();
1128 if (nullValue >= beta)
1130 // Do not return unproven mate scores
1131 if (nullValue >= value_mate_in(PLY_MAX))
1134 if (depth < 6 * OnePly)
1137 // Do verification search at high depths
1138 ss->skipNullMove = true;
1139 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R*OnePly, ply);
1140 ss->skipNullMove = false;
1147 // The null move failed low, which means that we may be faced with
1148 // some kind of threat. If the previous move was reduced, check if
1149 // the move that refuted the null move was somehow connected to the
1150 // move which was reduced. If a connection is found, return a fail
1151 // low score (which will cause the reduced move to fail high in the
1152 // parent node, which will trigger a re-search with full depth).
1153 if (nullValue == value_mated_in(ply + 2))
1156 threatMove = (ss+1)->bestMove;
1157 if ( depth < ThreatDepth
1158 && (ss-1)->reduction
1159 && connected_moves(pos, (ss-1)->currentMove, threatMove))
1164 // Step 9. Internal iterative deepening
1165 if ( depth >= IIDDepth[PvNode]
1166 && ttMove == MOVE_NONE
1167 && (PvNode || (!isCheck && ss->eval >= beta - IIDMargin)))
1169 Depth d = (PvNode ? depth - 2 * OnePly : depth / 2);
1171 ss->skipNullMove = true;
1172 search<PvNode>(pos, ss, alpha, beta, d, ply);
1173 ss->skipNullMove = false;
1175 ttMove = ss->bestMove;
1176 tte = TT.retrieve(posKey);
1179 // Expensive mate threat detection (only for PV nodes)
1181 mateThreat = pos.has_mate_threat(opposite_color(pos.side_to_move()));
1183 // Initialize a MovePicker object for the current position
1184 MovePicker mp = MovePicker(pos, ttMove, depth, H, ss, (PvNode ? -VALUE_INFINITE : beta));
1186 singleEvasion = isCheck && mp.number_of_evasions() == 1;
1187 singularExtensionNode = depth >= SingularExtensionDepth[PvNode]
1188 && tte && tte->move()
1189 && !excludedMove // Do not allow recursive singular extension search
1190 && is_lower_bound(tte->type())
1191 && tte->depth() >= depth - 3 * OnePly;
1193 // Step 10. Loop through moves
1194 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1195 while ( bestValue < beta
1196 && (move = mp.get_next_move()) != MOVE_NONE
1197 && !TM.thread_should_stop(threadID))
1199 assert(move_is_ok(move));
1201 if (move == excludedMove)
1204 moveIsCheck = pos.move_is_check(move, ci);
1205 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1207 // Step 11. Decide the new search depth
1208 ext = extension<PvNode>(pos, move, captureOrPromotion, moveIsCheck, singleEvasion, mateThreat, &dangerous);
1210 // Singular extension search. If all moves but one fail low on a search of (alpha-s, beta-s),
1211 // and just one fails high on (alpha, beta), then that move is singular and should be extended.
1212 // To verify this we do a reduced search on all the other moves but the ttMove, if result is
1213 // lower then ttValue minus a margin then we extend ttMove.
1214 if ( singularExtensionNode
1215 && move == tte->move()
1218 // Avoid to do an expensive singular extension search on nodes where
1219 // such search have already been done in the past, so assume the last
1220 // singular extension search result is still valid.
1222 && depth < SingularExtensionDepth[PvNode] + 5 * OnePly
1223 && ((ttx = TT.retrieve(pos.get_exclusion_key())) != NULL))
1225 if (is_upper_bound(ttx->type()))
1228 singularExtensionNode = false;
1231 Value ttValue = value_from_tt(tte->value(), ply);
1233 if (singularExtensionNode && abs(ttValue) < VALUE_KNOWN_WIN)
1235 Value b = ttValue - SingularExtensionMargin;
1236 ss->excludedMove = move;
1237 ss->skipNullMove = true;
1238 Value v = search<NonPV>(pos, ss, b - 1, b, depth / 2, ply);
1239 ss->skipNullMove = false;
1240 ss->excludedMove = MOVE_NONE;
1246 newDepth = depth - OnePly + ext;
1248 // Update current move (this must be done after singular extension search)
1249 movesSearched[moveCount++] = ss->currentMove = move;
1251 // Step 12. Futility pruning (is omitted in PV nodes)
1253 && !captureOrPromotion
1257 && !move_is_castle(move))
1259 // Move count based pruning
1260 if ( moveCount >= futility_move_count(depth)
1261 && !(threatMove && connected_threat(pos, move, threatMove))
1262 && bestValue > value_mated_in(PLY_MAX))
1265 // Value based pruning
1266 // We illogically ignore reduction condition depth >= 3*OnePly for predicted depth,
1267 // but fixing this made program slightly weaker.
1268 Depth predictedDepth = newDepth - reduction<NonPV>(depth, moveCount);
1269 futilityValueScaled = ss->eval + futility_margin(predictedDepth, moveCount)
1270 + H.gain(pos.piece_on(move_from(move)), move_to(move));
1272 if (futilityValueScaled < beta)
1274 if (futilityValueScaled > bestValue)
1275 bestValue = futilityValueScaled;
1280 // Step 13. Make the move
1281 pos.do_move(move, st, ci, moveIsCheck);
1283 // Step extra. pv search (only in PV nodes)
1284 // The first move in list is the expected PV
1285 if (PvNode && moveCount == 1)
1286 value = newDepth < OnePly ? -qsearch<PV>(pos, ss+1, -beta, -alpha, Depth(0), ply+1)
1287 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth, ply+1);
1290 // Step 14. Reduced depth search
1291 // If the move fails high will be re-searched at full depth.
1292 bool doFullDepthSearch = true;
1294 if ( depth >= 3 * OnePly
1295 && !captureOrPromotion
1297 && !move_is_castle(move)
1298 && !move_is_killer(move, ss))
1300 ss->reduction = reduction<PvNode>(depth, moveCount);
1303 Depth d = newDepth - ss->reduction;
1304 value = d < OnePly ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, Depth(0), ply+1)
1305 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, ply+1);
1307 doFullDepthSearch = (value > alpha);
1310 // The move failed high, but if reduction is very big we could
1311 // face a false positive, retry with a less aggressive reduction,
1312 // if the move fails high again then go with full depth search.
1313 if (doFullDepthSearch && ss->reduction > 2 * OnePly)
1315 assert(newDepth - OnePly >= OnePly);
1317 ss->reduction = OnePly;
1318 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth-ss->reduction, ply+1);
1319 doFullDepthSearch = (value > alpha);
1321 ss->reduction = Depth(0); // Restore original reduction
1324 // Step 15. Full depth search
1325 if (doFullDepthSearch)
1327 value = newDepth < OnePly ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, Depth(0), ply+1)
1328 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, ply+1);
1330 // Step extra. pv search (only in PV nodes)
1331 // Search only for possible new PV nodes, if instead value >= beta then
1332 // parent node fails low with value <= alpha and tries another move.
1333 if (PvNode && value > alpha && value < beta)
1334 value = newDepth < OnePly ? -qsearch<PV>(pos, ss+1, -beta, -alpha, Depth(0), ply+1)
1335 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth, ply+1);
1339 // Step 16. Undo move
1340 pos.undo_move(move);
1342 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1344 // Step 17. Check for new best move
1345 if (value > bestValue)
1350 if (PvNode && value < beta) // This guarantees that always: alpha < beta
1353 if (value == value_mate_in(ply + 1))
1354 ss->mateKiller = move;
1356 ss->bestMove = move;
1360 // Step 18. Check for split
1361 if ( depth >= MinimumSplitDepth
1362 && TM.active_threads() > 1
1364 && TM.available_thread_exists(threadID)
1366 && !TM.thread_should_stop(threadID)
1368 TM.split<FakeSplit>(pos, ss, ply, &alpha, beta, &bestValue, depth,
1369 threatMove, mateThreat, &moveCount, &mp, PvNode);
1372 // Step 19. Check for mate and stalemate
1373 // All legal moves have been searched and if there are
1374 // no legal moves, it must be mate or stalemate.
1375 // If one move was excluded return fail low score.
1377 return excludedMove ? oldAlpha : (isCheck ? value_mated_in(ply) : VALUE_DRAW);
1379 // Step 20. Update tables
1380 // If the search is not aborted, update the transposition table,
1381 // history counters, and killer moves.
1382 if (AbortSearch || TM.thread_should_stop(threadID))
1385 ValueType f = (bestValue <= oldAlpha ? VALUE_TYPE_UPPER : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT);
1386 move = (bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove);
1387 TT.store(posKey, value_to_tt(bestValue, ply), f, depth, move, ss->eval, ei.kingDanger[pos.side_to_move()]);
1389 // Update killers and history only for non capture moves that fails high
1390 if (bestValue >= beta)
1392 TM.incrementBetaCounter(pos.side_to_move(), depth, threadID);
1393 if (!pos.move_is_capture_or_promotion(move))
1395 update_history(pos, move, depth, movesSearched, moveCount);
1396 update_killers(move, ss);
1400 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1406 // qsearch() is the quiescence search function, which is called by the main
1407 // search function when the remaining depth is zero (or, to be more precise,
1408 // less than OnePly).
1410 template <NodeType PvNode>
1411 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply) {
1413 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1414 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1415 assert(PvNode || alpha == beta - 1);
1417 assert(ply > 0 && ply < PLY_MAX);
1418 assert(pos.thread() >= 0 && pos.thread() < TM.active_threads());
1423 Value bestValue, value, futilityValue, futilityBase;
1424 bool isCheck, deepChecks, enoughMaterial, moveIsCheck, evasionPrunable;
1426 Value oldAlpha = alpha;
1428 TM.incrementNodeCounter(pos.thread());
1429 ss->bestMove = ss->currentMove = MOVE_NONE;
1431 // Check for an instant draw or maximum ply reached
1432 if (pos.is_draw() || ply >= PLY_MAX - 1)
1435 // Transposition table lookup. At PV nodes, we don't use the TT for
1436 // pruning, but only for move ordering.
1437 tte = TT.retrieve(pos.get_key());
1438 ttMove = (tte ? tte->move() : MOVE_NONE);
1440 if (!PvNode && tte && ok_to_use_TT(tte, depth, beta, ply))
1442 ss->bestMove = ttMove; // Can be MOVE_NONE
1443 return value_from_tt(tte->value(), ply);
1446 isCheck = pos.is_check();
1448 // Evaluate the position statically
1451 bestValue = futilityBase = -VALUE_INFINITE;
1452 ss->eval = VALUE_NONE;
1453 deepChecks = enoughMaterial = false;
1459 assert(tte->static_value() != VALUE_NONE);
1460 ei.kingDanger[pos.side_to_move()] = tte->king_danger();
1461 bestValue = tte->static_value();
1464 bestValue = evaluate(pos, ei);
1466 ss->eval = bestValue;
1467 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
1469 // Stand pat. Return immediately if static value is at least beta
1470 if (bestValue >= beta)
1473 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, DEPTH_NONE, MOVE_NONE, ss->eval, ei.kingDanger[pos.side_to_move()]);
1478 if (PvNode && bestValue > alpha)
1481 // If we are near beta then try to get a cutoff pushing checks a bit further
1482 deepChecks = (depth == -OnePly && bestValue >= beta - PawnValueMidgame / 8);
1484 // Futility pruning parameters, not needed when in check
1485 futilityBase = bestValue + FutilityMarginQS + ei.kingDanger[pos.side_to_move()];
1486 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1489 // Initialize a MovePicker object for the current position, and prepare
1490 // to search the moves. Because the depth is <= 0 here, only captures,
1491 // queen promotions and checks (only if depth == 0 or depth == -OnePly
1492 // and we are near beta) will be generated.
1493 MovePicker mp = MovePicker(pos, ttMove, deepChecks ? Depth(0) : depth, H);
1496 // Loop through the moves until no moves remain or a beta cutoff occurs
1497 while ( alpha < beta
1498 && (move = mp.get_next_move()) != MOVE_NONE)
1500 assert(move_is_ok(move));
1502 moveIsCheck = pos.move_is_check(move, ci);
1510 && !move_is_promotion(move)
1511 && !pos.move_is_passed_pawn_push(move))
1513 futilityValue = futilityBase
1514 + pos.endgame_value_of_piece_on(move_to(move))
1515 + (move_is_ep(move) ? PawnValueEndgame : Value(0));
1517 if (futilityValue < alpha)
1519 if (futilityValue > bestValue)
1520 bestValue = futilityValue;
1525 // Detect blocking evasions that are candidate to be pruned
1526 evasionPrunable = isCheck
1527 && bestValue > value_mated_in(PLY_MAX)
1528 && !pos.move_is_capture(move)
1529 && pos.type_of_piece_on(move_from(move)) != KING
1530 && !pos.can_castle(pos.side_to_move());
1532 // Don't search moves with negative SEE values
1534 && (!isCheck || evasionPrunable)
1536 && !move_is_promotion(move)
1537 && pos.see_sign(move) < 0)
1540 // Update current move
1541 ss->currentMove = move;
1543 // Make and search the move
1544 pos.do_move(move, st, ci, moveIsCheck);
1545 value = -qsearch<PvNode>(pos, ss+1, -beta, -alpha, depth-OnePly, ply+1);
1546 pos.undo_move(move);
1548 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1551 if (value > bestValue)
1557 ss->bestMove = move;
1562 // All legal moves have been searched. A special case: If we're in check
1563 // and no legal moves were found, it is checkmate.
1564 if (isCheck && bestValue == -VALUE_INFINITE)
1565 return value_mated_in(ply);
1567 // Update transposition table
1568 Depth d = (depth == Depth(0) ? Depth(0) : Depth(-1));
1569 ValueType f = (bestValue <= oldAlpha ? VALUE_TYPE_UPPER : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT);
1570 TT.store(pos.get_key(), value_to_tt(bestValue, ply), f, d, ss->bestMove, ss->eval, ei.kingDanger[pos.side_to_move()]);
1572 // Update killers only for checking moves that fails high
1573 if ( bestValue >= beta
1574 && !pos.move_is_capture_or_promotion(ss->bestMove))
1575 update_killers(ss->bestMove, ss);
1577 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1583 // sp_search() is used to search from a split point. This function is called
1584 // by each thread working at the split point. It is similar to the normal
1585 // search() function, but simpler. Because we have already probed the hash
1586 // table, done a null move search, and searched the first move before
1587 // splitting, we don't have to repeat all this work in sp_search(). We
1588 // also don't need to store anything to the hash table here: This is taken
1589 // care of after we return from the split point.
1591 template <NodeType PvNode>
1592 void sp_search(SplitPoint* sp, int threadID) {
1594 assert(threadID >= 0 && threadID < TM.active_threads());
1595 assert(TM.active_threads() > 1);
1599 Depth ext, newDepth;
1601 Value futilityValueScaled; // NonPV specific
1602 bool isCheck, moveIsCheck, captureOrPromotion, dangerous;
1604 value = -VALUE_INFINITE;
1606 Position pos(*sp->pos, threadID);
1608 SearchStack* ss = sp->sstack[threadID] + 1;
1609 isCheck = pos.is_check();
1611 // Step 10. Loop through moves
1612 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1613 lock_grab(&(sp->lock));
1615 while ( sp->bestValue < sp->beta
1616 && (move = sp->mp->get_next_move()) != MOVE_NONE
1617 && !TM.thread_should_stop(threadID))
1619 moveCount = ++sp->moveCount;
1620 lock_release(&(sp->lock));
1622 assert(move_is_ok(move));
1624 moveIsCheck = pos.move_is_check(move, ci);
1625 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1627 // Step 11. Decide the new search depth
1628 ext = extension<PvNode>(pos, move, captureOrPromotion, moveIsCheck, false, sp->mateThreat, &dangerous);
1629 newDepth = sp->depth - OnePly + ext;
1631 // Update current move
1632 ss->currentMove = move;
1634 // Step 12. Futility pruning (is omitted in PV nodes)
1636 && !captureOrPromotion
1639 && !move_is_castle(move))
1641 // Move count based pruning
1642 if ( moveCount >= futility_move_count(sp->depth)
1643 && !(sp->threatMove && connected_threat(pos, move, sp->threatMove))
1644 && sp->bestValue > value_mated_in(PLY_MAX))
1646 lock_grab(&(sp->lock));
1650 // Value based pruning
1651 Depth predictedDepth = newDepth - reduction<NonPV>(sp->depth, moveCount);
1652 futilityValueScaled = ss->eval + futility_margin(predictedDepth, moveCount)
1653 + H.gain(pos.piece_on(move_from(move)), move_to(move));
1655 if (futilityValueScaled < sp->beta)
1657 lock_grab(&(sp->lock));
1659 if (futilityValueScaled > sp->bestValue)
1660 sp->bestValue = futilityValueScaled;
1665 // Step 13. Make the move
1666 pos.do_move(move, st, ci, moveIsCheck);
1668 // Step 14. Reduced search
1669 // If the move fails high will be re-searched at full depth.
1670 bool doFullDepthSearch = true;
1672 if ( !captureOrPromotion
1674 && !move_is_castle(move)
1675 && !move_is_killer(move, ss))
1677 ss->reduction = reduction<PvNode>(sp->depth, moveCount);
1680 Value localAlpha = sp->alpha;
1681 Depth d = newDepth - ss->reduction;
1682 value = d < OnePly ? -qsearch<NonPV>(pos, ss+1, -(localAlpha+1), -localAlpha, Depth(0), sp->ply+1)
1683 : - search<NonPV>(pos, ss+1, -(localAlpha+1), -localAlpha, d, sp->ply+1);
1685 doFullDepthSearch = (value > localAlpha);
1688 // The move failed high, but if reduction is very big we could
1689 // face a false positive, retry with a less aggressive reduction,
1690 // if the move fails high again then go with full depth search.
1691 if (doFullDepthSearch && ss->reduction > 2 * OnePly)
1693 assert(newDepth - OnePly >= OnePly);
1695 ss->reduction = OnePly;
1696 Value localAlpha = sp->alpha;
1697 value = -search<NonPV>(pos, ss+1, -(localAlpha+1), -localAlpha, newDepth-ss->reduction, sp->ply+1);
1698 doFullDepthSearch = (value > localAlpha);
1700 ss->reduction = Depth(0); // Restore original reduction
1703 // Step 15. Full depth search
1704 if (doFullDepthSearch)
1706 Value localAlpha = sp->alpha;
1707 value = newDepth < OnePly ? -qsearch<NonPV>(pos, ss+1, -(localAlpha+1), -localAlpha, Depth(0), sp->ply+1)
1708 : - search<NonPV>(pos, ss+1, -(localAlpha+1), -localAlpha, newDepth, sp->ply+1);
1710 // Step extra. pv search (only in PV nodes)
1711 // Search only for possible new PV nodes, if instead value >= beta then
1712 // parent node fails low with value <= alpha and tries another move.
1713 if (PvNode && value > localAlpha && value < sp->beta)
1714 value = newDepth < OnePly ? -qsearch<PV>(pos, ss+1, -sp->beta, -sp->alpha, Depth(0), sp->ply+1)
1715 : - search<PV>(pos, ss+1, -sp->beta, -sp->alpha, newDepth, sp->ply+1);
1718 // Step 16. Undo move
1719 pos.undo_move(move);
1721 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1723 // Step 17. Check for new best move
1724 lock_grab(&(sp->lock));
1726 if (value > sp->bestValue && !TM.thread_should_stop(threadID))
1728 sp->bestValue = value;
1730 if (sp->bestValue > sp->alpha)
1732 if (!PvNode || value >= sp->beta)
1733 sp->stopRequest = true;
1735 if (PvNode && value < sp->beta) // This guarantees that always: sp->alpha < sp->beta
1738 sp->parentSstack->bestMove = ss->bestMove = move;
1743 /* Here we have the lock still grabbed */
1745 sp->slaves[threadID] = 0;
1747 lock_release(&(sp->lock));
1751 // connected_moves() tests whether two moves are 'connected' in the sense
1752 // that the first move somehow made the second move possible (for instance
1753 // if the moving piece is the same in both moves). The first move is assumed
1754 // to be the move that was made to reach the current position, while the
1755 // second move is assumed to be a move from the current position.
1757 bool connected_moves(const Position& pos, Move m1, Move m2) {
1759 Square f1, t1, f2, t2;
1762 assert(move_is_ok(m1));
1763 assert(move_is_ok(m2));
1765 if (m2 == MOVE_NONE)
1768 // Case 1: The moving piece is the same in both moves
1774 // Case 2: The destination square for m2 was vacated by m1
1780 // Case 3: Moving through the vacated square
1781 if ( piece_is_slider(pos.piece_on(f2))
1782 && bit_is_set(squares_between(f2, t2), f1))
1785 // Case 4: The destination square for m2 is defended by the moving piece in m1
1786 p = pos.piece_on(t1);
1787 if (bit_is_set(pos.attacks_from(p, t1), t2))
1790 // Case 5: Discovered check, checking piece is the piece moved in m1
1791 if ( piece_is_slider(p)
1792 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
1793 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
1795 // discovered_check_candidates() works also if the Position's side to
1796 // move is the opposite of the checking piece.
1797 Color them = opposite_color(pos.side_to_move());
1798 Bitboard dcCandidates = pos.discovered_check_candidates(them);
1800 if (bit_is_set(dcCandidates, f2))
1807 // value_is_mate() checks if the given value is a mate one eventually
1808 // compensated for the ply.
1810 bool value_is_mate(Value value) {
1812 assert(abs(value) <= VALUE_INFINITE);
1814 return value <= value_mated_in(PLY_MAX)
1815 || value >= value_mate_in(PLY_MAX);
1819 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1820 // "plies to mate from the current ply". Non-mate scores are unchanged.
1821 // The function is called before storing a value to the transposition table.
1823 Value value_to_tt(Value v, int ply) {
1825 if (v >= value_mate_in(PLY_MAX))
1828 if (v <= value_mated_in(PLY_MAX))
1835 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score from
1836 // the transposition table to a mate score corrected for the current ply.
1838 Value value_from_tt(Value v, int ply) {
1840 if (v >= value_mate_in(PLY_MAX))
1843 if (v <= value_mated_in(PLY_MAX))
1850 // move_is_killer() checks if the given move is among the killer moves
1852 bool move_is_killer(Move m, SearchStack* ss) {
1854 if (ss->killers[0] == m || ss->killers[1] == m)
1861 // extension() decides whether a move should be searched with normal depth,
1862 // or with extended depth. Certain classes of moves (checking moves, in
1863 // particular) are searched with bigger depth than ordinary moves and in
1864 // any case are marked as 'dangerous'. Note that also if a move is not
1865 // extended, as example because the corresponding UCI option is set to zero,
1866 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
1867 template <NodeType PvNode>
1868 Depth extension(const Position& pos, Move m, bool captureOrPromotion, bool moveIsCheck,
1869 bool singleEvasion, bool mateThreat, bool* dangerous) {
1871 assert(m != MOVE_NONE);
1873 Depth result = Depth(0);
1874 *dangerous = moveIsCheck | singleEvasion | mateThreat;
1878 if (moveIsCheck && pos.see_sign(m) >= 0)
1879 result += CheckExtension[PvNode];
1882 result += SingleEvasionExtension[PvNode];
1885 result += MateThreatExtension[PvNode];
1888 if (pos.type_of_piece_on(move_from(m)) == PAWN)
1890 Color c = pos.side_to_move();
1891 if (relative_rank(c, move_to(m)) == RANK_7)
1893 result += PawnPushTo7thExtension[PvNode];
1896 if (pos.pawn_is_passed(c, move_to(m)))
1898 result += PassedPawnExtension[PvNode];
1903 if ( captureOrPromotion
1904 && pos.type_of_piece_on(move_to(m)) != PAWN
1905 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
1906 - pos.midgame_value_of_piece_on(move_to(m)) == Value(0))
1907 && !move_is_promotion(m)
1910 result += PawnEndgameExtension[PvNode];
1915 && captureOrPromotion
1916 && pos.type_of_piece_on(move_to(m)) != PAWN
1917 && pos.see_sign(m) >= 0)
1923 return Min(result, OnePly);
1927 // connected_threat() tests whether it is safe to forward prune a move or if
1928 // is somehow coonected to the threat move returned by null search.
1930 bool connected_threat(const Position& pos, Move m, Move threat) {
1932 assert(move_is_ok(m));
1933 assert(threat && move_is_ok(threat));
1934 assert(!pos.move_is_check(m));
1935 assert(!pos.move_is_capture_or_promotion(m));
1936 assert(!pos.move_is_passed_pawn_push(m));
1938 Square mfrom, mto, tfrom, tto;
1940 mfrom = move_from(m);
1942 tfrom = move_from(threat);
1943 tto = move_to(threat);
1945 // Case 1: Don't prune moves which move the threatened piece
1949 // Case 2: If the threatened piece has value less than or equal to the
1950 // value of the threatening piece, don't prune move which defend it.
1951 if ( pos.move_is_capture(threat)
1952 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
1953 || pos.type_of_piece_on(tfrom) == KING)
1954 && pos.move_attacks_square(m, tto))
1957 // Case 3: If the moving piece in the threatened move is a slider, don't
1958 // prune safe moves which block its ray.
1959 if ( piece_is_slider(pos.piece_on(tfrom))
1960 && bit_is_set(squares_between(tfrom, tto), mto)
1961 && pos.see_sign(m) >= 0)
1968 // ok_to_use_TT() returns true if a transposition table score
1969 // can be used at a given point in search.
1971 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
1973 Value v = value_from_tt(tte->value(), ply);
1975 return ( tte->depth() >= depth
1976 || v >= Max(value_mate_in(PLY_MAX), beta)
1977 || v < Min(value_mated_in(PLY_MAX), beta))
1979 && ( (is_lower_bound(tte->type()) && v >= beta)
1980 || (is_upper_bound(tte->type()) && v < beta));
1984 // refine_eval() returns the transposition table score if
1985 // possible otherwise falls back on static position evaluation.
1987 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
1992 Value v = value_from_tt(tte->value(), ply);
1994 if ( (is_lower_bound(tte->type()) && v >= defaultEval)
1995 || (is_upper_bound(tte->type()) && v < defaultEval))
2002 // update_history() registers a good move that produced a beta-cutoff
2003 // in history and marks as failures all the other moves of that ply.
2005 void update_history(const Position& pos, Move move, Depth depth,
2006 Move movesSearched[], int moveCount) {
2010 H.success(pos.piece_on(move_from(move)), move_to(move), depth);
2012 for (int i = 0; i < moveCount - 1; i++)
2014 m = movesSearched[i];
2018 if (!pos.move_is_capture_or_promotion(m))
2019 H.failure(pos.piece_on(move_from(m)), move_to(m), depth);
2024 // update_killers() add a good move that produced a beta-cutoff
2025 // among the killer moves of that ply.
2027 void update_killers(Move m, SearchStack* ss) {
2029 if (m == ss->killers[0])
2032 ss->killers[1] = ss->killers[0];
2037 // update_gains() updates the gains table of a non-capture move given
2038 // the static position evaluation before and after the move.
2040 void update_gains(const Position& pos, Move m, Value before, Value after) {
2043 && before != VALUE_NONE
2044 && after != VALUE_NONE
2045 && pos.captured_piece() == NO_PIECE_TYPE
2046 && !move_is_castle(m)
2047 && !move_is_promotion(m))
2048 H.set_gain(pos.piece_on(move_to(m)), move_to(m), -(before + after));
2052 // current_search_time() returns the number of milliseconds which have passed
2053 // since the beginning of the current search.
2055 int current_search_time() {
2057 return get_system_time() - SearchStartTime;
2061 // value_to_uci() converts a value to a string suitable for use with the UCI protocol
2063 std::string value_to_uci(Value v) {
2065 std::stringstream s;
2067 if (abs(v) < VALUE_MATE - PLY_MAX * OnePly)
2068 s << "cp " << int(v) * 100 / int(PawnValueMidgame); // Scale to pawn = 100
2070 s << "mate " << (v > 0 ? (VALUE_MATE - v + 1) / 2 : -(VALUE_MATE + v) / 2 );
2075 // nps() computes the current nodes/second count.
2079 int t = current_search_time();
2080 return (t > 0 ? int((TM.nodes_searched() * 1000) / t) : 0);
2084 // poll() performs two different functions: It polls for user input, and it
2085 // looks at the time consumed so far and decides if it's time to abort the
2090 static int lastInfoTime;
2091 int t = current_search_time();
2096 // We are line oriented, don't read single chars
2097 std::string command;
2099 if (!std::getline(std::cin, command))
2102 if (command == "quit")
2105 PonderSearch = false;
2109 else if (command == "stop")
2112 PonderSearch = false;
2114 else if (command == "ponderhit")
2118 // Print search information
2122 else if (lastInfoTime > t)
2123 // HACK: Must be a new search where we searched less than
2124 // NodesBetweenPolls nodes during the first second of search.
2127 else if (t - lastInfoTime >= 1000)
2134 if (dbg_show_hit_rate)
2135 dbg_print_hit_rate();
2137 cout << "info nodes " << TM.nodes_searched() << " nps " << nps()
2138 << " time " << t << endl;
2141 // Should we stop the search?
2145 bool stillAtFirstMove = FirstRootMove
2146 && !AspirationFailLow
2147 && t > OptimumSearchTime + ExtraSearchTime;
2149 bool noMoreTime = t > MaximumSearchTime
2150 || stillAtFirstMove;
2152 if ( (Iteration >= 3 && UseTimeManagement && noMoreTime)
2153 || (ExactMaxTime && t >= ExactMaxTime)
2154 || (Iteration >= 3 && MaxNodes && TM.nodes_searched() >= MaxNodes))
2159 // ponderhit() is called when the program is pondering (i.e. thinking while
2160 // it's the opponent's turn to move) in order to let the engine know that
2161 // it correctly predicted the opponent's move.
2165 int t = current_search_time();
2166 PonderSearch = false;
2168 bool stillAtFirstMove = FirstRootMove
2169 && !AspirationFailLow
2170 && t > OptimumSearchTime + ExtraSearchTime;
2172 bool noMoreTime = t > MaximumSearchTime
2173 || stillAtFirstMove;
2175 if (Iteration >= 3 && UseTimeManagement && (noMoreTime || StopOnPonderhit))
2180 // init_ss_array() does a fast reset of the first entries of a SearchStack
2181 // array and of all the excludedMove and skipNullMove entries.
2183 void init_ss_array(SearchStack* ss, int size) {
2185 for (int i = 0; i < size; i++, ss++)
2187 ss->excludedMove = MOVE_NONE;
2188 ss->skipNullMove = false;
2189 ss->reduction = Depth(0);
2192 ss->killers[0] = ss->killers[1] = ss->mateKiller = MOVE_NONE;
2197 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2198 // while the program is pondering. The point is to work around a wrinkle in
2199 // the UCI protocol: When pondering, the engine is not allowed to give a
2200 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2201 // We simply wait here until one of these commands is sent, and return,
2202 // after which the bestmove and pondermove will be printed (in id_loop()).
2204 void wait_for_stop_or_ponderhit() {
2206 std::string command;
2210 if (!std::getline(std::cin, command))
2213 if (command == "quit")
2218 else if (command == "ponderhit" || command == "stop")
2224 // print_pv_info() prints to standard output and eventually to log file information on
2225 // the current PV line. It is called at each iteration or after a new pv is found.
2227 void print_pv_info(const Position& pos, Move pv[], Value alpha, Value beta, Value value) {
2229 cout << "info depth " << Iteration
2230 << " score " << value_to_uci(value)
2231 << (value >= beta ? " lowerbound" : value <= alpha ? " upperbound" : "")
2232 << " time " << current_search_time()
2233 << " nodes " << TM.nodes_searched()
2237 for (Move* m = pv; *m != MOVE_NONE; m++)
2244 ValueType t = value >= beta ? VALUE_TYPE_LOWER :
2245 value <= alpha ? VALUE_TYPE_UPPER : VALUE_TYPE_EXACT;
2247 LogFile << pretty_pv(pos, current_search_time(), Iteration,
2248 TM.nodes_searched(), value, t, pv) << endl;
2253 // insert_pv_in_tt() is called at the end of a search iteration, and inserts
2254 // the PV back into the TT. This makes sure the old PV moves are searched
2255 // first, even if the old TT entries have been overwritten.
2257 void insert_pv_in_tt(const Position& pos, Move pv[]) {
2261 Position p(pos, pos.thread());
2265 for (int i = 0; pv[i] != MOVE_NONE; i++)
2267 tte = TT.retrieve(p.get_key());
2268 if (!tte || tte->move() != pv[i])
2270 v = (p.is_check() ? VALUE_NONE : evaluate(p, ei));
2271 TT.store(p.get_key(), VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, pv[i], v, ei.kingDanger[pos.side_to_move()]);
2273 p.do_move(pv[i], st);
2278 // extract_pv_from_tt() builds a PV by adding moves from the transposition table.
2279 // We consider also failing high nodes and not only VALUE_TYPE_EXACT nodes. This
2280 // allow to always have a ponder move even when we fail high at root and also a
2281 // long PV to print that is important for position analysis.
2283 void extract_pv_from_tt(const Position& pos, Move bestMove, Move pv[]) {
2287 Position p(pos, pos.thread());
2290 assert(bestMove != MOVE_NONE);
2293 p.do_move(pv[ply++], st);
2295 while ( (tte = TT.retrieve(p.get_key())) != NULL
2296 && tte->move() != MOVE_NONE
2297 && move_is_legal(p, tte->move())
2299 && (!p.is_draw() || ply < 2))
2301 pv[ply] = tte->move();
2302 p.do_move(pv[ply++], st);
2304 pv[ply] = MOVE_NONE;
2308 // init_thread() is the function which is called when a new thread is
2309 // launched. It simply calls the idle_loop() function with the supplied
2310 // threadID. There are two versions of this function; one for POSIX
2311 // threads and one for Windows threads.
2313 #if !defined(_MSC_VER)
2315 void* init_thread(void *threadID) {
2317 TM.idle_loop(*(int*)threadID, NULL);
2323 DWORD WINAPI init_thread(LPVOID threadID) {
2325 TM.idle_loop(*(int*)threadID, NULL);
2332 /// The ThreadsManager class
2334 // resetNodeCounters(), resetBetaCounters(), searched_nodes() and
2335 // get_beta_counters() are getters/setters for the per thread
2336 // counters used to sort the moves at root.
2338 void ThreadsManager::resetNodeCounters() {
2340 for (int i = 0; i < MAX_THREADS; i++)
2341 threads[i].nodes = 0ULL;
2344 void ThreadsManager::resetBetaCounters() {
2346 for (int i = 0; i < MAX_THREADS; i++)
2347 threads[i].betaCutOffs[WHITE] = threads[i].betaCutOffs[BLACK] = 0ULL;
2350 int64_t ThreadsManager::nodes_searched() const {
2352 int64_t result = 0ULL;
2353 for (int i = 0; i < ActiveThreads; i++)
2354 result += threads[i].nodes;
2359 void ThreadsManager::get_beta_counters(Color us, int64_t& our, int64_t& their) const {
2362 for (int i = 0; i < MAX_THREADS; i++)
2364 our += threads[i].betaCutOffs[us];
2365 their += threads[i].betaCutOffs[opposite_color(us)];
2370 // idle_loop() is where the threads are parked when they have no work to do.
2371 // The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint
2372 // object for which the current thread is the master.
2374 void ThreadsManager::idle_loop(int threadID, SplitPoint* sp) {
2376 assert(threadID >= 0 && threadID < MAX_THREADS);
2380 // Slave threads can exit as soon as AllThreadsShouldExit raises,
2381 // master should exit as last one.
2382 if (AllThreadsShouldExit)
2385 threads[threadID].state = THREAD_TERMINATED;
2389 // If we are not thinking, wait for a condition to be signaled
2390 // instead of wasting CPU time polling for work.
2391 while (AllThreadsShouldSleep || threadID >= ActiveThreads)
2394 assert(threadID != 0);
2395 threads[threadID].state = THREAD_SLEEPING;
2397 #if !defined(_MSC_VER)
2398 lock_grab(&WaitLock);
2399 if (AllThreadsShouldSleep || threadID >= ActiveThreads)
2400 pthread_cond_wait(&WaitCond, &WaitLock);
2401 lock_release(&WaitLock);
2403 WaitForSingleObject(SitIdleEvent[threadID], INFINITE);
2407 // If thread has just woken up, mark it as available
2408 if (threads[threadID].state == THREAD_SLEEPING)
2409 threads[threadID].state = THREAD_AVAILABLE;
2411 // If this thread has been assigned work, launch a search
2412 if (threads[threadID].state == THREAD_WORKISWAITING)
2414 assert(!AllThreadsShouldExit && !AllThreadsShouldSleep);
2416 threads[threadID].state = THREAD_SEARCHING;
2418 if (threads[threadID].splitPoint->pvNode)
2419 sp_search<PV>(threads[threadID].splitPoint, threadID);
2421 sp_search<NonPV>(threads[threadID].splitPoint, threadID);
2423 assert(threads[threadID].state == THREAD_SEARCHING);
2425 threads[threadID].state = THREAD_AVAILABLE;
2428 // If this thread is the master of a split point and all slaves have
2429 // finished their work at this split point, return from the idle loop.
2431 for ( ; sp && i < ActiveThreads && !sp->slaves[i]; i++) {}
2433 if (i == ActiveThreads)
2435 // Because sp->slaves[] is reset under lock protection,
2436 // be sure sp->lock has been released before to return.
2437 lock_grab(&(sp->lock));
2438 lock_release(&(sp->lock));
2440 assert(threads[threadID].state == THREAD_AVAILABLE);
2442 threads[threadID].state = THREAD_SEARCHING;
2449 // init_threads() is called during startup. It launches all helper threads,
2450 // and initializes the split point stack and the global locks and condition
2453 void ThreadsManager::init_threads() {
2458 #if !defined(_MSC_VER)
2459 pthread_t pthread[1];
2462 // Initialize global locks
2464 lock_init(&WaitLock);
2466 #if !defined(_MSC_VER)
2467 pthread_cond_init(&WaitCond, NULL);
2469 for (i = 0; i < MAX_THREADS; i++)
2470 SitIdleEvent[i] = CreateEvent(0, FALSE, FALSE, 0);
2473 // Initialize splitPoints[] locks
2474 for (i = 0; i < MAX_THREADS; i++)
2475 for (int j = 0; j < MAX_ACTIVE_SPLIT_POINTS; j++)
2476 lock_init(&(threads[i].splitPoints[j].lock));
2478 // Will be set just before program exits to properly end the threads
2479 AllThreadsShouldExit = false;
2481 // Threads will be put to sleep as soon as created
2482 AllThreadsShouldSleep = true;
2484 // All threads except the main thread should be initialized to THREAD_AVAILABLE
2486 threads[0].state = THREAD_SEARCHING;
2487 for (i = 1; i < MAX_THREADS; i++)
2488 threads[i].state = THREAD_AVAILABLE;
2490 // Launch the helper threads
2491 for (i = 1; i < MAX_THREADS; i++)
2494 #if !defined(_MSC_VER)
2495 ok = (pthread_create(pthread, NULL, init_thread, (void*)(&i)) == 0);
2497 ok = (CreateThread(NULL, 0, init_thread, (LPVOID)(&i), 0, NULL) != NULL);
2502 cout << "Failed to create thread number " << i << endl;
2503 Application::exit_with_failure();
2506 // Wait until the thread has finished launching and is gone to sleep
2507 while (threads[i].state != THREAD_SLEEPING) {}
2512 // exit_threads() is called when the program exits. It makes all the
2513 // helper threads exit cleanly.
2515 void ThreadsManager::exit_threads() {
2517 ActiveThreads = MAX_THREADS; // HACK
2518 AllThreadsShouldSleep = true; // HACK
2519 wake_sleeping_threads();
2521 // This makes the threads to exit idle_loop()
2522 AllThreadsShouldExit = true;
2524 // Wait for thread termination
2525 for (int i = 1; i < MAX_THREADS; i++)
2526 while (threads[i].state != THREAD_TERMINATED) {}
2528 // Now we can safely destroy the locks
2529 for (int i = 0; i < MAX_THREADS; i++)
2530 for (int j = 0; j < MAX_ACTIVE_SPLIT_POINTS; j++)
2531 lock_destroy(&(threads[i].splitPoints[j].lock));
2533 lock_destroy(&WaitLock);
2534 lock_destroy(&MPLock);
2538 // thread_should_stop() checks whether the thread should stop its search.
2539 // This can happen if a beta cutoff has occurred in the thread's currently
2540 // active split point, or in some ancestor of the current split point.
2542 bool ThreadsManager::thread_should_stop(int threadID) const {
2544 assert(threadID >= 0 && threadID < ActiveThreads);
2548 for (sp = threads[threadID].splitPoint; sp && !sp->stopRequest; sp = sp->parent) {}
2553 // thread_is_available() checks whether the thread with threadID "slave" is
2554 // available to help the thread with threadID "master" at a split point. An
2555 // obvious requirement is that "slave" must be idle. With more than two
2556 // threads, this is not by itself sufficient: If "slave" is the master of
2557 // some active split point, it is only available as a slave to the other
2558 // threads which are busy searching the split point at the top of "slave"'s
2559 // split point stack (the "helpful master concept" in YBWC terminology).
2561 bool ThreadsManager::thread_is_available(int slave, int master) const {
2563 assert(slave >= 0 && slave < ActiveThreads);
2564 assert(master >= 0 && master < ActiveThreads);
2565 assert(ActiveThreads > 1);
2567 if (threads[slave].state != THREAD_AVAILABLE || slave == master)
2570 // Make a local copy to be sure doesn't change under our feet
2571 int localActiveSplitPoints = threads[slave].activeSplitPoints;
2573 if (localActiveSplitPoints == 0)
2574 // No active split points means that the thread is available as
2575 // a slave for any other thread.
2578 if (ActiveThreads == 2)
2581 // Apply the "helpful master" concept if possible. Use localActiveSplitPoints
2582 // that is known to be > 0, instead of threads[slave].activeSplitPoints that
2583 // could have been set to 0 by another thread leading to an out of bound access.
2584 if (threads[slave].splitPoints[localActiveSplitPoints - 1].slaves[master])
2591 // available_thread_exists() tries to find an idle thread which is available as
2592 // a slave for the thread with threadID "master".
2594 bool ThreadsManager::available_thread_exists(int master) const {
2596 assert(master >= 0 && master < ActiveThreads);
2597 assert(ActiveThreads > 1);
2599 for (int i = 0; i < ActiveThreads; i++)
2600 if (thread_is_available(i, master))
2607 // split() does the actual work of distributing the work at a node between
2608 // several available threads. If it does not succeed in splitting the
2609 // node (because no idle threads are available, or because we have no unused
2610 // split point objects), the function immediately returns. If splitting is
2611 // possible, a SplitPoint object is initialized with all the data that must be
2612 // copied to the helper threads and we tell our helper threads that they have
2613 // been assigned work. This will cause them to instantly leave their idle loops
2614 // and call sp_search(). When all threads have returned from sp_search() then
2617 template <bool Fake>
2618 void ThreadsManager::split(const Position& p, SearchStack* ss, int ply, Value* alpha,
2619 const Value beta, Value* bestValue, Depth depth, Move threatMove,
2620 bool mateThreat, int* moveCount, MovePicker* mp, bool pvNode) {
2622 assert(ply > 0 && ply < PLY_MAX);
2623 assert(*bestValue >= -VALUE_INFINITE);
2624 assert(*bestValue <= *alpha);
2625 assert(*alpha < beta);
2626 assert(beta <= VALUE_INFINITE);
2627 assert(depth > Depth(0));
2628 assert(p.thread() >= 0 && p.thread() < ActiveThreads);
2629 assert(ActiveThreads > 1);
2631 int i, master = p.thread();
2632 Thread& masterThread = threads[master];
2636 // If no other thread is available to help us, or if we have too many
2637 // active split points, don't split.
2638 if ( !available_thread_exists(master)
2639 || masterThread.activeSplitPoints >= MAX_ACTIVE_SPLIT_POINTS)
2641 lock_release(&MPLock);
2645 // Pick the next available split point object from the split point stack
2646 SplitPoint& splitPoint = masterThread.splitPoints[masterThread.activeSplitPoints++];
2648 // Initialize the split point object
2649 splitPoint.parent = masterThread.splitPoint;
2650 splitPoint.stopRequest = false;
2651 splitPoint.ply = ply;
2652 splitPoint.depth = depth;
2653 splitPoint.threatMove = threatMove;
2654 splitPoint.mateThreat = mateThreat;
2655 splitPoint.alpha = *alpha;
2656 splitPoint.beta = beta;
2657 splitPoint.pvNode = pvNode;
2658 splitPoint.bestValue = *bestValue;
2660 splitPoint.moveCount = *moveCount;
2661 splitPoint.pos = &p;
2662 splitPoint.parentSstack = ss;
2663 for (i = 0; i < ActiveThreads; i++)
2664 splitPoint.slaves[i] = 0;
2666 masterThread.splitPoint = &splitPoint;
2668 // If we are here it means we are not available
2669 assert(masterThread.state != THREAD_AVAILABLE);
2671 int workersCnt = 1; // At least the master is included
2673 // Allocate available threads setting state to THREAD_BOOKED
2674 for (i = 0; !Fake && i < ActiveThreads && workersCnt < MaxThreadsPerSplitPoint; i++)
2675 if (thread_is_available(i, master))
2677 threads[i].state = THREAD_BOOKED;
2678 threads[i].splitPoint = &splitPoint;
2679 splitPoint.slaves[i] = 1;
2683 assert(Fake || workersCnt > 1);
2685 // We can release the lock because slave threads are already booked and master is not available
2686 lock_release(&MPLock);
2688 // Tell the threads that they have work to do. This will make them leave
2689 // their idle loop. But before copy search stack tail for each thread.
2690 for (i = 0; i < ActiveThreads; i++)
2691 if (i == master || splitPoint.slaves[i])
2693 memcpy(splitPoint.sstack[i], ss - 1, 4 * sizeof(SearchStack));
2695 assert(i == master || threads[i].state == THREAD_BOOKED);
2697 threads[i].state = THREAD_WORKISWAITING; // This makes the slave to exit from idle_loop()
2700 // Everything is set up. The master thread enters the idle loop, from
2701 // which it will instantly launch a search, because its state is
2702 // THREAD_WORKISWAITING. We send the split point as a second parameter to the
2703 // idle loop, which means that the main thread will return from the idle
2704 // loop when all threads have finished their work at this split point.
2705 idle_loop(master, &splitPoint);
2707 // We have returned from the idle loop, which means that all threads are
2708 // finished. Update alpha and bestValue, and return.
2711 *alpha = splitPoint.alpha;
2712 *bestValue = splitPoint.bestValue;
2713 masterThread.activeSplitPoints--;
2714 masterThread.splitPoint = splitPoint.parent;
2716 lock_release(&MPLock);
2720 // wake_sleeping_threads() wakes up all sleeping threads when it is time
2721 // to start a new search from the root.
2723 void ThreadsManager::wake_sleeping_threads() {
2725 assert(AllThreadsShouldSleep);
2726 assert(ActiveThreads > 0);
2728 AllThreadsShouldSleep = false;
2730 if (ActiveThreads == 1)
2733 #if !defined(_MSC_VER)
2734 pthread_mutex_lock(&WaitLock);
2735 pthread_cond_broadcast(&WaitCond);
2736 pthread_mutex_unlock(&WaitLock);
2738 for (int i = 1; i < MAX_THREADS; i++)
2739 SetEvent(SitIdleEvent[i]);
2745 // put_threads_to_sleep() makes all the threads go to sleep just before
2746 // to leave think(), at the end of the search. Threads should have already
2747 // finished the job and should be idle.
2749 void ThreadsManager::put_threads_to_sleep() {
2751 assert(!AllThreadsShouldSleep);
2753 // This makes the threads to go to sleep
2754 AllThreadsShouldSleep = true;
2757 /// The RootMoveList class
2759 // RootMoveList c'tor
2761 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) : count(0) {
2763 SearchStack ss[PLY_MAX_PLUS_2];
2764 MoveStack mlist[MaxRootMoves];
2766 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
2768 // Initialize search stack
2769 init_ss_array(ss, PLY_MAX_PLUS_2);
2770 ss[0].currentMove = ss[0].bestMove = MOVE_NONE;
2771 ss[0].eval = VALUE_NONE;
2773 // Generate all legal moves
2774 MoveStack* last = generate_moves(pos, mlist);
2776 // Add each move to the moves[] array
2777 for (MoveStack* cur = mlist; cur != last; cur++)
2779 bool includeMove = includeAllMoves;
2781 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
2782 includeMove = (searchMoves[k] == cur->move);
2787 // Find a quick score for the move
2788 pos.do_move(cur->move, st);
2789 ss[0].currentMove = cur->move;
2790 moves[count].move = cur->move;
2791 moves[count].score = -qsearch<PV>(pos, ss+1, -VALUE_INFINITE, VALUE_INFINITE, Depth(0), 1);
2792 moves[count].pv[0] = cur->move;
2793 moves[count].pv[1] = MOVE_NONE;
2794 pos.undo_move(cur->move);
2801 // RootMoveList simple methods definitions
2803 void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) {
2805 moves[moveNum].nodes = nodes;
2806 moves[moveNum].cumulativeNodes += nodes;
2809 void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) {
2811 moves[moveNum].ourBeta = our;
2812 moves[moveNum].theirBeta = their;
2815 void RootMoveList::set_move_pv(int moveNum, const Move pv[]) {
2819 for (j = 0; pv[j] != MOVE_NONE; j++)
2820 moves[moveNum].pv[j] = pv[j];
2822 moves[moveNum].pv[j] = MOVE_NONE;
2826 // RootMoveList::sort() sorts the root move list at the beginning of a new
2829 void RootMoveList::sort() {
2831 sort_multipv(count - 1); // Sort all items
2835 // RootMoveList::sort_multipv() sorts the first few moves in the root move
2836 // list by their scores and depths. It is used to order the different PVs
2837 // correctly in MultiPV mode.
2839 void RootMoveList::sort_multipv(int n) {
2843 for (i = 1; i <= n; i++)
2845 RootMove rm = moves[i];
2846 for (j = i; j > 0 && moves[j - 1] < rm; j--)
2847 moves[j] = moves[j - 1];