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 RootMove class is used for moves at the root at the tree. For each
51 // root move, we store a score, a node count, and a PV (really a refutation
52 // in the case of moves which fail low).
57 bool operator<(const RootMove&); // used to sort
61 int64_t nodes, cumulativeNodes;
62 Move pv[PLY_MAX_PLUS_2];
66 // The RootMoveList class is essentially an array of RootMove objects, with
67 // a handful of methods for accessing the data in the individual moves.
72 RootMoveList(Position &pos, Move searchMoves[]);
73 inline Move get_move(int moveNum) const;
74 inline Value get_move_score(int moveNum) const;
75 inline void set_move_score(int moveNum, Value score);
76 inline void set_move_nodes(int moveNum, int64_t nodes);
77 void set_move_pv(int moveNum, const Move pv[]);
78 inline Move get_move_pv(int moveNum, int i) const;
79 inline int64_t get_move_cumulative_nodes(int moveNum) const;
80 inline int move_count() const;
81 Move scan_for_easy_move() const;
83 void sort_multipv(int n);
86 static const int MaxRootMoves = 500;
87 RootMove moves[MaxRootMoves];
92 /// Constants and variables
94 // Minimum number of full depth (i.e. non-reduced) moves at PV and non-PV
97 int LMRNonPVMoves = 4;
99 // Depth limit for use of dynamic threat detection:
100 Depth ThreatDepth = 5*OnePly;
102 // Depth limit for selective search:
103 Depth SelectiveDepth = 7*OnePly;
105 // Use internal iterative deepening?
106 const bool UseIIDAtPVNodes = true;
107 const bool UseIIDAtNonPVNodes = false;
109 // Internal iterative deepening margin. At Non-PV moves, when
110 // UseIIDAtNonPVNodes is true, we do an internal iterative deepening search
111 // when the static evaluation is at most IIDMargin below beta.
112 const Value IIDMargin = Value(0x100);
115 const bool UseEasyMove = true;
117 // Easy move margin. An easy move candidate must be at least this much
118 // better than the second best move.
119 const Value EasyMoveMargin = Value(0x200);
121 // Problem margin. If the score of the first move at iteration N+1 has
122 // dropped by more than this since iteration N, the boolean variable
123 // "Problem" is set to true, which will make the program spend some extra
124 // time looking for a better move.
125 const Value ProblemMargin = Value(0x28);
127 // No problem margin. If the boolean "Problem" is true, and a new move
128 // is found at the root which is less than NoProblemMargin worse than the
129 // best move from the previous iteration, Problem is set back to false.
130 const Value NoProblemMargin = Value(0x14);
132 // Null move margin. A null move search will not be done if the approximate
133 // evaluation of the position is more than NullMoveMargin below beta.
134 const Value NullMoveMargin = Value(0x300);
136 // Pruning criterions. See the code and comments in ok_to_prune() to
137 // understand their precise meaning.
138 const bool PruneEscapeMoves = false;
139 const bool PruneDefendingMoves = false;
140 const bool PruneBlockingMoves = false;
142 // Use futility pruning?
143 bool UseQSearchFutilityPruning = true;
144 bool UseFutilityPruning = true;
146 // Margins for futility pruning in the quiescence search, at frontier
147 // nodes, and at pre-frontier nodes
148 Value FutilityMargin0 = Value(0x80);
149 Value FutilityMargin1 = Value(0x100);
150 Value FutilityMargin2 = Value(0x300);
153 Depth RazorDepth = 4*OnePly;
154 Value RazorMargin = Value(0x300);
156 // Last seconds noise filtering (LSN)
157 bool UseLSNFiltering = false;
158 bool looseOnTime = false;
159 int LSNTime = 4 * 1000; // In milliseconds
160 Value LSNValue = Value(0x200);
162 // Extensions. Array index 0 is used at non-PV nodes, index 1 at PV nodes.
163 Depth CheckExtension[2] = {OnePly, OnePly};
164 Depth SingleReplyExtension[2] = {OnePly / 2, OnePly / 2};
165 Depth PawnPushTo7thExtension[2] = {OnePly / 2, OnePly / 2};
166 Depth PassedPawnExtension[2] = {Depth(0), Depth(0)};
167 Depth PawnEndgameExtension[2] = {OnePly, OnePly};
168 Depth MateThreatExtension[2] = {Depth(0), Depth(0)};
170 // Search depth at iteration 1
171 const Depth InitialDepth = OnePly /*+ OnePly/2*/;
175 int NodesBetweenPolls = 30000;
181 // Scores and number of times the best move changed for each iteration:
182 Value ValueByIteration[PLY_MAX_PLUS_2];
183 int BestMoveChangesByIteration[PLY_MAX_PLUS_2];
188 // Time managment variables
190 int MaxNodes, MaxDepth;
191 int MaxSearchTime, AbsoluteMaxSearchTime, ExtraSearchTime, TimeAdvantage;
192 Move BestRootMove, PonderMove, EasyMove;
196 bool StopOnPonderhit;
201 bool PonderingEnabled;
204 // Show current line?
205 bool ShowCurrentLine = false;
208 bool UseLogFile = false;
209 std::ofstream LogFile;
211 // MP related variables
212 Depth MinimumSplitDepth = 4*OnePly;
213 int MaxThreadsPerSplitPoint = 4;
214 Thread Threads[THREAD_MAX];
216 bool AllThreadsShouldExit = false;
217 const int MaxActiveSplitPoints = 8;
218 SplitPoint SplitPointStack[THREAD_MAX][MaxActiveSplitPoints];
221 #if !defined(_MSC_VER)
222 pthread_cond_t WaitCond;
223 pthread_mutex_t WaitLock;
225 HANDLE SitIdleEvent[THREAD_MAX];
231 Value id_loop(const Position &pos, Move searchMoves[]);
232 Value root_search(Position &pos, SearchStack ss[], RootMoveList &rml);
233 Value search_pv(Position &pos, SearchStack ss[], Value alpha, Value beta,
234 Depth depth, int ply, int threadID);
235 Value search(Position &pos, SearchStack ss[], Value beta,
236 Depth depth, int ply, bool allowNullmove, int threadID);
237 Value qsearch(Position &pos, SearchStack ss[], Value alpha, Value beta,
238 Depth depth, int ply, int threadID);
239 void sp_search(SplitPoint *sp, int threadID);
240 void sp_search_pv(SplitPoint *sp, int threadID);
241 void init_search_stack(SearchStack& ss);
242 void init_search_stack(SearchStack ss[]);
243 void init_node(const Position &pos, SearchStack ss[], int ply, int threadID);
244 void update_pv(SearchStack ss[], int ply);
245 void sp_update_pv(SearchStack *pss, SearchStack ss[], int ply);
246 bool connected_moves(const Position &pos, Move m1, Move m2);
247 bool move_is_killer(Move m, const SearchStack& ss);
248 Depth extension(const Position &pos, Move m, bool pvNode, bool check, bool singleReply, bool mateThreat);
249 bool ok_to_do_nullmove(const Position &pos);
250 bool ok_to_prune(const Position &pos, Move m, Move threat, Depth d);
251 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply);
252 bool ok_to_history(const Position &pos, Move m);
253 void update_history(const Position& pos, Move m, Depth depth, Move movesSearched[], int moveCount);
254 void update_killers(Move m, SearchStack& ss);
256 bool fail_high_ply_1();
257 int current_search_time();
261 void print_current_line(SearchStack ss[], int ply, int threadID);
262 void wait_for_stop_or_ponderhit();
264 void idle_loop(int threadID, SplitPoint *waitSp);
265 void init_split_point_stack();
266 void destroy_split_point_stack();
267 bool thread_should_stop(int threadID);
268 bool thread_is_available(int slave, int master);
269 bool idle_thread_exists(int master);
270 bool split(const Position &pos, SearchStack *ss, int ply,
271 Value *alpha, Value *beta, Value *bestValue, Depth depth,
272 int *moves, MovePicker *mp, Bitboard dcCandidates, int master,
274 void wake_sleeping_threads();
276 #if !defined(_MSC_VER)
277 void *init_thread(void *threadID);
279 DWORD WINAPI init_thread(LPVOID threadID);
286 //// Global variables
289 // The main transposition table
290 TranspositionTable TT = TranspositionTable(TTDefaultSize);
293 // Number of active threads:
294 int ActiveThreads = 1;
296 // Locks. In principle, there is no need for IOLock to be a global variable,
297 // but it could turn out to be useful for debugging.
300 History H; // Should be made local?
302 // The empty search stack
303 SearchStack EmptySearchStack;
310 /// think() is the external interface to Stockfish's search, and is called when
311 /// the program receives the UCI 'go' command. It initializes various
312 /// search-related global variables, and calls root_search()
314 void think(const Position &pos, bool infinite, bool ponder, int side_to_move,
315 int time[], int increment[], int movesToGo, int maxDepth,
316 int maxNodes, int maxTime, Move searchMoves[]) {
318 // Look for a book move
319 if (!infinite && !ponder && get_option_value_bool("OwnBook"))
322 if (get_option_value_string("Book File") != OpeningBook.file_name())
325 OpeningBook.open("book.bin");
327 bookMove = OpeningBook.get_move(pos);
328 if (bookMove != MOVE_NONE)
330 std::cout << "bestmove " << bookMove << std::endl;
335 // Initialize global search variables
337 SearchStartTime = get_system_time();
338 BestRootMove = MOVE_NONE;
339 PonderMove = MOVE_NONE;
340 EasyMove = MOVE_NONE;
341 for (int i = 0; i < THREAD_MAX; i++)
343 Threads[i].nodes = 0ULL;
344 Threads[i].failHighPly1 = false;
347 InfiniteSearch = infinite;
348 PonderSearch = ponder;
349 StopOnPonderhit = false;
354 ExactMaxTime = maxTime;
356 // Read UCI option values
357 TT.set_size(get_option_value_int("Hash"));
358 if (button_was_pressed("Clear Hash"))
361 PonderingEnabled = get_option_value_bool("Ponder");
362 MultiPV = get_option_value_int("MultiPV");
364 CheckExtension[1] = Depth(get_option_value_int("Check Extension (PV nodes)"));
365 CheckExtension[0] = Depth(get_option_value_int("Check Extension (non-PV nodes)"));
367 SingleReplyExtension[1] = Depth(get_option_value_int("Single Reply Extension (PV nodes)"));
368 SingleReplyExtension[0] = Depth(get_option_value_int("Single Reply Extension (non-PV nodes)"));
370 PawnPushTo7thExtension[1] = Depth(get_option_value_int("Pawn Push to 7th Extension (PV nodes)"));
371 PawnPushTo7thExtension[0] = Depth(get_option_value_int("Pawn Push to 7th Extension (non-PV nodes)"));
373 PassedPawnExtension[1] = Depth(get_option_value_int("Passed Pawn Extension (PV nodes)"));
374 PassedPawnExtension[0] = Depth(get_option_value_int("Passed Pawn Extension (non-PV nodes)"));
376 PawnEndgameExtension[1] = Depth(get_option_value_int("Pawn Endgame Extension (PV nodes)"));
377 PawnEndgameExtension[0] = Depth(get_option_value_int("Pawn Endgame Extension (non-PV nodes)"));
379 MateThreatExtension[1] = Depth(get_option_value_int("Mate Threat Extension (PV nodes)"));
380 MateThreatExtension[0] = Depth(get_option_value_int("Mate Threat Extension (non-PV nodes)"));
382 LMRPVMoves = get_option_value_int("Full Depth Moves (PV nodes)") + 1;
383 LMRNonPVMoves = get_option_value_int("Full Depth Moves (non-PV nodes)") + 1;
384 ThreatDepth = get_option_value_int("Threat Depth") * OnePly;
385 SelectiveDepth = get_option_value_int("Selective Plies") * OnePly;
387 Chess960 = get_option_value_bool("UCI_Chess960");
388 ShowCurrentLine = get_option_value_bool("UCI_ShowCurrLine");
389 UseLogFile = get_option_value_bool("Use Search Log");
391 LogFile.open(get_option_value_string("Search Log Filename").c_str(), std::ios::out | std::ios::app);
393 UseQSearchFutilityPruning = get_option_value_bool("Futility Pruning (Quiescence Search)");
394 UseFutilityPruning = get_option_value_bool("Futility Pruning (Main Search)");
396 FutilityMargin0 = value_from_centipawns(get_option_value_int("Futility Margin 0"));
397 FutilityMargin1 = value_from_centipawns(get_option_value_int("Futility Margin 1"));
398 FutilityMargin2 = value_from_centipawns(get_option_value_int("Futility Margin 2"));
400 RazorDepth = (get_option_value_int("Maximum Razoring Depth") + 1) * OnePly;
401 RazorMargin = value_from_centipawns(get_option_value_int("Razoring Margin"));
403 UseLSNFiltering = get_option_value_bool("LSN filtering");
404 LSNTime = get_option_value_int("LSN Time Margin (sec)") * 1000;
405 LSNValue = value_from_centipawns(get_option_value_int("LSN Value Margin"));
407 MinimumSplitDepth = get_option_value_int("Minimum Split Depth") * OnePly;
408 MaxThreadsPerSplitPoint = get_option_value_int("Maximum Number of Threads per Split Point");
410 read_weights(pos.side_to_move());
412 int newActiveThreads = get_option_value_int("Threads");
413 if (newActiveThreads != ActiveThreads)
415 ActiveThreads = newActiveThreads;
416 init_eval(ActiveThreads);
419 // Wake up sleeping threads:
420 wake_sleeping_threads();
422 for (int i = 1; i < ActiveThreads; i++)
423 assert(thread_is_available(i, 0));
425 // Set thinking time:
426 int myTime = time[side_to_move];
427 int myIncrement = increment[side_to_move];
428 int oppTime = time[1 - side_to_move];
430 TimeAdvantage = myTime - oppTime;
432 if (!movesToGo) // Sudden death time control
436 MaxSearchTime = myTime / 30 + myIncrement;
437 AbsoluteMaxSearchTime = Max(myTime / 4, myIncrement - 100);
438 } else { // Blitz game without increment
439 MaxSearchTime = myTime / 40;
440 AbsoluteMaxSearchTime = myTime / 8;
443 else // (x moves) / (y minutes)
447 MaxSearchTime = myTime / 2;
448 AbsoluteMaxSearchTime = Min(myTime / 2, myTime - 500);
450 MaxSearchTime = myTime / Min(movesToGo, 20);
451 AbsoluteMaxSearchTime = Min((4 * myTime) / movesToGo, myTime / 3);
455 if (PonderingEnabled)
457 MaxSearchTime += MaxSearchTime / 4;
458 MaxSearchTime = Min(MaxSearchTime, AbsoluteMaxSearchTime);
461 // Fixed depth or fixed number of nodes?
464 InfiniteSearch = true; // HACK
469 NodesBetweenPolls = Min(MaxNodes, 30000);
470 InfiniteSearch = true; // HACK
473 NodesBetweenPolls = 30000;
476 // Write information to search log file:
478 LogFile << "Searching: " << pos.to_fen() << std::endl
479 << "infinite: " << infinite
480 << " ponder: " << ponder
481 << " time: " << myTime
482 << " increment: " << myIncrement
483 << " moves to go: " << movesToGo << std::endl;
486 // We're ready to start thinking. Call the iterative deepening loop
490 Value v = id_loop(pos, searchMoves);
491 looseOnTime = ( UseLSNFiltering
498 looseOnTime = false; // reset for next match
499 while (SearchStartTime + myTime + 1000 > get_system_time())
501 id_loop(pos, searchMoves); // to fail gracefully
518 /// init_threads() is called during startup. It launches all helper threads,
519 /// and initializes the split point stack and the global locks and condition
522 void init_threads() {
526 #if !defined(_MSC_VER)
527 pthread_t pthread[1];
530 for (i = 0; i < THREAD_MAX; i++)
531 Threads[i].activeSplitPoints = 0;
533 // Initialize global locks:
534 lock_init(&MPLock, NULL);
535 lock_init(&IOLock, NULL);
537 init_split_point_stack();
539 #if !defined(_MSC_VER)
540 pthread_mutex_init(&WaitLock, NULL);
541 pthread_cond_init(&WaitCond, NULL);
543 for (i = 0; i < THREAD_MAX; i++)
544 SitIdleEvent[i] = CreateEvent(0, FALSE, FALSE, 0);
547 // All threads except the main thread should be initialized to idle state
548 for (i = 1; i < THREAD_MAX; i++)
550 Threads[i].stop = false;
551 Threads[i].workIsWaiting = false;
552 Threads[i].idle = true;
553 Threads[i].running = false;
556 // Launch the helper threads
557 for(i = 1; i < THREAD_MAX; i++)
559 #if !defined(_MSC_VER)
560 pthread_create(pthread, NULL, init_thread, (void*)(&i));
563 CreateThread(NULL, 0, init_thread, (LPVOID)(&i), 0, iID);
566 // Wait until the thread has finished launching:
567 while (!Threads[i].running);
570 // Init also the empty search stack
571 init_search_stack(EmptySearchStack);
575 /// stop_threads() is called when the program exits. It makes all the
576 /// helper threads exit cleanly.
578 void stop_threads() {
580 ActiveThreads = THREAD_MAX; // HACK
581 Idle = false; // HACK
582 wake_sleeping_threads();
583 AllThreadsShouldExit = true;
584 for (int i = 1; i < THREAD_MAX; i++)
586 Threads[i].stop = true;
587 while(Threads[i].running);
589 destroy_split_point_stack();
593 /// nodes_searched() returns the total number of nodes searched so far in
594 /// the current search.
596 int64_t nodes_searched() {
598 int64_t result = 0ULL;
599 for (int i = 0; i < ActiveThreads; i++)
600 result += Threads[i].nodes;
607 // id_loop() is the main iterative deepening loop. It calls root_search
608 // repeatedly with increasing depth until the allocated thinking time has
609 // been consumed, the user stops the search, or the maximum search depth is
612 Value id_loop(const Position &pos, Move searchMoves[]) {
615 SearchStack ss[PLY_MAX_PLUS_2];
617 // searchMoves are verified, copied, scored and sorted
618 RootMoveList rml(p, searchMoves);
623 init_search_stack(ss);
625 ValueByIteration[0] = Value(0);
626 ValueByIteration[1] = rml.get_move_score(0);
628 LastIterations = false;
630 EasyMove = rml.scan_for_easy_move();
632 // Iterative deepening loop
633 while (!AbortSearch && Iteration < PLY_MAX)
635 // Initialize iteration
638 BestMoveChangesByIteration[Iteration] = 0;
642 std::cout << "info depth " << Iteration << std::endl;
644 // Search to the current depth
645 ValueByIteration[Iteration] = root_search(p, ss, rml);
647 // Erase the easy move if it differs from the new best move
648 if (ss[0].pv[0] != EasyMove)
649 EasyMove = MOVE_NONE;
656 bool stopSearch = false;
658 // Stop search early if there is only a single legal move:
659 if (Iteration >= 6 && rml.move_count() == 1)
662 // Stop search early when the last two iterations returned a mate score
664 && abs(ValueByIteration[Iteration]) >= abs(VALUE_MATE) - 100
665 && abs(ValueByIteration[Iteration-1]) >= abs(VALUE_MATE) - 100)
668 // Stop search early if one move seems to be much better than the rest
669 int64_t nodes = nodes_searched();
671 && EasyMove == ss[0].pv[0]
672 && ( ( rml.get_move_cumulative_nodes(0) > (nodes * 85) / 100
673 && current_search_time() > MaxSearchTime / 16)
674 ||( rml.get_move_cumulative_nodes(0) > (nodes * 98) / 100
675 && current_search_time() > MaxSearchTime / 32)))
678 // Add some extra time if the best move has changed during the last two iterations
679 if (Iteration > 5 && Iteration <= 50)
680 ExtraSearchTime = BestMoveChangesByIteration[Iteration] * (MaxSearchTime / 2)
681 + BestMoveChangesByIteration[Iteration-1] * (MaxSearchTime / 3);
683 // If we need some more and we are in time advantage take it
684 if (ExtraSearchTime > 0 && TimeAdvantage > 2 * MaxSearchTime)
685 ExtraSearchTime += MaxSearchTime / 2;
687 // Try to guess if the current iteration is the last one or the last two
688 LastIterations = (current_search_time() > ((MaxSearchTime + ExtraSearchTime)*58) / 128);
690 // Stop search if most of MaxSearchTime is consumed at the end of the
691 // iteration. We probably don't have enough time to search the first
692 // move at the next iteration anyway.
693 if (current_search_time() > ((MaxSearchTime + ExtraSearchTime)*80) / 128)
701 StopOnPonderhit = true;
704 // Write PV to transposition table, in case the relevant entries have
705 // been overwritten during the search:
706 TT.insert_pv(p, ss[0].pv);
708 if (MaxDepth && Iteration >= MaxDepth)
714 // If we are pondering, we shouldn't print the best move before we
717 wait_for_stop_or_ponderhit();
719 // Print final search statistics
720 std::cout << "info nodes " << nodes_searched()
722 << " time " << current_search_time()
723 << " hashfull " << TT.full() << std::endl;
725 // Print the best move and the ponder move to the standard output
726 std::cout << "bestmove " << ss[0].pv[0];
727 if (ss[0].pv[1] != MOVE_NONE)
728 std::cout << " ponder " << ss[0].pv[1];
730 std::cout << std::endl;
735 LogFile << "Nodes: " << nodes_searched() << std::endl
736 << "Nodes/second: " << nps() << std::endl
737 << "Best move: " << move_to_san(p, ss[0].pv[0]) << std::endl;
739 p.do_move(ss[0].pv[0], u);
740 LogFile << "Ponder move: " << move_to_san(p, ss[0].pv[1])
741 << std::endl << std::endl;
743 return rml.get_move_score(0);
747 // root_search() is the function which searches the root node. It is
748 // similar to search_pv except that it uses a different move ordering
749 // scheme (perhaps we should try to use this at internal PV nodes, too?)
750 // and prints some information to the standard output.
752 Value root_search(Position &pos, SearchStack ss[], RootMoveList &rml) {
754 Value alpha = -VALUE_INFINITE;
755 Value beta = VALUE_INFINITE, value;
756 Bitboard dcCandidates = pos.discovered_check_candidates(pos.side_to_move());
758 // Loop through all the moves in the root move list
759 for (int i = 0; i < rml.move_count() && !AbortSearch; i++)
766 RootMoveNumber = i + 1;
769 // Remember the node count before the move is searched. The node counts
770 // are used to sort the root moves at the next iteration.
771 nodes = nodes_searched();
773 // Pick the next root move, and print the move and the move number to
774 // the standard output.
775 move = ss[0].currentMove = rml.get_move(i);
776 if (current_search_time() >= 1000)
777 std::cout << "info currmove " << move
778 << " currmovenumber " << i + 1 << std::endl;
780 // Decide search depth for this move
781 ext = extension(pos, move, true, pos.move_is_check(move), false, false);
782 newDepth = (Iteration - 2) * OnePly + ext + InitialDepth;
784 // Make the move, and search it
785 pos.do_move(move, u, dcCandidates);
789 value = -search_pv(pos, ss, -beta, VALUE_INFINITE, newDepth, 1, 0);
790 // If the value has dropped a lot compared to the last iteration,
791 // set the boolean variable Problem to true. This variable is used
792 // for time managment: When Problem is true, we try to complete the
793 // current iteration before playing a move.
794 Problem = (Iteration >= 2 && value <= ValueByIteration[Iteration-1] - ProblemMargin);
796 if (Problem && StopOnPonderhit)
797 StopOnPonderhit = false;
801 value = -search(pos, ss, -alpha, newDepth, 1, true, 0);
804 // Fail high! Set the boolean variable FailHigh to true, and
805 // re-search the move with a big window. The variable FailHigh is
806 // used for time managment: We try to avoid aborting the search
807 // prematurely during a fail high research.
809 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
813 pos.undo_move(move, u);
815 // Finished searching the move. If AbortSearch is true, the search
816 // was aborted because the user interrupted the search or because we
817 // ran out of time. In this case, the return value of the search cannot
818 // be trusted, and we break out of the loop without updating the best
823 // Remember the node count for this move. The node counts are used to
824 // sort the root moves at the next iteration.
825 rml.set_move_nodes(i, nodes_searched() - nodes);
827 assert(value >= -VALUE_INFINITE && value <= VALUE_INFINITE);
829 if (value <= alpha && i >= MultiPV)
830 rml.set_move_score(i, -VALUE_INFINITE);
836 rml.set_move_score(i, value);
838 rml.set_move_pv(i, ss[0].pv);
842 // We record how often the best move has been changed in each
843 // iteration. This information is used for time managment: When
844 // the best move changes frequently, we allocate some more time.
846 BestMoveChangesByIteration[Iteration]++;
848 // Print search information to the standard output:
849 std::cout << "info depth " << Iteration
850 << " score " << value_to_string(value)
851 << " time " << current_search_time()
852 << " nodes " << nodes_searched()
856 for (int j = 0; ss[0].pv[j] != MOVE_NONE && j < PLY_MAX; j++)
857 std::cout << ss[0].pv[j] << " ";
859 std::cout << std::endl;
862 LogFile << pretty_pv(pos, current_search_time(), Iteration, nodes_searched(), value, ss[0].pv)
867 // Reset the global variable Problem to false if the value isn't too
868 // far below the final value from the last iteration.
869 if (value > ValueByIteration[Iteration - 1] - NoProblemMargin)
875 for (int j = 0; j < Min(MultiPV, rml.move_count()); j++)
878 std::cout << "info multipv " << j + 1
879 << " score " << value_to_string(rml.get_move_score(j))
880 << " depth " << ((j <= i)? Iteration : Iteration - 1)
881 << " time " << current_search_time()
882 << " nodes " << nodes_searched()
886 for (k = 0; rml.get_move_pv(j, k) != MOVE_NONE && k < PLY_MAX; k++)
887 std::cout << rml.get_move_pv(j, k) << " ";
889 std::cout << std::endl;
891 alpha = rml.get_move_score(Min(i, MultiPV-1));
899 // search_pv() is the main search function for PV nodes.
901 Value search_pv(Position &pos, SearchStack ss[], Value alpha, Value beta,
902 Depth depth, int ply, int threadID) {
904 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
905 assert(beta > alpha && beta <= VALUE_INFINITE);
906 assert(ply >= 0 && ply < PLY_MAX);
907 assert(threadID >= 0 && threadID < ActiveThreads);
909 // Initialize, and make an early exit in case of an aborted search,
910 // an instant draw, maximum ply reached, etc.
911 if (AbortSearch || thread_should_stop(threadID))
915 return qsearch(pos, ss, alpha, beta, Depth(0), ply, threadID);
917 init_node(pos, ss, ply, threadID);
924 if (ply >= PLY_MAX - 1)
925 return evaluate(pos, ei, threadID);
927 // Mate distance pruning
928 Value oldAlpha = alpha;
929 alpha = Max(value_mated_in(ply), alpha);
930 beta = Min(value_mate_in(ply+1), beta);
934 // Transposition table lookup. At PV nodes, we don't use the TT for
935 // pruning, but only for move ordering.
936 const TTEntry* tte = TT.retrieve(pos);
937 Move ttMove = (tte ? tte->move() : MOVE_NONE);
939 // Go with internal iterative deepening if we don't have a TT move
940 if (UseIIDAtPVNodes && ttMove == MOVE_NONE && depth >= 5*OnePly)
942 search_pv(pos, ss, alpha, beta, depth-2*OnePly, ply, threadID);
943 ttMove = ss[ply].pv[ply];
946 // Initialize a MovePicker object for the current position, and prepare
947 // to search all moves
948 MovePicker mp = MovePicker(pos, true, ttMove, ss[ply], depth);
950 Move move, movesSearched[256];
952 Value value, bestValue = -VALUE_INFINITE;
953 Bitboard dcCandidates = mp.discovered_check_candidates();
954 bool isCheck = pos.is_check();
955 bool mateThreat = MateThreatExtension[1] > Depth(0)
956 && pos.has_mate_threat(opposite_color(pos.side_to_move()));
958 // Loop through all legal moves until no moves remain or a beta cutoff
961 && (move = mp.get_next_move()) != MOVE_NONE
962 && !thread_should_stop(threadID))
964 assert(move_is_ok(move));
966 bool singleReply = (isCheck && mp.number_of_moves() == 1);
967 bool moveIsCheck = pos.move_is_check(move, dcCandidates);
968 bool moveIsCapture = pos.move_is_capture(move);
969 bool moveIsPassedPawnPush = pos.move_is_passed_pawn_push(move);
971 movesSearched[moveCount++] = ss[ply].currentMove = move;
974 ss[ply].currentMoveCaptureValue = pos.midgame_value_of_piece_on(move_to(move));
975 else if (move_is_ep(move))
976 ss[ply].currentMoveCaptureValue = PawnValueMidgame;
978 ss[ply].currentMoveCaptureValue = Value(0);
980 // Decide the new search depth
981 Depth ext = extension(pos, move, true, moveIsCheck, singleReply, mateThreat);
982 Depth newDepth = depth - OnePly + ext;
984 // Make and search the move
986 pos.do_move(move, u, dcCandidates);
988 if (moveCount == 1) // The first move in list is the PV
989 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
992 // Try to reduce non-pv search depth by one ply if move seems not problematic,
993 // if the move fails high will be re-searched at full depth.
994 if ( depth >= 2*OnePly
996 && moveCount >= LMRPVMoves
998 && !move_promotion(move)
999 && !moveIsPassedPawnPush
1000 && !move_is_castle(move)
1001 && !move_is_killer(move, ss[ply]))
1003 ss[ply].reduction = OnePly;
1004 value = -search(pos, ss, -alpha, newDepth-OnePly, ply+1, true, threadID);
1007 value = alpha + 1; // Just to trigger next condition
1009 if (value > alpha) // Go with full depth pv search
1011 ss[ply].reduction = Depth(0);
1012 value = -search(pos, ss, -alpha, newDepth, ply+1, true, threadID);
1013 if (value > alpha && value < beta)
1015 // When the search fails high at ply 1 while searching the first
1016 // move at the root, set the flag failHighPly1. This is used for
1017 // time managment: We don't want to stop the search early in
1018 // such cases, because resolving the fail high at ply 1 could
1019 // result in a big drop in score at the root.
1020 if (ply == 1 && RootMoveNumber == 1)
1021 Threads[threadID].failHighPly1 = true;
1023 // A fail high occurred. Re-search at full window (pv search)
1024 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1025 Threads[threadID].failHighPly1 = false;
1029 pos.undo_move(move, u);
1031 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1034 if (value > bestValue)
1041 if (value == value_mate_in(ply + 1))
1042 ss[ply].mateKiller = move;
1044 // If we are at ply 1, and we are searching the first root move at
1045 // ply 0, set the 'Problem' variable if the score has dropped a lot
1046 // (from the computer's point of view) since the previous iteration:
1047 if (Iteration >= 2 && -value <= ValueByIteration[Iteration-1] - ProblemMargin)
1052 if ( ActiveThreads > 1
1054 && depth >= MinimumSplitDepth
1056 && idle_thread_exists(threadID)
1058 && !thread_should_stop(threadID)
1059 && split(pos, ss, ply, &alpha, &beta, &bestValue, depth,
1060 &moveCount, &mp, dcCandidates, threadID, true))
1064 // All legal moves have been searched. A special case: If there were
1065 // no legal moves, it must be mate or stalemate:
1067 return (isCheck ? value_mated_in(ply) : VALUE_DRAW);
1069 // If the search is not aborted, update the transposition table,
1070 // history counters, and killer moves.
1071 if (AbortSearch || thread_should_stop(threadID))
1074 if (bestValue <= oldAlpha)
1075 TT.store(pos, value_to_tt(bestValue, ply), depth, MOVE_NONE, VALUE_TYPE_UPPER);
1077 else if (bestValue >= beta)
1079 Move m = ss[ply].pv[ply];
1080 if (ok_to_history(pos, m)) // Only non capture moves are considered
1082 update_history(pos, m, depth, movesSearched, moveCount);
1083 update_killers(m, ss[ply]);
1085 TT.store(pos, value_to_tt(bestValue, ply), depth, m, VALUE_TYPE_LOWER);
1088 TT.store(pos, value_to_tt(bestValue, ply), depth, ss[ply].pv[ply], VALUE_TYPE_EXACT);
1094 // search() is the search function for zero-width nodes.
1096 Value search(Position &pos, SearchStack ss[], Value beta, Depth depth,
1097 int ply, bool allowNullmove, int threadID) {
1099 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1100 assert(ply >= 0 && ply < PLY_MAX);
1101 assert(threadID >= 0 && threadID < ActiveThreads);
1105 // Initialize, and make an early exit in case of an aborted search,
1106 // an instant draw, maximum ply reached, etc.
1107 if (AbortSearch || thread_should_stop(threadID))
1111 return qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1113 init_node(pos, ss, ply, threadID);
1118 if (ply >= PLY_MAX - 1)
1119 return evaluate(pos, ei, threadID);
1121 // Mate distance pruning
1122 if (value_mated_in(ply) >= beta)
1125 if (value_mate_in(ply + 1) < beta)
1128 // Transposition table lookup
1129 const TTEntry* tte = TT.retrieve(pos);
1130 Move ttMove = (tte ? tte->move() : MOVE_NONE);
1132 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1134 ss[ply].currentMove = ttMove; // can be MOVE_NONE ?
1135 return value_from_tt(tte->value(), ply);
1138 Value approximateEval = quick_evaluate(pos);
1139 bool mateThreat = false;
1140 bool isCheck = pos.is_check();
1145 && ok_to_do_nullmove(pos)
1146 && approximateEval >= beta - NullMoveMargin)
1148 ss[ply].currentMove = MOVE_NULL;
1151 pos.do_null_move(u);
1152 int R = (depth > 7 ? 4 : 3);
1153 Value nullValue = -search(pos, ss, -(beta-1), depth-R*OnePly, ply+1, false, threadID);
1154 pos.undo_null_move(u);
1156 if (nullValue >= beta)
1158 if (depth < 6 * OnePly)
1161 // Do zugzwang verification search
1162 Value v = search(pos, ss, beta, depth-5*OnePly, ply, false, threadID);
1166 // The null move failed low, which means that we may be faced with
1167 // some kind of threat. If the previous move was reduced, check if
1168 // the move that refuted the null move was somehow connected to the
1169 // move which was reduced. If a connection is found, return a fail
1170 // low score (which will cause the reduced move to fail high in the
1171 // parent node, which will trigger a re-search with full depth).
1172 if (nullValue == value_mated_in(ply + 2))
1175 ss[ply].threatMove = ss[ply + 1].currentMove;
1176 if ( depth < ThreatDepth
1177 && ss[ply - 1].reduction
1178 && connected_moves(pos, ss[ply - 1].currentMove, ss[ply].threatMove))
1182 // Null move search not allowed, try razoring
1183 else if ( (approximateEval < beta - RazorMargin && depth < RazorDepth)
1184 ||(approximateEval < beta - PawnValueMidgame && depth <= OnePly))
1186 Value v = qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1191 // Go with internal iterative deepening if we don't have a TT move
1192 if (UseIIDAtNonPVNodes && ttMove == MOVE_NONE && depth >= 8*OnePly &&
1193 evaluate(pos, ei, threadID) >= beta - IIDMargin)
1195 search(pos, ss, beta, Min(depth/2, depth-2*OnePly), ply, false, threadID);
1196 ttMove = ss[ply].pv[ply];
1199 // Initialize a MovePicker object for the current position, and prepare
1200 // to search all moves:
1201 MovePicker mp = MovePicker(pos, false, ttMove, ss[ply], depth);
1203 Move move, movesSearched[256];
1205 Value value, bestValue = -VALUE_INFINITE;
1206 Bitboard dcCandidates = mp.discovered_check_candidates();
1207 Value futilityValue = VALUE_NONE;
1208 bool useFutilityPruning = UseFutilityPruning
1209 && depth < SelectiveDepth
1212 // Loop through all legal moves until no moves remain or a beta cutoff
1214 while ( bestValue < beta
1215 && (move = mp.get_next_move()) != MOVE_NONE
1216 && !thread_should_stop(threadID))
1218 assert(move_is_ok(move));
1220 bool singleReply = (isCheck && mp.number_of_moves() == 1);
1221 bool moveIsCheck = pos.move_is_check(move, dcCandidates);
1222 bool moveIsCapture = pos.move_is_capture(move);
1223 bool moveIsPassedPawnPush = pos.move_is_passed_pawn_push(move);
1225 movesSearched[moveCount++] = ss[ply].currentMove = move;
1227 // Decide the new search depth
1228 Depth ext = extension(pos, move, false, moveIsCheck, singleReply, mateThreat);
1229 Depth newDepth = depth - OnePly + ext;
1232 if ( useFutilityPruning
1235 && !moveIsPassedPawnPush
1236 && !move_promotion(move))
1238 if ( moveCount >= 2 + int(depth)
1239 && ok_to_prune(pos, move, ss[ply].threatMove, depth))
1242 if (depth < 3 * OnePly && approximateEval < beta)
1244 if (futilityValue == VALUE_NONE)
1245 futilityValue = evaluate(pos, ei, threadID)
1246 + (depth < 2 * OnePly ? FutilityMargin1 : FutilityMargin2);
1248 if (futilityValue < beta)
1250 if (futilityValue > bestValue)
1251 bestValue = futilityValue;
1257 // Make and search the move
1259 pos.do_move(move, u, dcCandidates);
1261 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1262 // if the move fails high will be re-searched at full depth.
1263 if ( depth >= 2*OnePly
1265 && moveCount >= LMRNonPVMoves
1267 && !move_promotion(move)
1268 && !moveIsPassedPawnPush
1269 && !move_is_castle(move)
1270 && !move_is_killer(move, ss[ply]))
1272 ss[ply].reduction = OnePly;
1273 value = -search(pos, ss, -(beta-1), newDepth-OnePly, ply+1, true, threadID);
1276 value = beta; // Just to trigger next condition
1278 if (value >= beta) // Go with full depth non-pv search
1280 ss[ply].reduction = Depth(0);
1281 value = -search(pos, ss, -(beta-1), newDepth, ply+1, true, threadID);
1283 pos.undo_move(move, u);
1285 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1288 if (value > bestValue)
1294 if (value == value_mate_in(ply + 1))
1295 ss[ply].mateKiller = move;
1299 if ( ActiveThreads > 1
1301 && depth >= MinimumSplitDepth
1303 && idle_thread_exists(threadID)
1305 && !thread_should_stop(threadID)
1306 && split(pos, ss, ply, &beta, &beta, &bestValue, depth, &moveCount,
1307 &mp, dcCandidates, threadID, false))
1311 // All legal moves have been searched. A special case: If there were
1312 // no legal moves, it must be mate or stalemate.
1314 return (pos.is_check() ? value_mated_in(ply) : VALUE_DRAW);
1316 // If the search is not aborted, update the transposition table,
1317 // history counters, and killer moves.
1318 if (AbortSearch || thread_should_stop(threadID))
1321 if (bestValue < beta)
1322 TT.store(pos, value_to_tt(bestValue, ply), depth, MOVE_NONE, VALUE_TYPE_UPPER);
1325 Move m = ss[ply].pv[ply];
1326 if (ok_to_history(pos, m)) // Only non capture moves are considered
1328 update_history(pos, m, depth, movesSearched, moveCount);
1329 update_killers(m, ss[ply]);
1331 TT.store(pos, value_to_tt(bestValue, ply), depth, m, VALUE_TYPE_LOWER);
1337 // qsearch() is the quiescence search function, which is called by the main
1338 // search function when the remaining depth is zero (or, to be more precise,
1339 // less than OnePly).
1341 Value qsearch(Position &pos, SearchStack ss[], Value alpha, Value beta,
1342 Depth depth, int ply, int threadID) {
1344 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1345 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1347 assert(ply >= 0 && ply < PLY_MAX);
1348 assert(threadID >= 0 && threadID < ActiveThreads);
1352 // Initialize, and make an early exit in case of an aborted search,
1353 // an instant draw, maximum ply reached, etc.
1354 if (AbortSearch || thread_should_stop(threadID))
1357 init_node(pos, ss, ply, threadID);
1362 // Transposition table lookup
1363 const TTEntry* tte = TT.retrieve(pos);
1364 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1365 return value_from_tt(tte->value(), ply);
1367 // Evaluate the position statically
1368 Value staticValue = evaluate(pos, ei, threadID);
1370 if (ply == PLY_MAX - 1)
1373 // Initialize "stand pat score", and return it immediately if it is
1375 Value bestValue = (pos.is_check() ? -VALUE_INFINITE : staticValue);
1377 if (bestValue >= beta)
1380 if (bestValue > alpha)
1383 // Initialize a MovePicker object for the current position, and prepare
1384 // to search the moves. Because the depth is <= 0 here, only captures,
1385 // queen promotions and checks (only if depth == 0) will be generated.
1386 MovePicker mp = MovePicker(pos, false, MOVE_NONE, EmptySearchStack, depth, &ei);
1389 Bitboard dcCandidates = mp.discovered_check_candidates();
1390 bool isCheck = pos.is_check();
1391 bool pvNode = (beta - alpha != 1);
1392 bool enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1394 // Loop through the moves until no moves remain or a beta cutoff
1396 while ( alpha < beta
1397 && (move = mp.get_next_move()) != MOVE_NONE)
1399 assert(move_is_ok(move));
1401 bool moveIsCheck = pos.move_is_check(move, dcCandidates);
1402 bool moveIsPassedPawnPush = pos.move_is_passed_pawn_push(move);
1405 ss[ply].currentMove = move;
1408 if ( UseQSearchFutilityPruning
1411 && !move_promotion(move)
1412 && !moveIsPassedPawnPush
1416 Value futilityValue = staticValue
1417 + Max(pos.midgame_value_of_piece_on(move_to(move)),
1418 pos.endgame_value_of_piece_on(move_to(move)))
1420 + ei.futilityMargin;
1422 if (futilityValue < alpha)
1424 if (futilityValue > bestValue)
1425 bestValue = futilityValue;
1430 // Don't search captures and checks with negative SEE values
1432 && !move_promotion(move)
1433 && (pos.midgame_value_of_piece_on(move_from(move)) >
1434 pos.midgame_value_of_piece_on(move_to(move)))
1435 && pos.see(move) < 0)
1438 // Make and search the move.
1440 pos.do_move(move, u, dcCandidates);
1441 Value value = -qsearch(pos, ss, -beta, -alpha, depth-OnePly, ply+1, threadID);
1442 pos.undo_move(move, u);
1444 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1447 if (value > bestValue)
1458 // All legal moves have been searched. A special case: If we're in check
1459 // and no legal moves were found, it is checkmate:
1460 if (pos.is_check() && moveCount == 0) // Mate!
1461 return value_mated_in(ply);
1463 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1465 // Update transposition table
1466 TT.store(pos, value_to_tt(bestValue, ply), depth, MOVE_NONE, VALUE_TYPE_EXACT);
1468 // Update killers only for good check moves
1469 Move m = ss[ply].currentMove;
1470 if (alpha >= beta && ok_to_history(pos, m)) // Only non capture moves are considered
1472 // Wrong to update history when depth is <= 0
1473 update_killers(m, ss[ply]);
1479 // sp_search() is used to search from a split point. This function is called
1480 // by each thread working at the split point. It is similar to the normal
1481 // search() function, but simpler. Because we have already probed the hash
1482 // table, done a null move search, and searched the first move before
1483 // splitting, we don't have to repeat all this work in sp_search(). We
1484 // also don't need to store anything to the hash table here: This is taken
1485 // care of after we return from the split point.
1487 void sp_search(SplitPoint *sp, int threadID) {
1489 assert(threadID >= 0 && threadID < ActiveThreads);
1490 assert(ActiveThreads > 1);
1492 Position pos = Position(sp->pos);
1493 SearchStack *ss = sp->sstack[threadID];
1496 bool isCheck = pos.is_check();
1497 bool useFutilityPruning = UseFutilityPruning
1498 && sp->depth < SelectiveDepth
1501 while ( sp->bestValue < sp->beta
1502 && !thread_should_stop(threadID)
1503 && (move = sp->mp->get_next_move(sp->lock)) != MOVE_NONE)
1505 assert(move_is_ok(move));
1507 bool moveIsCheck = pos.move_is_check(move, sp->dcCandidates);
1508 bool moveIsCapture = pos.move_is_capture(move);
1509 bool moveIsPassedPawnPush = pos.move_is_passed_pawn_push(move);
1511 lock_grab(&(sp->lock));
1512 int moveCount = ++sp->moves;
1513 lock_release(&(sp->lock));
1515 ss[sp->ply].currentMove = move;
1517 // Decide the new search depth.
1518 Depth ext = extension(pos, move, false, moveIsCheck, false, false);
1519 Depth newDepth = sp->depth - OnePly + ext;
1522 if ( useFutilityPruning
1525 && !moveIsPassedPawnPush
1526 && !move_promotion(move)
1527 && moveCount >= 2 + int(sp->depth)
1528 && ok_to_prune(pos, move, ss[sp->ply].threatMove, sp->depth))
1531 // Make and search the move.
1533 pos.do_move(move, u, sp->dcCandidates);
1535 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1536 // if the move fails high will be re-searched at full depth.
1537 if ( ext == Depth(0)
1538 && moveCount >= LMRNonPVMoves
1540 && !moveIsPassedPawnPush
1541 && !move_promotion(move)
1542 && !move_is_castle(move)
1543 && !move_is_killer(move, ss[sp->ply]))
1545 ss[sp->ply].reduction = OnePly;
1546 value = -search(pos, ss, -(sp->beta-1), newDepth - OnePly, sp->ply+1, true, threadID);
1549 value = sp->beta; // Just to trigger next condition
1551 if (value >= sp->beta) // Go with full depth non-pv search
1553 ss[sp->ply].reduction = Depth(0);
1554 value = -search(pos, ss, -(sp->beta - 1), newDepth, sp->ply+1, true, threadID);
1556 pos.undo_move(move, u);
1558 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1560 if (thread_should_stop(threadID))
1564 lock_grab(&(sp->lock));
1565 if (value > sp->bestValue && !thread_should_stop(threadID))
1567 sp->bestValue = value;
1568 if (sp->bestValue >= sp->beta)
1570 sp_update_pv(sp->parentSstack, ss, sp->ply);
1571 for (int i = 0; i < ActiveThreads; i++)
1572 if (i != threadID && (i == sp->master || sp->slaves[i]))
1573 Threads[i].stop = true;
1575 sp->finished = true;
1578 lock_release(&(sp->lock));
1581 lock_grab(&(sp->lock));
1583 // If this is the master thread and we have been asked to stop because of
1584 // a beta cutoff higher up in the tree, stop all slave threads:
1585 if (sp->master == threadID && thread_should_stop(threadID))
1586 for (int i = 0; i < ActiveThreads; i++)
1588 Threads[i].stop = true;
1591 sp->slaves[threadID] = 0;
1593 lock_release(&(sp->lock));
1597 // sp_search_pv() is used to search from a PV split point. This function
1598 // is called by each thread working at the split point. It is similar to
1599 // the normal search_pv() function, but simpler. Because we have already
1600 // probed the hash table and searched the first move before splitting, we
1601 // don't have to repeat all this work in sp_search_pv(). We also don't
1602 // need to store anything to the hash table here: This is taken care of
1603 // after we return from the split point.
1605 void sp_search_pv(SplitPoint *sp, int threadID) {
1607 assert(threadID >= 0 && threadID < ActiveThreads);
1608 assert(ActiveThreads > 1);
1610 Position pos = Position(sp->pos);
1611 SearchStack *ss = sp->sstack[threadID];
1615 while ( sp->alpha < sp->beta
1616 && !thread_should_stop(threadID)
1617 && (move = sp->mp->get_next_move(sp->lock)) != MOVE_NONE)
1619 bool moveIsCheck = pos.move_is_check(move, sp->dcCandidates);
1620 bool moveIsCapture = pos.move_is_capture(move);
1621 bool moveIsPassedPawnPush = pos.move_is_passed_pawn_push(move);
1623 assert(move_is_ok(move));
1625 ss[sp->ply].currentMoveCaptureValue = move_is_ep(move)?
1626 PawnValueMidgame : pos.midgame_value_of_piece_on(move_to(move));
1628 lock_grab(&(sp->lock));
1629 int moveCount = ++sp->moves;
1630 lock_release(&(sp->lock));
1632 ss[sp->ply].currentMove = move;
1634 // Decide the new search depth.
1635 Depth ext = extension(pos, move, true, moveIsCheck, false, false);
1636 Depth newDepth = sp->depth - OnePly + ext;
1638 // Make and search the move.
1640 pos.do_move(move, u, sp->dcCandidates);
1642 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1643 // if the move fails high will be re-searched at full depth.
1644 if ( ext == Depth(0)
1645 && moveCount >= LMRPVMoves
1647 && !moveIsPassedPawnPush
1648 && !move_promotion(move)
1649 && !move_is_castle(move)
1650 && !move_is_killer(move, ss[sp->ply]))
1652 ss[sp->ply].reduction = OnePly;
1653 value = -search(pos, ss, -sp->alpha, newDepth - OnePly, sp->ply+1, true, threadID);
1656 value = sp->alpha + 1; // Just to trigger next condition
1658 if (value > sp->alpha) // Go with full depth non-pv search
1660 ss[sp->ply].reduction = Depth(0);
1661 value = -search(pos, ss, -sp->alpha, newDepth, sp->ply+1, true, threadID);
1663 if (value > sp->alpha && value < sp->beta)
1665 // When the search fails high at ply 1 while searching the first
1666 // move at the root, set the flag failHighPly1. This is used for
1667 // time managment: We don't want to stop the search early in
1668 // such cases, because resolving the fail high at ply 1 could
1669 // result in a big drop in score at the root.
1670 if (sp->ply == 1 && RootMoveNumber == 1)
1671 Threads[threadID].failHighPly1 = true;
1673 value = -search_pv(pos, ss, -sp->beta, -sp->alpha, newDepth, sp->ply+1, threadID);
1674 Threads[threadID].failHighPly1 = false;
1677 pos.undo_move(move, u);
1679 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1681 if (thread_should_stop(threadID))
1685 lock_grab(&(sp->lock));
1686 if (value > sp->bestValue && !thread_should_stop(threadID))
1688 sp->bestValue = value;
1689 if (value > sp->alpha)
1692 sp_update_pv(sp->parentSstack, ss, sp->ply);
1693 if (value == value_mate_in(sp->ply + 1))
1694 ss[sp->ply].mateKiller = move;
1696 if(value >= sp->beta)
1698 for(int i = 0; i < ActiveThreads; i++)
1699 if(i != threadID && (i == sp->master || sp->slaves[i]))
1700 Threads[i].stop = true;
1702 sp->finished = true;
1705 // If we are at ply 1, and we are searching the first root move at
1706 // ply 0, set the 'Problem' variable if the score has dropped a lot
1707 // (from the computer's point of view) since the previous iteration:
1708 if (Iteration >= 2 && -value <= ValueByIteration[Iteration-1] - ProblemMargin)
1711 lock_release(&(sp->lock));
1714 lock_grab(&(sp->lock));
1716 // If this is the master thread and we have been asked to stop because of
1717 // a beta cutoff higher up in the tree, stop all slave threads:
1718 if (sp->master == threadID && thread_should_stop(threadID))
1719 for (int i = 0; i < ActiveThreads; i++)
1721 Threads[i].stop = true;
1724 sp->slaves[threadID] = 0;
1726 lock_release(&(sp->lock));
1730 /// The RootMove class
1734 RootMove::RootMove() {
1735 nodes = cumulativeNodes = 0ULL;
1738 // RootMove::operator<() is the comparison function used when
1739 // sorting the moves. A move m1 is considered to be better
1740 // than a move m2 if it has a higher score, or if the moves
1741 // have equal score but m1 has the higher node count.
1743 bool RootMove::operator<(const RootMove& m) {
1745 if (score != m.score)
1746 return (score < m.score);
1748 return nodes <= m.nodes;
1751 /// The RootMoveList class
1755 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) : count(0) {
1757 MoveStack mlist[MaxRootMoves];
1758 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
1760 // Generate all legal moves
1761 int lm_count = generate_legal_moves(pos, mlist);
1763 // Add each move to the moves[] array
1764 for (int i = 0; i < lm_count; i++)
1766 bool includeMove = includeAllMoves;
1768 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
1769 includeMove = (searchMoves[k] == mlist[i].move);
1773 // Find a quick score for the move
1775 SearchStack ss[PLY_MAX_PLUS_2];
1777 moves[count].move = mlist[i].move;
1778 moves[count].nodes = 0ULL;
1779 pos.do_move(moves[count].move, u);
1780 moves[count].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE,
1782 pos.undo_move(moves[count].move, u);
1783 moves[count].pv[0] = moves[i].move;
1784 moves[count].pv[1] = MOVE_NONE; // FIXME
1792 // Simple accessor methods for the RootMoveList class
1794 inline Move RootMoveList::get_move(int moveNum) const {
1795 return moves[moveNum].move;
1798 inline Value RootMoveList::get_move_score(int moveNum) const {
1799 return moves[moveNum].score;
1802 inline void RootMoveList::set_move_score(int moveNum, Value score) {
1803 moves[moveNum].score = score;
1806 inline void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) {
1807 moves[moveNum].nodes = nodes;
1808 moves[moveNum].cumulativeNodes += nodes;
1811 void RootMoveList::set_move_pv(int moveNum, const Move pv[]) {
1813 for(j = 0; pv[j] != MOVE_NONE; j++)
1814 moves[moveNum].pv[j] = pv[j];
1815 moves[moveNum].pv[j] = MOVE_NONE;
1818 inline Move RootMoveList::get_move_pv(int moveNum, int i) const {
1819 return moves[moveNum].pv[i];
1822 inline int64_t RootMoveList::get_move_cumulative_nodes(int moveNum) const {
1823 return moves[moveNum].cumulativeNodes;
1826 inline int RootMoveList::move_count() const {
1831 // RootMoveList::scan_for_easy_move() is called at the end of the first
1832 // iteration, and is used to detect an "easy move", i.e. a move which appears
1833 // to be much bester than all the rest. If an easy move is found, the move
1834 // is returned, otherwise the function returns MOVE_NONE. It is very
1835 // important that this function is called at the right moment: The code
1836 // assumes that the first iteration has been completed and the moves have
1837 // been sorted. This is done in RootMoveList c'tor.
1839 Move RootMoveList::scan_for_easy_move() const {
1846 // moves are sorted so just consider the best and the second one
1847 if (get_move_score(0) > get_move_score(1) + EasyMoveMargin)
1853 // RootMoveList::sort() sorts the root move list at the beginning of a new
1856 inline void RootMoveList::sort() {
1858 sort_multipv(count - 1); // all items
1862 // RootMoveList::sort_multipv() sorts the first few moves in the root move
1863 // list by their scores and depths. It is used to order the different PVs
1864 // correctly in MultiPV mode.
1866 void RootMoveList::sort_multipv(int n) {
1868 for (int i = 1; i <= n; i++)
1870 RootMove rm = moves[i];
1872 for (j = i; j > 0 && moves[j-1] < rm; j--)
1873 moves[j] = moves[j-1];
1879 // init_search_stack() initializes a search stack at the beginning of a
1880 // new search from the root.
1881 void init_search_stack(SearchStack& ss) {
1883 ss.pv[0] = MOVE_NONE;
1884 ss.pv[1] = MOVE_NONE;
1885 ss.currentMove = MOVE_NONE;
1886 ss.threatMove = MOVE_NONE;
1887 ss.reduction = Depth(0);
1888 for (int j = 0; j < KILLER_MAX; j++)
1889 ss.killers[j] = MOVE_NONE;
1892 void init_search_stack(SearchStack ss[]) {
1894 for (int i = 0; i < 3; i++)
1896 ss[i].pv[i] = MOVE_NONE;
1897 ss[i].pv[i+1] = MOVE_NONE;
1898 ss[i].currentMove = MOVE_NONE;
1899 ss[i].threatMove = MOVE_NONE;
1900 ss[i].reduction = Depth(0);
1901 for (int j = 0; j < KILLER_MAX; j++)
1902 ss[i].killers[j] = MOVE_NONE;
1907 // init_node() is called at the beginning of all the search functions
1908 // (search(), search_pv(), qsearch(), and so on) and initializes the search
1909 // stack object corresponding to the current node. Once every
1910 // NodesBetweenPolls nodes, init_node() also calls poll(), which polls
1911 // for user input and checks whether it is time to stop the search.
1913 void init_node(const Position &pos, SearchStack ss[], int ply, int threadID) {
1914 assert(ply >= 0 && ply < PLY_MAX);
1915 assert(threadID >= 0 && threadID < ActiveThreads);
1917 Threads[threadID].nodes++;
1921 if(NodesSincePoll >= NodesBetweenPolls) {
1927 ss[ply].pv[ply] = ss[ply].pv[ply+1] = ss[ply].currentMove = MOVE_NONE;
1928 ss[ply+2].mateKiller = MOVE_NONE;
1929 ss[ply].threatMove = MOVE_NONE;
1930 ss[ply].reduction = Depth(0);
1931 ss[ply].currentMoveCaptureValue = Value(0);
1932 for (int j = 0; j < KILLER_MAX; j++)
1933 ss[ply+2].killers[j] = MOVE_NONE;
1935 if(Threads[threadID].printCurrentLine)
1936 print_current_line(ss, ply, threadID);
1940 // update_pv() is called whenever a search returns a value > alpha. It
1941 // updates the PV in the SearchStack object corresponding to the current
1944 void update_pv(SearchStack ss[], int ply) {
1945 assert(ply >= 0 && ply < PLY_MAX);
1947 ss[ply].pv[ply] = ss[ply].currentMove;
1949 for(p = ply + 1; ss[ply+1].pv[p] != MOVE_NONE; p++)
1950 ss[ply].pv[p] = ss[ply+1].pv[p];
1951 ss[ply].pv[p] = MOVE_NONE;
1955 // sp_update_pv() is a variant of update_pv for use at split points. The
1956 // difference between the two functions is that sp_update_pv also updates
1957 // the PV at the parent node.
1959 void sp_update_pv(SearchStack *pss, SearchStack ss[], int ply) {
1960 assert(ply >= 0 && ply < PLY_MAX);
1962 ss[ply].pv[ply] = pss[ply].pv[ply] = ss[ply].currentMove;
1964 for(p = ply + 1; ss[ply+1].pv[p] != MOVE_NONE; p++)
1965 ss[ply].pv[p] = pss[ply].pv[p] = ss[ply+1].pv[p];
1966 ss[ply].pv[p] = pss[ply].pv[p] = MOVE_NONE;
1970 // connected_moves() tests whether two moves are 'connected' in the sense
1971 // that the first move somehow made the second move possible (for instance
1972 // if the moving piece is the same in both moves). The first move is
1973 // assumed to be the move that was made to reach the current position, while
1974 // the second move is assumed to be a move from the current position.
1976 bool connected_moves(const Position &pos, Move m1, Move m2) {
1977 Square f1, t1, f2, t2;
1979 assert(move_is_ok(m1));
1980 assert(move_is_ok(m2));
1985 // Case 1: The moving piece is the same in both moves.
1991 // Case 2: The destination square for m2 was vacated by m1.
1997 // Case 3: Moving through the vacated square:
1998 if(piece_is_slider(pos.piece_on(f2)) &&
1999 bit_is_set(squares_between(f2, t2), f1))
2002 // Case 4: The destination square for m2 is attacked by the moving piece
2004 if(pos.piece_attacks_square(t1, t2))
2007 // Case 5: Discovered check, checking piece is the piece moved in m1:
2008 if(piece_is_slider(pos.piece_on(t1)) &&
2009 bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())),
2011 !bit_is_set(squares_between(t2, pos.king_square(pos.side_to_move())),
2013 Bitboard occ = pos.occupied_squares();
2014 Color us = pos.side_to_move();
2015 Square ksq = pos.king_square(us);
2016 clear_bit(&occ, f2);
2017 if(pos.type_of_piece_on(t1) == BISHOP) {
2018 if(bit_is_set(bishop_attacks_bb(ksq, occ), t1))
2021 else if(pos.type_of_piece_on(t1) == ROOK) {
2022 if(bit_is_set(rook_attacks_bb(ksq, occ), t1))
2026 assert(pos.type_of_piece_on(t1) == QUEEN);
2027 if(bit_is_set(queen_attacks_bb(ksq, occ), t1))
2036 // move_is_killer() checks if the given move is among the
2037 // killer moves of that ply.
2039 bool move_is_killer(Move m, const SearchStack& ss) {
2041 const Move* k = ss.killers;
2042 for (int i = 0; i < KILLER_MAX; i++, k++)
2050 // extension() decides whether a move should be searched with normal depth,
2051 // or with extended depth. Certain classes of moves (checking moves, in
2052 // particular) are searched with bigger depth than ordinary moves.
2054 Depth extension(const Position &pos, Move m, bool pvNode,
2055 bool check, bool singleReply, bool mateThreat) {
2057 Depth result = Depth(0);
2060 result += CheckExtension[pvNode];
2063 result += SingleReplyExtension[pvNode];
2065 if (pos.move_is_pawn_push_to_7th(m))
2066 result += PawnPushTo7thExtension[pvNode];
2068 if (pos.move_is_passed_pawn_push(m))
2069 result += PassedPawnExtension[pvNode];
2072 result += MateThreatExtension[pvNode];
2074 if ( pos.midgame_value_of_piece_on(move_to(m)) >= RookValueMidgame
2075 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
2076 - pos.midgame_value_of_piece_on(move_to(m)) == Value(0))
2077 && !move_promotion(m))
2078 result += PawnEndgameExtension[pvNode];
2081 && pos.move_is_capture(m)
2082 && pos.type_of_piece_on(move_to(m)) != PAWN
2086 return Min(result, OnePly);
2090 // ok_to_do_nullmove() looks at the current position and decides whether
2091 // doing a 'null move' should be allowed. In order to avoid zugzwang
2092 // problems, null moves are not allowed when the side to move has very
2093 // little material left. Currently, the test is a bit too simple: Null
2094 // moves are avoided only when the side to move has only pawns left. It's
2095 // probably a good idea to avoid null moves in at least some more
2096 // complicated endgames, e.g. KQ vs KR. FIXME
2098 bool ok_to_do_nullmove(const Position &pos) {
2099 if(pos.non_pawn_material(pos.side_to_move()) == Value(0))
2105 // ok_to_prune() tests whether it is safe to forward prune a move. Only
2106 // non-tactical moves late in the move list close to the leaves are
2107 // candidates for pruning.
2109 bool ok_to_prune(const Position &pos, Move m, Move threat, Depth d) {
2110 Square mfrom, mto, tfrom, tto;
2112 assert(move_is_ok(m));
2113 assert(threat == MOVE_NONE || move_is_ok(threat));
2114 assert(!move_promotion(m));
2115 assert(!pos.move_is_check(m));
2116 assert(!pos.move_is_capture(m));
2117 assert(!pos.move_is_passed_pawn_push(m));
2118 assert(d >= OnePly);
2120 mfrom = move_from(m);
2122 tfrom = move_from(threat);
2123 tto = move_to(threat);
2125 // Case 1: Castling moves are never pruned.
2126 if(move_is_castle(m))
2129 // Case 2: Don't prune moves which move the threatened piece
2130 if(!PruneEscapeMoves && threat != MOVE_NONE && mfrom == tto)
2133 // Case 3: If the threatened piece has value less than or equal to the
2134 // value of the threatening piece, don't prune move which defend it.
2135 if(!PruneDefendingMoves && threat != MOVE_NONE
2136 && (piece_value_midgame(pos.piece_on(tfrom))
2137 >= piece_value_midgame(pos.piece_on(tto)))
2138 && pos.move_attacks_square(m, tto))
2141 // Case 4: Don't prune moves with good history.
2142 if(!H.ok_to_prune(pos.piece_on(move_from(m)), m, d))
2145 // Case 5: If the moving piece in the threatened move is a slider, don't
2146 // prune safe moves which block its ray.
2147 if(!PruneBlockingMoves && threat != MOVE_NONE
2148 && piece_is_slider(pos.piece_on(tfrom))
2149 && bit_is_set(squares_between(tfrom, tto), mto) && pos.see(m) >= 0)
2156 // ok_to_use_TT() returns true if a transposition table score
2157 // can be used at a given point in search.
2159 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
2161 Value v = value_from_tt(tte->value(), ply);
2163 return ( tte->depth() >= depth
2164 || v >= Max(value_mate_in(100), beta)
2165 || v < Min(value_mated_in(100), beta))
2167 && ( (is_lower_bound(tte->type()) && v >= beta)
2168 || (is_upper_bound(tte->type()) && v < beta));
2172 // ok_to_history() returns true if a move m can be stored
2173 // in history. Should be a non capturing move nor a promotion.
2175 bool ok_to_history(const Position& pos, Move m) {
2177 return !pos.move_is_capture(m) && !move_promotion(m);
2181 // update_history() registers a good move that produced a beta-cutoff
2182 // in history and marks as failures all the other moves of that ply.
2184 void update_history(const Position& pos, Move m, Depth depth,
2185 Move movesSearched[], int moveCount) {
2187 H.success(pos.piece_on(move_from(m)), m, depth);
2189 for (int i = 0; i < moveCount - 1; i++)
2191 assert(m != movesSearched[i]);
2192 if (ok_to_history(pos, movesSearched[i]))
2193 H.failure(pos.piece_on(move_from(movesSearched[i])), movesSearched[i]);
2198 // update_killers() add a good move that produced a beta-cutoff
2199 // among the killer moves of that ply.
2201 void update_killers(Move m, SearchStack& ss) {
2203 if (m == ss.killers[0])
2206 for (int i = KILLER_MAX - 1; i > 0; i--)
2207 ss.killers[i] = ss.killers[i - 1];
2212 // fail_high_ply_1() checks if some thread is currently resolving a fail
2213 // high at ply 1 at the node below the first root node. This information
2214 // is used for time managment.
2216 bool fail_high_ply_1() {
2217 for(int i = 0; i < ActiveThreads; i++)
2218 if(Threads[i].failHighPly1)
2224 // current_search_time() returns the number of milliseconds which have passed
2225 // since the beginning of the current search.
2227 int current_search_time() {
2228 return get_system_time() - SearchStartTime;
2232 // nps() computes the current nodes/second count.
2235 int t = current_search_time();
2236 return (t > 0)? int((nodes_searched() * 1000) / t) : 0;
2240 // poll() performs two different functions: It polls for user input, and it
2241 // looks at the time consumed so far and decides if it's time to abort the
2246 static int lastInfoTime;
2247 int t = current_search_time();
2252 // We are line oriented, don't read single chars
2253 std::string command;
2254 if (!std::getline(std::cin, command))
2257 if (command == "quit")
2260 PonderSearch = false;
2263 else if(command == "stop")
2266 PonderSearch = false;
2268 else if(command == "ponderhit")
2271 // Print search information
2275 else if (lastInfoTime > t)
2276 // HACK: Must be a new search where we searched less than
2277 // NodesBetweenPolls nodes during the first second of search.
2280 else if (t - lastInfoTime >= 1000)
2287 if (dbg_show_hit_rate)
2288 dbg_print_hit_rate();
2290 std::cout << "info nodes " << nodes_searched() << " nps " << nps()
2291 << " time " << t << " hashfull " << TT.full() << std::endl;
2292 lock_release(&IOLock);
2293 if (ShowCurrentLine)
2294 Threads[0].printCurrentLine = true;
2296 // Should we stop the search?
2300 bool overTime = t > AbsoluteMaxSearchTime
2301 || (RootMoveNumber == 1 && t > MaxSearchTime + ExtraSearchTime)
2302 || ( !FailHigh && !fail_high_ply_1() && !Problem
2303 && t > 6*(MaxSearchTime + ExtraSearchTime));
2305 if ( (Iteration >= 2 && (!InfiniteSearch && overTime))
2306 || (ExactMaxTime && t >= ExactMaxTime)
2307 || (Iteration >= 3 && MaxNodes && nodes_searched() >= MaxNodes))
2312 // ponderhit() is called when the program is pondering (i.e. thinking while
2313 // it's the opponent's turn to move) in order to let the engine know that
2314 // it correctly predicted the opponent's move.
2317 int t = current_search_time();
2318 PonderSearch = false;
2319 if(Iteration >= 2 &&
2320 (!InfiniteSearch && (StopOnPonderhit ||
2321 t > AbsoluteMaxSearchTime ||
2322 (RootMoveNumber == 1 &&
2323 t > MaxSearchTime + ExtraSearchTime) ||
2324 (!FailHigh && !fail_high_ply_1() && !Problem &&
2325 t > 6*(MaxSearchTime + ExtraSearchTime)))))
2330 // print_current_line() prints the current line of search for a given
2331 // thread. Called when the UCI option UCI_ShowCurrLine is 'true'.
2333 void print_current_line(SearchStack ss[], int ply, int threadID) {
2334 assert(ply >= 0 && ply < PLY_MAX);
2335 assert(threadID >= 0 && threadID < ActiveThreads);
2337 if(!Threads[threadID].idle) {
2339 std::cout << "info currline " << (threadID + 1);
2340 for(int p = 0; p < ply; p++)
2341 std::cout << " " << ss[p].currentMove;
2342 std::cout << std::endl;
2343 lock_release(&IOLock);
2345 Threads[threadID].printCurrentLine = false;
2346 if(threadID + 1 < ActiveThreads)
2347 Threads[threadID + 1].printCurrentLine = true;
2351 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2352 // while the program is pondering. The point is to work around a wrinkle in
2353 // the UCI protocol: When pondering, the engine is not allowed to give a
2354 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2355 // We simply wait here until one of these commands is sent, and return,
2356 // after which the bestmove and pondermove will be printed (in id_loop()).
2358 void wait_for_stop_or_ponderhit() {
2359 std::string command;
2362 if(!std::getline(std::cin, command))
2365 if(command == "quit") {
2366 OpeningBook.close();
2371 else if(command == "ponderhit" || command == "stop")
2377 // idle_loop() is where the threads are parked when they have no work to do.
2378 // The parameter "waitSp", if non-NULL, is a pointer to an active SplitPoint
2379 // object for which the current thread is the master.
2381 void idle_loop(int threadID, SplitPoint *waitSp) {
2382 assert(threadID >= 0 && threadID < THREAD_MAX);
2384 Threads[threadID].running = true;
2387 if(AllThreadsShouldExit && threadID != 0)
2390 // If we are not thinking, wait for a condition to be signaled instead
2391 // of wasting CPU time polling for work:
2392 while(threadID != 0 && (Idle || threadID >= ActiveThreads)) {
2393 #if !defined(_MSC_VER)
2394 pthread_mutex_lock(&WaitLock);
2395 if(Idle || threadID >= ActiveThreads)
2396 pthread_cond_wait(&WaitCond, &WaitLock);
2397 pthread_mutex_unlock(&WaitLock);
2399 WaitForSingleObject(SitIdleEvent[threadID], INFINITE);
2403 // If this thread has been assigned work, launch a search:
2404 if(Threads[threadID].workIsWaiting) {
2405 Threads[threadID].workIsWaiting = false;
2406 if(Threads[threadID].splitPoint->pvNode)
2407 sp_search_pv(Threads[threadID].splitPoint, threadID);
2409 sp_search(Threads[threadID].splitPoint, threadID);
2410 Threads[threadID].idle = true;
2413 // If this thread is the master of a split point and all threads have
2414 // finished their work at this split point, return from the idle loop:
2415 if(waitSp != NULL && waitSp->cpus == 0)
2419 Threads[threadID].running = false;
2423 // init_split_point_stack() is called during program initialization, and
2424 // initializes all split point objects.
2426 void init_split_point_stack() {
2427 for(int i = 0; i < THREAD_MAX; i++)
2428 for(int j = 0; j < MaxActiveSplitPoints; j++) {
2429 SplitPointStack[i][j].parent = NULL;
2430 lock_init(&(SplitPointStack[i][j].lock), NULL);
2435 // destroy_split_point_stack() is called when the program exits, and
2436 // destroys all locks in the precomputed split point objects.
2438 void destroy_split_point_stack() {
2439 for(int i = 0; i < THREAD_MAX; i++)
2440 for(int j = 0; j < MaxActiveSplitPoints; j++)
2441 lock_destroy(&(SplitPointStack[i][j].lock));
2445 // thread_should_stop() checks whether the thread with a given threadID has
2446 // been asked to stop, directly or indirectly. This can happen if a beta
2447 // cutoff has occured in thre thread's currently active split point, or in
2448 // some ancestor of the current split point.
2450 bool thread_should_stop(int threadID) {
2451 assert(threadID >= 0 && threadID < ActiveThreads);
2455 if(Threads[threadID].stop)
2457 if(ActiveThreads <= 2)
2459 for(sp = Threads[threadID].splitPoint; sp != NULL; sp = sp->parent)
2461 Threads[threadID].stop = true;
2468 // thread_is_available() checks whether the thread with threadID "slave" is
2469 // available to help the thread with threadID "master" at a split point. An
2470 // obvious requirement is that "slave" must be idle. With more than two
2471 // threads, this is not by itself sufficient: If "slave" is the master of
2472 // some active split point, it is only available as a slave to the other
2473 // threads which are busy searching the split point at the top of "slave"'s
2474 // split point stack (the "helpful master concept" in YBWC terminology).
2476 bool thread_is_available(int slave, int master) {
2477 assert(slave >= 0 && slave < ActiveThreads);
2478 assert(master >= 0 && master < ActiveThreads);
2479 assert(ActiveThreads > 1);
2481 if(!Threads[slave].idle || slave == master)
2484 if(Threads[slave].activeSplitPoints == 0)
2485 // No active split points means that the thread is available as a slave
2486 // for any other thread.
2489 if(ActiveThreads == 2)
2492 // Apply the "helpful master" concept if possible.
2493 if(SplitPointStack[slave][Threads[slave].activeSplitPoints-1].slaves[master])
2500 // idle_thread_exists() tries to find an idle thread which is available as
2501 // a slave for the thread with threadID "master".
2503 bool idle_thread_exists(int master) {
2504 assert(master >= 0 && master < ActiveThreads);
2505 assert(ActiveThreads > 1);
2507 for(int i = 0; i < ActiveThreads; i++)
2508 if(thread_is_available(i, master))
2514 // split() does the actual work of distributing the work at a node between
2515 // several threads at PV nodes. If it does not succeed in splitting the
2516 // node (because no idle threads are available, or because we have no unused
2517 // split point objects), the function immediately returns false. If
2518 // splitting is possible, a SplitPoint object is initialized with all the
2519 // data that must be copied to the helper threads (the current position and
2520 // search stack, alpha, beta, the search depth, etc.), and we tell our
2521 // helper threads that they have been assigned work. This will cause them
2522 // to instantly leave their idle loops and call sp_search_pv(). When all
2523 // threads have returned from sp_search_pv (or, equivalently, when
2524 // splitPoint->cpus becomes 0), split() returns true.
2526 bool split(const Position &p, SearchStack *sstck, int ply,
2527 Value *alpha, Value *beta, Value *bestValue,
2528 Depth depth, int *moves,
2529 MovePicker *mp, Bitboard dcCandidates, int master, bool pvNode) {
2531 assert(sstck != NULL);
2532 assert(ply >= 0 && ply < PLY_MAX);
2533 assert(*bestValue >= -VALUE_INFINITE && *bestValue <= *alpha);
2534 assert(!pvNode || *alpha < *beta);
2535 assert(*beta <= VALUE_INFINITE);
2536 assert(depth > Depth(0));
2537 assert(master >= 0 && master < ActiveThreads);
2538 assert(ActiveThreads > 1);
2540 SplitPoint *splitPoint;
2545 // If no other thread is available to help us, or if we have too many
2546 // active split points, don't split:
2547 if(!idle_thread_exists(master) ||
2548 Threads[master].activeSplitPoints >= MaxActiveSplitPoints) {
2549 lock_release(&MPLock);
2553 // Pick the next available split point object from the split point stack:
2554 splitPoint = SplitPointStack[master] + Threads[master].activeSplitPoints;
2555 Threads[master].activeSplitPoints++;
2557 // Initialize the split point object:
2558 splitPoint->parent = Threads[master].splitPoint;
2559 splitPoint->finished = false;
2560 splitPoint->ply = ply;
2561 splitPoint->depth = depth;
2562 splitPoint->alpha = pvNode? *alpha : (*beta - 1);
2563 splitPoint->beta = *beta;
2564 splitPoint->pvNode = pvNode;
2565 splitPoint->dcCandidates = dcCandidates;
2566 splitPoint->bestValue = *bestValue;
2567 splitPoint->master = master;
2568 splitPoint->mp = mp;
2569 splitPoint->moves = *moves;
2570 splitPoint->cpus = 1;
2571 splitPoint->pos.copy(p);
2572 splitPoint->parentSstack = sstck;
2573 for(i = 0; i < ActiveThreads; i++)
2574 splitPoint->slaves[i] = 0;
2576 // Copy the current position and the search stack to the master thread:
2577 memcpy(splitPoint->sstack[master], sstck, (ply+1)*sizeof(SearchStack));
2578 Threads[master].splitPoint = splitPoint;
2580 // Make copies of the current position and search stack for each thread:
2581 for(i = 0; i < ActiveThreads && splitPoint->cpus < MaxThreadsPerSplitPoint;
2583 if(thread_is_available(i, master)) {
2584 memcpy(splitPoint->sstack[i], sstck, (ply+1)*sizeof(SearchStack));
2585 Threads[i].splitPoint = splitPoint;
2586 splitPoint->slaves[i] = 1;
2590 // Tell the threads that they have work to do. This will make them leave
2592 for(i = 0; i < ActiveThreads; i++)
2593 if(i == master || splitPoint->slaves[i]) {
2594 Threads[i].workIsWaiting = true;
2595 Threads[i].idle = false;
2596 Threads[i].stop = false;
2599 lock_release(&MPLock);
2601 // Everything is set up. The master thread enters the idle loop, from
2602 // which it will instantly launch a search, because its workIsWaiting
2603 // slot is 'true'. We send the split point as a second parameter to the
2604 // idle loop, which means that the main thread will return from the idle
2605 // loop when all threads have finished their work at this split point
2606 // (i.e. when // splitPoint->cpus == 0).
2607 idle_loop(master, splitPoint);
2609 // We have returned from the idle loop, which means that all threads are
2610 // finished. Update alpha, beta and bestvalue, and return:
2612 if(pvNode) *alpha = splitPoint->alpha;
2613 *beta = splitPoint->beta;
2614 *bestValue = splitPoint->bestValue;
2615 Threads[master].stop = false;
2616 Threads[master].idle = false;
2617 Threads[master].activeSplitPoints--;
2618 Threads[master].splitPoint = splitPoint->parent;
2619 lock_release(&MPLock);
2625 // wake_sleeping_threads() wakes up all sleeping threads when it is time
2626 // to start a new search from the root.
2628 void wake_sleeping_threads() {
2629 if(ActiveThreads > 1) {
2630 for(int i = 1; i < ActiveThreads; i++) {
2631 Threads[i].idle = true;
2632 Threads[i].workIsWaiting = false;
2634 #if !defined(_MSC_VER)
2635 pthread_mutex_lock(&WaitLock);
2636 pthread_cond_broadcast(&WaitCond);
2637 pthread_mutex_unlock(&WaitLock);
2639 for(int i = 1; i < THREAD_MAX; i++)
2640 SetEvent(SitIdleEvent[i]);
2646 // init_thread() is the function which is called when a new thread is
2647 // launched. It simply calls the idle_loop() function with the supplied
2648 // threadID. There are two versions of this function; one for POSIX threads
2649 // and one for Windows threads.
2651 #if !defined(_MSC_VER)
2653 void *init_thread(void *threadID) {
2654 idle_loop(*(int *)threadID, NULL);
2660 DWORD WINAPI init_thread(LPVOID threadID) {
2661 idle_loop(*(int *)threadID, NULL);