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-2009 Marco Costalba
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/>.
43 #include "ucioption.h"
49 //// Local definitions
57 // ThreadsManager class is used to handle all the threads related stuff in search,
58 // init, starting, parking and, the most important, launching a slave thread at a
59 // split point are what this class does. All the access to shared thread data is
60 // done through this class, so that we avoid using global variables instead.
62 class ThreadsManager {
63 /* As long as the single ThreadsManager object is defined as a global we don't
64 need to explicitly initialize to zero its data members because variables with
65 static storage duration are automatically set to zero before enter main()
71 int active_threads() const { return ActiveThreads; }
72 void set_active_threads(int newActiveThreads) { ActiveThreads = newActiveThreads; }
73 void incrementNodeCounter(int threadID) { threads[threadID].nodes++; }
74 void incrementBetaCounter(Color us, Depth d, int threadID) { threads[threadID].betaCutOffs[us] += unsigned(d); }
75 void print_current_line(SearchStack ss[], int ply, int threadID);
77 void resetNodeCounters();
78 void resetBetaCounters();
79 int64_t nodes_searched() const;
80 void get_beta_counters(Color us, int64_t& our, int64_t& their) const;
81 bool available_thread_exists(int master) const;
82 bool thread_is_available(int slave, int master) const;
83 bool thread_should_stop(int threadID) const;
84 void wake_sleeping_threads();
85 void put_threads_to_sleep();
86 void idle_loop(int threadID, SplitPoint* waitSp);
87 bool split(const Position& pos, SearchStack* ss, int ply, Value* alpha, Value* beta, Value* bestValue,
88 const Value futilityValue, Depth depth, int* moves, MovePicker* mp, int master, bool pvNode);
94 volatile bool AllThreadsShouldExit, AllThreadsShouldSleep;
95 Thread threads[MAX_THREADS];
96 SplitPoint SplitPointStack[MAX_THREADS][ACTIVE_SPLIT_POINTS_MAX];
100 #if !defined(_MSC_VER)
101 pthread_cond_t WaitCond;
102 pthread_mutex_t WaitLock;
104 HANDLE SitIdleEvent[MAX_THREADS];
110 // RootMove struct is used for moves at the root at the tree. For each
111 // root move, we store a score, a node count, and a PV (really a refutation
112 // in the case of moves which fail low).
116 RootMove() { nodes = cumulativeNodes = ourBeta = theirBeta = 0ULL; }
118 // RootMove::operator<() is the comparison function used when
119 // sorting the moves. A move m1 is considered to be better
120 // than a move m2 if it has a higher score, or if the moves
121 // have equal score but m1 has the higher node count.
122 bool operator<(const RootMove& m) const {
124 return score != m.score ? score < m.score : theirBeta <= m.theirBeta;
129 int64_t nodes, cumulativeNodes, ourBeta, theirBeta;
130 Move pv[PLY_MAX_PLUS_2];
134 // The RootMoveList class is essentially an array of RootMove objects, with
135 // a handful of methods for accessing the data in the individual moves.
140 RootMoveList(Position& pos, Move searchMoves[]);
142 int move_count() const { return count; }
143 Move get_move(int moveNum) const { return moves[moveNum].move; }
144 Value get_move_score(int moveNum) const { return moves[moveNum].score; }
145 void set_move_score(int moveNum, Value score) { moves[moveNum].score = score; }
146 Move get_move_pv(int moveNum, int i) const { return moves[moveNum].pv[i]; }
147 int64_t get_move_cumulative_nodes(int moveNum) const { return moves[moveNum].cumulativeNodes; }
149 void set_move_nodes(int moveNum, int64_t nodes);
150 void set_beta_counters(int moveNum, int64_t our, int64_t their);
151 void set_move_pv(int moveNum, const Move pv[]);
153 void sort_multipv(int n);
156 static const int MaxRootMoves = 500;
157 RootMove moves[MaxRootMoves];
164 // Search depth at iteration 1
165 const Depth InitialDepth = OnePly;
167 // Use internal iterative deepening?
168 const bool UseIIDAtPVNodes = true;
169 const bool UseIIDAtNonPVNodes = true;
171 // Internal iterative deepening margin. At Non-PV moves, when
172 // UseIIDAtNonPVNodes is true, we do an internal iterative deepening
173 // search when the static evaluation is at most IIDMargin below beta.
174 const Value IIDMargin = Value(0x100);
176 // Easy move margin. An easy move candidate must be at least this much
177 // better than the second best move.
178 const Value EasyMoveMargin = Value(0x200);
180 // Null move margin. A null move search will not be done if the static
181 // evaluation of the position is more than NullMoveMargin below beta.
182 const Value NullMoveMargin = Value(0x200);
184 // If the TT move is at least SingleReplyMargin better then the
185 // remaining ones we will extend it.
186 const Value SingleReplyMargin = Value(0x20);
188 // Depth limit for razoring
189 const Depth RazorDepth = 4 * OnePly;
191 /// Lookup tables initialized at startup
193 // Reduction lookup tables and their getter functions
194 int8_t PVReductionMatrix[64][64]; // [depth][moveNumber]
195 int8_t NonPVReductionMatrix[64][64]; // [depth][moveNumber]
197 inline Depth pv_reduction(Depth d, int mn) { return (Depth) PVReductionMatrix[Min(d / 2, 63)][Min(mn, 63)]; }
198 inline Depth nonpv_reduction(Depth d, int mn) { return (Depth) NonPVReductionMatrix[Min(d / 2, 63)][Min(mn, 63)]; }
200 // Futility lookup tables and their getter functions
201 const Value FutilityMarginQS = Value(0x80);
202 int32_t FutilityMarginsMatrix[14][64]; // [depth][moveNumber]
203 int FutilityMoveCountArray[32]; // [depth]
205 inline Value futility_margin(Depth d, int mn) { return Value(d < 7*OnePly ? FutilityMarginsMatrix[Max(d, 0)][Min(mn, 63)] : 2 * VALUE_INFINITE); }
206 inline int futility_move_count(Depth d) { return d < 16*OnePly ? FutilityMoveCountArray[d] : 512; }
208 /// Variables initialized by UCI options
210 // Depth limit for use of dynamic threat detection
213 // Last seconds noise filtering (LSN)
214 const bool UseLSNFiltering = true;
215 const int LSNTime = 4000; // In milliseconds
216 const Value LSNValue = value_from_centipawns(200);
217 bool loseOnTime = false;
219 // Extensions. Array index 0 is used at non-PV nodes, index 1 at PV nodes.
220 Depth CheckExtension[2], SingleEvasionExtension[2], PawnPushTo7thExtension[2];
221 Depth PassedPawnExtension[2], PawnEndgameExtension[2], MateThreatExtension[2];
223 // Iteration counters
226 // Scores and number of times the best move changed for each iteration
227 Value ValueByIteration[PLY_MAX_PLUS_2];
228 int BestMoveChangesByIteration[PLY_MAX_PLUS_2];
230 // Search window management
236 // Time managment variables
239 int MaxNodes, MaxDepth;
240 int MaxSearchTime, AbsoluteMaxSearchTime, ExtraSearchTime, ExactMaxTime;
241 bool UseTimeManagement, InfiniteSearch, PonderSearch, StopOnPonderhit;
242 bool AbortSearch, Quit;
243 bool AspirationFailLow;
245 // Show current line?
246 bool ShowCurrentLine;
250 std::ofstream LogFile;
252 // MP related variables
253 Depth MinimumSplitDepth;
254 int MaxThreadsPerSplitPoint;
257 // Node counters, used only by thread[0] but try to keep in different
258 // cache lines (64 bytes each) from the heavy SMP read accessed variables.
260 int NodesBetweenPolls = 30000;
267 Value id_loop(const Position& pos, Move searchMoves[]);
268 Value root_search(Position& pos, SearchStack ss[], RootMoveList& rml, Value& oldAlpha, Value& beta);
269 Value search_pv(Position& pos, SearchStack ss[], Value alpha, Value beta, Depth depth, int ply, int threadID);
270 Value search(Position& pos, SearchStack ss[], Value beta, Depth depth, int ply, bool allowNullmove, int threadID, Move excludedMove = MOVE_NONE);
271 Value qsearch(Position& pos, SearchStack ss[], Value alpha, Value beta, Depth depth, int ply, int threadID);
272 void sp_search(SplitPoint* sp, int threadID);
273 void sp_search_pv(SplitPoint* sp, int threadID);
274 void init_node(SearchStack ss[], int ply, int threadID);
275 void update_pv(SearchStack ss[], int ply);
276 void sp_update_pv(SearchStack* pss, SearchStack ss[], int ply);
277 bool connected_moves(const Position& pos, Move m1, Move m2);
278 bool value_is_mate(Value value);
279 bool move_is_killer(Move m, const SearchStack& ss);
280 Depth extension(const Position&, Move, bool, bool, bool, bool, bool, bool*);
281 bool ok_to_do_nullmove(const Position& pos);
282 bool ok_to_prune(const Position& pos, Move m, Move threat);
283 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply);
284 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply);
285 void update_history(const Position& pos, Move move, Depth depth, Move movesSearched[], int moveCount);
286 void update_killers(Move m, SearchStack& ss);
287 void update_gains(const Position& pos, Move move, Value before, Value after);
289 int current_search_time();
293 void wait_for_stop_or_ponderhit();
294 void init_ss_array(SearchStack ss[]);
296 #if !defined(_MSC_VER)
297 void *init_thread(void *threadID);
299 DWORD WINAPI init_thread(LPVOID threadID);
309 /// init_threads(), exit_threads() and nodes_searched() are helpers to
310 /// give accessibility to some TM methods from outside of current file.
312 void init_threads() { TM.init_threads(); }
313 void exit_threads() { TM.exit_threads(); }
314 int64_t nodes_searched() { return TM.nodes_searched(); }
317 /// perft() is our utility to verify move generation is bug free. All the legal
318 /// moves up to given depth are generated and counted and the sum returned.
320 int perft(Position& pos, Depth depth)
324 MovePicker mp = MovePicker(pos, MOVE_NONE, depth, H);
326 // If we are at the last ply we don't need to do and undo
327 // the moves, just to count them.
328 if (depth <= OnePly) // Replace with '<' to test also qsearch
330 while (mp.get_next_move()) sum++;
334 // Loop through all legal moves
336 while ((move = mp.get_next_move()) != MOVE_NONE)
339 pos.do_move(move, st, ci, pos.move_is_check(move, ci));
340 sum += perft(pos, depth - OnePly);
347 /// think() is the external interface to Stockfish's search, and is called when
348 /// the program receives the UCI 'go' command. It initializes various
349 /// search-related global variables, and calls root_search(). It returns false
350 /// when a quit command is received during the search.
352 bool think(const Position& pos, bool infinite, bool ponder, int side_to_move,
353 int time[], int increment[], int movesToGo, int maxDepth,
354 int maxNodes, int maxTime, Move searchMoves[]) {
356 // Initialize global search variables
357 StopOnPonderhit = AbortSearch = Quit = false;
358 AspirationFailLow = false;
360 SearchStartTime = get_system_time();
361 ExactMaxTime = maxTime;
364 InfiniteSearch = infinite;
365 PonderSearch = ponder;
366 UseTimeManagement = !ExactMaxTime && !MaxDepth && !MaxNodes && !InfiniteSearch;
368 // Look for a book move, only during games, not tests
369 if (UseTimeManagement && get_option_value_bool("OwnBook"))
372 if (get_option_value_string("Book File") != OpeningBook.file_name())
373 OpeningBook.open(get_option_value_string("Book File"));
375 bookMove = OpeningBook.get_move(pos);
376 if (bookMove != MOVE_NONE)
379 wait_for_stop_or_ponderhit();
381 cout << "bestmove " << bookMove << endl;
386 TM.resetNodeCounters();
388 if (button_was_pressed("New Game"))
389 loseOnTime = false; // Reset at the beginning of a new game
391 // Read UCI option values
392 TT.set_size(get_option_value_int("Hash"));
393 if (button_was_pressed("Clear Hash"))
396 bool PonderingEnabled = get_option_value_bool("Ponder");
397 MultiPV = get_option_value_int("MultiPV");
399 CheckExtension[1] = Depth(get_option_value_int("Check Extension (PV nodes)"));
400 CheckExtension[0] = Depth(get_option_value_int("Check Extension (non-PV nodes)"));
402 SingleEvasionExtension[1] = Depth(get_option_value_int("Single Evasion Extension (PV nodes)"));
403 SingleEvasionExtension[0] = Depth(get_option_value_int("Single Evasion Extension (non-PV nodes)"));
405 PawnPushTo7thExtension[1] = Depth(get_option_value_int("Pawn Push to 7th Extension (PV nodes)"));
406 PawnPushTo7thExtension[0] = Depth(get_option_value_int("Pawn Push to 7th Extension (non-PV nodes)"));
408 PassedPawnExtension[1] = Depth(get_option_value_int("Passed Pawn Extension (PV nodes)"));
409 PassedPawnExtension[0] = Depth(get_option_value_int("Passed Pawn Extension (non-PV nodes)"));
411 PawnEndgameExtension[1] = Depth(get_option_value_int("Pawn Endgame Extension (PV nodes)"));
412 PawnEndgameExtension[0] = Depth(get_option_value_int("Pawn Endgame Extension (non-PV nodes)"));
414 MateThreatExtension[1] = Depth(get_option_value_int("Mate Threat Extension (PV nodes)"));
415 MateThreatExtension[0] = Depth(get_option_value_int("Mate Threat Extension (non-PV nodes)"));
417 ThreatDepth = get_option_value_int("Threat Depth") * OnePly;
419 Chess960 = get_option_value_bool("UCI_Chess960");
420 ShowCurrentLine = get_option_value_bool("UCI_ShowCurrLine");
421 UseLogFile = get_option_value_bool("Use Search Log");
423 LogFile.open(get_option_value_string("Search Log Filename").c_str(), std::ios::out | std::ios::app);
425 MinimumSplitDepth = get_option_value_int("Minimum Split Depth") * OnePly;
426 MaxThreadsPerSplitPoint = get_option_value_int("Maximum Number of Threads per Split Point");
428 read_weights(pos.side_to_move());
430 // Set the number of active threads
431 int newActiveThreads = get_option_value_int("Threads");
432 if (newActiveThreads != TM.active_threads())
434 TM.set_active_threads(newActiveThreads);
435 init_eval(TM.active_threads());
436 // HACK: init_eval() destroys the static castleRightsMask[] array in the
437 // Position class. The below line repairs the damage.
438 Position p(pos.to_fen());
442 // Wake up sleeping threads
443 TM.wake_sleeping_threads();
445 for (int i = 1; i < TM.active_threads(); i++)
446 assert(TM.thread_is_available(i, 0));
449 int myTime = time[side_to_move];
450 int myIncrement = increment[side_to_move];
451 if (UseTimeManagement)
453 if (!movesToGo) // Sudden death time control
457 MaxSearchTime = myTime / 30 + myIncrement;
458 AbsoluteMaxSearchTime = Max(myTime / 4, myIncrement - 100);
460 else // Blitz game without increment
462 MaxSearchTime = myTime / 30;
463 AbsoluteMaxSearchTime = myTime / 8;
466 else // (x moves) / (y minutes)
470 MaxSearchTime = myTime / 2;
471 AbsoluteMaxSearchTime = (myTime > 3000)? (myTime - 500) : ((myTime * 3) / 4);
475 MaxSearchTime = myTime / Min(movesToGo, 20);
476 AbsoluteMaxSearchTime = Min((4 * myTime) / movesToGo, myTime / 3);
480 if (PonderingEnabled)
482 MaxSearchTime += MaxSearchTime / 4;
483 MaxSearchTime = Min(MaxSearchTime, AbsoluteMaxSearchTime);
487 // Set best NodesBetweenPolls interval
489 NodesBetweenPolls = Min(MaxNodes, 30000);
490 else if (myTime && myTime < 1000)
491 NodesBetweenPolls = 1000;
492 else if (myTime && myTime < 5000)
493 NodesBetweenPolls = 5000;
495 NodesBetweenPolls = 30000;
497 // Write information to search log file
499 LogFile << "Searching: " << pos.to_fen() << endl
500 << "infinite: " << infinite
501 << " ponder: " << ponder
502 << " time: " << myTime
503 << " increment: " << myIncrement
504 << " moves to go: " << movesToGo << endl;
506 // LSN filtering. Used only for developing purpose. Disabled by default.
510 // Step 2. If after last move we decided to lose on time, do it now!
511 while (SearchStartTime + myTime + 1000 > get_system_time())
515 // We're ready to start thinking. Call the iterative deepening loop function
516 Value v = id_loop(pos, searchMoves);
520 // Step 1. If this is sudden death game and our position is hopeless,
521 // decide to lose on time.
522 if ( !loseOnTime // If we already lost on time, go to step 3.
532 // Step 3. Now after stepping over the time limit, reset flag for next match.
540 TM.put_threads_to_sleep();
546 /// init_search() is called during startup. It initializes various lookup tables
550 // Init our reduction lookup tables
551 for (int i = 1; i < 64; i++) // i == depth (OnePly = 1)
552 for (int j = 1; j < 64; j++) // j == moveNumber
554 double pvRed = 0.5 + log(double(i)) * log(double(j)) / 6.0;
555 double nonPVRed = 0.5 + log(double(i)) * log(double(j)) / 3.0;
556 PVReductionMatrix[i][j] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(OnePly)) : 0);
557 NonPVReductionMatrix[i][j] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(OnePly)) : 0);
560 // Init futility margins array
561 for (int i = 0; i < 14; i++) // i == depth (OnePly = 2)
562 for (int j = 0; j < 64; j++) // j == moveNumber
564 FutilityMarginsMatrix[i][j] = (i < 2 ? 0 : 112 * bitScanReverse32(i * i / 2)) - 8 * j; // FIXME: test using log instead of BSR
567 // Init futility move count array
568 for (int i = 0; i < 32; i++) // i == depth (OnePly = 2)
569 FutilityMoveCountArray[i] = 3 + (1 << (3 * i / 8));
573 // SearchStack::init() initializes a search stack. Used at the beginning of a
574 // new search from the root.
575 void SearchStack::init(int ply) {
577 pv[ply] = pv[ply + 1] = MOVE_NONE;
578 currentMove = threatMove = MOVE_NONE;
579 reduction = Depth(0);
583 void SearchStack::initKillers() {
585 mateKiller = MOVE_NONE;
586 for (int i = 0; i < KILLER_MAX; i++)
587 killers[i] = MOVE_NONE;
592 // id_loop() is the main iterative deepening loop. It calls root_search
593 // repeatedly with increasing depth until the allocated thinking time has
594 // been consumed, the user stops the search, or the maximum search depth is
597 Value id_loop(const Position& pos, Move searchMoves[]) {
600 SearchStack ss[PLY_MAX_PLUS_2];
602 // searchMoves are verified, copied, scored and sorted
603 RootMoveList rml(p, searchMoves);
605 // Handle special case of searching on a mate/stale position
606 if (rml.move_count() == 0)
609 wait_for_stop_or_ponderhit();
611 return pos.is_check()? -VALUE_MATE : VALUE_DRAW;
614 // Print RootMoveList c'tor startup scoring to the standard output,
615 // so that we print information also for iteration 1.
616 cout << "info depth " << 1 << "\ninfo depth " << 1
617 << " score " << value_to_string(rml.get_move_score(0))
618 << " time " << current_search_time()
619 << " nodes " << TM.nodes_searched()
621 << " pv " << rml.get_move(0) << "\n";
627 ValueByIteration[1] = rml.get_move_score(0);
630 // Is one move significantly better than others after initial scoring ?
631 Move EasyMove = MOVE_NONE;
632 if ( rml.move_count() == 1
633 || rml.get_move_score(0) > rml.get_move_score(1) + EasyMoveMargin)
634 EasyMove = rml.get_move(0);
636 // Iterative deepening loop
637 while (Iteration < PLY_MAX)
639 // Initialize iteration
642 BestMoveChangesByIteration[Iteration] = 0;
646 cout << "info depth " << Iteration << endl;
648 // Calculate dynamic search window based on previous iterations
651 if (MultiPV == 1 && Iteration >= 6 && abs(ValueByIteration[Iteration - 1]) < VALUE_KNOWN_WIN)
653 int prevDelta1 = ValueByIteration[Iteration - 1] - ValueByIteration[Iteration - 2];
654 int prevDelta2 = ValueByIteration[Iteration - 2] - ValueByIteration[Iteration - 3];
656 AspirationDelta = Max(abs(prevDelta1) + abs(prevDelta2) / 2, 16);
657 AspirationDelta = (AspirationDelta + 7) / 8 * 8; // Round to match grainSize
659 alpha = Max(ValueByIteration[Iteration - 1] - AspirationDelta, -VALUE_INFINITE);
660 beta = Min(ValueByIteration[Iteration - 1] + AspirationDelta, VALUE_INFINITE);
664 alpha = - VALUE_INFINITE;
665 beta = VALUE_INFINITE;
668 // Search to the current depth
669 Value value = root_search(p, ss, rml, alpha, beta);
671 // Write PV to transposition table, in case the relevant entries have
672 // been overwritten during the search.
673 TT.insert_pv(p, ss[0].pv);
676 break; // Value cannot be trusted. Break out immediately!
678 //Save info about search result
679 ValueByIteration[Iteration] = value;
681 // Drop the easy move if it differs from the new best move
682 if (ss[0].pv[0] != EasyMove)
683 EasyMove = MOVE_NONE;
685 if (UseTimeManagement)
688 bool stopSearch = false;
690 // Stop search early if there is only a single legal move,
691 // we search up to Iteration 6 anyway to get a proper score.
692 if (Iteration >= 6 && rml.move_count() == 1)
695 // Stop search early when the last two iterations returned a mate score
697 && abs(ValueByIteration[Iteration]) >= abs(VALUE_MATE) - 100
698 && abs(ValueByIteration[Iteration-1]) >= abs(VALUE_MATE) - 100)
701 // Stop search early if one move seems to be much better than the rest
702 int64_t nodes = TM.nodes_searched();
704 && EasyMove == ss[0].pv[0]
705 && ( ( rml.get_move_cumulative_nodes(0) > (nodes * 85) / 100
706 && current_search_time() > MaxSearchTime / 16)
707 ||( rml.get_move_cumulative_nodes(0) > (nodes * 98) / 100
708 && current_search_time() > MaxSearchTime / 32)))
711 // Add some extra time if the best move has changed during the last two iterations
712 if (Iteration > 5 && Iteration <= 50)
713 ExtraSearchTime = BestMoveChangesByIteration[Iteration] * (MaxSearchTime / 2)
714 + BestMoveChangesByIteration[Iteration-1] * (MaxSearchTime / 3);
716 // Stop search if most of MaxSearchTime is consumed at the end of the
717 // iteration. We probably don't have enough time to search the first
718 // move at the next iteration anyway.
719 if (current_search_time() > ((MaxSearchTime + ExtraSearchTime) * 80) / 128)
727 StopOnPonderhit = true;
731 if (MaxDepth && Iteration >= MaxDepth)
737 // If we are pondering or in infinite search, we shouldn't print the
738 // best move before we are told to do so.
739 if (!AbortSearch && (PonderSearch || InfiniteSearch))
740 wait_for_stop_or_ponderhit();
742 // Print final search statistics
743 cout << "info nodes " << TM.nodes_searched()
745 << " time " << current_search_time()
746 << " hashfull " << TT.full() << endl;
748 // Print the best move and the ponder move to the standard output
749 if (ss[0].pv[0] == MOVE_NONE)
751 ss[0].pv[0] = rml.get_move(0);
752 ss[0].pv[1] = MOVE_NONE;
754 cout << "bestmove " << ss[0].pv[0];
755 if (ss[0].pv[1] != MOVE_NONE)
756 cout << " ponder " << ss[0].pv[1];
763 dbg_print_mean(LogFile);
765 if (dbg_show_hit_rate)
766 dbg_print_hit_rate(LogFile);
768 LogFile << "\nNodes: " << TM.nodes_searched()
769 << "\nNodes/second: " << nps()
770 << "\nBest move: " << move_to_san(p, ss[0].pv[0]);
773 p.do_move(ss[0].pv[0], st);
774 LogFile << "\nPonder move: " << move_to_san(p, ss[0].pv[1]) << endl;
776 return rml.get_move_score(0);
780 // root_search() is the function which searches the root node. It is
781 // similar to search_pv except that it uses a different move ordering
782 // scheme and prints some information to the standard output.
784 Value root_search(Position& pos, SearchStack ss[], RootMoveList& rml, Value& oldAlpha, Value& beta) {
789 Depth depth, ext, newDepth;
792 int researchCount = 0;
793 bool moveIsCheck, captureOrPromotion, dangerous;
794 Value alpha = oldAlpha;
795 bool isCheck = pos.is_check();
797 // Evaluate the position statically
799 ss[0].eval = !isCheck ? evaluate(pos, ei, 0) : VALUE_NONE;
801 while (1) // Fail low loop
804 // Loop through all the moves in the root move list
805 for (int i = 0; i < rml.move_count() && !AbortSearch; i++)
809 // We failed high, invalidate and skip next moves, leave node-counters
810 // and beta-counters as they are and quickly return, we will try to do
811 // a research at the next iteration with a bigger aspiration window.
812 rml.set_move_score(i, -VALUE_INFINITE);
816 RootMoveNumber = i + 1;
818 // Save the current node count before the move is searched
819 nodes = TM.nodes_searched();
821 // Reset beta cut-off counters
822 TM.resetBetaCounters();
824 // Pick the next root move, and print the move and the move number to
825 // the standard output.
826 move = ss[0].currentMove = rml.get_move(i);
828 if (current_search_time() >= 1000)
829 cout << "info currmove " << move
830 << " currmovenumber " << RootMoveNumber << endl;
832 // Decide search depth for this move
833 moveIsCheck = pos.move_is_check(move);
834 captureOrPromotion = pos.move_is_capture_or_promotion(move);
835 depth = (Iteration - 2) * OnePly + InitialDepth;
836 ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, false, false, &dangerous);
837 newDepth = depth + ext;
839 value = - VALUE_INFINITE;
841 while (1) // Fail high loop
844 // Make the move, and search it
845 pos.do_move(move, st, ci, moveIsCheck);
847 if (i < MultiPV || value > alpha)
849 // Aspiration window is disabled in multi-pv case
851 alpha = -VALUE_INFINITE;
853 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
857 // Try to reduce non-pv search depth by one ply if move seems not problematic,
858 // if the move fails high will be re-searched at full depth.
859 bool doFullDepthSearch = true;
861 if ( depth >= 3*OnePly // FIXME was newDepth
863 && !captureOrPromotion
864 && !move_is_castle(move))
866 ss[0].reduction = pv_reduction(depth, RootMoveNumber - MultiPV + 1);
869 value = -search(pos, ss, -alpha, newDepth-ss[0].reduction, 1, true, 0);
870 doFullDepthSearch = (value > alpha);
874 if (doFullDepthSearch)
876 ss[0].reduction = Depth(0);
877 value = -search(pos, ss, -alpha, newDepth, 1, true, 0);
880 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
886 // Can we exit fail high loop ?
887 if (AbortSearch || value < beta)
890 // We are failing high and going to do a research. It's important to update score
891 // before research in case we run out of time while researching.
892 rml.set_move_score(i, value);
894 TT.extract_pv(pos, ss[0].pv, PLY_MAX);
895 rml.set_move_pv(i, ss[0].pv);
897 // Print search information to the standard output
898 cout << "info depth " << Iteration
899 << " score " << value_to_string(value)
900 << ((value >= beta) ? " lowerbound" :
901 ((value <= alpha)? " upperbound" : ""))
902 << " time " << current_search_time()
903 << " nodes " << TM.nodes_searched()
907 for (int j = 0; ss[0].pv[j] != MOVE_NONE && j < PLY_MAX; j++)
908 cout << ss[0].pv[j] << " ";
914 ValueType type = (value >= beta ? VALUE_TYPE_LOWER
915 : (value <= alpha ? VALUE_TYPE_UPPER : VALUE_TYPE_EXACT));
917 LogFile << pretty_pv(pos, current_search_time(), Iteration,
918 TM.nodes_searched(), value, type, ss[0].pv) << endl;
921 // Prepare for a research after a fail high, each time with a wider window
923 beta = Min(beta + AspirationDelta * (1 << researchCount), VALUE_INFINITE);
925 } // End of fail high loop
927 // Finished searching the move. If AbortSearch is true, the search
928 // was aborted because the user interrupted the search or because we
929 // ran out of time. In this case, the return value of the search cannot
930 // be trusted, and we break out of the loop without updating the best
935 // Remember beta-cutoff and searched nodes counts for this move. The
936 // info is used to sort the root moves at the next iteration.
938 TM.get_beta_counters(pos.side_to_move(), our, their);
939 rml.set_beta_counters(i, our, their);
940 rml.set_move_nodes(i, TM.nodes_searched() - nodes);
942 assert(value >= -VALUE_INFINITE && value <= VALUE_INFINITE);
944 if (value <= alpha && i >= MultiPV)
945 rml.set_move_score(i, -VALUE_INFINITE);
948 // PV move or new best move!
951 rml.set_move_score(i, value);
953 TT.extract_pv(pos, ss[0].pv, PLY_MAX);
954 rml.set_move_pv(i, ss[0].pv);
958 // We record how often the best move has been changed in each
959 // iteration. This information is used for time managment: When
960 // the best move changes frequently, we allocate some more time.
962 BestMoveChangesByIteration[Iteration]++;
964 // Print search information to the standard output
965 cout << "info depth " << Iteration
966 << " score " << value_to_string(value)
967 << ((value >= beta) ? " lowerbound" :
968 ((value <= alpha)? " upperbound" : ""))
969 << " time " << current_search_time()
970 << " nodes " << TM.nodes_searched()
974 for (int j = 0; ss[0].pv[j] != MOVE_NONE && j < PLY_MAX; j++)
975 cout << ss[0].pv[j] << " ";
981 ValueType type = (value >= beta ? VALUE_TYPE_LOWER
982 : (value <= alpha ? VALUE_TYPE_UPPER : VALUE_TYPE_EXACT));
984 LogFile << pretty_pv(pos, current_search_time(), Iteration,
985 TM.nodes_searched(), value, type, ss[0].pv) << endl;
993 for (int j = 0; j < Min(MultiPV, rml.move_count()); j++)
995 cout << "info multipv " << j + 1
996 << " score " << value_to_string(rml.get_move_score(j))
997 << " depth " << ((j <= i)? Iteration : Iteration - 1)
998 << " time " << current_search_time()
999 << " nodes " << TM.nodes_searched()
1003 for (int k = 0; rml.get_move_pv(j, k) != MOVE_NONE && k < PLY_MAX; k++)
1004 cout << rml.get_move_pv(j, k) << " ";
1008 alpha = rml.get_move_score(Min(i, MultiPV-1));
1010 } // PV move or new best move
1012 assert(alpha >= oldAlpha);
1014 AspirationFailLow = (alpha == oldAlpha);
1016 if (AspirationFailLow && StopOnPonderhit)
1017 StopOnPonderhit = false;
1020 // Can we exit fail low loop ?
1021 if (AbortSearch || alpha > oldAlpha)
1024 // Prepare for a research after a fail low, each time with a wider window
1026 alpha = Max(alpha - AspirationDelta * (1 << researchCount), -VALUE_INFINITE);
1035 // search_pv() is the main search function for PV nodes.
1037 Value search_pv(Position& pos, SearchStack ss[], Value alpha, Value beta,
1038 Depth depth, int ply, int threadID) {
1040 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1041 assert(beta > alpha && beta <= VALUE_INFINITE);
1042 assert(ply >= 0 && ply < PLY_MAX);
1043 assert(threadID >= 0 && threadID < TM.active_threads());
1045 Move movesSearched[256];
1049 Depth ext, newDepth;
1050 Value oldAlpha, value;
1051 bool isCheck, mateThreat, singleEvasion, moveIsCheck, captureOrPromotion, dangerous;
1053 Value bestValue = value = -VALUE_INFINITE;
1056 return qsearch(pos, ss, alpha, beta, Depth(0), ply, threadID);
1058 // Initialize, and make an early exit in case of an aborted search,
1059 // an instant draw, maximum ply reached, etc.
1060 init_node(ss, ply, threadID);
1062 // After init_node() that calls poll()
1063 if (AbortSearch || TM.thread_should_stop(threadID))
1066 if (pos.is_draw() || ply >= PLY_MAX - 1)
1069 // Mate distance pruning
1071 alpha = Max(value_mated_in(ply), alpha);
1072 beta = Min(value_mate_in(ply+1), beta);
1076 // Transposition table lookup. At PV nodes, we don't use the TT for
1077 // pruning, but only for move ordering. This is to avoid problems in
1078 // the following areas:
1080 // * Repetition draw detection
1081 // * Fifty move rule detection
1082 // * Searching for a mate
1083 // * Printing of full PV line
1085 tte = TT.retrieve(pos.get_key());
1086 ttMove = (tte ? tte->move() : MOVE_NONE);
1088 // Go with internal iterative deepening if we don't have a TT move
1089 if ( UseIIDAtPVNodes
1090 && depth >= 5*OnePly
1091 && ttMove == MOVE_NONE)
1093 search_pv(pos, ss, alpha, beta, depth-2*OnePly, ply, threadID);
1094 ttMove = ss[ply].pv[ply];
1095 tte = TT.retrieve(pos.get_key());
1098 isCheck = pos.is_check();
1101 // Update gain statistics of the previous move that lead
1102 // us in this position.
1104 ss[ply].eval = evaluate(pos, ei, threadID);
1105 update_gains(pos, ss[ply - 1].currentMove, ss[ply - 1].eval, ss[ply].eval);
1108 // Initialize a MovePicker object for the current position, and prepare
1109 // to search all moves
1110 mateThreat = pos.has_mate_threat(opposite_color(pos.side_to_move()));
1112 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
1114 // Loop through all legal moves until no moves remain or a beta cutoff
1116 while ( alpha < beta
1117 && (move = mp.get_next_move()) != MOVE_NONE
1118 && !TM.thread_should_stop(threadID))
1120 assert(move_is_ok(move));
1122 singleEvasion = (isCheck && mp.number_of_evasions() == 1);
1123 moveIsCheck = pos.move_is_check(move, ci);
1124 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1126 // Decide the new search depth
1127 ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, singleEvasion, mateThreat, &dangerous);
1129 // Singular extension search. We extend the TT move if its value is much better than
1130 // its siblings. To verify this we do a reduced search on all the other moves but the
1131 // ttMove, if result is lower then ttValue minus a margin then we extend ttMove.
1132 if ( depth >= 6 * OnePly
1134 && move == tte->move()
1136 && is_lower_bound(tte->type())
1137 && tte->depth() >= depth - 3 * OnePly)
1139 Value ttValue = value_from_tt(tte->value(), ply);
1141 if (abs(ttValue) < VALUE_KNOWN_WIN)
1143 Value excValue = search(pos, ss, ttValue - SingleReplyMargin, depth / 2, ply, false, threadID, move);
1145 if (excValue < ttValue - SingleReplyMargin)
1150 newDepth = depth - OnePly + ext;
1152 // Update current move
1153 movesSearched[moveCount++] = ss[ply].currentMove = move;
1155 // Make and search the move
1156 pos.do_move(move, st, ci, moveIsCheck);
1158 if (moveCount == 1) // The first move in list is the PV
1159 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1162 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1163 // if the move fails high will be re-searched at full depth.
1164 bool doFullDepthSearch = true;
1166 if ( depth >= 3*OnePly
1168 && !captureOrPromotion
1169 && !move_is_castle(move)
1170 && !move_is_killer(move, ss[ply]))
1172 ss[ply].reduction = pv_reduction(depth, moveCount);
1173 if (ss[ply].reduction)
1175 value = -search(pos, ss, -alpha, newDepth-ss[ply].reduction, ply+1, true, threadID);
1176 doFullDepthSearch = (value > alpha);
1180 if (doFullDepthSearch) // Go with full depth non-pv search
1182 ss[ply].reduction = Depth(0);
1183 value = -search(pos, ss, -alpha, newDepth, ply+1, true, threadID);
1184 if (value > alpha && value < beta)
1185 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1188 pos.undo_move(move);
1190 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1193 if (value > bestValue)
1200 if (value == value_mate_in(ply + 1))
1201 ss[ply].mateKiller = move;
1206 if ( TM.active_threads() > 1
1208 && depth >= MinimumSplitDepth
1210 && TM.available_thread_exists(threadID)
1212 && !TM.thread_should_stop(threadID)
1213 && TM.split(pos, ss, ply, &alpha, &beta, &bestValue, VALUE_NONE,
1214 depth, &moveCount, &mp, threadID, true))
1218 // All legal moves have been searched. A special case: If there were
1219 // no legal moves, it must be mate or stalemate.
1221 return (isCheck ? value_mated_in(ply) : VALUE_DRAW);
1223 // If the search is not aborted, update the transposition table,
1224 // history counters, and killer moves.
1225 if (AbortSearch || TM.thread_should_stop(threadID))
1228 if (bestValue <= oldAlpha)
1229 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1231 else if (bestValue >= beta)
1233 TM.incrementBetaCounter(pos.side_to_move(), depth, threadID);
1234 move = ss[ply].pv[ply];
1235 if (!pos.move_is_capture_or_promotion(move))
1237 update_history(pos, move, depth, movesSearched, moveCount);
1238 update_killers(move, ss[ply]);
1240 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, move);
1243 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EXACT, depth, ss[ply].pv[ply]);
1249 // search() is the search function for zero-width nodes.
1251 Value search(Position& pos, SearchStack ss[], Value beta, Depth depth,
1252 int ply, bool allowNullmove, int threadID, Move excludedMove) {
1254 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1255 assert(ply >= 0 && ply < PLY_MAX);
1256 assert(threadID >= 0 && threadID < TM.active_threads());
1258 Move movesSearched[256];
1263 Depth ext, newDepth;
1264 Value bestValue, staticValue, nullValue, value, futilityValue, futilityValueScaled;
1265 bool isCheck, singleEvasion, moveIsCheck, captureOrPromotion, dangerous;
1266 bool mateThreat = false;
1268 futilityValue = staticValue = bestValue = value = -VALUE_INFINITE;
1271 return qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1273 // Initialize, and make an early exit in case of an aborted search,
1274 // an instant draw, maximum ply reached, etc.
1275 init_node(ss, ply, threadID);
1277 // After init_node() that calls poll()
1278 if (AbortSearch || TM.thread_should_stop(threadID))
1281 if (pos.is_draw() || ply >= PLY_MAX - 1)
1284 // Mate distance pruning
1285 if (value_mated_in(ply) >= beta)
1288 if (value_mate_in(ply + 1) < beta)
1291 // We don't want the score of a partial search to overwrite a previous full search
1292 // TT value, so we use a different position key in case of an excluded move exsists.
1293 Key posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
1295 // Transposition table lookup
1296 tte = TT.retrieve(posKey);
1297 ttMove = (tte ? tte->move() : MOVE_NONE);
1299 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1301 ss[ply].currentMove = ttMove; // Can be MOVE_NONE
1302 return value_from_tt(tte->value(), ply);
1305 isCheck = pos.is_check();
1307 // Evaluate the position statically
1310 if (tte && (tte->type() & VALUE_TYPE_EVAL))
1311 staticValue = value_from_tt(tte->value(), ply);
1313 staticValue = evaluate(pos, ei, threadID);
1315 ss[ply].eval = staticValue;
1316 futilityValue = staticValue + futility_margin(depth, 0); //FIXME: Remove me, only for split
1317 staticValue = refine_eval(tte, staticValue, ply); // Enhance accuracy with TT value if possible
1318 update_gains(pos, ss[ply - 1].currentMove, ss[ply - 1].eval, ss[ply].eval);
1321 // Static null move pruning. We're betting that the opponent doesn't have
1322 // a move that will reduce the score by more than FutilityMargins[int(depth)]
1323 // if we do a null move.
1326 && depth < RazorDepth
1327 && staticValue - futility_margin(depth, 0) >= beta)
1328 return staticValue - futility_margin(depth, 0);
1334 && !value_is_mate(beta)
1335 && ok_to_do_nullmove(pos)
1336 && staticValue >= beta - (depth >= 4 * OnePly ? NullMoveMargin : 0))
1338 ss[ply].currentMove = MOVE_NULL;
1340 pos.do_null_move(st);
1342 // Null move dynamic reduction based on depth
1343 int R = 3 + (depth >= 5 * OnePly ? depth / 8 : 0);
1345 // Null move dynamic reduction based on value
1346 if (staticValue - beta > PawnValueMidgame)
1349 nullValue = -search(pos, ss, -(beta-1), depth-R*OnePly, ply+1, false, threadID);
1351 pos.undo_null_move();
1353 if (nullValue >= beta)
1355 if (depth < 6 * OnePly)
1358 // Do zugzwang verification search
1359 Value v = search(pos, ss, beta, depth-5*OnePly, ply, false, threadID);
1363 // The null move failed low, which means that we may be faced with
1364 // some kind of threat. If the previous move was reduced, check if
1365 // the move that refuted the null move was somehow connected to the
1366 // move which was reduced. If a connection is found, return a fail
1367 // low score (which will cause the reduced move to fail high in the
1368 // parent node, which will trigger a re-search with full depth).
1369 if (nullValue == value_mated_in(ply + 2))
1372 ss[ply].threatMove = ss[ply + 1].currentMove;
1373 if ( depth < ThreatDepth
1374 && ss[ply - 1].reduction
1375 && connected_moves(pos, ss[ply - 1].currentMove, ss[ply].threatMove))
1379 // Null move search not allowed, try razoring
1380 else if ( !value_is_mate(beta)
1382 && depth < RazorDepth
1383 && staticValue < beta - (NullMoveMargin + 16 * depth)
1384 && ss[ply - 1].currentMove != MOVE_NULL
1385 && ttMove == MOVE_NONE
1386 && !pos.has_pawn_on_7th(pos.side_to_move()))
1388 Value rbeta = beta - (NullMoveMargin + 16 * depth);
1389 Value v = qsearch(pos, ss, rbeta-1, rbeta, Depth(0), ply, threadID);
1394 // Go with internal iterative deepening if we don't have a TT move
1395 if (UseIIDAtNonPVNodes && ttMove == MOVE_NONE && depth >= 8*OnePly &&
1396 !isCheck && ss[ply].eval >= beta - IIDMargin)
1398 search(pos, ss, beta, Min(depth/2, depth-2*OnePly), ply, false, threadID);
1399 ttMove = ss[ply].pv[ply];
1400 tte = TT.retrieve(posKey);
1403 // Initialize a MovePicker object for the current position, and prepare
1404 // to search all moves.
1405 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
1408 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1409 while ( bestValue < beta
1410 && (move = mp.get_next_move()) != MOVE_NONE
1411 && !TM.thread_should_stop(threadID))
1413 assert(move_is_ok(move));
1415 if (move == excludedMove)
1418 moveIsCheck = pos.move_is_check(move, ci);
1419 singleEvasion = (isCheck && mp.number_of_evasions() == 1);
1420 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1422 // Decide the new search depth
1423 ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, singleEvasion, mateThreat, &dangerous);
1425 // Singular extension search. We extend the TT move if its value is much better than
1426 // its siblings. To verify this we do a reduced search on all the other moves but the
1427 // ttMove, if result is lower then ttValue minus a margin then we extend ttMove.
1428 if ( depth >= 8 * OnePly
1430 && move == tte->move()
1431 && !excludedMove // Do not allow recursive single-reply search
1433 && is_lower_bound(tte->type())
1434 && tte->depth() >= depth - 3 * OnePly)
1436 Value ttValue = value_from_tt(tte->value(), ply);
1438 if (abs(ttValue) < VALUE_KNOWN_WIN)
1440 Value excValue = search(pos, ss, ttValue - SingleReplyMargin, depth / 2, ply, false, threadID, move);
1442 if (excValue < ttValue - SingleReplyMargin)
1447 newDepth = depth - OnePly + ext;
1449 // Update current move
1450 movesSearched[moveCount++] = ss[ply].currentMove = move;
1455 && !captureOrPromotion
1456 && !move_is_castle(move)
1459 // Move count based pruning
1460 if ( moveCount >= futility_move_count(depth)
1461 && ok_to_prune(pos, move, ss[ply].threatMove)
1462 && bestValue > value_mated_in(PLY_MAX))
1465 // Value based pruning
1466 Depth predictedDepth = newDepth - nonpv_reduction(depth, moveCount); //FIXME: We are ignoring condition: depth >= 3*OnePly, BUG??
1467 futilityValueScaled = ss[ply].eval + futility_margin(predictedDepth, moveCount)
1468 + H.gain(pos.piece_on(move_from(move)), move_to(move)) + 45;
1470 if (futilityValueScaled < beta)
1472 if (futilityValueScaled > bestValue)
1473 bestValue = futilityValueScaled;
1478 // Make and search the move
1479 pos.do_move(move, st, ci, moveIsCheck);
1481 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1482 // if the move fails high will be re-searched at full depth.
1483 bool doFullDepthSearch = true;
1485 if ( depth >= 3*OnePly
1487 && !captureOrPromotion
1488 && !move_is_castle(move)
1489 && !move_is_killer(move, ss[ply]))
1491 ss[ply].reduction = nonpv_reduction(depth, moveCount);
1492 if (ss[ply].reduction)
1494 value = -search(pos, ss, -(beta-1), newDepth-ss[ply].reduction, ply+1, true, threadID);
1495 doFullDepthSearch = (value >= beta);
1499 if (doFullDepthSearch) // Go with full depth non-pv search
1501 ss[ply].reduction = Depth(0);
1502 value = -search(pos, ss, -(beta-1), newDepth, ply+1, true, threadID);
1504 pos.undo_move(move);
1506 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1509 if (value > bestValue)
1515 if (value == value_mate_in(ply + 1))
1516 ss[ply].mateKiller = move;
1520 if ( TM.active_threads() > 1
1522 && depth >= MinimumSplitDepth
1524 && TM.available_thread_exists(threadID)
1526 && !TM.thread_should_stop(threadID)
1527 && TM.split(pos, ss, ply, &beta, &beta, &bestValue, futilityValue, //FIXME: SMP & futilityValue
1528 depth, &moveCount, &mp, threadID, false))
1532 // All legal moves have been searched. A special case: If there were
1533 // no legal moves, it must be mate or stalemate.
1535 return excludedMove ? beta - 1 : (pos.is_check() ? value_mated_in(ply) : VALUE_DRAW);
1537 // If the search is not aborted, update the transposition table,
1538 // history counters, and killer moves.
1539 if (AbortSearch || TM.thread_should_stop(threadID))
1542 if (bestValue < beta)
1543 TT.store(posKey, value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1546 TM.incrementBetaCounter(pos.side_to_move(), depth, threadID);
1547 move = ss[ply].pv[ply];
1548 TT.store(posKey, value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, move);
1549 if (!pos.move_is_capture_or_promotion(move))
1551 update_history(pos, move, depth, movesSearched, moveCount);
1552 update_killers(move, ss[ply]);
1557 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1563 // qsearch() is the quiescence search function, which is called by the main
1564 // search function when the remaining depth is zero (or, to be more precise,
1565 // less than OnePly).
1567 Value qsearch(Position& pos, SearchStack ss[], Value alpha, Value beta,
1568 Depth depth, int ply, int threadID) {
1570 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1571 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1573 assert(ply >= 0 && ply < PLY_MAX);
1574 assert(threadID >= 0 && threadID < TM.active_threads());
1579 Value staticValue, bestValue, value, futilityBase, futilityValue;
1580 bool isCheck, enoughMaterial, moveIsCheck, evasionPrunable;
1581 const TTEntry* tte = NULL;
1583 bool pvNode = (beta - alpha != 1);
1584 Value oldAlpha = alpha;
1586 // Initialize, and make an early exit in case of an aborted search,
1587 // an instant draw, maximum ply reached, etc.
1588 init_node(ss, ply, threadID);
1590 // After init_node() that calls poll()
1591 if (AbortSearch || TM.thread_should_stop(threadID))
1594 if (pos.is_draw() || ply >= PLY_MAX - 1)
1597 // Transposition table lookup. At PV nodes, we don't use the TT for
1598 // pruning, but only for move ordering.
1599 tte = TT.retrieve(pos.get_key());
1600 ttMove = (tte ? tte->move() : MOVE_NONE);
1602 if (!pvNode && tte && ok_to_use_TT(tte, depth, beta, ply))
1604 assert(tte->type() != VALUE_TYPE_EVAL);
1606 ss[ply].currentMove = ttMove; // Can be MOVE_NONE
1607 return value_from_tt(tte->value(), ply);
1610 isCheck = pos.is_check();
1612 // Evaluate the position statically
1614 staticValue = -VALUE_INFINITE;
1615 else if (tte && (tte->type() & VALUE_TYPE_EVAL))
1616 staticValue = value_from_tt(tte->value(), ply);
1618 staticValue = evaluate(pos, ei, threadID);
1622 ss[ply].eval = staticValue;
1623 update_gains(pos, ss[ply - 1].currentMove, ss[ply - 1].eval, ss[ply].eval);
1626 // Initialize "stand pat score", and return it immediately if it is
1628 bestValue = staticValue;
1630 if (bestValue >= beta)
1632 // Store the score to avoid a future costly evaluation() call
1633 if (!isCheck && !tte && ei.futilityMargin[pos.side_to_move()] == 0)
1634 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EV_LO, Depth(-127*OnePly), MOVE_NONE);
1639 if (bestValue > alpha)
1642 // If we are near beta then try to get a cutoff pushing checks a bit further
1643 bool deepChecks = depth == -OnePly && staticValue >= beta - PawnValueMidgame / 8;
1645 // Initialize a MovePicker object for the current position, and prepare
1646 // to search the moves. Because the depth is <= 0 here, only captures,
1647 // queen promotions and checks (only if depth == 0 or depth == -OnePly
1648 // and we are near beta) will be generated.
1649 MovePicker mp = MovePicker(pos, ttMove, deepChecks ? Depth(0) : depth, H);
1651 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1652 futilityBase = staticValue + FutilityMarginQS + ei.futilityMargin[pos.side_to_move()];
1654 // Loop through the moves until no moves remain or a beta cutoff
1656 while ( alpha < beta
1657 && (move = mp.get_next_move()) != MOVE_NONE)
1659 assert(move_is_ok(move));
1661 moveIsCheck = pos.move_is_check(move, ci);
1663 // Update current move
1665 ss[ply].currentMove = move;
1673 && !move_is_promotion(move)
1674 && !pos.move_is_passed_pawn_push(move))
1676 futilityValue = futilityBase
1677 + pos.endgame_value_of_piece_on(move_to(move))
1678 + (move_is_ep(move) ? PawnValueEndgame : Value(0));
1680 if (futilityValue < alpha)
1682 if (futilityValue > bestValue)
1683 bestValue = futilityValue;
1688 // Detect blocking evasions that are candidate to be pruned
1689 evasionPrunable = isCheck
1690 && bestValue != -VALUE_INFINITE
1691 && !pos.move_is_capture(move)
1692 && pos.type_of_piece_on(move_from(move)) != KING
1693 && !pos.can_castle(pos.side_to_move());
1695 // Don't search moves with negative SEE values
1696 if ( (!isCheck || evasionPrunable)
1699 && !move_is_promotion(move)
1700 && pos.see_sign(move) < 0)
1703 // Make and search the move
1704 pos.do_move(move, st, ci, moveIsCheck);
1705 value = -qsearch(pos, ss, -beta, -alpha, depth-OnePly, ply+1, threadID);
1706 pos.undo_move(move);
1708 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1711 if (value > bestValue)
1722 // All legal moves have been searched. A special case: If we're in check
1723 // and no legal moves were found, it is checkmate.
1724 if (!moveCount && pos.is_check()) // Mate!
1725 return value_mated_in(ply);
1727 // Update transposition table
1728 Depth d = (depth == Depth(0) ? Depth(0) : Depth(-1));
1729 if (bestValue <= oldAlpha)
1731 // If bestValue isn't changed it means it is still the static evaluation
1732 // of the node, so keep this info to avoid a future evaluation() call.
1733 ValueType type = (bestValue == staticValue && !ei.futilityMargin[pos.side_to_move()] ? VALUE_TYPE_EV_UP : VALUE_TYPE_UPPER);
1734 TT.store(pos.get_key(), value_to_tt(bestValue, ply), type, d, MOVE_NONE);
1736 else if (bestValue >= beta)
1738 move = ss[ply].pv[ply];
1739 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, d, move);
1741 // Update killers only for good checking moves
1742 if (!pos.move_is_capture_or_promotion(move))
1743 update_killers(move, ss[ply]);
1746 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EXACT, d, ss[ply].pv[ply]);
1748 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1754 // sp_search() is used to search from a split point. This function is called
1755 // by each thread working at the split point. It is similar to the normal
1756 // search() function, but simpler. Because we have already probed the hash
1757 // table, done a null move search, and searched the first move before
1758 // splitting, we don't have to repeat all this work in sp_search(). We
1759 // also don't need to store anything to the hash table here: This is taken
1760 // care of after we return from the split point.
1762 void sp_search(SplitPoint* sp, int threadID) {
1764 assert(threadID >= 0 && threadID < TM.active_threads());
1765 assert(TM.active_threads() > 1);
1767 Position pos(*sp->pos);
1769 SearchStack* ss = sp->sstack[threadID];
1770 Value value = -VALUE_INFINITE;
1773 bool isCheck = pos.is_check();
1774 bool useFutilityPruning = sp->depth < 7 * OnePly //FIXME: sync with search
1777 while ( lock_grab_bool(&(sp->lock))
1778 && sp->bestValue < sp->beta
1779 && !TM.thread_should_stop(threadID)
1780 && (move = sp->mp->get_next_move()) != MOVE_NONE)
1782 moveCount = ++sp->moves;
1783 lock_release(&(sp->lock));
1785 assert(move_is_ok(move));
1787 bool moveIsCheck = pos.move_is_check(move, ci);
1788 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
1790 ss[sp->ply].currentMove = move;
1792 // Decide the new search depth
1794 Depth ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, false, false, &dangerous);
1795 Depth newDepth = sp->depth - OnePly + ext;
1798 if ( useFutilityPruning
1800 && !captureOrPromotion)
1802 // Move count based pruning
1803 if ( moveCount >= futility_move_count(sp->depth)
1804 && ok_to_prune(pos, move, ss[sp->ply].threatMove)
1805 && sp->bestValue > value_mated_in(PLY_MAX))
1808 // Value based pruning
1809 Value futilityValueScaled = sp->futilityValue - moveCount * 8; //FIXME: sync with search
1811 if (futilityValueScaled < sp->beta)
1813 if (futilityValueScaled > sp->bestValue) // Less then 1% of cases
1815 lock_grab(&(sp->lock));
1816 if (futilityValueScaled > sp->bestValue)
1817 sp->bestValue = futilityValueScaled;
1818 lock_release(&(sp->lock));
1824 // Make and search the move.
1826 pos.do_move(move, st, ci, moveIsCheck);
1828 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1829 // if the move fails high will be re-searched at full depth.
1830 bool doFullDepthSearch = true;
1833 && !captureOrPromotion
1834 && !move_is_castle(move)
1835 && !move_is_killer(move, ss[sp->ply]))
1837 ss[sp->ply].reduction = nonpv_reduction(sp->depth, moveCount);
1838 if (ss[sp->ply].reduction)
1840 value = -search(pos, ss, -(sp->beta-1), newDepth-ss[sp->ply].reduction, sp->ply+1, true, threadID);
1841 doFullDepthSearch = (value >= sp->beta);
1845 if (doFullDepthSearch) // Go with full depth non-pv search
1847 ss[sp->ply].reduction = Depth(0);
1848 value = -search(pos, ss, -(sp->beta - 1), newDepth, sp->ply+1, true, threadID);
1850 pos.undo_move(move);
1852 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1854 if (TM.thread_should_stop(threadID))
1856 lock_grab(&(sp->lock));
1861 if (value > sp->bestValue) // Less then 2% of cases
1863 // Recursive locking, lock current split point and its ancestors to
1864 // guarantee thread_should_stop() and sp_update_pv() are race free.
1865 SplitPoint* spChain[MAX_THREADS * ACTIVE_SPLIT_POINTS_MAX];
1867 for (spChain[cnt] = sp; spChain[cnt]; )
1869 lock_grab(&(spChain[cnt++]->lock));
1870 spChain[cnt] = spChain[cnt - 1]->parent;
1873 if (value > sp->bestValue && !TM.thread_should_stop(threadID))
1875 sp->bestValue = value;
1876 if (sp->bestValue >= sp->beta)
1878 sp->stopRequest = true;
1879 sp_update_pv(sp->parentSstack, ss, sp->ply);
1883 // Release locks in reverse order
1885 lock_release(&(spChain[--cnt]->lock));
1889 /* Here we have the lock still grabbed */
1892 sp->slaves[threadID] = 0;
1894 lock_release(&(sp->lock));
1898 // sp_search_pv() is used to search from a PV split point. This function
1899 // is called by each thread working at the split point. It is similar to
1900 // the normal search_pv() function, but simpler. Because we have already
1901 // probed the hash table and searched the first move before splitting, we
1902 // don't have to repeat all this work in sp_search_pv(). We also don't
1903 // need to store anything to the hash table here: This is taken care of
1904 // after we return from the split point.
1906 void sp_search_pv(SplitPoint* sp, int threadID) {
1908 assert(threadID >= 0 && threadID < TM.active_threads());
1909 assert(TM.active_threads() > 1);
1911 Position pos(*sp->pos);
1913 SearchStack* ss = sp->sstack[threadID];
1914 Value value = -VALUE_INFINITE;
1918 while ( lock_grab_bool(&(sp->lock))
1919 && sp->alpha < sp->beta
1920 && !TM.thread_should_stop(threadID)
1921 && (move = sp->mp->get_next_move()) != MOVE_NONE)
1923 moveCount = ++sp->moves;
1924 lock_release(&(sp->lock));
1926 assert(move_is_ok(move));
1928 bool moveIsCheck = pos.move_is_check(move, ci);
1929 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
1931 ss[sp->ply].currentMove = move;
1933 // Decide the new search depth
1935 Depth ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, false, false, &dangerous);
1936 Depth newDepth = sp->depth - OnePly + ext;
1938 // Make and search the move.
1940 pos.do_move(move, st, ci, moveIsCheck);
1942 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1943 // if the move fails high will be re-searched at full depth.
1944 bool doFullDepthSearch = true;
1947 && !captureOrPromotion
1948 && !move_is_castle(move)
1949 && !move_is_killer(move, ss[sp->ply]))
1951 ss[sp->ply].reduction = pv_reduction(sp->depth, moveCount);
1952 if (ss[sp->ply].reduction)
1954 Value localAlpha = sp->alpha;
1955 value = -search(pos, ss, -localAlpha, newDepth-ss[sp->ply].reduction, sp->ply+1, true, threadID);
1956 doFullDepthSearch = (value > localAlpha);
1960 if (doFullDepthSearch) // Go with full depth non-pv search
1962 Value localAlpha = sp->alpha;
1963 ss[sp->ply].reduction = Depth(0);
1964 value = -search(pos, ss, -localAlpha, newDepth, sp->ply+1, true, threadID);
1966 if (value > localAlpha && value < sp->beta)
1968 // If another thread has failed high then sp->alpha has been increased
1969 // to be higher or equal then beta, if so, avoid to start a PV search.
1970 localAlpha = sp->alpha;
1971 if (localAlpha < sp->beta)
1972 value = -search_pv(pos, ss, -sp->beta, -localAlpha, newDepth, sp->ply+1, threadID);
1974 assert(TM.thread_should_stop(threadID));
1977 pos.undo_move(move);
1979 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1981 if (TM.thread_should_stop(threadID))
1983 lock_grab(&(sp->lock));
1988 if (value > sp->bestValue) // Less then 2% of cases
1990 // Recursive locking, lock current split point and its ancestors to
1991 // guarantee thread_should_stop() and sp_update_pv() are race free.
1992 SplitPoint* spChain[MAX_THREADS * ACTIVE_SPLIT_POINTS_MAX];
1994 for (spChain[cnt] = sp; spChain[cnt]; )
1996 lock_grab(&(spChain[cnt++]->lock));
1997 spChain[cnt] = spChain[cnt - 1]->parent;
2000 if (value > sp->bestValue && !TM.thread_should_stop(threadID))
2002 sp->bestValue = value;
2003 if (value > sp->alpha)
2005 // Ask threads to stop before to modify sp->alpha
2006 if (value >= sp->beta)
2007 sp->stopRequest = true;
2011 sp_update_pv(sp->parentSstack, ss, sp->ply);
2012 if (value == value_mate_in(sp->ply + 1))
2013 ss[sp->ply].mateKiller = move;
2017 // Release locks in reverse order
2019 lock_release(&(spChain[--cnt]->lock));
2023 /* Here we have the lock still grabbed */
2026 sp->slaves[threadID] = 0;
2028 lock_release(&(sp->lock));
2032 // init_node() is called at the beginning of all the search functions
2033 // (search(), search_pv(), qsearch(), and so on) and initializes the
2034 // search stack object corresponding to the current node. Once every
2035 // NodesBetweenPolls nodes, init_node() also calls poll(), which polls
2036 // for user input and checks whether it is time to stop the search.
2038 void init_node(SearchStack ss[], int ply, int threadID) {
2040 assert(ply >= 0 && ply < PLY_MAX);
2041 assert(threadID >= 0 && threadID < TM.active_threads());
2043 TM.incrementNodeCounter(threadID);
2048 if (NodesSincePoll >= NodesBetweenPolls)
2055 ss[ply + 2].initKillers();
2056 TM.print_current_line(ss, ply, threadID);
2060 // update_pv() is called whenever a search returns a value > alpha.
2061 // It updates the PV in the SearchStack object corresponding to the
2064 void update_pv(SearchStack ss[], int ply) {
2066 assert(ply >= 0 && ply < PLY_MAX);
2070 ss[ply].pv[ply] = ss[ply].currentMove;
2072 for (p = ply + 1; ss[ply + 1].pv[p] != MOVE_NONE; p++)
2073 ss[ply].pv[p] = ss[ply + 1].pv[p];
2075 ss[ply].pv[p] = MOVE_NONE;
2079 // sp_update_pv() is a variant of update_pv for use at split points. The
2080 // difference between the two functions is that sp_update_pv also updates
2081 // the PV at the parent node.
2083 void sp_update_pv(SearchStack* pss, SearchStack ss[], int ply) {
2085 assert(ply >= 0 && ply < PLY_MAX);
2089 ss[ply].pv[ply] = pss[ply].pv[ply] = ss[ply].currentMove;
2091 for (p = ply + 1; ss[ply + 1].pv[p] != MOVE_NONE; p++)
2092 ss[ply].pv[p] = pss[ply].pv[p] = ss[ply + 1].pv[p];
2094 ss[ply].pv[p] = pss[ply].pv[p] = MOVE_NONE;
2098 // connected_moves() tests whether two moves are 'connected' in the sense
2099 // that the first move somehow made the second move possible (for instance
2100 // if the moving piece is the same in both moves). The first move is assumed
2101 // to be the move that was made to reach the current position, while the
2102 // second move is assumed to be a move from the current position.
2104 bool connected_moves(const Position& pos, Move m1, Move m2) {
2106 Square f1, t1, f2, t2;
2109 assert(move_is_ok(m1));
2110 assert(move_is_ok(m2));
2112 if (m2 == MOVE_NONE)
2115 // Case 1: The moving piece is the same in both moves
2121 // Case 2: The destination square for m2 was vacated by m1
2127 // Case 3: Moving through the vacated square
2128 if ( piece_is_slider(pos.piece_on(f2))
2129 && bit_is_set(squares_between(f2, t2), f1))
2132 // Case 4: The destination square for m2 is defended by the moving piece in m1
2133 p = pos.piece_on(t1);
2134 if (bit_is_set(pos.attacks_from(p, t1), t2))
2137 // Case 5: Discovered check, checking piece is the piece moved in m1
2138 if ( piece_is_slider(p)
2139 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
2140 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
2142 // discovered_check_candidates() works also if the Position's side to
2143 // move is the opposite of the checking piece.
2144 Color them = opposite_color(pos.side_to_move());
2145 Bitboard dcCandidates = pos.discovered_check_candidates(them);
2147 if (bit_is_set(dcCandidates, f2))
2154 // value_is_mate() checks if the given value is a mate one
2155 // eventually compensated for the ply.
2157 bool value_is_mate(Value value) {
2159 assert(abs(value) <= VALUE_INFINITE);
2161 return value <= value_mated_in(PLY_MAX)
2162 || value >= value_mate_in(PLY_MAX);
2166 // move_is_killer() checks if the given move is among the
2167 // killer moves of that ply.
2169 bool move_is_killer(Move m, const SearchStack& ss) {
2171 const Move* k = ss.killers;
2172 for (int i = 0; i < KILLER_MAX; i++, k++)
2180 // extension() decides whether a move should be searched with normal depth,
2181 // or with extended depth. Certain classes of moves (checking moves, in
2182 // particular) are searched with bigger depth than ordinary moves and in
2183 // any case are marked as 'dangerous'. Note that also if a move is not
2184 // extended, as example because the corresponding UCI option is set to zero,
2185 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
2187 Depth extension(const Position& pos, Move m, bool pvNode, bool captureOrPromotion,
2188 bool moveIsCheck, bool singleEvasion, bool mateThreat, bool* dangerous) {
2190 assert(m != MOVE_NONE);
2192 Depth result = Depth(0);
2193 *dangerous = moveIsCheck | singleEvasion | mateThreat;
2198 result += CheckExtension[pvNode];
2201 result += SingleEvasionExtension[pvNode];
2204 result += MateThreatExtension[pvNode];
2207 if (pos.type_of_piece_on(move_from(m)) == PAWN)
2209 Color c = pos.side_to_move();
2210 if (relative_rank(c, move_to(m)) == RANK_7)
2212 result += PawnPushTo7thExtension[pvNode];
2215 if (pos.pawn_is_passed(c, move_to(m)))
2217 result += PassedPawnExtension[pvNode];
2222 if ( captureOrPromotion
2223 && pos.type_of_piece_on(move_to(m)) != PAWN
2224 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
2225 - pos.midgame_value_of_piece_on(move_to(m)) == Value(0))
2226 && !move_is_promotion(m)
2229 result += PawnEndgameExtension[pvNode];
2234 && captureOrPromotion
2235 && pos.type_of_piece_on(move_to(m)) != PAWN
2236 && pos.see_sign(m) >= 0)
2242 return Min(result, OnePly);
2246 // ok_to_do_nullmove() looks at the current position and decides whether
2247 // doing a 'null move' should be allowed. In order to avoid zugzwang
2248 // problems, null moves are not allowed when the side to move has very
2249 // little material left. Currently, the test is a bit too simple: Null
2250 // moves are avoided only when the side to move has only pawns left.
2251 // It's probably a good idea to avoid null moves in at least some more
2252 // complicated endgames, e.g. KQ vs KR. FIXME
2254 bool ok_to_do_nullmove(const Position& pos) {
2256 return pos.non_pawn_material(pos.side_to_move()) != Value(0);
2260 // ok_to_prune() tests whether it is safe to forward prune a move. Only
2261 // non-tactical moves late in the move list close to the leaves are
2262 // candidates for pruning.
2264 bool ok_to_prune(const Position& pos, Move m, Move threat) {
2266 assert(move_is_ok(m));
2267 assert(threat == MOVE_NONE || move_is_ok(threat));
2268 assert(!pos.move_is_check(m));
2269 assert(!pos.move_is_capture_or_promotion(m));
2270 assert(!pos.move_is_passed_pawn_push(m));
2272 Square mfrom, mto, tfrom, tto;
2274 // Prune if there isn't any threat move
2275 if (threat == MOVE_NONE)
2278 mfrom = move_from(m);
2280 tfrom = move_from(threat);
2281 tto = move_to(threat);
2283 // Case 1: Don't prune moves which move the threatened piece
2287 // Case 2: If the threatened piece has value less than or equal to the
2288 // value of the threatening piece, don't prune move which defend it.
2289 if ( pos.move_is_capture(threat)
2290 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
2291 || pos.type_of_piece_on(tfrom) == KING)
2292 && pos.move_attacks_square(m, tto))
2295 // Case 3: If the moving piece in the threatened move is a slider, don't
2296 // prune safe moves which block its ray.
2297 if ( piece_is_slider(pos.piece_on(tfrom))
2298 && bit_is_set(squares_between(tfrom, tto), mto)
2299 && pos.see_sign(m) >= 0)
2306 // ok_to_use_TT() returns true if a transposition table score
2307 // can be used at a given point in search.
2309 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
2311 Value v = value_from_tt(tte->value(), ply);
2313 return ( tte->depth() >= depth
2314 || v >= Max(value_mate_in(PLY_MAX), beta)
2315 || v < Min(value_mated_in(PLY_MAX), beta))
2317 && ( (is_lower_bound(tte->type()) && v >= beta)
2318 || (is_upper_bound(tte->type()) && v < beta));
2322 // refine_eval() returns the transposition table score if
2323 // possible otherwise falls back on static position evaluation.
2325 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
2330 Value v = value_from_tt(tte->value(), ply);
2332 if ( (is_lower_bound(tte->type()) && v >= defaultEval)
2333 || (is_upper_bound(tte->type()) && v < defaultEval))
2340 // update_history() registers a good move that produced a beta-cutoff
2341 // in history and marks as failures all the other moves of that ply.
2343 void update_history(const Position& pos, Move move, Depth depth,
2344 Move movesSearched[], int moveCount) {
2348 H.success(pos.piece_on(move_from(move)), move_to(move), depth);
2350 for (int i = 0; i < moveCount - 1; i++)
2352 m = movesSearched[i];
2356 if (!pos.move_is_capture_or_promotion(m))
2357 H.failure(pos.piece_on(move_from(m)), move_to(m), depth);
2362 // update_killers() add a good move that produced a beta-cutoff
2363 // among the killer moves of that ply.
2365 void update_killers(Move m, SearchStack& ss) {
2367 if (m == ss.killers[0])
2370 for (int i = KILLER_MAX - 1; i > 0; i--)
2371 ss.killers[i] = ss.killers[i - 1];
2377 // update_gains() updates the gains table of a non-capture move given
2378 // the static position evaluation before and after the move.
2380 void update_gains(const Position& pos, Move m, Value before, Value after) {
2383 && before != VALUE_NONE
2384 && after != VALUE_NONE
2385 && pos.captured_piece() == NO_PIECE_TYPE
2386 && !move_is_castle(m)
2387 && !move_is_promotion(m))
2388 H.set_gain(pos.piece_on(move_to(m)), move_to(m), -(before + after));
2392 // current_search_time() returns the number of milliseconds which have passed
2393 // since the beginning of the current search.
2395 int current_search_time() {
2397 return get_system_time() - SearchStartTime;
2401 // nps() computes the current nodes/second count.
2405 int t = current_search_time();
2406 return (t > 0 ? int((TM.nodes_searched() * 1000) / t) : 0);
2410 // poll() performs two different functions: It polls for user input, and it
2411 // looks at the time consumed so far and decides if it's time to abort the
2416 static int lastInfoTime;
2417 int t = current_search_time();
2422 // We are line oriented, don't read single chars
2423 std::string command;
2425 if (!std::getline(std::cin, command))
2428 if (command == "quit")
2431 PonderSearch = false;
2435 else if (command == "stop")
2438 PonderSearch = false;
2440 else if (command == "ponderhit")
2444 // Print search information
2448 else if (lastInfoTime > t)
2449 // HACK: Must be a new search where we searched less than
2450 // NodesBetweenPolls nodes during the first second of search.
2453 else if (t - lastInfoTime >= 1000)
2456 lock_grab(&TM.IOLock);
2461 if (dbg_show_hit_rate)
2462 dbg_print_hit_rate();
2464 cout << "info nodes " << TM.nodes_searched() << " nps " << nps()
2465 << " time " << t << " hashfull " << TT.full() << endl;
2467 lock_release(&TM.IOLock);
2469 if (ShowCurrentLine)
2470 TM.threads[0].printCurrentLineRequest = true;
2473 // Should we stop the search?
2477 bool stillAtFirstMove = RootMoveNumber == 1
2478 && !AspirationFailLow
2479 && t > MaxSearchTime + ExtraSearchTime;
2481 bool noMoreTime = t > AbsoluteMaxSearchTime
2482 || stillAtFirstMove;
2484 if ( (Iteration >= 3 && UseTimeManagement && noMoreTime)
2485 || (ExactMaxTime && t >= ExactMaxTime)
2486 || (Iteration >= 3 && MaxNodes && TM.nodes_searched() >= MaxNodes))
2491 // ponderhit() is called when the program is pondering (i.e. thinking while
2492 // it's the opponent's turn to move) in order to let the engine know that
2493 // it correctly predicted the opponent's move.
2497 int t = current_search_time();
2498 PonderSearch = false;
2500 bool stillAtFirstMove = RootMoveNumber == 1
2501 && !AspirationFailLow
2502 && t > MaxSearchTime + ExtraSearchTime;
2504 bool noMoreTime = t > AbsoluteMaxSearchTime
2505 || stillAtFirstMove;
2507 if (Iteration >= 3 && UseTimeManagement && (noMoreTime || StopOnPonderhit))
2512 // init_ss_array() does a fast reset of the first entries of a SearchStack array
2514 void init_ss_array(SearchStack ss[]) {
2516 for (int i = 0; i < 3; i++)
2519 ss[i].initKillers();
2524 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2525 // while the program is pondering. The point is to work around a wrinkle in
2526 // the UCI protocol: When pondering, the engine is not allowed to give a
2527 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2528 // We simply wait here until one of these commands is sent, and return,
2529 // after which the bestmove and pondermove will be printed (in id_loop()).
2531 void wait_for_stop_or_ponderhit() {
2533 std::string command;
2537 if (!std::getline(std::cin, command))
2540 if (command == "quit")
2545 else if (command == "ponderhit" || command == "stop")
2551 // init_thread() is the function which is called when a new thread is
2552 // launched. It simply calls the idle_loop() function with the supplied
2553 // threadID. There are two versions of this function; one for POSIX
2554 // threads and one for Windows threads.
2556 #if !defined(_MSC_VER)
2558 void* init_thread(void *threadID) {
2560 TM.idle_loop(*(int*)threadID, NULL);
2566 DWORD WINAPI init_thread(LPVOID threadID) {
2568 TM.idle_loop(*(int*)threadID, NULL);
2575 /// The ThreadsManager class
2577 // resetNodeCounters(), resetBetaCounters(), searched_nodes() and
2578 // get_beta_counters() are getters/setters for the per thread
2579 // counters used to sort the moves at root.
2581 void ThreadsManager::resetNodeCounters() {
2583 for (int i = 0; i < MAX_THREADS; i++)
2584 threads[i].nodes = 0ULL;
2587 void ThreadsManager::resetBetaCounters() {
2589 for (int i = 0; i < MAX_THREADS; i++)
2590 threads[i].betaCutOffs[WHITE] = threads[i].betaCutOffs[BLACK] = 0ULL;
2593 int64_t ThreadsManager::nodes_searched() const {
2595 int64_t result = 0ULL;
2596 for (int i = 0; i < ActiveThreads; i++)
2597 result += threads[i].nodes;
2602 void ThreadsManager::get_beta_counters(Color us, int64_t& our, int64_t& their) const {
2605 for (int i = 0; i < MAX_THREADS; i++)
2607 our += threads[i].betaCutOffs[us];
2608 their += threads[i].betaCutOffs[opposite_color(us)];
2613 // idle_loop() is where the threads are parked when they have no work to do.
2614 // The parameter "waitSp", if non-NULL, is a pointer to an active SplitPoint
2615 // object for which the current thread is the master.
2617 void ThreadsManager::idle_loop(int threadID, SplitPoint* waitSp) {
2619 assert(threadID >= 0 && threadID < MAX_THREADS);
2623 // Slave threads can exit as soon as AllThreadsShouldExit raises,
2624 // master should exit as last one.
2625 if (AllThreadsShouldExit && !waitSp)
2627 threads[threadID].state = THREAD_TERMINATED;
2631 // If we are not thinking, wait for a condition to be signaled
2632 // instead of wasting CPU time polling for work.
2633 while ( threadID != 0
2634 && !AllThreadsShouldExit
2635 && (AllThreadsShouldSleep || threadID >= ActiveThreads))
2637 threads[threadID].state = THREAD_SLEEPING;
2639 #if !defined(_MSC_VER)
2640 pthread_mutex_lock(&WaitLock);
2641 pthread_cond_wait(&WaitCond, &WaitLock);
2642 pthread_mutex_unlock(&WaitLock);
2644 WaitForSingleObject(SitIdleEvent[threadID], INFINITE);
2646 // State is already changed by wake_sleeping_threads()
2647 assert(threads[threadID].state == THREAD_AVAILABLE || threadID >= ActiveThreads);
2650 // If this thread has been assigned work, launch a search
2651 if (threads[threadID].state == THREAD_WORKISWAITING)
2653 threads[threadID].state = THREAD_SEARCHING;
2655 if (threads[threadID].splitPoint->pvNode)
2656 sp_search_pv(threads[threadID].splitPoint, threadID);
2658 sp_search(threads[threadID].splitPoint, threadID);
2660 assert(threads[threadID].state == THREAD_SEARCHING);
2662 // If this is a slave thread reset to available, instead
2663 // if it is a master thread and all slaves have finished
2664 // then leave as is to avoid booking by another master,
2665 // we will leave idle loop shortly anyhow.
2666 if ( !AllThreadsShouldExit
2667 && (!waitSp || waitSp->cpus > 0))
2668 threads[threadID].state = THREAD_AVAILABLE;
2671 // If this thread is the master of a split point and all threads have
2672 // finished their work at this split point, return from the idle loop.
2673 if (waitSp != NULL && waitSp->cpus == 0)
2675 assert( threads[threadID].state == THREAD_AVAILABLE
2676 || threads[threadID].state == THREAD_SEARCHING);
2678 threads[threadID].state = THREAD_SEARCHING;
2685 // init_threads() is called during startup. It launches all helper threads,
2686 // and initializes the split point stack and the global locks and condition
2689 void ThreadsManager::init_threads() {
2694 #if !defined(_MSC_VER)
2695 pthread_t pthread[1];
2698 // Initialize global locks
2699 lock_init(&MPLock, NULL);
2700 lock_init(&IOLock, NULL);
2702 // Initialize SplitPointStack locks
2703 for (int i = 0; i < MAX_THREADS; i++)
2704 for (int j = 0; j < ACTIVE_SPLIT_POINTS_MAX; j++)
2706 SplitPointStack[i][j].parent = NULL;
2707 lock_init(&(SplitPointStack[i][j].lock), NULL);
2710 #if !defined(_MSC_VER)
2711 pthread_mutex_init(&WaitLock, NULL);
2712 pthread_cond_init(&WaitCond, NULL);
2714 for (i = 0; i < MAX_THREADS; i++)
2715 SitIdleEvent[i] = CreateEvent(0, FALSE, FALSE, 0);
2718 // Will be set just before program exits to properly end the threads
2719 AllThreadsShouldExit = false;
2721 // Threads will be put to sleep as soon as created
2722 AllThreadsShouldSleep = true;
2724 // All threads except the main thread should be initialized to THREAD_AVAILABLE
2726 threads[0].state = THREAD_SEARCHING;
2727 for (i = 1; i < MAX_THREADS; i++)
2728 threads[i].state = THREAD_AVAILABLE;
2730 // Launch the helper threads
2731 for (i = 1; i < MAX_THREADS; i++)
2734 #if !defined(_MSC_VER)
2735 ok = (pthread_create(pthread, NULL, init_thread, (void*)(&i)) == 0);
2738 ok = (CreateThread(NULL, 0, init_thread, (LPVOID)(&i), 0, iID) != NULL);
2743 cout << "Failed to create thread number " << i << endl;
2744 Application::exit_with_failure();
2747 // Wait until the thread has finished launching and is gone to sleep
2748 while (threads[i].state != THREAD_SLEEPING);
2753 // exit_threads() is called when the program exits. It makes all the
2754 // helper threads exit cleanly.
2756 void ThreadsManager::exit_threads() {
2758 ActiveThreads = MAX_THREADS; // HACK
2759 AllThreadsShouldSleep = true; // HACK
2760 wake_sleeping_threads();
2762 // This makes the threads to exit idle_loop()
2763 AllThreadsShouldExit = true;
2765 // Wait for thread termination
2766 for (int i = 1; i < MAX_THREADS; i++)
2767 while (threads[i].state != THREAD_TERMINATED);
2769 // Now we can safely destroy the locks
2770 for (int i = 0; i < MAX_THREADS; i++)
2771 for (int j = 0; j < ACTIVE_SPLIT_POINTS_MAX; j++)
2772 lock_destroy(&(SplitPointStack[i][j].lock));
2776 // thread_should_stop() checks whether the thread should stop its search.
2777 // This can happen if a beta cutoff has occurred in the thread's currently
2778 // active split point, or in some ancestor of the current split point.
2780 bool ThreadsManager::thread_should_stop(int threadID) const {
2782 assert(threadID >= 0 && threadID < ActiveThreads);
2786 for (sp = threads[threadID].splitPoint; sp && !sp->stopRequest; sp = sp->parent);
2791 // thread_is_available() checks whether the thread with threadID "slave" is
2792 // available to help the thread with threadID "master" at a split point. An
2793 // obvious requirement is that "slave" must be idle. With more than two
2794 // threads, this is not by itself sufficient: If "slave" is the master of
2795 // some active split point, it is only available as a slave to the other
2796 // threads which are busy searching the split point at the top of "slave"'s
2797 // split point stack (the "helpful master concept" in YBWC terminology).
2799 bool ThreadsManager::thread_is_available(int slave, int master) const {
2801 assert(slave >= 0 && slave < ActiveThreads);
2802 assert(master >= 0 && master < ActiveThreads);
2803 assert(ActiveThreads > 1);
2805 if (threads[slave].state != THREAD_AVAILABLE || slave == master)
2808 // Make a local copy to be sure doesn't change under our feet
2809 int localActiveSplitPoints = threads[slave].activeSplitPoints;
2811 if (localActiveSplitPoints == 0)
2812 // No active split points means that the thread is available as
2813 // a slave for any other thread.
2816 if (ActiveThreads == 2)
2819 // Apply the "helpful master" concept if possible. Use localActiveSplitPoints
2820 // that is known to be > 0, instead of threads[slave].activeSplitPoints that
2821 // could have been set to 0 by another thread leading to an out of bound access.
2822 if (SplitPointStack[slave][localActiveSplitPoints - 1].slaves[master])
2829 // available_thread_exists() tries to find an idle thread which is available as
2830 // a slave for the thread with threadID "master".
2832 bool ThreadsManager::available_thread_exists(int master) const {
2834 assert(master >= 0 && master < ActiveThreads);
2835 assert(ActiveThreads > 1);
2837 for (int i = 0; i < ActiveThreads; i++)
2838 if (thread_is_available(i, master))
2845 // split() does the actual work of distributing the work at a node between
2846 // several threads at PV nodes. If it does not succeed in splitting the
2847 // node (because no idle threads are available, or because we have no unused
2848 // split point objects), the function immediately returns false. If
2849 // splitting is possible, a SplitPoint object is initialized with all the
2850 // data that must be copied to the helper threads (the current position and
2851 // search stack, alpha, beta, the search depth, etc.), and we tell our
2852 // helper threads that they have been assigned work. This will cause them
2853 // to instantly leave their idle loops and call sp_search_pv(). When all
2854 // threads have returned from sp_search_pv (or, equivalently, when
2855 // splitPoint->cpus becomes 0), split() returns true.
2857 bool ThreadsManager::split(const Position& p, SearchStack* sstck, int ply,
2858 Value* alpha, Value* beta, Value* bestValue, const Value futilityValue,
2859 Depth depth, int* moves, MovePicker* mp, int master, bool pvNode) {
2862 assert(sstck != NULL);
2863 assert(ply >= 0 && ply < PLY_MAX);
2864 assert(*bestValue >= -VALUE_INFINITE && *bestValue <= *alpha);
2865 assert(!pvNode || *alpha < *beta);
2866 assert(*beta <= VALUE_INFINITE);
2867 assert(depth > Depth(0));
2868 assert(master >= 0 && master < ActiveThreads);
2869 assert(ActiveThreads > 1);
2871 SplitPoint* splitPoint;
2875 // If no other thread is available to help us, or if we have too many
2876 // active split points, don't split.
2877 if ( !available_thread_exists(master)
2878 || threads[master].activeSplitPoints >= ACTIVE_SPLIT_POINTS_MAX)
2880 lock_release(&MPLock);
2884 // Pick the next available split point object from the split point stack
2885 splitPoint = SplitPointStack[master] + threads[master].activeSplitPoints;
2886 threads[master].activeSplitPoints++;
2888 // Initialize the split point object
2889 splitPoint->parent = threads[master].splitPoint;
2890 splitPoint->stopRequest = false;
2891 splitPoint->ply = ply;
2892 splitPoint->depth = depth;
2893 splitPoint->alpha = pvNode ? *alpha : (*beta - 1);
2894 splitPoint->beta = *beta;
2895 splitPoint->pvNode = pvNode;
2896 splitPoint->bestValue = *bestValue;
2897 splitPoint->futilityValue = futilityValue;
2898 splitPoint->master = master;
2899 splitPoint->mp = mp;
2900 splitPoint->moves = *moves;
2901 splitPoint->cpus = 1;
2902 splitPoint->pos = &p;
2903 splitPoint->parentSstack = sstck;
2904 for (int i = 0; i < ActiveThreads; i++)
2905 splitPoint->slaves[i] = 0;
2907 threads[master].splitPoint = splitPoint;
2909 // If we are here it means we are not available
2910 assert(threads[master].state != THREAD_AVAILABLE);
2912 // Allocate available threads setting state to THREAD_BOOKED
2913 for (int i = 0; i < ActiveThreads && splitPoint->cpus < MaxThreadsPerSplitPoint; i++)
2914 if (thread_is_available(i, master))
2916 threads[i].state = THREAD_BOOKED;
2917 threads[i].splitPoint = splitPoint;
2918 splitPoint->slaves[i] = 1;
2922 assert(splitPoint->cpus > 1);
2924 // We can release the lock because slave threads are already booked and master is not available
2925 lock_release(&MPLock);
2927 // Tell the threads that they have work to do. This will make them leave
2928 // their idle loop. But before copy search stack tail for each thread.
2929 for (int i = 0; i < ActiveThreads; i++)
2930 if (i == master || splitPoint->slaves[i])
2932 memcpy(splitPoint->sstack[i] + ply - 1, sstck + ply - 1, 4 * sizeof(SearchStack));
2934 assert(i == master || threads[i].state == THREAD_BOOKED);
2936 threads[i].state = THREAD_WORKISWAITING; // This makes the slave to exit from idle_loop()
2939 // Everything is set up. The master thread enters the idle loop, from
2940 // which it will instantly launch a search, because its state is
2941 // THREAD_WORKISWAITING. We send the split point as a second parameter to the
2942 // idle loop, which means that the main thread will return from the idle
2943 // loop when all threads have finished their work at this split point
2944 // (i.e. when splitPoint->cpus == 0).
2945 idle_loop(master, splitPoint);
2947 // We have returned from the idle loop, which means that all threads are
2948 // finished. Update alpha, beta and bestValue, and return.
2952 *alpha = splitPoint->alpha;
2954 *beta = splitPoint->beta;
2955 *bestValue = splitPoint->bestValue;
2956 threads[master].activeSplitPoints--;
2957 threads[master].splitPoint = splitPoint->parent;
2959 lock_release(&MPLock);
2964 // wake_sleeping_threads() wakes up all sleeping threads when it is time
2965 // to start a new search from the root.
2967 void ThreadsManager::wake_sleeping_threads() {
2969 assert(AllThreadsShouldSleep);
2970 assert(ActiveThreads > 0);
2972 AllThreadsShouldSleep = false;
2974 if (ActiveThreads == 1)
2977 for (int i = 1; i < ActiveThreads; i++)
2979 assert(threads[i].state == THREAD_SLEEPING);
2981 threads[i].state = THREAD_AVAILABLE;
2984 #if !defined(_MSC_VER)
2985 pthread_mutex_lock(&WaitLock);
2986 pthread_cond_broadcast(&WaitCond);
2987 pthread_mutex_unlock(&WaitLock);
2989 for (int i = 1; i < MAX_THREADS; i++)
2990 SetEvent(SitIdleEvent[i]);
2996 // put_threads_to_sleep() makes all the threads go to sleep just before
2997 // to leave think(), at the end of the search. Threads should have already
2998 // finished the job and should be idle.
3000 void ThreadsManager::put_threads_to_sleep() {
3002 assert(!AllThreadsShouldSleep);
3004 // This makes the threads to go to sleep
3005 AllThreadsShouldSleep = true;
3007 // Wait for the threads to be all sleeping and reset flags
3008 // to a known state.
3009 for (int i = 1; i < ActiveThreads; i++)
3011 while (threads[i].state != THREAD_SLEEPING);
3013 // This flag can be in a random state
3014 threads[i].printCurrentLineRequest = false;
3018 // print_current_line() prints _once_ the current line of search for a
3019 // given thread and then setup the print request for the next thread.
3020 // Called when the UCI option UCI_ShowCurrLine is 'true'.
3022 void ThreadsManager::print_current_line(SearchStack ss[], int ply, int threadID) {
3024 assert(ply >= 0 && ply < PLY_MAX);
3025 assert(threadID >= 0 && threadID < ActiveThreads);
3027 if (!threads[threadID].printCurrentLineRequest)
3031 threads[threadID].printCurrentLineRequest = false;
3033 if (threads[threadID].state == THREAD_SEARCHING)
3036 cout << "info currline " << (threadID + 1);
3037 for (int p = 0; p < ply; p++)
3038 cout << " " << ss[p].currentMove;
3041 lock_release(&IOLock);
3044 // Setup print request for the next thread ID
3045 if (threadID + 1 < ActiveThreads)
3046 threads[threadID + 1].printCurrentLineRequest = true;
3050 /// The RootMoveList class
3052 // RootMoveList c'tor
3054 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) : count(0) {
3056 SearchStack ss[PLY_MAX_PLUS_2];
3057 MoveStack mlist[MaxRootMoves];
3059 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
3061 // Generate all legal moves
3062 MoveStack* last = generate_moves(pos, mlist);
3064 // Add each move to the moves[] array
3065 for (MoveStack* cur = mlist; cur != last; cur++)
3067 bool includeMove = includeAllMoves;
3069 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
3070 includeMove = (searchMoves[k] == cur->move);
3075 // Find a quick score for the move
3077 pos.do_move(cur->move, st);
3078 moves[count].move = cur->move;
3079 moves[count].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE, Depth(0), 1, 0);
3080 moves[count].pv[0] = cur->move;
3081 moves[count].pv[1] = MOVE_NONE;
3082 pos.undo_move(cur->move);
3089 // RootMoveList simple methods definitions
3091 void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) {
3093 moves[moveNum].nodes = nodes;
3094 moves[moveNum].cumulativeNodes += nodes;
3097 void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) {
3099 moves[moveNum].ourBeta = our;
3100 moves[moveNum].theirBeta = their;
3103 void RootMoveList::set_move_pv(int moveNum, const Move pv[]) {
3107 for (j = 0; pv[j] != MOVE_NONE; j++)
3108 moves[moveNum].pv[j] = pv[j];
3110 moves[moveNum].pv[j] = MOVE_NONE;
3114 // RootMoveList::sort() sorts the root move list at the beginning of a new
3117 void RootMoveList::sort() {
3119 sort_multipv(count - 1); // Sort all items
3123 // RootMoveList::sort_multipv() sorts the first few moves in the root move
3124 // list by their scores and depths. It is used to order the different PVs
3125 // correctly in MultiPV mode.
3127 void RootMoveList::sort_multipv(int n) {
3131 for (i = 1; i <= n; i++)
3133 RootMove rm = moves[i];
3134 for (j = i; j > 0 && moves[j - 1] < rm; j--)
3135 moves[j] = moves[j - 1];