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 and
1047 // update gain statistics of parent move.
1048 isCheck = pos.is_check();
1050 ss->eval = VALUE_NONE;
1053 assert(tte->static_value() != VALUE_NONE);
1055 ss->eval = tte->static_value();
1056 ei.kingDanger[pos.side_to_move()] = tte->king_danger();
1057 refinedValue = refine_eval(tte, ss->eval, ply);
1061 refinedValue = ss->eval = evaluate(pos, ei);
1062 TT.store(posKey, VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, MOVE_NONE, ss->eval, ei.kingDanger[pos.side_to_move()]);
1065 // Save gain for the parent non-capture move
1066 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
1068 // Step 6. Razoring (is omitted in PV nodes)
1070 && depth < RazorDepth
1072 && refinedValue < beta - razor_margin(depth)
1073 && ttMove == MOVE_NONE
1074 && (ss-1)->currentMove != MOVE_NULL
1075 && !value_is_mate(beta)
1076 && !pos.has_pawn_on_7th(pos.side_to_move()))
1078 Value rbeta = beta - razor_margin(depth);
1079 Value v = qsearch<NonPV>(pos, ss, rbeta-1, rbeta, Depth(0), ply);
1081 // Logically we should return (v + razor_margin(depth)), but
1082 // surprisingly this did slightly weaker in tests.
1086 // Step 7. Static null move pruning (is omitted in PV nodes)
1087 // We're betting that the opponent doesn't have a move that will reduce
1088 // the score by more than futility_margin(depth) if we do a null move.
1090 && !ss->skipNullMove
1091 && depth < RazorDepth
1093 && refinedValue >= beta + futility_margin(depth, 0)
1094 && !value_is_mate(beta)
1095 && pos.non_pawn_material(pos.side_to_move()))
1096 return refinedValue - futility_margin(depth, 0);
1098 // Step 8. Null move search with verification search (is omitted in PV nodes)
1099 // When we jump directly to qsearch() we do a null move only if static value is
1100 // at least beta. Otherwise we do a null move if static value is not more than
1101 // NullMoveMargin under beta.
1103 && !ss->skipNullMove
1106 && refinedValue >= beta - (depth >= 4 * OnePly ? NullMoveMargin : 0)
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 * OnePly ? 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;
1122 nullValue = depth-R*OnePly < OnePly ? -qsearch<NonPV>(pos, ss+1, -beta, -alpha, Depth(0), ply+1)
1123 : - search<NonPV>(pos, ss+1, -beta, -alpha, depth-R*OnePly, ply+1);
1124 (ss+1)->skipNullMove = false;
1125 pos.undo_null_move();
1127 if (nullValue >= beta)
1129 // Do not return unproven mate scores
1130 if (nullValue >= value_mate_in(PLY_MAX))
1133 if (depth < 6 * OnePly)
1136 // Do verification search at high depths
1137 ss->skipNullMove = true;
1138 Value v = search<NonPV>(pos, ss, alpha, beta, depth-R*OnePly, ply);
1139 ss->skipNullMove = false;
1146 // The null move failed low, which means that we may be faced with
1147 // some kind of threat. If the previous move was reduced, check if
1148 // the move that refuted the null move was somehow connected to the
1149 // move which was reduced. If a connection is found, return a fail
1150 // low score (which will cause the reduced move to fail high in the
1151 // parent node, which will trigger a re-search with full depth).
1152 if (nullValue == value_mated_in(ply + 2))
1155 threatMove = (ss+1)->bestMove;
1156 if ( depth < ThreatDepth
1157 && (ss-1)->reduction
1158 && connected_moves(pos, (ss-1)->currentMove, threatMove))
1163 // Step 9. Internal iterative deepening
1164 if ( depth >= IIDDepth[PvNode]
1165 && ttMove == MOVE_NONE
1166 && (PvNode || (!isCheck && ss->eval >= beta - IIDMargin)))
1168 Depth d = (PvNode ? depth - 2 * OnePly : depth / 2);
1170 ss->skipNullMove = true;
1171 search<PvNode>(pos, ss, alpha, beta, d, ply);
1172 ss->skipNullMove = false;
1174 ttMove = ss->bestMove;
1175 tte = TT.retrieve(posKey);
1178 // Expensive mate threat detection (only for PV nodes)
1180 mateThreat = pos.has_mate_threat(opposite_color(pos.side_to_move()));
1182 // Initialize a MovePicker object for the current position
1183 MovePicker mp = MovePicker(pos, ttMove, depth, H, ss, (PvNode ? -VALUE_INFINITE : beta));
1185 ss->bestMove = MOVE_NONE;
1186 singleEvasion = isCheck && mp.number_of_evasions() == 1;
1187 singularExtensionNode = depth >= SingularExtensionDepth[PvNode]
1190 && !excludedMove // Do not allow recursive singular extension search
1191 && is_lower_bound(tte->type())
1192 && tte->depth() >= depth - 3 * OnePly;
1194 // Step 10. Loop through moves
1195 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1196 while ( bestValue < beta
1197 && (move = mp.get_next_move()) != MOVE_NONE
1198 && !TM.thread_should_stop(threadID))
1200 assert(move_is_ok(move));
1202 if (move == excludedMove)
1205 moveIsCheck = pos.move_is_check(move, ci);
1206 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1208 // Step 11. Decide the new search depth
1209 ext = extension<PvNode>(pos, move, captureOrPromotion, moveIsCheck, singleEvasion, mateThreat, &dangerous);
1211 // Singular extension search. If all moves but one fail low on a search of (alpha-s, beta-s),
1212 // and just one fails high on (alpha, beta), then that move is singular and should be extended.
1213 // To verify this we do a reduced search on all the other moves but the ttMove, if result is
1214 // lower then ttValue minus a margin then we extend ttMove.
1215 if ( singularExtensionNode
1216 && move == tte->move()
1219 // Avoid to do an expensive singular extension search on nodes where
1220 // such search have already been done in the past, so assume the last
1221 // singular extension search result is still valid.
1223 && depth < SingularExtensionDepth[PvNode] + 5 * OnePly
1224 && (ttx = TT.retrieve(pos.get_exclusion_key())) != NULL)
1226 if (is_upper_bound(ttx->type()))
1229 singularExtensionNode = false;
1232 Value ttValue = value_from_tt(tte->value(), ply);
1234 if (singularExtensionNode && abs(ttValue) < VALUE_KNOWN_WIN)
1236 Value b = ttValue - SingularExtensionMargin;
1237 ss->excludedMove = move;
1238 ss->skipNullMove = true;
1239 Value v = search<NonPV>(pos, ss, b - 1, b, depth / 2, ply);
1240 ss->skipNullMove = false;
1241 ss->excludedMove = MOVE_NONE;
1242 ss->bestMove = MOVE_NONE;
1248 newDepth = depth - OnePly + ext;
1250 // Update current move (this must be done after singular extension search)
1251 movesSearched[moveCount++] = ss->currentMove = move;
1253 // Step 12. Futility pruning (is omitted in PV nodes)
1255 && !captureOrPromotion
1259 && !move_is_castle(move))
1261 // Move count based pruning
1262 if ( moveCount >= futility_move_count(depth)
1263 && !(threatMove && connected_threat(pos, move, threatMove))
1264 && bestValue > value_mated_in(PLY_MAX))
1267 // Value based pruning
1268 // We illogically ignore reduction condition depth >= 3*OnePly for predicted depth,
1269 // but fixing this made program slightly weaker.
1270 Depth predictedDepth = newDepth - reduction<NonPV>(depth, moveCount);
1271 futilityValueScaled = ss->eval + futility_margin(predictedDepth, moveCount)
1272 + H.gain(pos.piece_on(move_from(move)), move_to(move));
1274 if (futilityValueScaled < beta)
1276 if (futilityValueScaled > bestValue)
1277 bestValue = futilityValueScaled;
1282 // Step 13. Make the move
1283 pos.do_move(move, st, ci, moveIsCheck);
1285 // Step extra. pv search (only in PV nodes)
1286 // The first move in list is the expected PV
1287 if (PvNode && moveCount == 1)
1288 value = newDepth < OnePly ? -qsearch<PV>(pos, ss+1, -beta, -alpha, Depth(0), ply+1)
1289 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth, ply+1);
1292 // Step 14. Reduced depth search
1293 // If the move fails high will be re-searched at full depth.
1294 bool doFullDepthSearch = true;
1296 if ( depth >= 3 * OnePly
1297 && !captureOrPromotion
1299 && !move_is_castle(move)
1300 && !move_is_killer(move, ss))
1302 ss->reduction = reduction<PvNode>(depth, moveCount);
1305 Depth d = newDepth - ss->reduction;
1306 value = d < OnePly ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, Depth(0), ply+1)
1307 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, d, ply+1);
1309 doFullDepthSearch = (value > alpha);
1312 // The move failed high, but if reduction is very big we could
1313 // face a false positive, retry with a less aggressive reduction,
1314 // if the move fails high again then go with full depth search.
1315 if (doFullDepthSearch && ss->reduction > 2 * OnePly)
1317 assert(newDepth - OnePly >= OnePly);
1319 ss->reduction = OnePly;
1320 value = -search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth-ss->reduction, ply+1);
1321 doFullDepthSearch = (value > alpha);
1323 ss->reduction = Depth(0); // Restore original reduction
1326 // Step 15. Full depth search
1327 if (doFullDepthSearch)
1329 value = newDepth < OnePly ? -qsearch<NonPV>(pos, ss+1, -(alpha+1), -alpha, Depth(0), ply+1)
1330 : - search<NonPV>(pos, ss+1, -(alpha+1), -alpha, newDepth, ply+1);
1332 // Step extra. pv search (only in PV nodes)
1333 // Search only for possible new PV nodes, if instead value >= beta then
1334 // parent node fails low with value <= alpha and tries another move.
1335 if (PvNode && value > alpha && value < beta)
1336 value = newDepth < OnePly ? -qsearch<PV>(pos, ss+1, -beta, -alpha, Depth(0), ply+1)
1337 : - search<PV>(pos, ss+1, -beta, -alpha, newDepth, ply+1);
1341 // Step 16. Undo move
1342 pos.undo_move(move);
1344 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1346 // Step 17. Check for new best move
1347 if (value > bestValue)
1352 if (PvNode && value < beta) // We want always alpha < beta
1355 if (value == value_mate_in(ply + 1))
1356 ss->mateKiller = move;
1358 ss->bestMove = move;
1362 // Step 18. Check for split
1363 if ( depth >= MinimumSplitDepth
1364 && TM.active_threads() > 1
1366 && TM.available_thread_exists(threadID)
1368 && !TM.thread_should_stop(threadID)
1370 TM.split<FakeSplit>(pos, ss, ply, &alpha, beta, &bestValue, depth,
1371 threatMove, mateThreat, &moveCount, &mp, PvNode);
1374 // Step 19. Check for mate and stalemate
1375 // All legal moves have been searched and if there are
1376 // no legal moves, it must be mate or stalemate.
1377 // If one move was excluded return fail low score.
1379 return excludedMove ? oldAlpha : isCheck ? value_mated_in(ply) : VALUE_DRAW;
1381 // Step 20. Update tables
1382 // If the search is not aborted, update the transposition table,
1383 // history counters, and killer moves.
1384 if (AbortSearch || TM.thread_should_stop(threadID))
1387 ValueType vt = (bestValue <= oldAlpha ? VALUE_TYPE_UPPER : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT);
1388 move = (bestValue <= oldAlpha ? MOVE_NONE : ss->bestMove);
1389 TT.store(posKey, value_to_tt(bestValue, ply), vt, depth, move, ss->eval, ei.kingDanger[pos.side_to_move()]);
1391 // Update killers and history only for non capture moves that fails high
1392 if (bestValue >= beta)
1394 TM.incrementBetaCounter(pos.side_to_move(), depth, threadID);
1395 if (!pos.move_is_capture_or_promotion(move))
1397 update_history(pos, move, depth, movesSearched, moveCount);
1398 update_killers(move, ss);
1402 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1408 // qsearch() is the quiescence search function, which is called by the main
1409 // search function when the remaining depth is zero (or, to be more precise,
1410 // less than OnePly).
1412 template <NodeType PvNode>
1413 Value qsearch(Position& pos, SearchStack* ss, Value alpha, Value beta, Depth depth, int ply) {
1415 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1416 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1417 assert(PvNode || alpha == beta - 1);
1419 assert(ply > 0 && ply < PLY_MAX);
1420 assert(pos.thread() >= 0 && pos.thread() < TM.active_threads());
1425 Value bestValue, value, futilityValue, futilityBase;
1426 bool isCheck, deepChecks, enoughMaterial, moveIsCheck, evasionPrunable;
1428 Value oldAlpha = alpha;
1430 TM.incrementNodeCounter(pos.thread());
1431 ss->bestMove = ss->currentMove = MOVE_NONE;
1433 // Check for an instant draw or maximum ply reached
1434 if (pos.is_draw() || ply >= PLY_MAX - 1)
1437 // Transposition table lookup. At PV nodes, we don't use the TT for
1438 // pruning, but only for move ordering.
1439 tte = TT.retrieve(pos.get_key());
1440 ttMove = (tte ? tte->move() : MOVE_NONE);
1442 if (!PvNode && tte && ok_to_use_TT(tte, depth, beta, ply))
1444 ss->bestMove = ttMove; // Can be MOVE_NONE
1445 return value_from_tt(tte->value(), ply);
1448 isCheck = pos.is_check();
1450 // Evaluate the position statically
1453 bestValue = futilityBase = -VALUE_INFINITE;
1454 ss->eval = VALUE_NONE;
1455 deepChecks = enoughMaterial = false;
1461 assert(tte->static_value() != VALUE_NONE);
1463 ei.kingDanger[pos.side_to_move()] = tte->king_danger();
1464 bestValue = tte->static_value();
1467 bestValue = evaluate(pos, ei);
1469 ss->eval = bestValue;
1470 update_gains(pos, (ss-1)->currentMove, (ss-1)->eval, ss->eval);
1472 // Stand pat. Return immediately if static value is at least beta
1473 if (bestValue >= beta)
1476 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()]);
1481 if (PvNode && bestValue > alpha)
1484 // If we are near beta then try to get a cutoff pushing checks a bit further
1485 deepChecks = (depth == -OnePly && bestValue >= beta - PawnValueMidgame / 8);
1487 // Futility pruning parameters, not needed when in check
1488 futilityBase = bestValue + FutilityMarginQS + ei.kingDanger[pos.side_to_move()];
1489 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1492 // Initialize a MovePicker object for the current position, and prepare
1493 // to search the moves. Because the depth is <= 0 here, only captures,
1494 // queen promotions and checks (only if depth == 0 or depth == -OnePly
1495 // and we are near beta) will be generated.
1496 MovePicker mp = MovePicker(pos, ttMove, deepChecks ? Depth(0) : depth, H);
1499 // Loop through the moves until no moves remain or a beta cutoff occurs
1500 while ( alpha < beta
1501 && (move = mp.get_next_move()) != MOVE_NONE)
1503 assert(move_is_ok(move));
1505 moveIsCheck = pos.move_is_check(move, ci);
1513 && !move_is_promotion(move)
1514 && !pos.move_is_passed_pawn_push(move))
1516 futilityValue = futilityBase
1517 + pos.endgame_value_of_piece_on(move_to(move))
1518 + (move_is_ep(move) ? PawnValueEndgame : Value(0));
1520 if (futilityValue < alpha)
1522 if (futilityValue > bestValue)
1523 bestValue = futilityValue;
1528 // Detect blocking evasions that are candidate to be pruned
1529 evasionPrunable = isCheck
1530 && bestValue > value_mated_in(PLY_MAX)
1531 && !pos.move_is_capture(move)
1532 && pos.type_of_piece_on(move_from(move)) != KING
1533 && !pos.can_castle(pos.side_to_move());
1535 // Don't search moves with negative SEE values
1537 && (!isCheck || evasionPrunable)
1539 && !move_is_promotion(move)
1540 && pos.see_sign(move) < 0)
1543 // Update current move
1544 ss->currentMove = move;
1546 // Make and search the move
1547 pos.do_move(move, st, ci, moveIsCheck);
1548 value = -qsearch<PvNode>(pos, ss+1, -beta, -alpha, depth-OnePly, ply+1);
1549 pos.undo_move(move);
1551 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1554 if (value > bestValue)
1560 ss->bestMove = move;
1565 // All legal moves have been searched. A special case: If we're in check
1566 // and no legal moves were found, it is checkmate.
1567 if (isCheck && bestValue == -VALUE_INFINITE)
1568 return value_mated_in(ply);
1570 // Update transposition table
1571 Depth d = (depth == Depth(0) ? Depth(0) : Depth(-1));
1572 ValueType vt = (bestValue <= oldAlpha ? VALUE_TYPE_UPPER : bestValue >= beta ? VALUE_TYPE_LOWER : VALUE_TYPE_EXACT);
1573 TT.store(pos.get_key(), value_to_tt(bestValue, ply), vt, d, ss->bestMove, ss->eval, ei.kingDanger[pos.side_to_move()]);
1575 // Update killers only for checking moves that fails high
1576 if ( bestValue >= beta
1577 && !pos.move_is_capture_or_promotion(ss->bestMove))
1578 update_killers(ss->bestMove, ss);
1580 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1586 // sp_search() is used to search from a split point. This function is called
1587 // by each thread working at the split point. It is similar to the normal
1588 // search() function, but simpler. Because we have already probed the hash
1589 // table, done a null move search, and searched the first move before
1590 // splitting, we don't have to repeat all this work in sp_search(). We
1591 // also don't need to store anything to the hash table here: This is taken
1592 // care of after we return from the split point.
1594 template <NodeType PvNode>
1595 void sp_search(SplitPoint* sp, int threadID) {
1597 assert(threadID >= 0 && threadID < TM.active_threads());
1598 assert(TM.active_threads() > 1);
1602 Depth ext, newDepth;
1604 Value futilityValueScaled; // NonPV specific
1605 bool isCheck, moveIsCheck, captureOrPromotion, dangerous;
1607 value = -VALUE_INFINITE;
1609 Position pos(*sp->pos, threadID);
1611 SearchStack* ss = sp->sstack[threadID] + 1;
1612 isCheck = pos.is_check();
1614 // Step 10. Loop through moves
1615 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1616 lock_grab(&(sp->lock));
1618 while ( sp->bestValue < sp->beta
1619 && (move = sp->mp->get_next_move()) != MOVE_NONE
1620 && !TM.thread_should_stop(threadID))
1622 moveCount = ++sp->moveCount;
1623 lock_release(&(sp->lock));
1625 assert(move_is_ok(move));
1627 moveIsCheck = pos.move_is_check(move, ci);
1628 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1630 // Step 11. Decide the new search depth
1631 ext = extension<PvNode>(pos, move, captureOrPromotion, moveIsCheck, false, sp->mateThreat, &dangerous);
1632 newDepth = sp->depth - OnePly + ext;
1634 // Update current move
1635 ss->currentMove = move;
1637 // Step 12. Futility pruning (is omitted in PV nodes)
1639 && !captureOrPromotion
1642 && !move_is_castle(move))
1644 // Move count based pruning
1645 if ( moveCount >= futility_move_count(sp->depth)
1646 && !(sp->threatMove && connected_threat(pos, move, sp->threatMove))
1647 && sp->bestValue > value_mated_in(PLY_MAX))
1649 lock_grab(&(sp->lock));
1653 // Value based pruning
1654 Depth predictedDepth = newDepth - reduction<NonPV>(sp->depth, moveCount);
1655 futilityValueScaled = ss->eval + futility_margin(predictedDepth, moveCount)
1656 + H.gain(pos.piece_on(move_from(move)), move_to(move));
1658 if (futilityValueScaled < sp->beta)
1660 lock_grab(&(sp->lock));
1662 if (futilityValueScaled > sp->bestValue)
1663 sp->bestValue = futilityValueScaled;
1668 // Step 13. Make the move
1669 pos.do_move(move, st, ci, moveIsCheck);
1671 // Step 14. Reduced search
1672 // If the move fails high will be re-searched at full depth.
1673 bool doFullDepthSearch = true;
1675 if ( !captureOrPromotion
1677 && !move_is_castle(move)
1678 && !move_is_killer(move, ss))
1680 ss->reduction = reduction<PvNode>(sp->depth, moveCount);
1683 Value localAlpha = sp->alpha;
1684 Depth d = newDepth - ss->reduction;
1685 value = d < OnePly ? -qsearch<NonPV>(pos, ss+1, -(localAlpha+1), -localAlpha, Depth(0), sp->ply+1)
1686 : - search<NonPV>(pos, ss+1, -(localAlpha+1), -localAlpha, d, sp->ply+1);
1688 doFullDepthSearch = (value > localAlpha);
1691 // The move failed high, but if reduction is very big we could
1692 // face a false positive, retry with a less aggressive reduction,
1693 // if the move fails high again then go with full depth search.
1694 if (doFullDepthSearch && ss->reduction > 2 * OnePly)
1696 assert(newDepth - OnePly >= OnePly);
1698 ss->reduction = OnePly;
1699 Value localAlpha = sp->alpha;
1700 value = -search<NonPV>(pos, ss+1, -(localAlpha+1), -localAlpha, newDepth-ss->reduction, sp->ply+1);
1701 doFullDepthSearch = (value > localAlpha);
1703 ss->reduction = Depth(0); // Restore original reduction
1706 // Step 15. Full depth search
1707 if (doFullDepthSearch)
1709 Value localAlpha = sp->alpha;
1710 value = newDepth < OnePly ? -qsearch<NonPV>(pos, ss+1, -(localAlpha+1), -localAlpha, Depth(0), sp->ply+1)
1711 : - search<NonPV>(pos, ss+1, -(localAlpha+1), -localAlpha, newDepth, sp->ply+1);
1713 // Step extra. pv search (only in PV nodes)
1714 // Search only for possible new PV nodes, if instead value >= beta then
1715 // parent node fails low with value <= alpha and tries another move.
1716 if (PvNode && value > localAlpha && value < sp->beta)
1717 value = newDepth < OnePly ? -qsearch<PV>(pos, ss+1, -sp->beta, -sp->alpha, Depth(0), sp->ply+1)
1718 : - search<PV>(pos, ss+1, -sp->beta, -sp->alpha, newDepth, sp->ply+1);
1721 // Step 16. Undo move
1722 pos.undo_move(move);
1724 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1726 // Step 17. Check for new best move
1727 lock_grab(&(sp->lock));
1729 if (value > sp->bestValue && !TM.thread_should_stop(threadID))
1731 sp->bestValue = value;
1733 if (sp->bestValue > sp->alpha)
1735 if (!PvNode || value >= sp->beta)
1736 sp->stopRequest = true;
1738 if (PvNode && value < sp->beta) // This guarantees that always: sp->alpha < sp->beta
1741 sp->parentSstack->bestMove = ss->bestMove = move;
1746 /* Here we have the lock still grabbed */
1748 sp->slaves[threadID] = 0;
1750 lock_release(&(sp->lock));
1754 // connected_moves() tests whether two moves are 'connected' in the sense
1755 // that the first move somehow made the second move possible (for instance
1756 // if the moving piece is the same in both moves). The first move is assumed
1757 // to be the move that was made to reach the current position, while the
1758 // second move is assumed to be a move from the current position.
1760 bool connected_moves(const Position& pos, Move m1, Move m2) {
1762 Square f1, t1, f2, t2;
1765 assert(move_is_ok(m1));
1766 assert(move_is_ok(m2));
1768 if (m2 == MOVE_NONE)
1771 // Case 1: The moving piece is the same in both moves
1777 // Case 2: The destination square for m2 was vacated by m1
1783 // Case 3: Moving through the vacated square
1784 if ( piece_is_slider(pos.piece_on(f2))
1785 && bit_is_set(squares_between(f2, t2), f1))
1788 // Case 4: The destination square for m2 is defended by the moving piece in m1
1789 p = pos.piece_on(t1);
1790 if (bit_is_set(pos.attacks_from(p, t1), t2))
1793 // Case 5: Discovered check, checking piece is the piece moved in m1
1794 if ( piece_is_slider(p)
1795 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
1796 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
1798 // discovered_check_candidates() works also if the Position's side to
1799 // move is the opposite of the checking piece.
1800 Color them = opposite_color(pos.side_to_move());
1801 Bitboard dcCandidates = pos.discovered_check_candidates(them);
1803 if (bit_is_set(dcCandidates, f2))
1810 // value_is_mate() checks if the given value is a mate one eventually
1811 // compensated for the ply.
1813 bool value_is_mate(Value value) {
1815 assert(abs(value) <= VALUE_INFINITE);
1817 return value <= value_mated_in(PLY_MAX)
1818 || value >= value_mate_in(PLY_MAX);
1822 // value_to_tt() adjusts a mate score from "plies to mate from the root" to
1823 // "plies to mate from the current ply". Non-mate scores are unchanged.
1824 // The function is called before storing a value to the transposition table.
1826 Value value_to_tt(Value v, int ply) {
1828 if (v >= value_mate_in(PLY_MAX))
1831 if (v <= value_mated_in(PLY_MAX))
1838 // value_from_tt() is the inverse of value_to_tt(): It adjusts a mate score from
1839 // the transposition table to a mate score corrected for the current ply.
1841 Value value_from_tt(Value v, int ply) {
1843 if (v >= value_mate_in(PLY_MAX))
1846 if (v <= value_mated_in(PLY_MAX))
1853 // move_is_killer() checks if the given move is among the killer moves
1855 bool move_is_killer(Move m, SearchStack* ss) {
1857 if (ss->killers[0] == m || ss->killers[1] == m)
1864 // extension() decides whether a move should be searched with normal depth,
1865 // or with extended depth. Certain classes of moves (checking moves, in
1866 // particular) are searched with bigger depth than ordinary moves and in
1867 // any case are marked as 'dangerous'. Note that also if a move is not
1868 // extended, as example because the corresponding UCI option is set to zero,
1869 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
1870 template <NodeType PvNode>
1871 Depth extension(const Position& pos, Move m, bool captureOrPromotion, bool moveIsCheck,
1872 bool singleEvasion, bool mateThreat, bool* dangerous) {
1874 assert(m != MOVE_NONE);
1876 Depth result = Depth(0);
1877 *dangerous = moveIsCheck | singleEvasion | mateThreat;
1881 if (moveIsCheck && pos.see_sign(m) >= 0)
1882 result += CheckExtension[PvNode];
1885 result += SingleEvasionExtension[PvNode];
1888 result += MateThreatExtension[PvNode];
1891 if (pos.type_of_piece_on(move_from(m)) == PAWN)
1893 Color c = pos.side_to_move();
1894 if (relative_rank(c, move_to(m)) == RANK_7)
1896 result += PawnPushTo7thExtension[PvNode];
1899 if (pos.pawn_is_passed(c, move_to(m)))
1901 result += PassedPawnExtension[PvNode];
1906 if ( captureOrPromotion
1907 && pos.type_of_piece_on(move_to(m)) != PAWN
1908 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
1909 - pos.midgame_value_of_piece_on(move_to(m)) == Value(0))
1910 && !move_is_promotion(m)
1913 result += PawnEndgameExtension[PvNode];
1918 && captureOrPromotion
1919 && pos.type_of_piece_on(move_to(m)) != PAWN
1920 && pos.see_sign(m) >= 0)
1926 return Min(result, OnePly);
1930 // connected_threat() tests whether it is safe to forward prune a move or if
1931 // is somehow coonected to the threat move returned by null search.
1933 bool connected_threat(const Position& pos, Move m, Move threat) {
1935 assert(move_is_ok(m));
1936 assert(threat && move_is_ok(threat));
1937 assert(!pos.move_is_check(m));
1938 assert(!pos.move_is_capture_or_promotion(m));
1939 assert(!pos.move_is_passed_pawn_push(m));
1941 Square mfrom, mto, tfrom, tto;
1943 mfrom = move_from(m);
1945 tfrom = move_from(threat);
1946 tto = move_to(threat);
1948 // Case 1: Don't prune moves which move the threatened piece
1952 // Case 2: If the threatened piece has value less than or equal to the
1953 // value of the threatening piece, don't prune move which defend it.
1954 if ( pos.move_is_capture(threat)
1955 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
1956 || pos.type_of_piece_on(tfrom) == KING)
1957 && pos.move_attacks_square(m, tto))
1960 // Case 3: If the moving piece in the threatened move is a slider, don't
1961 // prune safe moves which block its ray.
1962 if ( piece_is_slider(pos.piece_on(tfrom))
1963 && bit_is_set(squares_between(tfrom, tto), mto)
1964 && pos.see_sign(m) >= 0)
1971 // ok_to_use_TT() returns true if a transposition table score
1972 // can be used at a given point in search.
1974 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
1976 Value v = value_from_tt(tte->value(), ply);
1978 return ( tte->depth() >= depth
1979 || v >= Max(value_mate_in(PLY_MAX), beta)
1980 || v < Min(value_mated_in(PLY_MAX), beta))
1982 && ( (is_lower_bound(tte->type()) && v >= beta)
1983 || (is_upper_bound(tte->type()) && v < beta));
1987 // refine_eval() returns the transposition table score if
1988 // possible otherwise falls back on static position evaluation.
1990 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
1994 Value v = value_from_tt(tte->value(), ply);
1996 if ( (is_lower_bound(tte->type()) && v >= defaultEval)
1997 || (is_upper_bound(tte->type()) && v < defaultEval))
2004 // update_history() registers a good move that produced a beta-cutoff
2005 // in history and marks as failures all the other moves of that ply.
2007 void update_history(const Position& pos, Move move, Depth depth,
2008 Move movesSearched[], int moveCount) {
2012 H.success(pos.piece_on(move_from(move)), move_to(move), depth);
2014 for (int i = 0; i < moveCount - 1; i++)
2016 m = movesSearched[i];
2020 if (!pos.move_is_capture_or_promotion(m))
2021 H.failure(pos.piece_on(move_from(m)), move_to(m), depth);
2026 // update_killers() add a good move that produced a beta-cutoff
2027 // among the killer moves of that ply.
2029 void update_killers(Move m, SearchStack* ss) {
2031 if (m == ss->killers[0])
2034 ss->killers[1] = ss->killers[0];
2039 // update_gains() updates the gains table of a non-capture move given
2040 // the static position evaluation before and after the move.
2042 void update_gains(const Position& pos, Move m, Value before, Value after) {
2045 && before != VALUE_NONE
2046 && after != VALUE_NONE
2047 && pos.captured_piece() == NO_PIECE_TYPE
2048 && !move_is_special(m))
2049 H.set_gain(pos.piece_on(move_to(m)), move_to(m), -(before + after));
2053 // current_search_time() returns the number of milliseconds which have passed
2054 // since the beginning of the current search.
2056 int current_search_time() {
2058 return get_system_time() - SearchStartTime;
2062 // value_to_uci() converts a value to a string suitable for use with the UCI protocol
2064 std::string value_to_uci(Value v) {
2066 std::stringstream s;
2068 if (abs(v) < VALUE_MATE - PLY_MAX * OnePly)
2069 s << "cp " << int(v) * 100 / int(PawnValueMidgame); // Scale to pawn = 100
2071 s << "mate " << (v > 0 ? (VALUE_MATE - v + 1) / 2 : -(VALUE_MATE + v) / 2 );
2076 // nps() computes the current nodes/second count.
2080 int t = current_search_time();
2081 return (t > 0 ? int((TM.nodes_searched() * 1000) / t) : 0);
2085 // poll() performs two different functions: It polls for user input, and it
2086 // looks at the time consumed so far and decides if it's time to abort the
2091 static int lastInfoTime;
2092 int t = current_search_time();
2097 // We are line oriented, don't read single chars
2098 std::string command;
2100 if (!std::getline(std::cin, command))
2103 if (command == "quit")
2106 PonderSearch = false;
2110 else if (command == "stop")
2113 PonderSearch = false;
2115 else if (command == "ponderhit")
2119 // Print search information
2123 else if (lastInfoTime > t)
2124 // HACK: Must be a new search where we searched less than
2125 // NodesBetweenPolls nodes during the first second of search.
2128 else if (t - lastInfoTime >= 1000)
2135 if (dbg_show_hit_rate)
2136 dbg_print_hit_rate();
2138 cout << "info nodes " << TM.nodes_searched() << " nps " << nps()
2139 << " time " << t << endl;
2142 // Should we stop the search?
2146 bool stillAtFirstMove = FirstRootMove
2147 && !AspirationFailLow
2148 && t > OptimumSearchTime + ExtraSearchTime;
2150 bool noMoreTime = t > MaximumSearchTime
2151 || stillAtFirstMove;
2153 if ( (Iteration >= 3 && UseTimeManagement && noMoreTime)
2154 || (ExactMaxTime && t >= ExactMaxTime)
2155 || (Iteration >= 3 && MaxNodes && TM.nodes_searched() >= MaxNodes))
2160 // ponderhit() is called when the program is pondering (i.e. thinking while
2161 // it's the opponent's turn to move) in order to let the engine know that
2162 // it correctly predicted the opponent's move.
2166 int t = current_search_time();
2167 PonderSearch = false;
2169 bool stillAtFirstMove = FirstRootMove
2170 && !AspirationFailLow
2171 && t > OptimumSearchTime + ExtraSearchTime;
2173 bool noMoreTime = t > MaximumSearchTime
2174 || stillAtFirstMove;
2176 if (Iteration >= 3 && UseTimeManagement && (noMoreTime || StopOnPonderhit))
2181 // init_ss_array() does a fast reset of the first entries of a SearchStack
2182 // array and of all the excludedMove and skipNullMove entries.
2184 void init_ss_array(SearchStack* ss, int size) {
2186 for (int i = 0; i < size; i++, ss++)
2188 ss->excludedMove = MOVE_NONE;
2189 ss->skipNullMove = false;
2190 ss->reduction = Depth(0);
2193 ss->killers[0] = ss->killers[1] = ss->mateKiller = MOVE_NONE;
2198 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2199 // while the program is pondering. The point is to work around a wrinkle in
2200 // the UCI protocol: When pondering, the engine is not allowed to give a
2201 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2202 // We simply wait here until one of these commands is sent, and return,
2203 // after which the bestmove and pondermove will be printed (in id_loop()).
2205 void wait_for_stop_or_ponderhit() {
2207 std::string command;
2211 if (!std::getline(std::cin, command))
2214 if (command == "quit")
2219 else if (command == "ponderhit" || command == "stop")
2225 // print_pv_info() prints to standard output and eventually to log file information on
2226 // the current PV line. It is called at each iteration or after a new pv is found.
2228 void print_pv_info(const Position& pos, Move pv[], Value alpha, Value beta, Value value) {
2230 cout << "info depth " << Iteration
2231 << " score " << value_to_uci(value)
2232 << (value >= beta ? " lowerbound" : value <= alpha ? " upperbound" : "")
2233 << " time " << current_search_time()
2234 << " nodes " << TM.nodes_searched()
2238 for (Move* m = pv; *m != MOVE_NONE; m++)
2245 ValueType t = value >= beta ? VALUE_TYPE_LOWER :
2246 value <= alpha ? VALUE_TYPE_UPPER : VALUE_TYPE_EXACT;
2248 LogFile << pretty_pv(pos, current_search_time(), Iteration,
2249 TM.nodes_searched(), value, t, pv) << endl;
2254 // insert_pv_in_tt() is called at the end of a search iteration, and inserts
2255 // the PV back into the TT. This makes sure the old PV moves are searched
2256 // first, even if the old TT entries have been overwritten.
2258 void insert_pv_in_tt(const Position& pos, Move pv[]) {
2262 Position p(pos, pos.thread());
2266 for (int i = 0; pv[i] != MOVE_NONE; i++)
2268 tte = TT.retrieve(p.get_key());
2269 if (!tte || tte->move() != pv[i])
2271 v = (p.is_check() ? VALUE_NONE : evaluate(p, ei));
2272 TT.store(p.get_key(), VALUE_NONE, VALUE_TYPE_NONE, DEPTH_NONE, pv[i], v, ei.kingDanger[pos.side_to_move()]);
2274 p.do_move(pv[i], st);
2279 // extract_pv_from_tt() builds a PV by adding moves from the transposition table.
2280 // We consider also failing high nodes and not only VALUE_TYPE_EXACT nodes. This
2281 // allow to always have a ponder move even when we fail high at root and also a
2282 // long PV to print that is important for position analysis.
2284 void extract_pv_from_tt(const Position& pos, Move bestMove, Move pv[]) {
2288 Position p(pos, pos.thread());
2291 assert(bestMove != MOVE_NONE);
2294 p.do_move(pv[ply++], st);
2296 while ( (tte = TT.retrieve(p.get_key())) != NULL
2297 && tte->move() != MOVE_NONE
2298 && move_is_legal(p, tte->move())
2300 && (!p.is_draw() || ply < 2))
2302 pv[ply] = tte->move();
2303 p.do_move(pv[ply++], st);
2305 pv[ply] = MOVE_NONE;
2309 // init_thread() is the function which is called when a new thread is
2310 // launched. It simply calls the idle_loop() function with the supplied
2311 // threadID. There are two versions of this function; one for POSIX
2312 // threads and one for Windows threads.
2314 #if !defined(_MSC_VER)
2316 void* init_thread(void *threadID) {
2318 TM.idle_loop(*(int*)threadID, NULL);
2324 DWORD WINAPI init_thread(LPVOID threadID) {
2326 TM.idle_loop(*(int*)threadID, NULL);
2333 /// The ThreadsManager class
2335 // resetNodeCounters(), resetBetaCounters(), searched_nodes() and
2336 // get_beta_counters() are getters/setters for the per thread
2337 // counters used to sort the moves at root.
2339 void ThreadsManager::resetNodeCounters() {
2341 for (int i = 0; i < MAX_THREADS; i++)
2342 threads[i].nodes = 0ULL;
2345 void ThreadsManager::resetBetaCounters() {
2347 for (int i = 0; i < MAX_THREADS; i++)
2348 threads[i].betaCutOffs[WHITE] = threads[i].betaCutOffs[BLACK] = 0ULL;
2351 int64_t ThreadsManager::nodes_searched() const {
2353 int64_t result = 0ULL;
2354 for (int i = 0; i < ActiveThreads; i++)
2355 result += threads[i].nodes;
2360 void ThreadsManager::get_beta_counters(Color us, int64_t& our, int64_t& their) const {
2363 for (int i = 0; i < MAX_THREADS; i++)
2365 our += threads[i].betaCutOffs[us];
2366 their += threads[i].betaCutOffs[opposite_color(us)];
2371 // idle_loop() is where the threads are parked when they have no work to do.
2372 // The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint
2373 // object for which the current thread is the master.
2375 void ThreadsManager::idle_loop(int threadID, SplitPoint* sp) {
2377 assert(threadID >= 0 && threadID < MAX_THREADS);
2381 // Slave threads can exit as soon as AllThreadsShouldExit raises,
2382 // master should exit as last one.
2383 if (AllThreadsShouldExit)
2386 threads[threadID].state = THREAD_TERMINATED;
2390 // If we are not thinking, wait for a condition to be signaled
2391 // instead of wasting CPU time polling for work.
2392 while (AllThreadsShouldSleep || threadID >= ActiveThreads)
2395 assert(threadID != 0);
2396 threads[threadID].state = THREAD_SLEEPING;
2398 #if !defined(_MSC_VER)
2399 lock_grab(&WaitLock);
2400 if (AllThreadsShouldSleep || threadID >= ActiveThreads)
2401 pthread_cond_wait(&WaitCond, &WaitLock);
2402 lock_release(&WaitLock);
2404 WaitForSingleObject(SitIdleEvent[threadID], INFINITE);
2408 // If thread has just woken up, mark it as available
2409 if (threads[threadID].state == THREAD_SLEEPING)
2410 threads[threadID].state = THREAD_AVAILABLE;
2412 // If this thread has been assigned work, launch a search
2413 if (threads[threadID].state == THREAD_WORKISWAITING)
2415 assert(!AllThreadsShouldExit && !AllThreadsShouldSleep);
2417 threads[threadID].state = THREAD_SEARCHING;
2419 if (threads[threadID].splitPoint->pvNode)
2420 sp_search<PV>(threads[threadID].splitPoint, threadID);
2422 sp_search<NonPV>(threads[threadID].splitPoint, threadID);
2424 assert(threads[threadID].state == THREAD_SEARCHING);
2426 threads[threadID].state = THREAD_AVAILABLE;
2429 // If this thread is the master of a split point and all slaves have
2430 // finished their work at this split point, return from the idle loop.
2432 for ( ; sp && i < ActiveThreads && !sp->slaves[i]; i++) {}
2434 if (i == ActiveThreads)
2436 // Because sp->slaves[] is reset under lock protection,
2437 // be sure sp->lock has been released before to return.
2438 lock_grab(&(sp->lock));
2439 lock_release(&(sp->lock));
2441 assert(threads[threadID].state == THREAD_AVAILABLE);
2443 threads[threadID].state = THREAD_SEARCHING;
2450 // init_threads() is called during startup. It launches all helper threads,
2451 // and initializes the split point stack and the global locks and condition
2454 void ThreadsManager::init_threads() {
2459 #if !defined(_MSC_VER)
2460 pthread_t pthread[1];
2463 // Initialize global locks
2465 lock_init(&WaitLock);
2467 #if !defined(_MSC_VER)
2468 pthread_cond_init(&WaitCond, NULL);
2470 for (i = 0; i < MAX_THREADS; i++)
2471 SitIdleEvent[i] = CreateEvent(0, FALSE, FALSE, 0);
2474 // Initialize splitPoints[] locks
2475 for (i = 0; i < MAX_THREADS; i++)
2476 for (int j = 0; j < MAX_ACTIVE_SPLIT_POINTS; j++)
2477 lock_init(&(threads[i].splitPoints[j].lock));
2479 // Will be set just before program exits to properly end the threads
2480 AllThreadsShouldExit = false;
2482 // Threads will be put to sleep as soon as created
2483 AllThreadsShouldSleep = true;
2485 // All threads except the main thread should be initialized to THREAD_AVAILABLE
2487 threads[0].state = THREAD_SEARCHING;
2488 for (i = 1; i < MAX_THREADS; i++)
2489 threads[i].state = THREAD_AVAILABLE;
2491 // Launch the helper threads
2492 for (i = 1; i < MAX_THREADS; i++)
2495 #if !defined(_MSC_VER)
2496 ok = (pthread_create(pthread, NULL, init_thread, (void*)(&i)) == 0);
2498 ok = (CreateThread(NULL, 0, init_thread, (LPVOID)(&i), 0, NULL) != NULL);
2503 cout << "Failed to create thread number " << i << endl;
2504 Application::exit_with_failure();
2507 // Wait until the thread has finished launching and is gone to sleep
2508 while (threads[i].state != THREAD_SLEEPING) {}
2513 // exit_threads() is called when the program exits. It makes all the
2514 // helper threads exit cleanly.
2516 void ThreadsManager::exit_threads() {
2518 ActiveThreads = MAX_THREADS; // HACK
2519 AllThreadsShouldSleep = true; // HACK
2520 wake_sleeping_threads();
2522 // This makes the threads to exit idle_loop()
2523 AllThreadsShouldExit = true;
2525 // Wait for thread termination
2526 for (int i = 1; i < MAX_THREADS; i++)
2527 while (threads[i].state != THREAD_TERMINATED) {}
2529 // Now we can safely destroy the locks
2530 for (int i = 0; i < MAX_THREADS; i++)
2531 for (int j = 0; j < MAX_ACTIVE_SPLIT_POINTS; j++)
2532 lock_destroy(&(threads[i].splitPoints[j].lock));
2534 lock_destroy(&WaitLock);
2535 lock_destroy(&MPLock);
2539 // thread_should_stop() checks whether the thread should stop its search.
2540 // This can happen if a beta cutoff has occurred in the thread's currently
2541 // active split point, or in some ancestor of the current split point.
2543 bool ThreadsManager::thread_should_stop(int threadID) const {
2545 assert(threadID >= 0 && threadID < ActiveThreads);
2549 for (sp = threads[threadID].splitPoint; sp && !sp->stopRequest; sp = sp->parent) {}
2554 // thread_is_available() checks whether the thread with threadID "slave" is
2555 // available to help the thread with threadID "master" at a split point. An
2556 // obvious requirement is that "slave" must be idle. With more than two
2557 // threads, this is not by itself sufficient: If "slave" is the master of
2558 // some active split point, it is only available as a slave to the other
2559 // threads which are busy searching the split point at the top of "slave"'s
2560 // split point stack (the "helpful master concept" in YBWC terminology).
2562 bool ThreadsManager::thread_is_available(int slave, int master) const {
2564 assert(slave >= 0 && slave < ActiveThreads);
2565 assert(master >= 0 && master < ActiveThreads);
2566 assert(ActiveThreads > 1);
2568 if (threads[slave].state != THREAD_AVAILABLE || slave == master)
2571 // Make a local copy to be sure doesn't change under our feet
2572 int localActiveSplitPoints = threads[slave].activeSplitPoints;
2574 if (localActiveSplitPoints == 0)
2575 // No active split points means that the thread is available as
2576 // a slave for any other thread.
2579 if (ActiveThreads == 2)
2582 // Apply the "helpful master" concept if possible. Use localActiveSplitPoints
2583 // that is known to be > 0, instead of threads[slave].activeSplitPoints that
2584 // could have been set to 0 by another thread leading to an out of bound access.
2585 if (threads[slave].splitPoints[localActiveSplitPoints - 1].slaves[master])
2592 // available_thread_exists() tries to find an idle thread which is available as
2593 // a slave for the thread with threadID "master".
2595 bool ThreadsManager::available_thread_exists(int master) const {
2597 assert(master >= 0 && master < ActiveThreads);
2598 assert(ActiveThreads > 1);
2600 for (int i = 0; i < ActiveThreads; i++)
2601 if (thread_is_available(i, master))
2608 // split() does the actual work of distributing the work at a node between
2609 // several available threads. If it does not succeed in splitting the
2610 // node (because no idle threads are available, or because we have no unused
2611 // split point objects), the function immediately returns. If splitting is
2612 // possible, a SplitPoint object is initialized with all the data that must be
2613 // copied to the helper threads and we tell our helper threads that they have
2614 // been assigned work. This will cause them to instantly leave their idle loops
2615 // and call sp_search(). When all threads have returned from sp_search() then
2618 template <bool Fake>
2619 void ThreadsManager::split(const Position& p, SearchStack* ss, int ply, Value* alpha,
2620 const Value beta, Value* bestValue, Depth depth, Move threatMove,
2621 bool mateThreat, int* moveCount, MovePicker* mp, bool pvNode) {
2623 assert(ply > 0 && ply < PLY_MAX);
2624 assert(*bestValue >= -VALUE_INFINITE);
2625 assert(*bestValue <= *alpha);
2626 assert(*alpha < beta);
2627 assert(beta <= VALUE_INFINITE);
2628 assert(depth > Depth(0));
2629 assert(p.thread() >= 0 && p.thread() < ActiveThreads);
2630 assert(ActiveThreads > 1);
2632 int i, master = p.thread();
2633 Thread& masterThread = threads[master];
2637 // If no other thread is available to help us, or if we have too many
2638 // active split points, don't split.
2639 if ( !available_thread_exists(master)
2640 || masterThread.activeSplitPoints >= MAX_ACTIVE_SPLIT_POINTS)
2642 lock_release(&MPLock);
2646 // Pick the next available split point object from the split point stack
2647 SplitPoint& splitPoint = masterThread.splitPoints[masterThread.activeSplitPoints++];
2649 // Initialize the split point object
2650 splitPoint.parent = masterThread.splitPoint;
2651 splitPoint.stopRequest = false;
2652 splitPoint.ply = ply;
2653 splitPoint.depth = depth;
2654 splitPoint.threatMove = threatMove;
2655 splitPoint.mateThreat = mateThreat;
2656 splitPoint.alpha = *alpha;
2657 splitPoint.beta = beta;
2658 splitPoint.pvNode = pvNode;
2659 splitPoint.bestValue = *bestValue;
2661 splitPoint.moveCount = *moveCount;
2662 splitPoint.pos = &p;
2663 splitPoint.parentSstack = ss;
2664 for (i = 0; i < ActiveThreads; i++)
2665 splitPoint.slaves[i] = 0;
2667 masterThread.splitPoint = &splitPoint;
2669 // If we are here it means we are not available
2670 assert(masterThread.state != THREAD_AVAILABLE);
2672 int workersCnt = 1; // At least the master is included
2674 // Allocate available threads setting state to THREAD_BOOKED
2675 for (i = 0; !Fake && i < ActiveThreads && workersCnt < MaxThreadsPerSplitPoint; i++)
2676 if (thread_is_available(i, master))
2678 threads[i].state = THREAD_BOOKED;
2679 threads[i].splitPoint = &splitPoint;
2680 splitPoint.slaves[i] = 1;
2684 assert(Fake || workersCnt > 1);
2686 // We can release the lock because slave threads are already booked and master is not available
2687 lock_release(&MPLock);
2689 // Tell the threads that they have work to do. This will make them leave
2690 // their idle loop. But before copy search stack tail for each thread.
2691 for (i = 0; i < ActiveThreads; i++)
2692 if (i == master || splitPoint.slaves[i])
2694 memcpy(splitPoint.sstack[i], ss - 1, 4 * sizeof(SearchStack));
2696 assert(i == master || threads[i].state == THREAD_BOOKED);
2698 threads[i].state = THREAD_WORKISWAITING; // This makes the slave to exit from idle_loop()
2701 // Everything is set up. The master thread enters the idle loop, from
2702 // which it will instantly launch a search, because its state is
2703 // THREAD_WORKISWAITING. We send the split point as a second parameter to the
2704 // idle loop, which means that the main thread will return from the idle
2705 // loop when all threads have finished their work at this split point.
2706 idle_loop(master, &splitPoint);
2708 // We have returned from the idle loop, which means that all threads are
2709 // finished. Update alpha and bestValue, and return.
2712 *alpha = splitPoint.alpha;
2713 *bestValue = splitPoint.bestValue;
2714 masterThread.activeSplitPoints--;
2715 masterThread.splitPoint = splitPoint.parent;
2717 lock_release(&MPLock);
2721 // wake_sleeping_threads() wakes up all sleeping threads when it is time
2722 // to start a new search from the root.
2724 void ThreadsManager::wake_sleeping_threads() {
2726 assert(AllThreadsShouldSleep);
2727 assert(ActiveThreads > 0);
2729 AllThreadsShouldSleep = false;
2731 if (ActiveThreads == 1)
2734 #if !defined(_MSC_VER)
2735 pthread_mutex_lock(&WaitLock);
2736 pthread_cond_broadcast(&WaitCond);
2737 pthread_mutex_unlock(&WaitLock);
2739 for (int i = 1; i < MAX_THREADS; i++)
2740 SetEvent(SitIdleEvent[i]);
2746 // put_threads_to_sleep() makes all the threads go to sleep just before
2747 // to leave think(), at the end of the search. Threads should have already
2748 // finished the job and should be idle.
2750 void ThreadsManager::put_threads_to_sleep() {
2752 assert(!AllThreadsShouldSleep);
2754 // This makes the threads to go to sleep
2755 AllThreadsShouldSleep = true;
2758 /// The RootMoveList class
2760 // RootMoveList c'tor
2762 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) : count(0) {
2764 SearchStack ss[PLY_MAX_PLUS_2];
2765 MoveStack mlist[MaxRootMoves];
2767 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
2769 // Initialize search stack
2770 init_ss_array(ss, PLY_MAX_PLUS_2);
2771 ss[0].currentMove = ss[0].bestMove = MOVE_NONE;
2772 ss[0].eval = VALUE_NONE;
2774 // Generate all legal moves
2775 MoveStack* last = generate_moves(pos, mlist);
2777 // Add each move to the moves[] array
2778 for (MoveStack* cur = mlist; cur != last; cur++)
2780 bool includeMove = includeAllMoves;
2782 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
2783 includeMove = (searchMoves[k] == cur->move);
2788 // Find a quick score for the move
2789 pos.do_move(cur->move, st);
2790 ss[0].currentMove = cur->move;
2791 moves[count].move = cur->move;
2792 moves[count].score = -qsearch<PV>(pos, ss+1, -VALUE_INFINITE, VALUE_INFINITE, Depth(0), 1);
2793 moves[count].pv[0] = cur->move;
2794 moves[count].pv[1] = MOVE_NONE;
2795 pos.undo_move(cur->move);
2802 // RootMoveList simple methods definitions
2804 void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) {
2806 moves[moveNum].nodes = nodes;
2807 moves[moveNum].cumulativeNodes += nodes;
2810 void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) {
2812 moves[moveNum].ourBeta = our;
2813 moves[moveNum].theirBeta = their;
2816 void RootMoveList::set_move_pv(int moveNum, const Move pv[]) {
2820 for (j = 0; pv[j] != MOVE_NONE; j++)
2821 moves[moveNum].pv[j] = pv[j];
2823 moves[moveNum].pv[j] = MOVE_NONE;
2827 // RootMoveList::sort() sorts the root move list at the beginning of a new
2830 void RootMoveList::sort() {
2832 sort_multipv(count - 1); // Sort all items
2836 // RootMoveList::sort_multipv() sorts the first few moves in the root move
2837 // list by their scores and depths. It is used to order the different PVs
2838 // correctly in MultiPV mode.
2840 void RootMoveList::sort_multipv(int n) {
2844 for (i = 1; i <= n; i++)
2846 RootMove rm = moves[i];
2847 for (j = i; j > 0 && moves[j - 1] < rm; j--)
2848 moves[j] = moves[j - 1];