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 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/>.
39 #include "ucioption.h"
43 //// Local definitions
50 // The BetaCounterType class is used to order moves at ply one.
51 // Apart for the first one that has its score, following moves
52 // normally have score -VALUE_INFINITE, so are ordered according
53 // to the number of beta cutoffs occurred under their subtree during
54 // the last iteration.
56 struct BetaCounterType {
60 void add(Color us, Depth d, int threadID);
61 void read(Color us, int64_t& our, int64_t& their);
63 int64_t hits[THREAD_MAX][2];
67 // The RootMove class is used for moves at the root at the tree. For each
68 // root move, we store a score, a node count, and a PV (really a refutation
69 // in the case of moves which fail low).
74 bool operator<(const RootMove&); // used to sort
78 int64_t nodes, cumulativeNodes;
79 Move pv[PLY_MAX_PLUS_2];
80 int64_t ourBeta, theirBeta;
84 // The RootMoveList class is essentially an array of RootMove objects, with
85 // a handful of methods for accessing the data in the individual moves.
90 RootMoveList(Position &pos, Move searchMoves[]);
91 inline Move get_move(int moveNum) const;
92 inline Value get_move_score(int moveNum) const;
93 inline void set_move_score(int moveNum, Value score);
94 inline void set_move_nodes(int moveNum, int64_t nodes);
95 inline void set_beta_counters(int moveNum, int64_t our, int64_t their);
96 void set_move_pv(int moveNum, const Move pv[]);
97 inline Move get_move_pv(int moveNum, int i) const;
98 inline int64_t get_move_cumulative_nodes(int moveNum) const;
99 inline int move_count() const;
100 Move scan_for_easy_move() const;
102 void sort_multipv(int n);
105 static const int MaxRootMoves = 500;
106 RootMove moves[MaxRootMoves];
111 /// Constants and variables
113 // Minimum number of full depth (i.e. non-reduced) moves at PV and non-PV
116 int LMRNonPVMoves = 4;
118 // Depth limit for use of dynamic threat detection:
119 Depth ThreatDepth = 5*OnePly;
121 // Depth limit for selective search:
122 Depth SelectiveDepth = 7*OnePly;
124 // Use internal iterative deepening?
125 const bool UseIIDAtPVNodes = true;
126 const bool UseIIDAtNonPVNodes = false;
128 // Use null move driven internal iterative deepening?
129 bool UseNullDrivenIID = false;
131 // Internal iterative deepening margin. At Non-PV moves, when
132 // UseIIDAtNonPVNodes is true, we do an internal iterative deepening search
133 // when the static evaluation is at most IIDMargin below beta.
134 const Value IIDMargin = Value(0x100);
136 // Easy move margin. An easy move candidate must be at least this much
137 // better than the second best move.
138 const Value EasyMoveMargin = Value(0x200);
140 // Problem margin. If the score of the first move at iteration N+1 has
141 // dropped by more than this since iteration N, the boolean variable
142 // "Problem" is set to true, which will make the program spend some extra
143 // time looking for a better move.
144 const Value ProblemMargin = Value(0x28);
146 // No problem margin. If the boolean "Problem" is true, and a new move
147 // is found at the root which is less than NoProblemMargin worse than the
148 // best move from the previous iteration, Problem is set back to false.
149 const Value NoProblemMargin = Value(0x14);
151 // Null move margin. A null move search will not be done if the approximate
152 // evaluation of the position is more than NullMoveMargin below beta.
153 const Value NullMoveMargin = Value(0x300);
155 // Pruning criterions. See the code and comments in ok_to_prune() to
156 // understand their precise meaning.
157 const bool PruneEscapeMoves = false;
158 const bool PruneDefendingMoves = false;
159 const bool PruneBlockingMoves = false;
161 // Use futility pruning?
162 bool UseQSearchFutilityPruning = true;
163 bool UseFutilityPruning = true;
165 // Margins for futility pruning in the quiescence search, at frontier
166 // nodes, and at pre-frontier nodes
167 Value FutilityMargin0 = Value(0x80);
168 Value FutilityMargin1 = Value(0x100);
169 Value FutilityMargin2 = Value(0x200);
172 Depth RazorDepth = 4*OnePly;
173 Value RazorMargin = Value(0x300);
175 // Last seconds noise filtering (LSN)
176 bool UseLSNFiltering = false;
177 bool looseOnTime = false;
178 int LSNTime = 4 * 1000; // In milliseconds
179 Value LSNValue = Value(0x200);
181 // Extensions. Array index 0 is used at non-PV nodes, index 1 at PV nodes.
182 Depth CheckExtension[2] = {OnePly, OnePly};
183 Depth SingleReplyExtension[2] = {OnePly / 2, OnePly / 2};
184 Depth PawnPushTo7thExtension[2] = {OnePly / 2, OnePly / 2};
185 Depth PassedPawnExtension[2] = {Depth(0), Depth(0)};
186 Depth PawnEndgameExtension[2] = {OnePly, OnePly};
187 Depth MateThreatExtension[2] = {Depth(0), Depth(0)};
189 // Search depth at iteration 1
190 const Depth InitialDepth = OnePly /*+ OnePly/2*/;
194 int NodesBetweenPolls = 30000;
196 // Iteration counters
199 BetaCounterType BetaCounter;
201 // Scores and number of times the best move changed for each iteration:
202 Value ValueByIteration[PLY_MAX_PLUS_2];
203 int BestMoveChangesByIteration[PLY_MAX_PLUS_2];
208 // Time managment variables
210 int MaxNodes, MaxDepth;
211 int MaxSearchTime, AbsoluteMaxSearchTime, ExtraSearchTime;
212 Move BestRootMove, PonderMove, EasyMove;
216 bool StopOnPonderhit;
221 bool PonderingEnabled;
224 // Show current line?
225 bool ShowCurrentLine = false;
228 bool UseLogFile = false;
229 std::ofstream LogFile;
231 // MP related variables
232 Depth MinimumSplitDepth = 4*OnePly;
233 int MaxThreadsPerSplitPoint = 4;
234 Thread Threads[THREAD_MAX];
236 bool AllThreadsShouldExit = false;
237 const int MaxActiveSplitPoints = 8;
238 SplitPoint SplitPointStack[THREAD_MAX][MaxActiveSplitPoints];
241 #if !defined(_MSC_VER)
242 pthread_cond_t WaitCond;
243 pthread_mutex_t WaitLock;
245 HANDLE SitIdleEvent[THREAD_MAX];
251 Value id_loop(const Position &pos, Move searchMoves[]);
252 Value root_search(Position &pos, SearchStack ss[], RootMoveList &rml);
253 Value search_pv(Position &pos, SearchStack ss[], Value alpha, Value beta,
254 Depth depth, int ply, int threadID);
255 Value search(Position &pos, SearchStack ss[], Value beta,
256 Depth depth, int ply, bool allowNullmove, int threadID);
257 Value qsearch(Position &pos, SearchStack ss[], Value alpha, Value beta,
258 Depth depth, int ply, int threadID);
259 void sp_search(SplitPoint *sp, int threadID);
260 void sp_search_pv(SplitPoint *sp, int threadID);
261 void init_search_stack(SearchStack& ss);
262 void init_search_stack(SearchStack ss[]);
263 void init_node(const Position &pos, SearchStack ss[], int ply, int threadID);
264 void update_pv(SearchStack ss[], int ply);
265 void sp_update_pv(SearchStack *pss, SearchStack ss[], int ply);
266 bool connected_moves(const Position &pos, Move m1, Move m2);
267 bool value_is_mate(Value value);
268 bool move_is_killer(Move m, const SearchStack& ss);
269 Depth extension(const Position &pos, Move m, bool pvNode, bool check, bool singleReply, bool mateThreat, bool* dangerous);
270 bool ok_to_do_nullmove(const Position &pos);
271 bool ok_to_prune(const Position &pos, Move m, Move threat, Depth d);
272 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply);
273 bool ok_to_history(const Position &pos, Move m);
274 void update_history(const Position& pos, Move m, Depth depth, Move movesSearched[], int moveCount);
275 void update_killers(Move m, SearchStack& ss);
277 bool fail_high_ply_1();
278 int current_search_time();
282 void print_current_line(SearchStack ss[], int ply, int threadID);
283 void wait_for_stop_or_ponderhit();
285 void idle_loop(int threadID, SplitPoint *waitSp);
286 void init_split_point_stack();
287 void destroy_split_point_stack();
288 bool thread_should_stop(int threadID);
289 bool thread_is_available(int slave, int master);
290 bool idle_thread_exists(int master);
291 bool split(const Position &pos, SearchStack *ss, int ply,
292 Value *alpha, Value *beta, Value *bestValue, Depth depth,
293 int *moves, MovePicker *mp, Bitboard dcCandidates, int master,
295 void wake_sleeping_threads();
297 #if !defined(_MSC_VER)
298 void *init_thread(void *threadID);
300 DWORD WINAPI init_thread(LPVOID threadID);
307 //// Global variables
310 // The main transposition table
311 TranspositionTable TT = TranspositionTable(TTDefaultSize);
314 // Number of active threads:
315 int ActiveThreads = 1;
317 // Locks. In principle, there is no need for IOLock to be a global variable,
318 // but it could turn out to be useful for debugging.
321 History H; // Should be made local?
323 // The empty search stack
324 SearchStack EmptySearchStack;
331 /// think() is the external interface to Stockfish's search, and is called when
332 /// the program receives the UCI 'go' command. It initializes various
333 /// search-related global variables, and calls root_search()
335 void think(const Position &pos, bool infinite, bool ponder, int side_to_move,
336 int time[], int increment[], int movesToGo, int maxDepth,
337 int maxNodes, int maxTime, Move searchMoves[]) {
339 // Look for a book move
340 if (!infinite && !ponder && get_option_value_bool("OwnBook"))
343 if (get_option_value_string("Book File") != OpeningBook.file_name())
346 OpeningBook.open("book.bin");
348 bookMove = OpeningBook.get_move(pos);
349 if (bookMove != MOVE_NONE)
351 std::cout << "bestmove " << bookMove << std::endl;
356 // Initialize global search variables
358 SearchStartTime = get_system_time();
359 BestRootMove = MOVE_NONE;
360 PonderMove = MOVE_NONE;
361 EasyMove = MOVE_NONE;
362 for (int i = 0; i < THREAD_MAX; i++)
364 Threads[i].nodes = 0ULL;
365 Threads[i].failHighPly1 = false;
368 InfiniteSearch = infinite;
369 PonderSearch = ponder;
370 StopOnPonderhit = false;
375 ExactMaxTime = maxTime;
377 // Read UCI option values
378 TT.set_size(get_option_value_int("Hash"));
379 if (button_was_pressed("Clear Hash"))
382 PonderingEnabled = get_option_value_bool("Ponder");
383 MultiPV = get_option_value_int("MultiPV");
385 CheckExtension[1] = Depth(get_option_value_int("Check Extension (PV nodes)"));
386 CheckExtension[0] = Depth(get_option_value_int("Check Extension (non-PV nodes)"));
388 SingleReplyExtension[1] = Depth(get_option_value_int("Single Reply Extension (PV nodes)"));
389 SingleReplyExtension[0] = Depth(get_option_value_int("Single Reply Extension (non-PV nodes)"));
391 PawnPushTo7thExtension[1] = Depth(get_option_value_int("Pawn Push to 7th Extension (PV nodes)"));
392 PawnPushTo7thExtension[0] = Depth(get_option_value_int("Pawn Push to 7th Extension (non-PV nodes)"));
394 PassedPawnExtension[1] = Depth(get_option_value_int("Passed Pawn Extension (PV nodes)"));
395 PassedPawnExtension[0] = Depth(get_option_value_int("Passed Pawn Extension (non-PV nodes)"));
397 PawnEndgameExtension[1] = Depth(get_option_value_int("Pawn Endgame Extension (PV nodes)"));
398 PawnEndgameExtension[0] = Depth(get_option_value_int("Pawn Endgame Extension (non-PV nodes)"));
400 MateThreatExtension[1] = Depth(get_option_value_int("Mate Threat Extension (PV nodes)"));
401 MateThreatExtension[0] = Depth(get_option_value_int("Mate Threat Extension (non-PV nodes)"));
403 LMRPVMoves = get_option_value_int("Full Depth Moves (PV nodes)") + 1;
404 LMRNonPVMoves = get_option_value_int("Full Depth Moves (non-PV nodes)") + 1;
405 ThreatDepth = get_option_value_int("Threat Depth") * OnePly;
406 SelectiveDepth = get_option_value_int("Selective Plies") * OnePly;
408 Chess960 = get_option_value_bool("UCI_Chess960");
409 ShowCurrentLine = get_option_value_bool("UCI_ShowCurrLine");
410 UseLogFile = get_option_value_bool("Use Search Log");
412 LogFile.open(get_option_value_string("Search Log Filename").c_str(), std::ios::out | std::ios::app);
414 UseNullDrivenIID = get_option_value_bool("Null driven IID");
415 UseQSearchFutilityPruning = get_option_value_bool("Futility Pruning (Quiescence Search)");
416 UseFutilityPruning = get_option_value_bool("Futility Pruning (Main Search)");
418 FutilityMargin0 = value_from_centipawns(get_option_value_int("Futility Margin 0"));
419 FutilityMargin1 = value_from_centipawns(get_option_value_int("Futility Margin 1"));
420 FutilityMargin2 = value_from_centipawns(get_option_value_int("Futility Margin 2"));
422 RazorDepth = (get_option_value_int("Maximum Razoring Depth") + 1) * OnePly;
423 RazorMargin = value_from_centipawns(get_option_value_int("Razoring Margin"));
425 UseLSNFiltering = get_option_value_bool("LSN filtering");
426 LSNTime = get_option_value_int("LSN Time Margin (sec)") * 1000;
427 LSNValue = value_from_centipawns(get_option_value_int("LSN Value Margin"));
429 MinimumSplitDepth = get_option_value_int("Minimum Split Depth") * OnePly;
430 MaxThreadsPerSplitPoint = get_option_value_int("Maximum Number of Threads per Split Point");
432 read_weights(pos.side_to_move());
434 int newActiveThreads = get_option_value_int("Threads");
435 if (newActiveThreads != ActiveThreads)
437 ActiveThreads = newActiveThreads;
438 init_eval(ActiveThreads);
441 // Wake up sleeping threads:
442 wake_sleeping_threads();
444 for (int i = 1; i < ActiveThreads; i++)
445 assert(thread_is_available(i, 0));
447 // Set thinking time:
448 int myTime = time[side_to_move];
449 int myIncrement = increment[side_to_move];
450 int oppTime = time[1 - side_to_move];
452 if (!movesToGo) // Sudden death time control
456 MaxSearchTime = myTime / 30 + myIncrement;
457 AbsoluteMaxSearchTime = Max(myTime / 4, myIncrement - 100);
458 } else { // Blitz game without increment
459 MaxSearchTime = myTime / 30;
460 AbsoluteMaxSearchTime = myTime / 8;
463 else // (x moves) / (y minutes)
467 MaxSearchTime = myTime / 2;
468 AbsoluteMaxSearchTime = Min(myTime / 2, myTime - 500);
470 MaxSearchTime = myTime / Min(movesToGo, 20);
471 AbsoluteMaxSearchTime = Min((4 * myTime) / movesToGo, myTime / 3);
475 if (PonderingEnabled)
477 MaxSearchTime += MaxSearchTime / 4;
478 MaxSearchTime = Min(MaxSearchTime, AbsoluteMaxSearchTime);
481 // Fixed depth or fixed number of nodes?
484 InfiniteSearch = true; // HACK
489 NodesBetweenPolls = Min(MaxNodes, 30000);
490 InfiniteSearch = true; // HACK
493 NodesBetweenPolls = 30000;
496 // Write information to search log file:
498 LogFile << "Searching: " << pos.to_fen() << std::endl
499 << "infinite: " << infinite
500 << " ponder: " << ponder
501 << " time: " << myTime
502 << " increment: " << myIncrement
503 << " moves to go: " << movesToGo << std::endl;
506 // We're ready to start thinking. Call the iterative deepening loop
510 Value v = id_loop(pos, searchMoves);
511 looseOnTime = ( UseLSNFiltering
518 looseOnTime = false; // reset for next match
519 while (SearchStartTime + myTime + 1000 > get_system_time())
521 id_loop(pos, searchMoves); // to fail gracefully
538 /// init_threads() is called during startup. It launches all helper threads,
539 /// and initializes the split point stack and the global locks and condition
542 void init_threads() {
546 #if !defined(_MSC_VER)
547 pthread_t pthread[1];
550 for (i = 0; i < THREAD_MAX; i++)
551 Threads[i].activeSplitPoints = 0;
553 // Initialize global locks:
554 lock_init(&MPLock, NULL);
555 lock_init(&IOLock, NULL);
557 init_split_point_stack();
559 #if !defined(_MSC_VER)
560 pthread_mutex_init(&WaitLock, NULL);
561 pthread_cond_init(&WaitCond, NULL);
563 for (i = 0; i < THREAD_MAX; i++)
564 SitIdleEvent[i] = CreateEvent(0, FALSE, FALSE, 0);
567 // All threads except the main thread should be initialized to idle state
568 for (i = 1; i < THREAD_MAX; i++)
570 Threads[i].stop = false;
571 Threads[i].workIsWaiting = false;
572 Threads[i].idle = true;
573 Threads[i].running = false;
576 // Launch the helper threads
577 for(i = 1; i < THREAD_MAX; i++)
579 #if !defined(_MSC_VER)
580 pthread_create(pthread, NULL, init_thread, (void*)(&i));
583 CreateThread(NULL, 0, init_thread, (LPVOID)(&i), 0, iID);
586 // Wait until the thread has finished launching:
587 while (!Threads[i].running);
590 // Init also the empty search stack
591 init_search_stack(EmptySearchStack);
595 /// stop_threads() is called when the program exits. It makes all the
596 /// helper threads exit cleanly.
598 void stop_threads() {
600 ActiveThreads = THREAD_MAX; // HACK
601 Idle = false; // HACK
602 wake_sleeping_threads();
603 AllThreadsShouldExit = true;
604 for (int i = 1; i < THREAD_MAX; i++)
606 Threads[i].stop = true;
607 while(Threads[i].running);
609 destroy_split_point_stack();
613 /// nodes_searched() returns the total number of nodes searched so far in
614 /// the current search.
616 int64_t nodes_searched() {
618 int64_t result = 0ULL;
619 for (int i = 0; i < ActiveThreads; i++)
620 result += Threads[i].nodes;
627 // id_loop() is the main iterative deepening loop. It calls root_search
628 // repeatedly with increasing depth until the allocated thinking time has
629 // been consumed, the user stops the search, or the maximum search depth is
632 Value id_loop(const Position &pos, Move searchMoves[]) {
635 SearchStack ss[PLY_MAX_PLUS_2];
637 // searchMoves are verified, copied, scored and sorted
638 RootMoveList rml(p, searchMoves);
643 init_search_stack(ss);
645 ValueByIteration[0] = Value(0);
646 ValueByIteration[1] = rml.get_move_score(0);
648 LastIterations = false;
650 EasyMove = rml.scan_for_easy_move();
652 // Iterative deepening loop
653 while (!AbortSearch && Iteration < PLY_MAX)
655 // Initialize iteration
658 BestMoveChangesByIteration[Iteration] = 0;
662 std::cout << "info depth " << Iteration << std::endl;
664 // Search to the current depth
665 ValueByIteration[Iteration] = root_search(p, ss, rml);
667 // Erase the easy move if it differs from the new best move
668 if (ss[0].pv[0] != EasyMove)
669 EasyMove = MOVE_NONE;
676 bool stopSearch = false;
678 // Stop search early if there is only a single legal move:
679 if (Iteration >= 6 && rml.move_count() == 1)
682 // Stop search early when the last two iterations returned a mate score
684 && abs(ValueByIteration[Iteration]) >= abs(VALUE_MATE) - 100
685 && abs(ValueByIteration[Iteration-1]) >= abs(VALUE_MATE) - 100)
688 // Stop search early if one move seems to be much better than the rest
689 int64_t nodes = nodes_searched();
691 && EasyMove == ss[0].pv[0]
692 && ( ( rml.get_move_cumulative_nodes(0) > (nodes * 85) / 100
693 && current_search_time() > MaxSearchTime / 16)
694 ||( rml.get_move_cumulative_nodes(0) > (nodes * 98) / 100
695 && current_search_time() > MaxSearchTime / 32)))
698 // Add some extra time if the best move has changed during the last two iterations
699 if (Iteration > 5 && Iteration <= 50)
700 ExtraSearchTime = BestMoveChangesByIteration[Iteration] * (MaxSearchTime / 2)
701 + BestMoveChangesByIteration[Iteration-1] * (MaxSearchTime / 3);
703 // Try to guess if the current iteration is the last one or the last two
704 LastIterations = (current_search_time() > ((MaxSearchTime + ExtraSearchTime)*58) / 128);
706 // Stop search if most of MaxSearchTime is consumed at the end of the
707 // iteration. We probably don't have enough time to search the first
708 // move at the next iteration anyway.
709 if (current_search_time() > ((MaxSearchTime + ExtraSearchTime)*80) / 128)
717 StopOnPonderhit = true;
720 // Write PV to transposition table, in case the relevant entries have
721 // been overwritten during the search:
722 TT.insert_pv(p, ss[0].pv);
724 if (MaxDepth && Iteration >= MaxDepth)
730 // If we are pondering, we shouldn't print the best move before we
733 wait_for_stop_or_ponderhit();
735 // Print final search statistics
736 std::cout << "info nodes " << nodes_searched()
738 << " time " << current_search_time()
739 << " hashfull " << TT.full() << std::endl;
741 // Print the best move and the ponder move to the standard output
742 std::cout << "bestmove " << ss[0].pv[0];
743 if (ss[0].pv[1] != MOVE_NONE)
744 std::cout << " ponder " << ss[0].pv[1];
746 std::cout << std::endl;
751 dbg_print_mean(LogFile);
753 if (dbg_show_hit_rate)
754 dbg_print_hit_rate(LogFile);
757 LogFile << "Nodes: " << nodes_searched() << std::endl
758 << "Nodes/second: " << nps() << std::endl
759 << "Best move: " << move_to_san(p, ss[0].pv[0]) << std::endl;
761 p.do_move(ss[0].pv[0], u);
762 LogFile << "Ponder move: " << move_to_san(p, ss[0].pv[1])
763 << std::endl << std::endl;
765 return rml.get_move_score(0);
769 // root_search() is the function which searches the root node. It is
770 // similar to search_pv except that it uses a different move ordering
771 // scheme (perhaps we should try to use this at internal PV nodes, too?)
772 // and prints some information to the standard output.
774 Value root_search(Position &pos, SearchStack ss[], RootMoveList &rml) {
776 Value alpha = -VALUE_INFINITE;
777 Value beta = VALUE_INFINITE, value;
778 Bitboard dcCandidates = pos.discovered_check_candidates(pos.side_to_move());
780 // Loop through all the moves in the root move list
781 for (int i = 0; i < rml.move_count() && !AbortSearch; i++)
788 RootMoveNumber = i + 1;
791 // Remember the node count before the move is searched. The node counts
792 // are used to sort the root moves at the next iteration.
793 nodes = nodes_searched();
795 // Reset beta cut-off counters
798 // Pick the next root move, and print the move and the move number to
799 // the standard output.
800 move = ss[0].currentMove = rml.get_move(i);
801 if (current_search_time() >= 1000)
802 std::cout << "info currmove " << move
803 << " currmovenumber " << i + 1 << std::endl;
805 // Decide search depth for this move
807 ext = extension(pos, move, true, pos.move_is_check(move), false, false, &dangerous);
808 newDepth = (Iteration - 2) * OnePly + ext + InitialDepth;
810 // Make the move, and search it
811 pos.do_move(move, u, dcCandidates);
815 value = -search_pv(pos, ss, -beta, VALUE_INFINITE, newDepth, 1, 0);
816 // If the value has dropped a lot compared to the last iteration,
817 // set the boolean variable Problem to true. This variable is used
818 // for time managment: When Problem is true, we try to complete the
819 // current iteration before playing a move.
820 Problem = (Iteration >= 2 && value <= ValueByIteration[Iteration-1] - ProblemMargin);
822 if (Problem && StopOnPonderhit)
823 StopOnPonderhit = false;
827 value = -search(pos, ss, -alpha, newDepth, 1, true, 0);
830 // Fail high! Set the boolean variable FailHigh to true, and
831 // re-search the move with a big window. The variable FailHigh is
832 // used for time managment: We try to avoid aborting the search
833 // prematurely during a fail high research.
835 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
839 pos.undo_move(move, u);
841 // Finished searching the move. If AbortSearch is true, the search
842 // was aborted because the user interrupted the search or because we
843 // ran out of time. In this case, the return value of the search cannot
844 // be trusted, and we break out of the loop without updating the best
849 // Remember the node count for this move. The node counts are used to
850 // sort the root moves at the next iteration.
851 rml.set_move_nodes(i, nodes_searched() - nodes);
853 // Remember the beta-cutoff statistics
855 BetaCounter.read(pos.side_to_move(), our, their);
856 rml.set_beta_counters(i, our, their);
858 assert(value >= -VALUE_INFINITE && value <= VALUE_INFINITE);
860 if (value <= alpha && i >= MultiPV)
861 rml.set_move_score(i, -VALUE_INFINITE);
867 rml.set_move_score(i, value);
869 rml.set_move_pv(i, ss[0].pv);
873 // We record how often the best move has been changed in each
874 // iteration. This information is used for time managment: When
875 // the best move changes frequently, we allocate some more time.
877 BestMoveChangesByIteration[Iteration]++;
879 // Print search information to the standard output:
880 std::cout << "info depth " << Iteration
881 << " score " << value_to_string(value)
882 << " time " << current_search_time()
883 << " nodes " << nodes_searched()
887 for (int j = 0; ss[0].pv[j] != MOVE_NONE && j < PLY_MAX; j++)
888 std::cout << ss[0].pv[j] << " ";
890 std::cout << std::endl;
893 LogFile << pretty_pv(pos, current_search_time(), Iteration, nodes_searched(), value, ss[0].pv)
898 // Reset the global variable Problem to false if the value isn't too
899 // far below the final value from the last iteration.
900 if (value > ValueByIteration[Iteration - 1] - NoProblemMargin)
906 for (int j = 0; j < Min(MultiPV, rml.move_count()); j++)
909 std::cout << "info multipv " << j + 1
910 << " score " << value_to_string(rml.get_move_score(j))
911 << " depth " << ((j <= i)? Iteration : Iteration - 1)
912 << " time " << current_search_time()
913 << " nodes " << nodes_searched()
917 for (k = 0; rml.get_move_pv(j, k) != MOVE_NONE && k < PLY_MAX; k++)
918 std::cout << rml.get_move_pv(j, k) << " ";
920 std::cout << std::endl;
922 alpha = rml.get_move_score(Min(i, MultiPV-1));
930 // search_pv() is the main search function for PV nodes.
932 Value search_pv(Position &pos, SearchStack ss[], Value alpha, Value beta,
933 Depth depth, int ply, int threadID) {
935 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
936 assert(beta > alpha && beta <= VALUE_INFINITE);
937 assert(ply >= 0 && ply < PLY_MAX);
938 assert(threadID >= 0 && threadID < ActiveThreads);
941 return qsearch(pos, ss, alpha, beta, Depth(0), ply, threadID);
943 // Initialize, and make an early exit in case of an aborted search,
944 // an instant draw, maximum ply reached, etc.
945 init_node(pos, ss, ply, threadID);
947 // After init_node() that calls poll()
948 if (AbortSearch || thread_should_stop(threadID))
956 if (ply >= PLY_MAX - 1)
957 return evaluate(pos, ei, threadID);
959 // Mate distance pruning
960 Value oldAlpha = alpha;
961 alpha = Max(value_mated_in(ply), alpha);
962 beta = Min(value_mate_in(ply+1), beta);
966 // Transposition table lookup. At PV nodes, we don't use the TT for
967 // pruning, but only for move ordering.
968 const TTEntry* tte = TT.retrieve(pos);
969 Move ttMove = (tte ? tte->move() : MOVE_NONE);
971 // Go with internal iterative deepening if we don't have a TT move
972 if (UseIIDAtPVNodes && ttMove == MOVE_NONE && depth >= 5*OnePly)
974 search_pv(pos, ss, alpha, beta, depth-2*OnePly, ply, threadID);
975 ttMove = ss[ply].pv[ply];
978 // Initialize a MovePicker object for the current position, and prepare
979 // to search all moves
980 MovePicker mp = MovePicker(pos, true, ttMove, ss[ply], depth);
982 Move move, movesSearched[256];
984 Value value, bestValue = -VALUE_INFINITE;
985 Bitboard dcCandidates = mp.discovered_check_candidates();
986 bool isCheck = pos.is_check();
987 bool mateThreat = pos.has_mate_threat(opposite_color(pos.side_to_move()));
989 // Loop through all legal moves until no moves remain or a beta cutoff
992 && (move = mp.get_next_move()) != MOVE_NONE
993 && !thread_should_stop(threadID))
995 assert(move_is_ok(move));
997 bool singleReply = (isCheck && mp.number_of_moves() == 1);
998 bool moveIsCheck = pos.move_is_check(move, dcCandidates);
999 bool moveIsCapture = pos.move_is_capture(move);
1001 movesSearched[moveCount++] = ss[ply].currentMove = move;
1004 ss[ply].currentMoveCaptureValue =
1005 move_is_ep(move)? PawnValueMidgame : pos.midgame_value_of_piece_on(move_to(move));
1007 ss[ply].currentMoveCaptureValue = Value(0);
1009 // Decide the new search depth
1011 Depth ext = extension(pos, move, true, moveIsCheck, singleReply, mateThreat, &dangerous);
1012 Depth newDepth = depth - OnePly + ext;
1014 // Make and search the move
1016 pos.do_move(move, u, dcCandidates);
1018 if (moveCount == 1) // The first move in list is the PV
1019 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1022 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1023 // if the move fails high will be re-searched at full depth.
1024 if ( depth >= 2*OnePly
1025 && moveCount >= LMRPVMoves
1028 && !move_promotion(move)
1029 && !move_is_castle(move)
1030 && !move_is_killer(move, ss[ply]))
1032 ss[ply].reduction = OnePly;
1033 value = -search(pos, ss, -alpha, newDepth-OnePly, ply+1, true, threadID);
1036 value = alpha + 1; // Just to trigger next condition
1038 if (value > alpha) // Go with full depth non-pv search
1040 ss[ply].reduction = Depth(0);
1041 value = -search(pos, ss, -alpha, newDepth, ply+1, true, threadID);
1042 if (value > alpha && value < beta)
1044 // When the search fails high at ply 1 while searching the first
1045 // move at the root, set the flag failHighPly1. This is used for
1046 // time managment: We don't want to stop the search early in
1047 // such cases, because resolving the fail high at ply 1 could
1048 // result in a big drop in score at the root.
1049 if (ply == 1 && RootMoveNumber == 1)
1050 Threads[threadID].failHighPly1 = true;
1052 // A fail high occurred. Re-search at full window (pv search)
1053 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1054 Threads[threadID].failHighPly1 = false;
1058 pos.undo_move(move, u);
1060 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1063 if (value > bestValue)
1070 if (value == value_mate_in(ply + 1))
1071 ss[ply].mateKiller = move;
1073 // If we are at ply 1, and we are searching the first root move at
1074 // ply 0, set the 'Problem' variable if the score has dropped a lot
1075 // (from the computer's point of view) since the previous iteration:
1078 && -value <= ValueByIteration[Iteration-1] - ProblemMargin)
1083 if ( ActiveThreads > 1
1085 && depth >= MinimumSplitDepth
1087 && idle_thread_exists(threadID)
1089 && !thread_should_stop(threadID)
1090 && split(pos, ss, ply, &alpha, &beta, &bestValue, depth,
1091 &moveCount, &mp, dcCandidates, threadID, true))
1095 // All legal moves have been searched. A special case: If there were
1096 // no legal moves, it must be mate or stalemate:
1098 return (isCheck ? value_mated_in(ply) : VALUE_DRAW);
1100 // If the search is not aborted, update the transposition table,
1101 // history counters, and killer moves.
1102 if (AbortSearch || thread_should_stop(threadID))
1105 if (bestValue <= oldAlpha)
1106 TT.store(pos, value_to_tt(bestValue, ply), depth, MOVE_NONE, VALUE_TYPE_UPPER);
1108 else if (bestValue >= beta)
1110 BetaCounter.add(pos.side_to_move(), depth, threadID);
1111 Move m = ss[ply].pv[ply];
1112 if (ok_to_history(pos, m)) // Only non capture moves are considered
1114 update_history(pos, m, depth, movesSearched, moveCount);
1115 update_killers(m, ss[ply]);
1117 TT.store(pos, value_to_tt(bestValue, ply), depth, m, VALUE_TYPE_LOWER);
1120 TT.store(pos, value_to_tt(bestValue, ply), depth, ss[ply].pv[ply], VALUE_TYPE_EXACT);
1126 // search() is the search function for zero-width nodes.
1128 Value search(Position &pos, SearchStack ss[], Value beta, Depth depth,
1129 int ply, bool allowNullmove, int threadID) {
1131 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1132 assert(ply >= 0 && ply < PLY_MAX);
1133 assert(threadID >= 0 && threadID < ActiveThreads);
1136 return qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1138 // Initialize, and make an early exit in case of an aborted search,
1139 // an instant draw, maximum ply reached, etc.
1140 init_node(pos, ss, ply, threadID);
1142 // After init_node() that calls poll()
1143 if (AbortSearch || thread_should_stop(threadID))
1151 if (ply >= PLY_MAX - 1)
1152 return evaluate(pos, ei, threadID);
1154 // Mate distance pruning
1155 if (value_mated_in(ply) >= beta)
1158 if (value_mate_in(ply + 1) < beta)
1161 // Transposition table lookup
1162 const TTEntry* tte = TT.retrieve(pos);
1163 Move ttMove = (tte ? tte->move() : MOVE_NONE);
1165 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1167 ss[ply].currentMove = ttMove; // can be MOVE_NONE
1168 return value_from_tt(tte->value(), ply);
1171 Value approximateEval = quick_evaluate(pos);
1172 bool mateThreat = false;
1173 bool nullDrivenIID = false;
1174 bool isCheck = pos.is_check();
1180 && !value_is_mate(beta)
1181 && ok_to_do_nullmove(pos)
1182 && approximateEval >= beta - NullMoveMargin)
1184 ss[ply].currentMove = MOVE_NULL;
1187 pos.do_null_move(u);
1188 int R = (depth >= 4 * OnePly ? 4 : 3); // Null move dynamic reduction
1190 Value nullValue = -search(pos, ss, -(beta-1), depth-R*OnePly, ply+1, false, threadID);
1192 // Check for a null capture artifact, if the value without the null capture
1193 // is above beta then mark the node as a suspicious failed low. We will verify
1194 // later if we are really under threat.
1195 if ( UseNullDrivenIID
1197 && depth > 6 * OnePly
1198 &&!value_is_mate(nullValue)
1199 && ttMove == MOVE_NONE
1200 && ss[ply + 1].currentMove != MOVE_NONE
1201 && pos.move_is_capture(ss[ply + 1].currentMove)
1202 && pos.see(ss[ply + 1].currentMove) + nullValue >= beta)
1203 nullDrivenIID = true;
1205 pos.undo_null_move(u);
1207 if (value_is_mate(nullValue))
1209 /* Do not return unproven mates */
1211 else if (nullValue >= beta)
1213 if (depth < 6 * OnePly)
1216 // Do zugzwang verification search
1217 Value v = search(pos, ss, beta, depth-5*OnePly, ply, false, threadID);
1221 // The null move failed low, which means that we may be faced with
1222 // some kind of threat. If the previous move was reduced, check if
1223 // the move that refuted the null move was somehow connected to the
1224 // move which was reduced. If a connection is found, return a fail
1225 // low score (which will cause the reduced move to fail high in the
1226 // parent node, which will trigger a re-search with full depth).
1227 if (nullValue == value_mated_in(ply + 2))
1230 nullDrivenIID = false;
1232 ss[ply].threatMove = ss[ply + 1].currentMove;
1233 if ( depth < ThreatDepth
1234 && ss[ply - 1].reduction
1235 && connected_moves(pos, ss[ply - 1].currentMove, ss[ply].threatMove))
1239 // Null move search not allowed, try razoring
1240 else if ( !value_is_mate(beta)
1241 && approximateEval < beta - RazorMargin
1242 && depth < RazorDepth)
1244 Value v = qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1245 if (v < beta - RazorMargin / 2)
1249 // Go with internal iterative deepening if we don't have a TT move
1250 if (UseIIDAtNonPVNodes && ttMove == MOVE_NONE && depth >= 8*OnePly &&
1251 evaluate(pos, ei, threadID) >= beta - IIDMargin)
1253 search(pos, ss, beta, Min(depth/2, depth-2*OnePly), ply, false, threadID);
1254 ttMove = ss[ply].pv[ply];
1256 else if (nullDrivenIID)
1258 // The null move failed low due to a suspicious capture. Perhaps we
1259 // are facing a null capture artifact due to the side to move change
1260 // and this position should fail high. So do a normal search with a
1261 // reduced depth to get a good ttMove to use in the following full
1263 Move tm = ss[ply].threatMove;
1265 assert(tm != MOVE_NONE);
1266 assert(ttMove == MOVE_NONE);
1268 search(pos, ss, beta, depth/2, ply, false, threadID);
1269 ttMove = ss[ply].pv[ply];
1270 ss[ply].threatMove = tm;
1273 // Initialize a MovePicker object for the current position, and prepare
1274 // to search all moves:
1275 MovePicker mp = MovePicker(pos, false, ttMove, ss[ply], depth);
1277 Move move, movesSearched[256];
1279 Value value, bestValue = -VALUE_INFINITE;
1280 Bitboard dcCandidates = mp.discovered_check_candidates();
1281 Value futilityValue = VALUE_NONE;
1282 bool useFutilityPruning = UseFutilityPruning
1283 && depth < SelectiveDepth
1286 // Loop through all legal moves until no moves remain or a beta cutoff
1288 while ( bestValue < beta
1289 && (move = mp.get_next_move()) != MOVE_NONE
1290 && !thread_should_stop(threadID))
1292 assert(move_is_ok(move));
1294 bool singleReply = (isCheck && mp.number_of_moves() == 1);
1295 bool moveIsCheck = pos.move_is_check(move, dcCandidates);
1296 bool moveIsCapture = pos.move_is_capture(move);
1298 movesSearched[moveCount++] = ss[ply].currentMove = move;
1300 // Decide the new search depth
1302 Depth ext = extension(pos, move, false, moveIsCheck, singleReply, mateThreat, &dangerous);
1303 Depth newDepth = depth - OnePly + ext;
1306 if ( useFutilityPruning
1309 && !move_promotion(move))
1311 // History pruning. See ok_to_prune() definition
1312 if ( moveCount >= 2 + int(depth)
1313 && ok_to_prune(pos, move, ss[ply].threatMove, depth))
1316 // Value based pruning
1317 if (depth < 7 * OnePly && approximateEval < beta)
1319 if (futilityValue == VALUE_NONE)
1320 futilityValue = evaluate(pos, ei, threadID)
1321 + (depth < 2 * OnePly ? FutilityMargin1 :
1322 + (depth < 6 * OnePly ? FutilityMargin2 + (depth - 2*OnePly) * 32
1323 : FutilityMargin2 + (depth - 2*OnePly) * 64));
1325 if (futilityValue < beta)
1327 if (futilityValue > bestValue)
1328 bestValue = futilityValue;
1334 // Make and search the move
1336 pos.do_move(move, u, dcCandidates);
1338 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1339 // if the move fails high will be re-searched at full depth.
1340 if ( depth >= 2*OnePly
1341 && moveCount >= LMRNonPVMoves
1344 && !move_promotion(move)
1345 && !move_is_castle(move)
1346 && !move_is_killer(move, ss[ply]))
1348 ss[ply].reduction = OnePly;
1349 value = -search(pos, ss, -(beta-1), newDepth-OnePly, ply+1, true, threadID);
1352 value = beta; // Just to trigger next condition
1354 if (value >= beta) // Go with full depth non-pv search
1356 ss[ply].reduction = Depth(0);
1357 value = -search(pos, ss, -(beta-1), newDepth, ply+1, true, threadID);
1359 pos.undo_move(move, u);
1361 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1364 if (value > bestValue)
1370 if (value == value_mate_in(ply + 1))
1371 ss[ply].mateKiller = move;
1375 if ( ActiveThreads > 1
1377 && depth >= MinimumSplitDepth
1379 && idle_thread_exists(threadID)
1381 && !thread_should_stop(threadID)
1382 && split(pos, ss, ply, &beta, &beta, &bestValue, depth, &moveCount,
1383 &mp, dcCandidates, threadID, false))
1387 // All legal moves have been searched. A special case: If there were
1388 // no legal moves, it must be mate or stalemate.
1390 return (pos.is_check() ? value_mated_in(ply) : VALUE_DRAW);
1392 // If the search is not aborted, update the transposition table,
1393 // history counters, and killer moves.
1394 if (AbortSearch || thread_should_stop(threadID))
1397 if (bestValue < beta)
1398 TT.store(pos, value_to_tt(bestValue, ply), depth, MOVE_NONE, VALUE_TYPE_UPPER);
1401 BetaCounter.add(pos.side_to_move(), depth, threadID);
1402 Move m = ss[ply].pv[ply];
1403 if (ok_to_history(pos, m)) // Only non capture moves are considered
1405 update_history(pos, m, depth, movesSearched, moveCount);
1406 update_killers(m, ss[ply]);
1408 TT.store(pos, value_to_tt(bestValue, ply), depth, m, VALUE_TYPE_LOWER);
1414 // qsearch() is the quiescence search function, which is called by the main
1415 // search function when the remaining depth is zero (or, to be more precise,
1416 // less than OnePly).
1418 Value qsearch(Position &pos, SearchStack ss[], Value alpha, Value beta,
1419 Depth depth, int ply, int threadID) {
1421 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1422 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1424 assert(ply >= 0 && ply < PLY_MAX);
1425 assert(threadID >= 0 && threadID < ActiveThreads);
1427 // Initialize, and make an early exit in case of an aborted search,
1428 // an instant draw, maximum ply reached, etc.
1429 init_node(pos, ss, ply, threadID);
1431 // After init_node() that calls poll()
1432 if (AbortSearch || thread_should_stop(threadID))
1438 // Transposition table lookup
1439 const TTEntry* tte = TT.retrieve(pos);
1440 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1441 return value_from_tt(tte->value(), ply);
1443 // Evaluate the position statically
1445 bool isCheck = pos.is_check();
1446 Value staticValue = (isCheck ? -VALUE_INFINITE : evaluate(pos, ei, threadID));
1448 if (ply == PLY_MAX - 1)
1449 return evaluate(pos, ei, threadID);
1451 // Initialize "stand pat score", and return it immediately if it is
1453 Value bestValue = staticValue;
1455 if (bestValue >= beta)
1458 if (bestValue > alpha)
1461 // Initialize a MovePicker object for the current position, and prepare
1462 // to search the moves. Because the depth is <= 0 here, only captures,
1463 // queen promotions and checks (only if depth == 0) will be generated.
1464 bool pvNode = (beta - alpha != 1);
1465 MovePicker mp = MovePicker(pos, pvNode, MOVE_NONE, EmptySearchStack, depth, isCheck ? NULL : &ei);
1468 Bitboard dcCandidates = mp.discovered_check_candidates();
1469 bool enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1471 // Loop through the moves until no moves remain or a beta cutoff
1473 while ( alpha < beta
1474 && (move = mp.get_next_move()) != MOVE_NONE)
1476 assert(move_is_ok(move));
1479 ss[ply].currentMove = move;
1482 if ( UseQSearchFutilityPruning
1486 && !move_promotion(move)
1487 && !pos.move_is_check(move, dcCandidates)
1488 && !pos.move_is_passed_pawn_push(move))
1490 Value futilityValue = staticValue
1491 + Max(pos.midgame_value_of_piece_on(move_to(move)),
1492 pos.endgame_value_of_piece_on(move_to(move)))
1493 + (move_is_ep(move) ? PawnValueEndgame : Value(0))
1495 + ei.futilityMargin;
1497 if (futilityValue < alpha)
1499 if (futilityValue > bestValue)
1500 bestValue = futilityValue;
1505 // Don't search captures and checks with negative SEE values
1507 && !move_promotion(move)
1508 && (pos.midgame_value_of_piece_on(move_from(move)) >
1509 pos.midgame_value_of_piece_on(move_to(move)))
1510 && pos.see(move) < 0)
1513 // Make and search the move.
1515 pos.do_move(move, u, dcCandidates);
1516 Value value = -qsearch(pos, ss, -beta, -alpha, depth-OnePly, ply+1, threadID);
1517 pos.undo_move(move, u);
1519 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1522 if (value > bestValue)
1533 // All legal moves have been searched. A special case: If we're in check
1534 // and no legal moves were found, it is checkmate:
1535 if (pos.is_check() && moveCount == 0) // Mate!
1536 return value_mated_in(ply);
1538 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1540 // Update transposition table
1541 TT.store(pos, value_to_tt(bestValue, ply), depth, MOVE_NONE, VALUE_TYPE_EXACT);
1543 // Update killers only for good check moves
1544 Move m = ss[ply].currentMove;
1545 if (alpha >= beta && ok_to_history(pos, m)) // Only non capture moves are considered
1547 // Wrong to update history when depth is <= 0
1548 update_killers(m, ss[ply]);
1554 // sp_search() is used to search from a split point. This function is called
1555 // by each thread working at the split point. It is similar to the normal
1556 // search() function, but simpler. Because we have already probed the hash
1557 // table, done a null move search, and searched the first move before
1558 // splitting, we don't have to repeat all this work in sp_search(). We
1559 // also don't need to store anything to the hash table here: This is taken
1560 // care of after we return from the split point.
1562 void sp_search(SplitPoint *sp, int threadID) {
1564 assert(threadID >= 0 && threadID < ActiveThreads);
1565 assert(ActiveThreads > 1);
1567 Position pos = Position(sp->pos);
1568 SearchStack *ss = sp->sstack[threadID];
1571 bool isCheck = pos.is_check();
1572 bool useFutilityPruning = UseFutilityPruning
1573 && sp->depth < SelectiveDepth
1576 while ( sp->bestValue < sp->beta
1577 && !thread_should_stop(threadID)
1578 && (move = sp->mp->get_next_move(sp->lock)) != MOVE_NONE)
1580 assert(move_is_ok(move));
1582 bool moveIsCheck = pos.move_is_check(move, sp->dcCandidates);
1583 bool moveIsCapture = pos.move_is_capture(move);
1585 lock_grab(&(sp->lock));
1586 int moveCount = ++sp->moves;
1587 lock_release(&(sp->lock));
1589 ss[sp->ply].currentMove = move;
1591 // Decide the new search depth.
1593 Depth ext = extension(pos, move, false, moveIsCheck, false, false, &dangerous);
1594 Depth newDepth = sp->depth - OnePly + ext;
1597 if ( useFutilityPruning
1600 && !move_promotion(move)
1601 && moveCount >= 2 + int(sp->depth)
1602 && ok_to_prune(pos, move, ss[sp->ply].threatMove, sp->depth))
1605 // Make and search the move.
1607 pos.do_move(move, u, sp->dcCandidates);
1609 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1610 // if the move fails high will be re-searched at full depth.
1612 && moveCount >= LMRNonPVMoves
1614 && !move_promotion(move)
1615 && !move_is_castle(move)
1616 && !move_is_killer(move, ss[sp->ply]))
1618 ss[sp->ply].reduction = OnePly;
1619 value = -search(pos, ss, -(sp->beta-1), newDepth - OnePly, sp->ply+1, true, threadID);
1622 value = sp->beta; // Just to trigger next condition
1624 if (value >= sp->beta) // Go with full depth non-pv search
1626 ss[sp->ply].reduction = Depth(0);
1627 value = -search(pos, ss, -(sp->beta - 1), newDepth, sp->ply+1, true, threadID);
1629 pos.undo_move(move, u);
1631 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1633 if (thread_should_stop(threadID))
1637 lock_grab(&(sp->lock));
1638 if (value > sp->bestValue && !thread_should_stop(threadID))
1640 sp->bestValue = value;
1641 if (sp->bestValue >= sp->beta)
1643 sp_update_pv(sp->parentSstack, ss, sp->ply);
1644 for (int i = 0; i < ActiveThreads; i++)
1645 if (i != threadID && (i == sp->master || sp->slaves[i]))
1646 Threads[i].stop = true;
1648 sp->finished = true;
1651 lock_release(&(sp->lock));
1654 lock_grab(&(sp->lock));
1656 // If this is the master thread and we have been asked to stop because of
1657 // a beta cutoff higher up in the tree, stop all slave threads:
1658 if (sp->master == threadID && thread_should_stop(threadID))
1659 for (int i = 0; i < ActiveThreads; i++)
1661 Threads[i].stop = true;
1664 sp->slaves[threadID] = 0;
1666 lock_release(&(sp->lock));
1670 // sp_search_pv() is used to search from a PV split point. This function
1671 // is called by each thread working at the split point. It is similar to
1672 // the normal search_pv() function, but simpler. Because we have already
1673 // probed the hash table and searched the first move before splitting, we
1674 // don't have to repeat all this work in sp_search_pv(). We also don't
1675 // need to store anything to the hash table here: This is taken care of
1676 // after we return from the split point.
1678 void sp_search_pv(SplitPoint *sp, int threadID) {
1680 assert(threadID >= 0 && threadID < ActiveThreads);
1681 assert(ActiveThreads > 1);
1683 Position pos = Position(sp->pos);
1684 SearchStack *ss = sp->sstack[threadID];
1688 while ( sp->alpha < sp->beta
1689 && !thread_should_stop(threadID)
1690 && (move = sp->mp->get_next_move(sp->lock)) != MOVE_NONE)
1692 bool moveIsCheck = pos.move_is_check(move, sp->dcCandidates);
1693 bool moveIsCapture = pos.move_is_capture(move);
1695 assert(move_is_ok(move));
1698 ss[sp->ply].currentMoveCaptureValue =
1699 move_is_ep(move)? PawnValueMidgame : pos.midgame_value_of_piece_on(move_to(move));
1701 ss[sp->ply].currentMoveCaptureValue = Value(0);
1703 lock_grab(&(sp->lock));
1704 int moveCount = ++sp->moves;
1705 lock_release(&(sp->lock));
1707 ss[sp->ply].currentMove = move;
1709 // Decide the new search depth.
1711 Depth ext = extension(pos, move, true, moveIsCheck, false, false, &dangerous);
1712 Depth newDepth = sp->depth - OnePly + ext;
1714 // Make and search the move.
1716 pos.do_move(move, u, sp->dcCandidates);
1718 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1719 // if the move fails high will be re-searched at full depth.
1721 && moveCount >= LMRPVMoves
1723 && !move_promotion(move)
1724 && !move_is_castle(move)
1725 && !move_is_killer(move, ss[sp->ply]))
1727 ss[sp->ply].reduction = OnePly;
1728 value = -search(pos, ss, -sp->alpha, newDepth - OnePly, sp->ply+1, true, threadID);
1731 value = sp->alpha + 1; // Just to trigger next condition
1733 if (value > sp->alpha) // Go with full depth non-pv search
1735 ss[sp->ply].reduction = Depth(0);
1736 value = -search(pos, ss, -sp->alpha, newDepth, sp->ply+1, true, threadID);
1738 if (value > sp->alpha && value < sp->beta)
1740 // When the search fails high at ply 1 while searching the first
1741 // move at the root, set the flag failHighPly1. This is used for
1742 // time managment: We don't want to stop the search early in
1743 // such cases, because resolving the fail high at ply 1 could
1744 // result in a big drop in score at the root.
1745 if (sp->ply == 1 && RootMoveNumber == 1)
1746 Threads[threadID].failHighPly1 = true;
1748 value = -search_pv(pos, ss, -sp->beta, -sp->alpha, newDepth, sp->ply+1, threadID);
1749 Threads[threadID].failHighPly1 = false;
1752 pos.undo_move(move, u);
1754 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1756 if (thread_should_stop(threadID))
1760 lock_grab(&(sp->lock));
1761 if (value > sp->bestValue && !thread_should_stop(threadID))
1763 sp->bestValue = value;
1764 if (value > sp->alpha)
1767 sp_update_pv(sp->parentSstack, ss, sp->ply);
1768 if (value == value_mate_in(sp->ply + 1))
1769 ss[sp->ply].mateKiller = move;
1771 if(value >= sp->beta)
1773 for(int i = 0; i < ActiveThreads; i++)
1774 if(i != threadID && (i == sp->master || sp->slaves[i]))
1775 Threads[i].stop = true;
1777 sp->finished = true;
1780 // If we are at ply 1, and we are searching the first root move at
1781 // ply 0, set the 'Problem' variable if the score has dropped a lot
1782 // (from the computer's point of view) since the previous iteration.
1785 && -value <= ValueByIteration[Iteration-1] - ProblemMargin)
1788 lock_release(&(sp->lock));
1791 lock_grab(&(sp->lock));
1793 // If this is the master thread and we have been asked to stop because of
1794 // a beta cutoff higher up in the tree, stop all slave threads.
1795 if (sp->master == threadID && thread_should_stop(threadID))
1796 for (int i = 0; i < ActiveThreads; i++)
1798 Threads[i].stop = true;
1801 sp->slaves[threadID] = 0;
1803 lock_release(&(sp->lock));
1806 /// The BetaCounterType class
1808 BetaCounterType::BetaCounterType() { clear(); }
1810 void BetaCounterType::clear() {
1812 for (int i = 0; i < THREAD_MAX; i++)
1813 hits[i][WHITE] = hits[i][BLACK] = 0ULL;
1816 void BetaCounterType::add(Color us, Depth d, int threadID) {
1818 // Weighted count based on depth
1819 hits[threadID][us] += int(d);
1822 void BetaCounterType::read(Color us, int64_t& our, int64_t& their) {
1825 for (int i = 0; i < THREAD_MAX; i++)
1828 their += hits[i][opposite_color(us)];
1833 /// The RootMove class
1837 RootMove::RootMove() {
1838 nodes = cumulativeNodes = 0ULL;
1841 // RootMove::operator<() is the comparison function used when
1842 // sorting the moves. A move m1 is considered to be better
1843 // than a move m2 if it has a higher score, or if the moves
1844 // have equal score but m1 has the higher node count.
1846 bool RootMove::operator<(const RootMove& m) {
1848 if (score != m.score)
1849 return (score < m.score);
1851 return theirBeta <= m.theirBeta;
1854 /// The RootMoveList class
1858 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) : count(0) {
1860 MoveStack mlist[MaxRootMoves];
1861 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
1863 // Generate all legal moves
1864 int lm_count = generate_legal_moves(pos, mlist);
1866 // Add each move to the moves[] array
1867 for (int i = 0; i < lm_count; i++)
1869 bool includeMove = includeAllMoves;
1871 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
1872 includeMove = (searchMoves[k] == mlist[i].move);
1876 // Find a quick score for the move
1878 SearchStack ss[PLY_MAX_PLUS_2];
1880 moves[count].move = mlist[i].move;
1881 moves[count].nodes = 0ULL;
1882 pos.do_move(moves[count].move, u);
1883 moves[count].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE,
1885 pos.undo_move(moves[count].move, u);
1886 moves[count].pv[0] = moves[i].move;
1887 moves[count].pv[1] = MOVE_NONE; // FIXME
1895 // Simple accessor methods for the RootMoveList class
1897 inline Move RootMoveList::get_move(int moveNum) const {
1898 return moves[moveNum].move;
1901 inline Value RootMoveList::get_move_score(int moveNum) const {
1902 return moves[moveNum].score;
1905 inline void RootMoveList::set_move_score(int moveNum, Value score) {
1906 moves[moveNum].score = score;
1909 inline void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) {
1910 moves[moveNum].nodes = nodes;
1911 moves[moveNum].cumulativeNodes += nodes;
1914 inline void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) {
1915 moves[moveNum].ourBeta = our;
1916 moves[moveNum].theirBeta = their;
1919 void RootMoveList::set_move_pv(int moveNum, const Move pv[]) {
1921 for(j = 0; pv[j] != MOVE_NONE; j++)
1922 moves[moveNum].pv[j] = pv[j];
1923 moves[moveNum].pv[j] = MOVE_NONE;
1926 inline Move RootMoveList::get_move_pv(int moveNum, int i) const {
1927 return moves[moveNum].pv[i];
1930 inline int64_t RootMoveList::get_move_cumulative_nodes(int moveNum) const {
1931 return moves[moveNum].cumulativeNodes;
1934 inline int RootMoveList::move_count() const {
1939 // RootMoveList::scan_for_easy_move() is called at the end of the first
1940 // iteration, and is used to detect an "easy move", i.e. a move which appears
1941 // to be much bester than all the rest. If an easy move is found, the move
1942 // is returned, otherwise the function returns MOVE_NONE. It is very
1943 // important that this function is called at the right moment: The code
1944 // assumes that the first iteration has been completed and the moves have
1945 // been sorted. This is done in RootMoveList c'tor.
1947 Move RootMoveList::scan_for_easy_move() const {
1954 // moves are sorted so just consider the best and the second one
1955 if (get_move_score(0) > get_move_score(1) + EasyMoveMargin)
1961 // RootMoveList::sort() sorts the root move list at the beginning of a new
1964 inline void RootMoveList::sort() {
1966 sort_multipv(count - 1); // all items
1970 // RootMoveList::sort_multipv() sorts the first few moves in the root move
1971 // list by their scores and depths. It is used to order the different PVs
1972 // correctly in MultiPV mode.
1974 void RootMoveList::sort_multipv(int n) {
1976 for (int i = 1; i <= n; i++)
1978 RootMove rm = moves[i];
1980 for (j = i; j > 0 && moves[j-1] < rm; j--)
1981 moves[j] = moves[j-1];
1987 // init_search_stack() initializes a search stack at the beginning of a
1988 // new search from the root.
1989 void init_search_stack(SearchStack& ss) {
1991 ss.pv[0] = MOVE_NONE;
1992 ss.pv[1] = MOVE_NONE;
1993 ss.currentMove = MOVE_NONE;
1994 ss.threatMove = MOVE_NONE;
1995 ss.reduction = Depth(0);
1996 for (int j = 0; j < KILLER_MAX; j++)
1997 ss.killers[j] = MOVE_NONE;
2000 void init_search_stack(SearchStack ss[]) {
2002 for (int i = 0; i < 3; i++)
2004 ss[i].pv[i] = MOVE_NONE;
2005 ss[i].pv[i+1] = MOVE_NONE;
2006 ss[i].currentMove = MOVE_NONE;
2007 ss[i].threatMove = MOVE_NONE;
2008 ss[i].reduction = Depth(0);
2009 for (int j = 0; j < KILLER_MAX; j++)
2010 ss[i].killers[j] = MOVE_NONE;
2015 // init_node() is called at the beginning of all the search functions
2016 // (search(), search_pv(), qsearch(), and so on) and initializes the search
2017 // stack object corresponding to the current node. Once every
2018 // NodesBetweenPolls nodes, init_node() also calls poll(), which polls
2019 // for user input and checks whether it is time to stop the search.
2021 void init_node(const Position &pos, SearchStack ss[], int ply, int threadID) {
2022 assert(ply >= 0 && ply < PLY_MAX);
2023 assert(threadID >= 0 && threadID < ActiveThreads);
2025 Threads[threadID].nodes++;
2029 if(NodesSincePoll >= NodesBetweenPolls) {
2034 ss[ply].pv[ply] = ss[ply].pv[ply+1] = ss[ply].currentMove = MOVE_NONE;
2035 ss[ply+2].mateKiller = MOVE_NONE;
2036 ss[ply].threatMove = MOVE_NONE;
2037 ss[ply].reduction = Depth(0);
2038 ss[ply].currentMoveCaptureValue = Value(0);
2039 for (int j = 0; j < KILLER_MAX; j++)
2040 ss[ply+2].killers[j] = MOVE_NONE;
2042 if(Threads[threadID].printCurrentLine)
2043 print_current_line(ss, ply, threadID);
2047 // update_pv() is called whenever a search returns a value > alpha. It
2048 // updates the PV in the SearchStack object corresponding to the current
2051 void update_pv(SearchStack ss[], int ply) {
2052 assert(ply >= 0 && ply < PLY_MAX);
2054 ss[ply].pv[ply] = ss[ply].currentMove;
2056 for(p = ply + 1; ss[ply+1].pv[p] != MOVE_NONE; p++)
2057 ss[ply].pv[p] = ss[ply+1].pv[p];
2058 ss[ply].pv[p] = MOVE_NONE;
2062 // sp_update_pv() is a variant of update_pv for use at split points. The
2063 // difference between the two functions is that sp_update_pv also updates
2064 // the PV at the parent node.
2066 void sp_update_pv(SearchStack *pss, SearchStack ss[], int ply) {
2067 assert(ply >= 0 && ply < PLY_MAX);
2069 ss[ply].pv[ply] = pss[ply].pv[ply] = ss[ply].currentMove;
2071 for(p = ply + 1; ss[ply+1].pv[p] != MOVE_NONE; p++)
2072 ss[ply].pv[p] = pss[ply].pv[p] = ss[ply+1].pv[p];
2073 ss[ply].pv[p] = pss[ply].pv[p] = MOVE_NONE;
2077 // connected_moves() tests whether two moves are 'connected' in the sense
2078 // that the first move somehow made the second move possible (for instance
2079 // if the moving piece is the same in both moves). The first move is
2080 // assumed to be the move that was made to reach the current position, while
2081 // the second move is assumed to be a move from the current position.
2083 bool connected_moves(const Position &pos, Move m1, Move m2) {
2084 Square f1, t1, f2, t2;
2086 assert(move_is_ok(m1));
2087 assert(move_is_ok(m2));
2092 // Case 1: The moving piece is the same in both moves.
2098 // Case 2: The destination square for m2 was vacated by m1.
2104 // Case 3: Moving through the vacated square:
2105 if(piece_is_slider(pos.piece_on(f2)) &&
2106 bit_is_set(squares_between(f2, t2), f1))
2109 // Case 4: The destination square for m2 is attacked by the moving piece
2111 if(pos.piece_attacks_square(t1, t2))
2114 // Case 5: Discovered check, checking piece is the piece moved in m1:
2115 if(piece_is_slider(pos.piece_on(t1)) &&
2116 bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())),
2118 !bit_is_set(squares_between(t2, pos.king_square(pos.side_to_move())),
2120 Bitboard occ = pos.occupied_squares();
2121 Color us = pos.side_to_move();
2122 Square ksq = pos.king_square(us);
2123 clear_bit(&occ, f2);
2124 if(pos.type_of_piece_on(t1) == BISHOP) {
2125 if(bit_is_set(bishop_attacks_bb(ksq, occ), t1))
2128 else if(pos.type_of_piece_on(t1) == ROOK) {
2129 if(bit_is_set(rook_attacks_bb(ksq, occ), t1))
2133 assert(pos.type_of_piece_on(t1) == QUEEN);
2134 if(bit_is_set(queen_attacks_bb(ksq, occ), t1))
2143 // value_is_mate() checks if the given value is a mate one
2144 // eventually compensated for the ply.
2146 bool value_is_mate(Value value) {
2148 assert(abs(value) <= VALUE_INFINITE);
2150 return value <= value_mated_in(PLY_MAX)
2151 || value >= value_mate_in(PLY_MAX);
2155 // move_is_killer() checks if the given move is among the
2156 // killer moves of that ply.
2158 bool move_is_killer(Move m, const SearchStack& ss) {
2160 const Move* k = ss.killers;
2161 for (int i = 0; i < KILLER_MAX; i++, k++)
2169 // extension() decides whether a move should be searched with normal depth,
2170 // or with extended depth. Certain classes of moves (checking moves, in
2171 // particular) are searched with bigger depth than ordinary moves and in
2172 // any case are marked as 'dangerous'. Note that also if a move is not
2173 // extended, as example because the corresponding UCI option is set to zero,
2174 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
2176 Depth extension(const Position &pos, Move m, bool pvNode, bool check,
2177 bool singleReply, bool mateThreat, bool* dangerous) {
2179 assert(m != MOVE_NONE);
2181 Depth result = Depth(0);
2182 *dangerous = check || singleReply || mateThreat;
2185 result += CheckExtension[pvNode];
2188 result += SingleReplyExtension[pvNode];
2191 result += MateThreatExtension[pvNode];
2193 if (pos.move_is_pawn_push_to_7th(m))
2195 result += PawnPushTo7thExtension[pvNode];
2198 if (pos.move_is_passed_pawn_push(m))
2200 result += PassedPawnExtension[pvNode];
2204 if ( pos.move_is_capture(m)
2205 && pos.type_of_piece_on(move_to(m)) != PAWN
2206 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
2207 - pos.midgame_value_of_piece_on(move_to(m)) == Value(0))
2208 && !move_promotion(m)
2211 result += PawnEndgameExtension[pvNode];
2216 && pos.move_is_capture(m)
2217 && pos.type_of_piece_on(move_to(m)) != PAWN
2224 return Min(result, OnePly);
2228 // ok_to_do_nullmove() looks at the current position and decides whether
2229 // doing a 'null move' should be allowed. In order to avoid zugzwang
2230 // problems, null moves are not allowed when the side to move has very
2231 // little material left. Currently, the test is a bit too simple: Null
2232 // moves are avoided only when the side to move has only pawns left. It's
2233 // probably a good idea to avoid null moves in at least some more
2234 // complicated endgames, e.g. KQ vs KR. FIXME
2236 bool ok_to_do_nullmove(const Position &pos) {
2237 if(pos.non_pawn_material(pos.side_to_move()) == Value(0))
2243 // ok_to_prune() tests whether it is safe to forward prune a move. Only
2244 // non-tactical moves late in the move list close to the leaves are
2245 // candidates for pruning.
2247 bool ok_to_prune(const Position &pos, Move m, Move threat, Depth d) {
2248 Square mfrom, mto, tfrom, tto;
2250 assert(move_is_ok(m));
2251 assert(threat == MOVE_NONE || move_is_ok(threat));
2252 assert(!move_promotion(m));
2253 assert(!pos.move_is_check(m));
2254 assert(!pos.move_is_capture(m));
2255 assert(!pos.move_is_passed_pawn_push(m));
2256 assert(d >= OnePly);
2258 mfrom = move_from(m);
2260 tfrom = move_from(threat);
2261 tto = move_to(threat);
2263 // Case 1: Castling moves are never pruned.
2264 if (move_is_castle(m))
2267 // Case 2: Don't prune moves which move the threatened piece
2268 if (!PruneEscapeMoves && threat != MOVE_NONE && mfrom == tto)
2271 // Case 3: If the threatened piece has value less than or equal to the
2272 // value of the threatening piece, don't prune move which defend it.
2273 if ( !PruneDefendingMoves
2274 && threat != MOVE_NONE
2275 && pos.move_is_capture(threat)
2276 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
2277 || pos.type_of_piece_on(tfrom) == KING)
2278 && pos.move_attacks_square(m, tto))
2281 // Case 4: Don't prune moves with good history.
2282 if (!H.ok_to_prune(pos.piece_on(move_from(m)), m, d))
2285 // Case 5: If the moving piece in the threatened move is a slider, don't
2286 // prune safe moves which block its ray.
2287 if ( !PruneBlockingMoves
2288 && threat != MOVE_NONE
2289 && piece_is_slider(pos.piece_on(tfrom))
2290 && bit_is_set(squares_between(tfrom, tto), mto)
2298 // ok_to_use_TT() returns true if a transposition table score
2299 // can be used at a given point in search.
2301 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
2303 Value v = value_from_tt(tte->value(), ply);
2305 return ( tte->depth() >= depth
2306 || v >= Max(value_mate_in(100), beta)
2307 || v < Min(value_mated_in(100), beta))
2309 && ( (is_lower_bound(tte->type()) && v >= beta)
2310 || (is_upper_bound(tte->type()) && v < beta));
2314 // ok_to_history() returns true if a move m can be stored
2315 // in history. Should be a non capturing move nor a promotion.
2317 bool ok_to_history(const Position& pos, Move m) {
2319 return !pos.move_is_capture(m) && !move_promotion(m);
2323 // update_history() registers a good move that produced a beta-cutoff
2324 // in history and marks as failures all the other moves of that ply.
2326 void update_history(const Position& pos, Move m, Depth depth,
2327 Move movesSearched[], int moveCount) {
2329 H.success(pos.piece_on(move_from(m)), m, depth);
2331 for (int i = 0; i < moveCount - 1; i++)
2333 assert(m != movesSearched[i]);
2334 if (ok_to_history(pos, movesSearched[i]))
2335 H.failure(pos.piece_on(move_from(movesSearched[i])), movesSearched[i]);
2340 // update_killers() add a good move that produced a beta-cutoff
2341 // among the killer moves of that ply.
2343 void update_killers(Move m, SearchStack& ss) {
2345 if (m == ss.killers[0])
2348 for (int i = KILLER_MAX - 1; i > 0; i--)
2349 ss.killers[i] = ss.killers[i - 1];
2354 // fail_high_ply_1() checks if some thread is currently resolving a fail
2355 // high at ply 1 at the node below the first root node. This information
2356 // is used for time managment.
2358 bool fail_high_ply_1() {
2359 for(int i = 0; i < ActiveThreads; i++)
2360 if(Threads[i].failHighPly1)
2366 // current_search_time() returns the number of milliseconds which have passed
2367 // since the beginning of the current search.
2369 int current_search_time() {
2370 return get_system_time() - SearchStartTime;
2374 // nps() computes the current nodes/second count.
2377 int t = current_search_time();
2378 return (t > 0)? int((nodes_searched() * 1000) / t) : 0;
2382 // poll() performs two different functions: It polls for user input, and it
2383 // looks at the time consumed so far and decides if it's time to abort the
2388 static int lastInfoTime;
2389 int t = current_search_time();
2394 // We are line oriented, don't read single chars
2395 std::string command;
2396 if (!std::getline(std::cin, command))
2399 if (command == "quit")
2402 PonderSearch = false;
2405 else if(command == "stop")
2408 PonderSearch = false;
2410 else if(command == "ponderhit")
2413 // Print search information
2417 else if (lastInfoTime > t)
2418 // HACK: Must be a new search where we searched less than
2419 // NodesBetweenPolls nodes during the first second of search.
2422 else if (t - lastInfoTime >= 1000)
2429 if (dbg_show_hit_rate)
2430 dbg_print_hit_rate();
2432 std::cout << "info nodes " << nodes_searched() << " nps " << nps()
2433 << " time " << t << " hashfull " << TT.full() << std::endl;
2434 lock_release(&IOLock);
2435 if (ShowCurrentLine)
2436 Threads[0].printCurrentLine = true;
2438 // Should we stop the search?
2442 bool overTime = t > AbsoluteMaxSearchTime
2443 || (RootMoveNumber == 1 && t > MaxSearchTime + ExtraSearchTime)
2444 || ( !FailHigh && !fail_high_ply_1() && !Problem
2445 && t > 6*(MaxSearchTime + ExtraSearchTime));
2447 if ( (Iteration >= 2 && (!InfiniteSearch && overTime))
2448 || (ExactMaxTime && t >= ExactMaxTime)
2449 || (Iteration >= 3 && MaxNodes && nodes_searched() >= MaxNodes))
2454 // ponderhit() is called when the program is pondering (i.e. thinking while
2455 // it's the opponent's turn to move) in order to let the engine know that
2456 // it correctly predicted the opponent's move.
2459 int t = current_search_time();
2460 PonderSearch = false;
2461 if(Iteration >= 2 &&
2462 (!InfiniteSearch && (StopOnPonderhit ||
2463 t > AbsoluteMaxSearchTime ||
2464 (RootMoveNumber == 1 &&
2465 t > MaxSearchTime + ExtraSearchTime) ||
2466 (!FailHigh && !fail_high_ply_1() && !Problem &&
2467 t > 6*(MaxSearchTime + ExtraSearchTime)))))
2472 // print_current_line() prints the current line of search for a given
2473 // thread. Called when the UCI option UCI_ShowCurrLine is 'true'.
2475 void print_current_line(SearchStack ss[], int ply, int threadID) {
2476 assert(ply >= 0 && ply < PLY_MAX);
2477 assert(threadID >= 0 && threadID < ActiveThreads);
2479 if(!Threads[threadID].idle) {
2481 std::cout << "info currline " << (threadID + 1);
2482 for(int p = 0; p < ply; p++)
2483 std::cout << " " << ss[p].currentMove;
2484 std::cout << std::endl;
2485 lock_release(&IOLock);
2487 Threads[threadID].printCurrentLine = false;
2488 if(threadID + 1 < ActiveThreads)
2489 Threads[threadID + 1].printCurrentLine = true;
2493 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2494 // while the program is pondering. The point is to work around a wrinkle in
2495 // the UCI protocol: When pondering, the engine is not allowed to give a
2496 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2497 // We simply wait here until one of these commands is sent, and return,
2498 // after which the bestmove and pondermove will be printed (in id_loop()).
2500 void wait_for_stop_or_ponderhit() {
2501 std::string command;
2504 if(!std::getline(std::cin, command))
2507 if(command == "quit") {
2508 OpeningBook.close();
2513 else if(command == "ponderhit" || command == "stop")
2519 // idle_loop() is where the threads are parked when they have no work to do.
2520 // The parameter "waitSp", if non-NULL, is a pointer to an active SplitPoint
2521 // object for which the current thread is the master.
2523 void idle_loop(int threadID, SplitPoint *waitSp) {
2524 assert(threadID >= 0 && threadID < THREAD_MAX);
2526 Threads[threadID].running = true;
2529 if(AllThreadsShouldExit && threadID != 0)
2532 // If we are not thinking, wait for a condition to be signaled instead
2533 // of wasting CPU time polling for work:
2534 while(threadID != 0 && (Idle || threadID >= ActiveThreads)) {
2535 #if !defined(_MSC_VER)
2536 pthread_mutex_lock(&WaitLock);
2537 if(Idle || threadID >= ActiveThreads)
2538 pthread_cond_wait(&WaitCond, &WaitLock);
2539 pthread_mutex_unlock(&WaitLock);
2541 WaitForSingleObject(SitIdleEvent[threadID], INFINITE);
2545 // If this thread has been assigned work, launch a search:
2546 if(Threads[threadID].workIsWaiting) {
2547 Threads[threadID].workIsWaiting = false;
2548 if(Threads[threadID].splitPoint->pvNode)
2549 sp_search_pv(Threads[threadID].splitPoint, threadID);
2551 sp_search(Threads[threadID].splitPoint, threadID);
2552 Threads[threadID].idle = true;
2555 // If this thread is the master of a split point and all threads have
2556 // finished their work at this split point, return from the idle loop:
2557 if(waitSp != NULL && waitSp->cpus == 0)
2561 Threads[threadID].running = false;
2565 // init_split_point_stack() is called during program initialization, and
2566 // initializes all split point objects.
2568 void init_split_point_stack() {
2569 for(int i = 0; i < THREAD_MAX; i++)
2570 for(int j = 0; j < MaxActiveSplitPoints; j++) {
2571 SplitPointStack[i][j].parent = NULL;
2572 lock_init(&(SplitPointStack[i][j].lock), NULL);
2577 // destroy_split_point_stack() is called when the program exits, and
2578 // destroys all locks in the precomputed split point objects.
2580 void destroy_split_point_stack() {
2581 for(int i = 0; i < THREAD_MAX; i++)
2582 for(int j = 0; j < MaxActiveSplitPoints; j++)
2583 lock_destroy(&(SplitPointStack[i][j].lock));
2587 // thread_should_stop() checks whether the thread with a given threadID has
2588 // been asked to stop, directly or indirectly. This can happen if a beta
2589 // cutoff has occured in thre thread's currently active split point, or in
2590 // some ancestor of the current split point.
2592 bool thread_should_stop(int threadID) {
2593 assert(threadID >= 0 && threadID < ActiveThreads);
2597 if(Threads[threadID].stop)
2599 if(ActiveThreads <= 2)
2601 for(sp = Threads[threadID].splitPoint; sp != NULL; sp = sp->parent)
2603 Threads[threadID].stop = true;
2610 // thread_is_available() checks whether the thread with threadID "slave" is
2611 // available to help the thread with threadID "master" at a split point. An
2612 // obvious requirement is that "slave" must be idle. With more than two
2613 // threads, this is not by itself sufficient: If "slave" is the master of
2614 // some active split point, it is only available as a slave to the other
2615 // threads which are busy searching the split point at the top of "slave"'s
2616 // split point stack (the "helpful master concept" in YBWC terminology).
2618 bool thread_is_available(int slave, int master) {
2619 assert(slave >= 0 && slave < ActiveThreads);
2620 assert(master >= 0 && master < ActiveThreads);
2621 assert(ActiveThreads > 1);
2623 if(!Threads[slave].idle || slave == master)
2626 if(Threads[slave].activeSplitPoints == 0)
2627 // No active split points means that the thread is available as a slave
2628 // for any other thread.
2631 if(ActiveThreads == 2)
2634 // Apply the "helpful master" concept if possible.
2635 if(SplitPointStack[slave][Threads[slave].activeSplitPoints-1].slaves[master])
2642 // idle_thread_exists() tries to find an idle thread which is available as
2643 // a slave for the thread with threadID "master".
2645 bool idle_thread_exists(int master) {
2646 assert(master >= 0 && master < ActiveThreads);
2647 assert(ActiveThreads > 1);
2649 for(int i = 0; i < ActiveThreads; i++)
2650 if(thread_is_available(i, master))
2656 // split() does the actual work of distributing the work at a node between
2657 // several threads at PV nodes. If it does not succeed in splitting the
2658 // node (because no idle threads are available, or because we have no unused
2659 // split point objects), the function immediately returns false. If
2660 // splitting is possible, a SplitPoint object is initialized with all the
2661 // data that must be copied to the helper threads (the current position and
2662 // search stack, alpha, beta, the search depth, etc.), and we tell our
2663 // helper threads that they have been assigned work. This will cause them
2664 // to instantly leave their idle loops and call sp_search_pv(). When all
2665 // threads have returned from sp_search_pv (or, equivalently, when
2666 // splitPoint->cpus becomes 0), split() returns true.
2668 bool split(const Position &p, SearchStack *sstck, int ply,
2669 Value *alpha, Value *beta, Value *bestValue,
2670 Depth depth, int *moves,
2671 MovePicker *mp, Bitboard dcCandidates, int master, bool pvNode) {
2673 assert(sstck != NULL);
2674 assert(ply >= 0 && ply < PLY_MAX);
2675 assert(*bestValue >= -VALUE_INFINITE && *bestValue <= *alpha);
2676 assert(!pvNode || *alpha < *beta);
2677 assert(*beta <= VALUE_INFINITE);
2678 assert(depth > Depth(0));
2679 assert(master >= 0 && master < ActiveThreads);
2680 assert(ActiveThreads > 1);
2682 SplitPoint *splitPoint;
2687 // If no other thread is available to help us, or if we have too many
2688 // active split points, don't split:
2689 if(!idle_thread_exists(master) ||
2690 Threads[master].activeSplitPoints >= MaxActiveSplitPoints) {
2691 lock_release(&MPLock);
2695 // Pick the next available split point object from the split point stack:
2696 splitPoint = SplitPointStack[master] + Threads[master].activeSplitPoints;
2697 Threads[master].activeSplitPoints++;
2699 // Initialize the split point object:
2700 splitPoint->parent = Threads[master].splitPoint;
2701 splitPoint->finished = false;
2702 splitPoint->ply = ply;
2703 splitPoint->depth = depth;
2704 splitPoint->alpha = pvNode? *alpha : (*beta - 1);
2705 splitPoint->beta = *beta;
2706 splitPoint->pvNode = pvNode;
2707 splitPoint->dcCandidates = dcCandidates;
2708 splitPoint->bestValue = *bestValue;
2709 splitPoint->master = master;
2710 splitPoint->mp = mp;
2711 splitPoint->moves = *moves;
2712 splitPoint->cpus = 1;
2713 splitPoint->pos.copy(p);
2714 splitPoint->parentSstack = sstck;
2715 for(i = 0; i < ActiveThreads; i++)
2716 splitPoint->slaves[i] = 0;
2718 // Copy the current position and the search stack to the master thread:
2719 memcpy(splitPoint->sstack[master], sstck, (ply+1)*sizeof(SearchStack));
2720 Threads[master].splitPoint = splitPoint;
2722 // Make copies of the current position and search stack for each thread:
2723 for(i = 0; i < ActiveThreads && splitPoint->cpus < MaxThreadsPerSplitPoint;
2725 if(thread_is_available(i, master)) {
2726 memcpy(splitPoint->sstack[i], sstck, (ply+1)*sizeof(SearchStack));
2727 Threads[i].splitPoint = splitPoint;
2728 splitPoint->slaves[i] = 1;
2732 // Tell the threads that they have work to do. This will make them leave
2734 for(i = 0; i < ActiveThreads; i++)
2735 if(i == master || splitPoint->slaves[i]) {
2736 Threads[i].workIsWaiting = true;
2737 Threads[i].idle = false;
2738 Threads[i].stop = false;
2741 lock_release(&MPLock);
2743 // Everything is set up. The master thread enters the idle loop, from
2744 // which it will instantly launch a search, because its workIsWaiting
2745 // slot is 'true'. We send the split point as a second parameter to the
2746 // idle loop, which means that the main thread will return from the idle
2747 // loop when all threads have finished their work at this split point
2748 // (i.e. when // splitPoint->cpus == 0).
2749 idle_loop(master, splitPoint);
2751 // We have returned from the idle loop, which means that all threads are
2752 // finished. Update alpha, beta and bestvalue, and return:
2754 if(pvNode) *alpha = splitPoint->alpha;
2755 *beta = splitPoint->beta;
2756 *bestValue = splitPoint->bestValue;
2757 Threads[master].stop = false;
2758 Threads[master].idle = false;
2759 Threads[master].activeSplitPoints--;
2760 Threads[master].splitPoint = splitPoint->parent;
2761 lock_release(&MPLock);
2767 // wake_sleeping_threads() wakes up all sleeping threads when it is time
2768 // to start a new search from the root.
2770 void wake_sleeping_threads() {
2771 if(ActiveThreads > 1) {
2772 for(int i = 1; i < ActiveThreads; i++) {
2773 Threads[i].idle = true;
2774 Threads[i].workIsWaiting = false;
2776 #if !defined(_MSC_VER)
2777 pthread_mutex_lock(&WaitLock);
2778 pthread_cond_broadcast(&WaitCond);
2779 pthread_mutex_unlock(&WaitLock);
2781 for(int i = 1; i < THREAD_MAX; i++)
2782 SetEvent(SitIdleEvent[i]);
2788 // init_thread() is the function which is called when a new thread is
2789 // launched. It simply calls the idle_loop() function with the supplied
2790 // threadID. There are two versions of this function; one for POSIX threads
2791 // and one for Windows threads.
2793 #if !defined(_MSC_VER)
2795 void *init_thread(void *threadID) {
2796 idle_loop(*(int *)threadID, NULL);
2802 DWORD WINAPI init_thread(LPVOID threadID) {
2803 idle_loop(*(int *)threadID, NULL);