2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2009 Marco Costalba
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
43 #include "ucioption.h"
49 //// Local definitions
56 // IterationInfoType stores search results for each iteration
58 // Because we use relatively small (dynamic) aspiration window,
59 // there happens many fail highs and fail lows in root. And
60 // because we don't do researches in those cases, "value" stored
61 // here is not necessarily exact. Instead in case of fail high/low
62 // we guess what the right value might be and store our guess
63 // as a "speculated value" and then move on. Speculated values are
64 // used just to calculate aspiration window width, so also if are
65 // not exact is not big a problem.
67 struct IterationInfoType {
69 IterationInfoType(Value v = Value(0), Value sv = Value(0))
70 : value(v), speculatedValue(sv) {}
72 Value value, speculatedValue;
76 // The BetaCounterType class is used to order moves at ply one.
77 // Apart for the first one that has its score, following moves
78 // normally have score -VALUE_INFINITE, so are ordered according
79 // to the number of beta cutoffs occurred under their subtree during
80 // the last iteration. The counters are per thread variables to avoid
81 // concurrent accessing under SMP case.
83 struct BetaCounterType {
87 void add(Color us, Depth d, int threadID);
88 void read(Color us, int64_t& our, int64_t& their);
92 // The RootMove class is used for moves at the root at the tree. For each
93 // root move, we store a score, a node count, and a PV (really a refutation
94 // in the case of moves which fail low).
98 RootMove() { nodes = cumulativeNodes = ourBeta = theirBeta = 0ULL; }
100 // RootMove::operator<() is the comparison function used when
101 // sorting the moves. A move m1 is considered to be better
102 // than a move m2 if it has a higher score, or if the moves
103 // have equal score but m1 has the higher node count.
104 bool operator<(const RootMove& m) const {
106 return score != m.score ? score < m.score : theirBeta <= m.theirBeta;
111 int64_t nodes, cumulativeNodes, ourBeta, theirBeta;
112 Move pv[PLY_MAX_PLUS_2];
116 // The RootMoveList class is essentially an array of RootMove objects, with
117 // a handful of methods for accessing the data in the individual moves.
122 RootMoveList(Position& pos, Move searchMoves[]);
124 int move_count() const { return count; }
125 Move get_move(int moveNum) const { return moves[moveNum].move; }
126 Value get_move_score(int moveNum) const { return moves[moveNum].score; }
127 void set_move_score(int moveNum, Value score) { moves[moveNum].score = score; }
128 Move get_move_pv(int moveNum, int i) const { return moves[moveNum].pv[i]; }
129 int64_t get_move_cumulative_nodes(int moveNum) const { return moves[moveNum].cumulativeNodes; }
131 void set_move_nodes(int moveNum, int64_t nodes);
132 void set_beta_counters(int moveNum, int64_t our, int64_t their);
133 void set_move_pv(int moveNum, const Move pv[]);
135 void sort_multipv(int n);
138 static const int MaxRootMoves = 500;
139 RootMove moves[MaxRootMoves];
146 // Search depth at iteration 1
147 const Depth InitialDepth = OnePly;
149 // Depth limit for selective search
150 const Depth SelectiveDepth = 7 * OnePly;
152 // Use internal iterative deepening?
153 const bool UseIIDAtPVNodes = true;
154 const bool UseIIDAtNonPVNodes = true;
156 // Internal iterative deepening margin. At Non-PV moves, when
157 // UseIIDAtNonPVNodes is true, we do an internal iterative deepening
158 // search when the static evaluation is at most IIDMargin below beta.
159 const Value IIDMargin = Value(0x100);
161 // Easy move margin. An easy move candidate must be at least this much
162 // better than the second best move.
163 const Value EasyMoveMargin = Value(0x200);
165 // Problem margin. If the score of the first move at iteration N+1 has
166 // dropped by more than this since iteration N, the boolean variable
167 // "Problem" is set to true, which will make the program spend some extra
168 // time looking for a better move.
169 const Value ProblemMargin = Value(0x28);
171 // No problem margin. If the boolean "Problem" is true, and a new move
172 // is found at the root which is less than NoProblemMargin worse than the
173 // best move from the previous iteration, Problem is set back to false.
174 const Value NoProblemMargin = Value(0x14);
176 // Null move margin. A null move search will not be done if the static
177 // evaluation of the position is more than NullMoveMargin below beta.
178 const Value NullMoveMargin = Value(0x200);
180 // If the TT move is at least SingleReplyMargin better then the
181 // remaining ones we will extend it.
182 const Value SingleReplyMargin = Value(0x20);
184 // Margins for futility pruning in the quiescence search, and at frontier
185 // and near frontier nodes.
186 const Value FutilityMarginQS = Value(0x80);
188 // Each move futility margin is decreased
189 const Value IncrementalFutilityMargin = Value(0x8);
191 // Depth limit for razoring
192 const Depth RazorDepth = 4 * OnePly;
194 /// Variables initialized by UCI options
196 // Depth limit for use of dynamic threat detection
199 // Last seconds noise filtering (LSN)
200 const bool UseLSNFiltering = true;
201 const int LSNTime = 4000; // In milliseconds
202 const Value LSNValue = value_from_centipawns(200);
203 bool loseOnTime = false;
205 // Extensions. Array index 0 is used at non-PV nodes, index 1 at PV nodes.
206 Depth CheckExtension[2], SingleEvasionExtension[2], PawnPushTo7thExtension[2];
207 Depth PassedPawnExtension[2], PawnEndgameExtension[2], MateThreatExtension[2];
209 // Iteration counters
211 BetaCounterType BetaCounter;
213 // Scores and number of times the best move changed for each iteration
214 IterationInfoType IterationInfo[PLY_MAX_PLUS_2];
215 int BestMoveChangesByIteration[PLY_MAX_PLUS_2];
220 // Time managment variables
223 int MaxNodes, MaxDepth;
224 int MaxSearchTime, AbsoluteMaxSearchTime, ExtraSearchTime, ExactMaxTime;
225 bool UseTimeManagement, InfiniteSearch, PonderSearch, StopOnPonderhit;
226 bool AbortSearch, Quit;
227 bool FailHigh, FailLow, Problem;
229 // Show current line?
230 bool ShowCurrentLine;
234 std::ofstream LogFile;
236 // Natural logarithmic lookup table and its getter function
238 inline double ln(int i) { return lnArray[i]; }
240 // MP related variables
241 int ActiveThreads = 1;
242 Depth MinimumSplitDepth;
243 int MaxThreadsPerSplitPoint;
244 Thread Threads[THREAD_MAX];
247 bool AllThreadsShouldExit = false;
248 SplitPoint SplitPointStack[THREAD_MAX][ACTIVE_SPLIT_POINTS_MAX];
251 #if !defined(_MSC_VER)
252 pthread_cond_t WaitCond;
253 pthread_mutex_t WaitLock;
255 HANDLE SitIdleEvent[THREAD_MAX];
258 // Node counters, used only by thread[0] but try to keep in different
259 // cache lines (64 bytes each) from the heavy SMP read accessed variables.
261 int NodesBetweenPolls = 30000;
268 Value id_loop(const Position& pos, Move searchMoves[]);
269 Value root_search(Position& pos, SearchStack ss[], RootMoveList& rml, Value alpha, Value beta);
270 Value search_pv(Position& pos, SearchStack ss[], Value alpha, Value beta, Depth depth, int ply, int threadID);
271 Value search(Position& pos, SearchStack ss[], Value beta, Depth depth, int ply, bool allowNullmove, int threadID, Move excludedMove = MOVE_NONE);
272 Value qsearch(Position& pos, SearchStack ss[], Value alpha, Value beta, Depth depth, int ply, int threadID);
273 void sp_search(SplitPoint* sp, int threadID);
274 void sp_search_pv(SplitPoint* sp, int threadID);
275 void init_node(SearchStack ss[], int ply, int threadID);
276 void update_pv(SearchStack ss[], int ply);
277 void sp_update_pv(SearchStack* pss, SearchStack ss[], int ply);
278 bool connected_moves(const Position& pos, Move m1, Move m2);
279 bool value_is_mate(Value value);
280 bool move_is_killer(Move m, const SearchStack& ss);
281 Depth extension(const Position&, Move, bool, bool, bool, bool, bool, bool*);
282 bool ok_to_do_nullmove(const Position& pos);
283 bool ok_to_prune(const Position& pos, Move m, Move threat);
284 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply);
285 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply);
286 void update_history(const Position& pos, Move move, Depth depth, Move movesSearched[], int moveCount);
287 void update_killers(Move m, SearchStack& ss);
288 void update_gains(const Position& pos, Move move, Value before, Value after);
290 bool fail_high_ply_1();
291 int current_search_time();
295 void print_current_line(SearchStack ss[], int ply, int threadID);
296 void wait_for_stop_or_ponderhit();
297 void init_ss_array(SearchStack ss[]);
299 void idle_loop(int threadID, SplitPoint* waitSp);
300 void init_split_point_stack();
301 void destroy_split_point_stack();
302 bool thread_should_stop(int threadID);
303 bool thread_is_available(int slave, int master);
304 bool idle_thread_exists(int master);
305 bool split(const Position& pos, SearchStack* ss, int ply,
306 Value *alpha, Value *beta, Value *bestValue,
307 const Value futilityValue, Depth depth, int *moves,
308 MovePicker *mp, int master, bool pvNode);
309 void wake_sleeping_threads();
311 #if !defined(_MSC_VER)
312 void *init_thread(void *threadID);
314 DWORD WINAPI init_thread(LPVOID threadID);
325 /// perft() is our utility to verify move generation is bug free. All the legal
326 /// moves up to given depth are generated and counted and the sum returned.
328 int perft(Position& pos, Depth depth)
332 MovePicker mp = MovePicker(pos, MOVE_NONE, depth, H);
334 // If we are at the last ply we don't need to do and undo
335 // the moves, just to count them.
336 if (depth <= OnePly) // Replace with '<' to test also qsearch
338 while (mp.get_next_move()) sum++;
342 // Loop through all legal moves
344 while ((move = mp.get_next_move()) != MOVE_NONE)
347 pos.do_move(move, st, ci, pos.move_is_check(move, ci));
348 sum += perft(pos, depth - OnePly);
355 /// think() is the external interface to Stockfish's search, and is called when
356 /// the program receives the UCI 'go' command. It initializes various
357 /// search-related global variables, and calls root_search(). It returns false
358 /// when a quit command is received during the search.
360 bool think(const Position& pos, bool infinite, bool ponder, int side_to_move,
361 int time[], int increment[], int movesToGo, int maxDepth,
362 int maxNodes, int maxTime, Move searchMoves[]) {
364 // Initialize global search variables
365 Idle = StopOnPonderhit = AbortSearch = Quit = false;
366 FailHigh = FailLow = Problem = false;
368 SearchStartTime = get_system_time();
369 ExactMaxTime = maxTime;
372 InfiniteSearch = infinite;
373 PonderSearch = ponder;
374 UseTimeManagement = !ExactMaxTime && !MaxDepth && !MaxNodes && !InfiniteSearch;
376 // Look for a book move, only during games, not tests
377 if (UseTimeManagement && !ponder && get_option_value_bool("OwnBook"))
380 if (get_option_value_string("Book File") != OpeningBook.file_name())
381 OpeningBook.open(get_option_value_string("Book File"));
383 bookMove = OpeningBook.get_move(pos);
384 if (bookMove != MOVE_NONE)
386 cout << "bestmove " << bookMove << endl;
391 for (int i = 0; i < THREAD_MAX; i++)
393 Threads[i].nodes = 0ULL;
394 Threads[i].failHighPly1 = false;
397 if (button_was_pressed("New Game"))
398 loseOnTime = false; // Reset at the beginning of a new game
400 // Read UCI option values
401 TT.set_size(get_option_value_int("Hash"));
402 if (button_was_pressed("Clear Hash"))
405 bool PonderingEnabled = get_option_value_bool("Ponder");
406 MultiPV = get_option_value_int("MultiPV");
408 CheckExtension[1] = Depth(get_option_value_int("Check Extension (PV nodes)"));
409 CheckExtension[0] = Depth(get_option_value_int("Check Extension (non-PV nodes)"));
411 SingleEvasionExtension[1] = Depth(get_option_value_int("Single Evasion Extension (PV nodes)"));
412 SingleEvasionExtension[0] = Depth(get_option_value_int("Single Evasion Extension (non-PV nodes)"));
414 PawnPushTo7thExtension[1] = Depth(get_option_value_int("Pawn Push to 7th Extension (PV nodes)"));
415 PawnPushTo7thExtension[0] = Depth(get_option_value_int("Pawn Push to 7th Extension (non-PV nodes)"));
417 PassedPawnExtension[1] = Depth(get_option_value_int("Passed Pawn Extension (PV nodes)"));
418 PassedPawnExtension[0] = Depth(get_option_value_int("Passed Pawn Extension (non-PV nodes)"));
420 PawnEndgameExtension[1] = Depth(get_option_value_int("Pawn Endgame Extension (PV nodes)"));
421 PawnEndgameExtension[0] = Depth(get_option_value_int("Pawn Endgame Extension (non-PV nodes)"));
423 MateThreatExtension[1] = Depth(get_option_value_int("Mate Threat Extension (PV nodes)"));
424 MateThreatExtension[0] = Depth(get_option_value_int("Mate Threat Extension (non-PV nodes)"));
426 ThreatDepth = get_option_value_int("Threat Depth") * OnePly;
428 Chess960 = get_option_value_bool("UCI_Chess960");
429 ShowCurrentLine = get_option_value_bool("UCI_ShowCurrLine");
430 UseLogFile = get_option_value_bool("Use Search Log");
432 LogFile.open(get_option_value_string("Search Log Filename").c_str(), std::ios::out | std::ios::app);
434 MinimumSplitDepth = get_option_value_int("Minimum Split Depth") * OnePly;
435 MaxThreadsPerSplitPoint = get_option_value_int("Maximum Number of Threads per Split Point");
437 read_weights(pos.side_to_move());
439 // Set the number of active threads
440 int newActiveThreads = get_option_value_int("Threads");
441 if (newActiveThreads != ActiveThreads)
443 ActiveThreads = newActiveThreads;
444 init_eval(ActiveThreads);
445 // HACK: init_eval() destroys the static castleRightsMask[] array in the
446 // Position class. The below line repairs the damage.
447 Position p(pos.to_fen());
451 // Wake up sleeping threads
452 wake_sleeping_threads();
454 for (int i = 1; i < ActiveThreads; i++)
455 assert(thread_is_available(i, 0));
458 int myTime = time[side_to_move];
459 int myIncrement = increment[side_to_move];
460 if (UseTimeManagement)
462 if (!movesToGo) // Sudden death time control
466 MaxSearchTime = myTime / 30 + myIncrement;
467 AbsoluteMaxSearchTime = Max(myTime / 4, myIncrement - 100);
469 else // Blitz game without increment
471 MaxSearchTime = myTime / 30;
472 AbsoluteMaxSearchTime = myTime / 8;
475 else // (x moves) / (y minutes)
479 MaxSearchTime = myTime / 2;
480 AbsoluteMaxSearchTime = (myTime > 3000)? (myTime - 500) : ((myTime * 3) / 4);
484 MaxSearchTime = myTime / Min(movesToGo, 20);
485 AbsoluteMaxSearchTime = Min((4 * myTime) / movesToGo, myTime / 3);
489 if (PonderingEnabled)
491 MaxSearchTime += MaxSearchTime / 4;
492 MaxSearchTime = Min(MaxSearchTime, AbsoluteMaxSearchTime);
496 // Set best NodesBetweenPolls interval
498 NodesBetweenPolls = Min(MaxNodes, 30000);
499 else if (myTime && myTime < 1000)
500 NodesBetweenPolls = 1000;
501 else if (myTime && myTime < 5000)
502 NodesBetweenPolls = 5000;
504 NodesBetweenPolls = 30000;
506 // Write information to search log file
508 LogFile << "Searching: " << pos.to_fen() << endl
509 << "infinite: " << infinite
510 << " ponder: " << ponder
511 << " time: " << myTime
512 << " increment: " << myIncrement
513 << " moves to go: " << movesToGo << endl;
515 // LSN filtering. Used only for developing purpose. Disabled by default.
519 // Step 2. If after last move we decided to lose on time, do it now!
520 while (SearchStartTime + myTime + 1000 > get_system_time())
524 // We're ready to start thinking. Call the iterative deepening loop function
525 Value v = id_loop(pos, searchMoves);
530 // Step 1. If this is sudden death game and our position is hopeless,
531 // decide to lose on time.
532 if ( !loseOnTime // If we already lost on time, go to step 3.
542 // Step 3. Now after stepping over the time limit, reset flag for next match.
555 /// init_threads() is called during startup. It launches all helper threads,
556 /// and initializes the split point stack and the global locks and condition
559 void init_threads() {
564 #if !defined(_MSC_VER)
565 pthread_t pthread[1];
568 // Init our logarithmic lookup table
569 for (i = 0; i < 512; i++)
570 lnArray[i] = log(double(i)); // log() returns base-e logarithm
572 for (i = 0; i < THREAD_MAX; i++)
573 Threads[i].activeSplitPoints = 0;
575 // Initialize global locks
576 lock_init(&MPLock, NULL);
577 lock_init(&IOLock, NULL);
579 init_split_point_stack();
581 #if !defined(_MSC_VER)
582 pthread_mutex_init(&WaitLock, NULL);
583 pthread_cond_init(&WaitCond, NULL);
585 for (i = 0; i < THREAD_MAX; i++)
586 SitIdleEvent[i] = CreateEvent(0, FALSE, FALSE, 0);
589 // All threads except the main thread should be initialized to idle state
590 for (i = 1; i < THREAD_MAX; i++)
592 Threads[i].stop = false;
593 Threads[i].workIsWaiting = false;
594 Threads[i].idle = true;
595 Threads[i].running = false;
598 // Launch the helper threads
599 for (i = 1; i < THREAD_MAX; i++)
601 #if !defined(_MSC_VER)
602 ok = (pthread_create(pthread, NULL, init_thread, (void*)(&i)) == 0);
605 ok = (CreateThread(NULL, 0, init_thread, (LPVOID)(&i), 0, iID) != NULL);
610 cout << "Failed to create thread number " << i << endl;
611 Application::exit_with_failure();
614 // Wait until the thread has finished launching
615 while (!Threads[i].running);
620 /// stop_threads() is called when the program exits. It makes all the
621 /// helper threads exit cleanly.
623 void stop_threads() {
625 ActiveThreads = THREAD_MAX; // HACK
626 Idle = false; // HACK
627 wake_sleeping_threads();
628 AllThreadsShouldExit = true;
629 for (int i = 1; i < THREAD_MAX; i++)
631 Threads[i].stop = true;
632 while (Threads[i].running);
634 destroy_split_point_stack();
638 /// nodes_searched() returns the total number of nodes searched so far in
639 /// the current search.
641 int64_t nodes_searched() {
643 int64_t result = 0ULL;
644 for (int i = 0; i < ActiveThreads; i++)
645 result += Threads[i].nodes;
650 // SearchStack::init() initializes a search stack. Used at the beginning of a
651 // new search from the root.
652 void SearchStack::init(int ply) {
654 pv[ply] = pv[ply + 1] = MOVE_NONE;
655 currentMove = threatMove = MOVE_NONE;
656 reduction = Depth(0);
661 void SearchStack::initKillers() {
663 mateKiller = MOVE_NONE;
664 for (int i = 0; i < KILLER_MAX; i++)
665 killers[i] = MOVE_NONE;
670 // id_loop() is the main iterative deepening loop. It calls root_search
671 // repeatedly with increasing depth until the allocated thinking time has
672 // been consumed, the user stops the search, or the maximum search depth is
675 Value id_loop(const Position& pos, Move searchMoves[]) {
678 SearchStack ss[PLY_MAX_PLUS_2];
680 // searchMoves are verified, copied, scored and sorted
681 RootMoveList rml(p, searchMoves);
683 if (rml.move_count() == 0)
686 wait_for_stop_or_ponderhit();
688 return pos.is_check()? -VALUE_MATE : VALUE_DRAW;
691 // Print RootMoveList c'tor startup scoring to the standard output,
692 // so that we print information also for iteration 1.
693 cout << "info depth " << 1 << "\ninfo depth " << 1
694 << " score " << value_to_string(rml.get_move_score(0))
695 << " time " << current_search_time()
696 << " nodes " << nodes_searched()
698 << " pv " << rml.get_move(0) << "\n";
704 IterationInfo[1] = IterationInfoType(rml.get_move_score(0), rml.get_move_score(0));
707 // Is one move significantly better than others after initial scoring ?
708 Move EasyMove = MOVE_NONE;
709 if ( rml.move_count() == 1
710 || rml.get_move_score(0) > rml.get_move_score(1) + EasyMoveMargin)
711 EasyMove = rml.get_move(0);
713 // Iterative deepening loop
714 while (Iteration < PLY_MAX)
716 // Initialize iteration
719 BestMoveChangesByIteration[Iteration] = 0;
723 cout << "info depth " << Iteration << endl;
725 // Calculate dynamic search window based on previous iterations
728 if (MultiPV == 1 && Iteration >= 6 && abs(IterationInfo[Iteration - 1].value) < VALUE_KNOWN_WIN)
730 int prevDelta1 = IterationInfo[Iteration - 1].speculatedValue - IterationInfo[Iteration - 2].speculatedValue;
731 int prevDelta2 = IterationInfo[Iteration - 2].speculatedValue - IterationInfo[Iteration - 3].speculatedValue;
733 int delta = Max(2 * abs(prevDelta1) + abs(prevDelta2), ProblemMargin);
735 alpha = Max(IterationInfo[Iteration - 1].value - delta, -VALUE_INFINITE);
736 beta = Min(IterationInfo[Iteration - 1].value + delta, VALUE_INFINITE);
740 alpha = - VALUE_INFINITE;
741 beta = VALUE_INFINITE;
744 // Search to the current depth
745 Value value = root_search(p, ss, rml, alpha, beta);
747 // Write PV to transposition table, in case the relevant entries have
748 // been overwritten during the search.
749 TT.insert_pv(p, ss[0].pv);
752 break; // Value cannot be trusted. Break out immediately!
754 //Save info about search result
755 Value speculatedValue;
758 Value delta = value - IterationInfo[Iteration - 1].value;
765 speculatedValue = value + delta;
766 BestMoveChangesByIteration[Iteration] += 2; // Allocate more time
768 else if (value <= alpha)
770 assert(value == alpha);
774 speculatedValue = value + delta;
775 BestMoveChangesByIteration[Iteration] += 3; // Allocate more time
777 speculatedValue = value;
779 speculatedValue = Min(Max(speculatedValue, -VALUE_INFINITE), VALUE_INFINITE);
780 IterationInfo[Iteration] = IterationInfoType(value, speculatedValue);
782 // Drop the easy move if it differs from the new best move
783 if (ss[0].pv[0] != EasyMove)
784 EasyMove = MOVE_NONE;
788 if (UseTimeManagement)
791 bool stopSearch = false;
793 // Stop search early if there is only a single legal move,
794 // we search up to Iteration 6 anyway to get a proper score.
795 if (Iteration >= 6 && rml.move_count() == 1)
798 // Stop search early when the last two iterations returned a mate score
800 && abs(IterationInfo[Iteration].value) >= abs(VALUE_MATE) - 100
801 && abs(IterationInfo[Iteration-1].value) >= abs(VALUE_MATE) - 100)
804 // Stop search early if one move seems to be much better than the rest
805 int64_t nodes = nodes_searched();
809 && EasyMove == ss[0].pv[0]
810 && ( ( rml.get_move_cumulative_nodes(0) > (nodes * 85) / 100
811 && current_search_time() > MaxSearchTime / 16)
812 ||( rml.get_move_cumulative_nodes(0) > (nodes * 98) / 100
813 && current_search_time() > MaxSearchTime / 32)))
816 // Add some extra time if the best move has changed during the last two iterations
817 if (Iteration > 5 && Iteration <= 50)
818 ExtraSearchTime = BestMoveChangesByIteration[Iteration] * (MaxSearchTime / 2)
819 + BestMoveChangesByIteration[Iteration-1] * (MaxSearchTime / 3);
821 // Stop search if most of MaxSearchTime is consumed at the end of the
822 // iteration. We probably don't have enough time to search the first
823 // move at the next iteration anyway.
824 if (current_search_time() > ((MaxSearchTime + ExtraSearchTime) * 80) / 128)
832 StopOnPonderhit = true;
836 if (MaxDepth && Iteration >= MaxDepth)
842 // If we are pondering or in infinite search, we shouldn't print the
843 // best move before we are told to do so.
844 if (!AbortSearch && (PonderSearch || InfiniteSearch))
845 wait_for_stop_or_ponderhit();
847 // Print final search statistics
848 cout << "info nodes " << nodes_searched()
850 << " time " << current_search_time()
851 << " hashfull " << TT.full() << endl;
853 // Print the best move and the ponder move to the standard output
854 if (ss[0].pv[0] == MOVE_NONE)
856 ss[0].pv[0] = rml.get_move(0);
857 ss[0].pv[1] = MOVE_NONE;
859 cout << "bestmove " << ss[0].pv[0];
860 if (ss[0].pv[1] != MOVE_NONE)
861 cout << " ponder " << ss[0].pv[1];
868 dbg_print_mean(LogFile);
870 if (dbg_show_hit_rate)
871 dbg_print_hit_rate(LogFile);
873 LogFile << "\nNodes: " << nodes_searched()
874 << "\nNodes/second: " << nps()
875 << "\nBest move: " << move_to_san(p, ss[0].pv[0]);
878 p.do_move(ss[0].pv[0], st);
879 LogFile << "\nPonder move: " << move_to_san(p, ss[0].pv[1]) << endl;
881 return rml.get_move_score(0);
885 // root_search() is the function which searches the root node. It is
886 // similar to search_pv except that it uses a different move ordering
887 // scheme and prints some information to the standard output.
889 Value root_search(Position& pos, SearchStack ss[], RootMoveList& rml, Value alpha, Value beta) {
891 Value oldAlpha = alpha;
892 Value value = -VALUE_INFINITE;
894 bool isCheck = pos.is_check();
896 // Evaluate the position statically
899 ss[0].eval = evaluate(pos, ei, 0);
901 ss[0].eval = VALUE_NONE;
903 // Loop through all the moves in the root move list
904 for (int i = 0; i < rml.move_count() && !AbortSearch; i++)
908 // We failed high, invalidate and skip next moves, leave node-counters
909 // and beta-counters as they are and quickly return, we will try to do
910 // a research at the next iteration with a bigger aspiration window.
911 rml.set_move_score(i, -VALUE_INFINITE);
917 Depth depth, ext, newDepth;
919 RootMoveNumber = i + 1;
922 // Save the current node count before the move is searched
923 nodes = nodes_searched();
925 // Reset beta cut-off counters
928 // Pick the next root move, and print the move and the move number to
929 // the standard output.
930 move = ss[0].currentMove = rml.get_move(i);
932 if (current_search_time() >= 1000)
933 cout << "info currmove " << move
934 << " currmovenumber " << RootMoveNumber << endl;
936 // Decide search depth for this move
937 bool moveIsCheck = pos.move_is_check(move);
938 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
940 depth = (Iteration - 2) * OnePly + InitialDepth;
941 ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, false, false, &dangerous);
942 newDepth = depth + ext;
944 // Make the move, and search it
945 pos.do_move(move, st, ci, moveIsCheck);
949 // Aspiration window is disabled in multi-pv case
951 alpha = -VALUE_INFINITE;
953 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
955 // If the value has dropped a lot compared to the last iteration,
956 // set the boolean variable Problem to true. This variable is used
957 // for time managment: When Problem is true, we try to complete the
958 // current iteration before playing a move.
959 Problem = ( Iteration >= 2
960 && value <= IterationInfo[Iteration - 1].value - ProblemMargin);
962 if (Problem && StopOnPonderhit)
963 StopOnPonderhit = false;
967 // Try to reduce non-pv search depth by one ply if move seems not problematic,
968 // if the move fails high will be re-searched at full depth.
969 bool doFullDepthSearch = true;
971 if ( depth >= 3*OnePly // FIXME was newDepth
973 && !captureOrPromotion
974 && !move_is_castle(move))
976 double red = 0.5 + ln(RootMoveNumber - MultiPV + 1) * ln(depth / 2) / 6.0;
979 ss[0].reduction = Depth(int(floor(red * int(OnePly))));
980 value = -search(pos, ss, -alpha, newDepth-ss[0].reduction, 1, true, 0);
981 doFullDepthSearch = (value > alpha);
985 if (doFullDepthSearch)
987 value = -search(pos, ss, -alpha, newDepth, 1, true, 0);
991 // Fail high! Set the boolean variable FailHigh to true, and
992 // re-search the move using a PV search. The variable FailHigh
993 // is used for time managment: We try to avoid aborting the
994 // search prematurely during a fail high research.
996 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
1001 pos.undo_move(move);
1003 // Finished searching the move. If AbortSearch is true, the search
1004 // was aborted because the user interrupted the search or because we
1005 // ran out of time. In this case, the return value of the search cannot
1006 // be trusted, and we break out of the loop without updating the best
1011 // Remember beta-cutoff and searched nodes counts for this move. The
1012 // info is used to sort the root moves at the next iteration.
1014 BetaCounter.read(pos.side_to_move(), our, their);
1015 rml.set_beta_counters(i, our, their);
1016 rml.set_move_nodes(i, nodes_searched() - nodes);
1018 assert(value >= -VALUE_INFINITE && value <= VALUE_INFINITE);
1020 if (value <= alpha && i >= MultiPV)
1021 rml.set_move_score(i, -VALUE_INFINITE);
1024 // PV move or new best move!
1027 rml.set_move_score(i, value);
1029 TT.extract_pv(pos, ss[0].pv, PLY_MAX);
1030 rml.set_move_pv(i, ss[0].pv);
1034 // We record how often the best move has been changed in each
1035 // iteration. This information is used for time managment: When
1036 // the best move changes frequently, we allocate some more time.
1038 BestMoveChangesByIteration[Iteration]++;
1040 // Print search information to the standard output
1041 cout << "info depth " << Iteration
1042 << " score " << value_to_string(value)
1043 << ((value >= beta) ? " lowerbound" :
1044 ((value <= alpha)? " upperbound" : ""))
1045 << " time " << current_search_time()
1046 << " nodes " << nodes_searched()
1050 for (int j = 0; ss[0].pv[j] != MOVE_NONE && j < PLY_MAX; j++)
1051 cout << ss[0].pv[j] << " ";
1057 ValueType type = (value >= beta ? VALUE_TYPE_LOWER
1058 : (value <= alpha ? VALUE_TYPE_UPPER : VALUE_TYPE_EXACT));
1060 LogFile << pretty_pv(pos, current_search_time(), Iteration,
1061 nodes_searched(), value, type, ss[0].pv) << endl;
1066 // Reset the global variable Problem to false if the value isn't too
1067 // far below the final value from the last iteration.
1068 if (value > IterationInfo[Iteration - 1].value - NoProblemMargin)
1073 rml.sort_multipv(i);
1074 for (int j = 0; j < Min(MultiPV, rml.move_count()); j++)
1076 cout << "info multipv " << j + 1
1077 << " score " << value_to_string(rml.get_move_score(j))
1078 << " depth " << ((j <= i)? Iteration : Iteration - 1)
1079 << " time " << current_search_time()
1080 << " nodes " << nodes_searched()
1084 for (int k = 0; rml.get_move_pv(j, k) != MOVE_NONE && k < PLY_MAX; k++)
1085 cout << rml.get_move_pv(j, k) << " ";
1089 alpha = rml.get_move_score(Min(i, MultiPV-1));
1091 } // PV move or new best move
1093 assert(alpha >= oldAlpha);
1095 FailLow = (alpha == oldAlpha);
1101 // search_pv() is the main search function for PV nodes.
1103 Value search_pv(Position& pos, SearchStack ss[], Value alpha, Value beta,
1104 Depth depth, int ply, int threadID) {
1106 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1107 assert(beta > alpha && beta <= VALUE_INFINITE);
1108 assert(ply >= 0 && ply < PLY_MAX);
1109 assert(threadID >= 0 && threadID < ActiveThreads);
1111 Move movesSearched[256];
1115 Depth ext, newDepth;
1116 Value oldAlpha, value;
1117 bool isCheck, mateThreat, singleEvasion, moveIsCheck, captureOrPromotion, dangerous;
1119 Value bestValue = value = -VALUE_INFINITE;
1122 return qsearch(pos, ss, alpha, beta, Depth(0), ply, threadID);
1124 // Initialize, and make an early exit in case of an aborted search,
1125 // an instant draw, maximum ply reached, etc.
1126 init_node(ss, ply, threadID);
1128 // After init_node() that calls poll()
1129 if (AbortSearch || thread_should_stop(threadID))
1132 if (pos.is_draw() || ply >= PLY_MAX - 1)
1135 // Mate distance pruning
1137 alpha = Max(value_mated_in(ply), alpha);
1138 beta = Min(value_mate_in(ply+1), beta);
1142 // Transposition table lookup. At PV nodes, we don't use the TT for
1143 // pruning, but only for move ordering. This is to avoid problems in
1144 // the following areas:
1146 // * Repetition draw detection
1147 // * Fifty move rule detection
1148 // * Searching for a mate
1149 // * Printing of full PV line
1151 tte = TT.retrieve(pos.get_key());
1152 ttMove = (tte ? tte->move() : MOVE_NONE);
1154 // Go with internal iterative deepening if we don't have a TT move
1155 if ( UseIIDAtPVNodes
1156 && depth >= 5*OnePly
1157 && ttMove == MOVE_NONE)
1159 search_pv(pos, ss, alpha, beta, depth-2*OnePly, ply, threadID);
1160 ttMove = ss[ply].pv[ply];
1161 tte = TT.retrieve(pos.get_key());
1164 isCheck = pos.is_check();
1167 // Update gain statistics of the previous move that lead
1168 // us in this position.
1170 ss[ply].eval = evaluate(pos, ei, threadID);
1171 update_gains(pos, ss[ply - 1].currentMove, ss[ply - 1].eval, ss[ply].eval);
1174 // Initialize a MovePicker object for the current position, and prepare
1175 // to search all moves
1176 mateThreat = pos.has_mate_threat(opposite_color(pos.side_to_move()));
1178 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
1180 // Loop through all legal moves until no moves remain or a beta cutoff
1182 while ( alpha < beta
1183 && (move = mp.get_next_move()) != MOVE_NONE
1184 && !thread_should_stop(threadID))
1186 assert(move_is_ok(move));
1188 singleEvasion = (isCheck && mp.number_of_evasions() == 1);
1189 moveIsCheck = pos.move_is_check(move, ci);
1190 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1192 // Decide the new search depth
1193 ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, singleEvasion, mateThreat, &dangerous);
1195 // Singular extension search. We extend the TT move if its value is much better than
1196 // its siblings. To verify this we do a reduced search on all the other moves but the
1197 // ttMove, if result is lower then ttValue minus a margin then we extend ttMove.
1198 if ( depth >= 6 * OnePly
1200 && move == tte->move()
1202 && is_lower_bound(tte->type())
1203 && tte->depth() >= depth - 3 * OnePly)
1205 Value ttValue = value_from_tt(tte->value(), ply);
1207 if (abs(ttValue) < VALUE_KNOWN_WIN)
1209 Value excValue = search(pos, ss, ttValue - SingleReplyMargin, depth / 2, ply, false, threadID, move);
1211 if (excValue < ttValue - SingleReplyMargin)
1216 newDepth = depth - OnePly + ext;
1218 // Update current move
1219 movesSearched[moveCount++] = ss[ply].currentMove = move;
1221 // Make and search the move
1222 pos.do_move(move, st, ci, moveIsCheck);
1224 if (moveCount == 1) // The first move in list is the PV
1225 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1228 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1229 // if the move fails high will be re-searched at full depth.
1230 bool doFullDepthSearch = true;
1232 if ( depth >= 3*OnePly
1234 && !captureOrPromotion
1235 && !move_is_castle(move)
1236 && !move_is_killer(move, ss[ply]))
1238 double red = 0.5 + ln(moveCount) * ln(depth / 2) / 6.0;
1241 ss[ply].reduction = Depth(int(floor(red * int(OnePly))));
1242 value = -search(pos, ss, -alpha, newDepth-ss[ply].reduction, ply+1, true, threadID);
1243 doFullDepthSearch = (value > alpha);
1247 if (doFullDepthSearch) // Go with full depth non-pv search
1249 ss[ply].reduction = Depth(0);
1250 value = -search(pos, ss, -alpha, newDepth, ply+1, true, threadID);
1251 if (value > alpha && value < beta)
1253 // When the search fails high at ply 1 while searching the first
1254 // move at the root, set the flag failHighPly1. This is used for
1255 // time managment: We don't want to stop the search early in
1256 // such cases, because resolving the fail high at ply 1 could
1257 // result in a big drop in score at the root.
1258 if (ply == 1 && RootMoveNumber == 1)
1259 Threads[threadID].failHighPly1 = true;
1261 // A fail high occurred. Re-search at full window (pv search)
1262 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1263 Threads[threadID].failHighPly1 = false;
1267 pos.undo_move(move);
1269 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1272 if (value > bestValue)
1279 if (value == value_mate_in(ply + 1))
1280 ss[ply].mateKiller = move;
1282 // If we are at ply 1, and we are searching the first root move at
1283 // ply 0, set the 'Problem' variable if the score has dropped a lot
1284 // (from the computer's point of view) since the previous iteration.
1287 && -value <= IterationInfo[Iteration-1].value - ProblemMargin)
1292 if ( ActiveThreads > 1
1294 && depth >= MinimumSplitDepth
1296 && idle_thread_exists(threadID)
1298 && !thread_should_stop(threadID)
1299 && split(pos, ss, ply, &alpha, &beta, &bestValue, VALUE_NONE,
1300 depth, &moveCount, &mp, threadID, true))
1304 // All legal moves have been searched. A special case: If there were
1305 // no legal moves, it must be mate or stalemate.
1307 return (isCheck ? value_mated_in(ply) : VALUE_DRAW);
1309 // If the search is not aborted, update the transposition table,
1310 // history counters, and killer moves.
1311 if (AbortSearch || thread_should_stop(threadID))
1314 if (bestValue <= oldAlpha)
1315 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1317 else if (bestValue >= beta)
1319 BetaCounter.add(pos.side_to_move(), depth, threadID);
1320 move = ss[ply].pv[ply];
1321 if (!pos.move_is_capture_or_promotion(move))
1323 update_history(pos, move, depth, movesSearched, moveCount);
1324 update_killers(move, ss[ply]);
1326 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, move);
1329 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EXACT, depth, ss[ply].pv[ply]);
1335 // search() is the search function for zero-width nodes.
1337 Value search(Position& pos, SearchStack ss[], Value beta, Depth depth,
1338 int ply, bool allowNullmove, int threadID, Move excludedMove) {
1340 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1341 assert(ply >= 0 && ply < PLY_MAX);
1342 assert(threadID >= 0 && threadID < ActiveThreads);
1344 Move movesSearched[256];
1349 Depth ext, newDepth;
1350 Value bestValue, staticValue, nullValue, value, futilityValue, futilityValueScaled;
1351 bool isCheck, singleEvasion, moveIsCheck, captureOrPromotion, dangerous;
1352 bool mateThreat = false;
1354 futilityValue = staticValue = bestValue = value = -VALUE_INFINITE;
1357 return qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1359 // Initialize, and make an early exit in case of an aborted search,
1360 // an instant draw, maximum ply reached, etc.
1361 init_node(ss, ply, threadID);
1363 // After init_node() that calls poll()
1364 if (AbortSearch || thread_should_stop(threadID))
1367 if (pos.is_draw() || ply >= PLY_MAX - 1)
1370 // Mate distance pruning
1371 if (value_mated_in(ply) >= beta)
1374 if (value_mate_in(ply + 1) < beta)
1377 // We don't want the score of a partial search to overwrite a previous full search
1378 // TT value, so we use a different position key in case of an excluded move exsists.
1379 Key posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
1381 // Transposition table lookup
1382 tte = TT.retrieve(posKey);
1383 ttMove = (tte ? tte->move() : MOVE_NONE);
1385 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1387 ss[ply].currentMove = ttMove; // Can be MOVE_NONE
1388 return value_from_tt(tte->value(), ply);
1391 isCheck = pos.is_check();
1393 // Calculate depth dependant futility pruning parameters
1394 const int FutilityMoveCountMargin = 3 + (1 << (3 * int(depth) / 8));
1395 const int PostFutilityValueMargin = 112 * bitScanReverse32(int(depth) * int(depth) / 2);
1397 // Evaluate the position statically
1400 if (tte && (tte->type() & VALUE_TYPE_EVAL))
1401 staticValue = value_from_tt(tte->value(), ply);
1404 staticValue = evaluate(pos, ei, threadID);
1405 ss[ply].evalInfo = &ei;
1408 ss[ply].eval = staticValue;
1409 futilityValue = staticValue + PostFutilityValueMargin; //FIXME: Remove me, only for split
1410 staticValue = refine_eval(tte, staticValue, ply); // Enhance accuracy with TT value if possible
1411 update_gains(pos, ss[ply - 1].currentMove, ss[ply - 1].eval, ss[ply].eval);
1414 // Do a "stand pat". If we are above beta by a good margin then
1415 // return immediately.
1416 // FIXME: test with added condition 'allowNullmove || depth <= OnePly' and !value_is_mate(beta)
1417 // FIXME: test with modified condition 'depth < RazorDepth'
1419 && depth < SelectiveDepth
1420 && staticValue - PostFutilityValueMargin >= beta)
1421 return staticValue - PostFutilityValueMargin;
1427 && !value_is_mate(beta)
1428 && ok_to_do_nullmove(pos)
1429 && staticValue >= beta - NullMoveMargin)
1431 ss[ply].currentMove = MOVE_NULL;
1433 pos.do_null_move(st);
1435 // Null move dynamic reduction based on depth
1436 int R = 3 + (depth >= 5 * OnePly ? depth / 8 : 0);
1438 // Null move dynamic reduction based on value
1439 if (staticValue - beta > PawnValueMidgame)
1442 nullValue = -search(pos, ss, -(beta-1), depth-R*OnePly, ply+1, false, threadID);
1444 pos.undo_null_move();
1446 if (nullValue >= beta)
1448 if (depth < 6 * OnePly)
1451 // Do zugzwang verification search
1452 Value v = search(pos, ss, beta, depth-5*OnePly, ply, false, threadID);
1456 // The null move failed low, which means that we may be faced with
1457 // some kind of threat. If the previous move was reduced, check if
1458 // the move that refuted the null move was somehow connected to the
1459 // move which was reduced. If a connection is found, return a fail
1460 // low score (which will cause the reduced move to fail high in the
1461 // parent node, which will trigger a re-search with full depth).
1462 if (nullValue == value_mated_in(ply + 2))
1465 ss[ply].threatMove = ss[ply + 1].currentMove;
1466 if ( depth < ThreatDepth
1467 && ss[ply - 1].reduction
1468 && connected_moves(pos, ss[ply - 1].currentMove, ss[ply].threatMove))
1472 // Null move search not allowed, try razoring
1473 else if ( !value_is_mate(beta)
1475 && depth < RazorDepth
1476 && staticValue < beta - (NullMoveMargin + 16 * depth)
1477 && ss[ply - 1].currentMove != MOVE_NULL
1478 && ttMove == MOVE_NONE
1479 && !pos.has_pawn_on_7th(pos.side_to_move()))
1481 Value rbeta = beta - (NullMoveMargin + 16 * depth);
1482 Value v = qsearch(pos, ss, rbeta-1, rbeta, Depth(0), ply, threadID);
1487 // Go with internal iterative deepening if we don't have a TT move
1488 if (UseIIDAtNonPVNodes && ttMove == MOVE_NONE && depth >= 8*OnePly &&
1489 !isCheck && ss[ply].eval >= beta - IIDMargin)
1491 search(pos, ss, beta, Min(depth/2, depth-2*OnePly), ply, false, threadID);
1492 ttMove = ss[ply].pv[ply];
1493 tte = TT.retrieve(pos.get_key());
1496 // Initialize a MovePicker object for the current position, and prepare
1497 // to search all moves.
1498 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
1501 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1502 while ( bestValue < beta
1503 && (move = mp.get_next_move()) != MOVE_NONE
1504 && !thread_should_stop(threadID))
1506 assert(move_is_ok(move));
1508 if (move == excludedMove)
1511 moveIsCheck = pos.move_is_check(move, ci);
1512 singleEvasion = (isCheck && mp.number_of_evasions() == 1);
1513 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1515 // Decide the new search depth
1516 ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, singleEvasion, mateThreat, &dangerous);
1518 // Singular extension search. We extend the TT move if its value is much better than
1519 // its siblings. To verify this we do a reduced search on all the other moves but the
1520 // ttMove, if result is lower then ttValue minus a margin then we extend ttMove.
1521 if ( depth >= 8 * OnePly
1523 && move == tte->move()
1524 && !excludedMove // Do not allow recursive single-reply search
1526 && is_lower_bound(tte->type())
1527 && tte->depth() >= depth - 3 * OnePly)
1529 Value ttValue = value_from_tt(tte->value(), ply);
1531 if (abs(ttValue) < VALUE_KNOWN_WIN)
1533 Value excValue = search(pos, ss, ttValue - SingleReplyMargin, depth / 2, ply, false, threadID, move);
1535 if (excValue < ttValue - SingleReplyMargin)
1540 newDepth = depth - OnePly + ext;
1542 // Update current move
1543 movesSearched[moveCount++] = ss[ply].currentMove = move;
1548 && !captureOrPromotion
1549 && !move_is_castle(move)
1552 // Move count based pruning
1553 if ( moveCount >= FutilityMoveCountMargin
1554 && ok_to_prune(pos, move, ss[ply].threatMove)
1555 && bestValue > value_mated_in(PLY_MAX))
1558 // Value based pruning
1559 Depth predictedDepth = newDepth;
1561 //FIXME HACK: awful code duplication
1562 double red = 0.5 + ln(moveCount) * ln(depth / 2) / 3.0;
1564 predictedDepth -= int(floor(red * int(OnePly)));
1566 if (predictedDepth < SelectiveDepth)
1568 int preFutilityValueMargin = 0;
1569 if (predictedDepth >= OnePly)
1570 preFutilityValueMargin = 112 * bitScanReverse32(int(predictedDepth) * int(predictedDepth) / 2);
1572 preFutilityValueMargin += H.gain(pos.piece_on(move_from(move)), move_from(move), move_to(move)) + 45;
1574 futilityValueScaled = ss[ply].eval + preFutilityValueMargin - moveCount * IncrementalFutilityMargin;
1576 if (futilityValueScaled < beta)
1578 if (futilityValueScaled > bestValue)
1579 bestValue = futilityValueScaled;
1585 // Make and search the move
1586 pos.do_move(move, st, ci, moveIsCheck);
1588 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1589 // if the move fails high will be re-searched at full depth.
1590 bool doFullDepthSearch = true;
1592 if ( depth >= 3*OnePly
1594 && !captureOrPromotion
1595 && !move_is_castle(move)
1596 && !move_is_killer(move, ss[ply])
1597 /* && move != ttMove*/)
1599 double red = 0.5 + ln(moveCount) * ln(depth / 2) / 3.0;
1602 ss[ply].reduction = Depth(int(floor(red * int(OnePly))));
1603 value = -search(pos, ss, -(beta-1), newDepth-ss[ply].reduction, ply+1, true, threadID);
1604 doFullDepthSearch = (value >= beta);
1608 if (doFullDepthSearch) // Go with full depth non-pv search
1610 ss[ply].reduction = Depth(0);
1611 value = -search(pos, ss, -(beta-1), newDepth, ply+1, true, threadID);
1613 pos.undo_move(move);
1615 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1618 if (value > bestValue)
1624 if (value == value_mate_in(ply + 1))
1625 ss[ply].mateKiller = move;
1629 if ( ActiveThreads > 1
1631 && depth >= MinimumSplitDepth
1633 && idle_thread_exists(threadID)
1635 && !thread_should_stop(threadID)
1636 && split(pos, ss, ply, &beta, &beta, &bestValue, futilityValue, //FIXME: SMP & futilityValue
1637 depth, &moveCount, &mp, threadID, false))
1641 // All legal moves have been searched. A special case: If there were
1642 // no legal moves, it must be mate or stalemate.
1644 return excludedMove ? beta - 1 : (pos.is_check() ? value_mated_in(ply) : VALUE_DRAW);
1646 // If the search is not aborted, update the transposition table,
1647 // history counters, and killer moves.
1648 if (AbortSearch || thread_should_stop(threadID))
1651 if (bestValue < beta)
1652 TT.store(posKey, value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1655 BetaCounter.add(pos.side_to_move(), depth, threadID);
1656 move = ss[ply].pv[ply];
1657 TT.store(posKey, value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, move);
1658 if (!pos.move_is_capture_or_promotion(move))
1660 update_history(pos, move, depth, movesSearched, moveCount);
1661 update_killers(move, ss[ply]);
1666 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1672 // qsearch() is the quiescence search function, which is called by the main
1673 // search function when the remaining depth is zero (or, to be more precise,
1674 // less than OnePly).
1676 Value qsearch(Position& pos, SearchStack ss[], Value alpha, Value beta,
1677 Depth depth, int ply, int threadID) {
1679 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1680 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1682 assert(ply >= 0 && ply < PLY_MAX);
1683 assert(threadID >= 0 && threadID < ActiveThreads);
1688 Value staticValue, bestValue, value, futilityBase, futilityValue;
1689 bool isCheck, enoughMaterial, moveIsCheck, evasionPrunable;
1690 const TTEntry* tte = NULL;
1692 bool pvNode = (beta - alpha != 1);
1694 // Initialize, and make an early exit in case of an aborted search,
1695 // an instant draw, maximum ply reached, etc.
1696 init_node(ss, ply, threadID);
1698 // After init_node() that calls poll()
1699 if (AbortSearch || thread_should_stop(threadID))
1702 if (pos.is_draw() || ply >= PLY_MAX - 1)
1705 // Transposition table lookup. At PV nodes, we don't use the TT for
1706 // pruning, but only for move ordering.
1707 tte = TT.retrieve(pos.get_key());
1708 ttMove = (tte ? tte->move() : MOVE_NONE);
1710 if (!pvNode && tte && ok_to_use_TT(tte, depth, beta, ply))
1712 assert(tte->type() != VALUE_TYPE_EVAL);
1714 ss[ply].currentMove = ttMove; // Can be MOVE_NONE
1715 return value_from_tt(tte->value(), ply);
1718 isCheck = pos.is_check();
1720 // Evaluate the position statically
1722 staticValue = -VALUE_INFINITE;
1723 else if (tte && (tte->type() & VALUE_TYPE_EVAL))
1724 staticValue = value_from_tt(tte->value(), ply);
1726 staticValue = evaluate(pos, ei, threadID);
1730 ss[ply].eval = staticValue;
1731 update_gains(pos, ss[ply - 1].currentMove, ss[ply - 1].eval, ss[ply].eval);
1734 // Initialize "stand pat score", and return it immediately if it is
1736 bestValue = staticValue;
1738 if (bestValue >= beta)
1740 // Store the score to avoid a future costly evaluation() call
1741 if (!isCheck && !tte && ei.futilityMargin == 0)
1742 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EV_LO, Depth(-127*OnePly), MOVE_NONE);
1747 if (bestValue > alpha)
1750 // If we are near beta then try to get a cutoff pushing checks a bit further
1751 bool deepChecks = depth == -OnePly && staticValue >= beta - PawnValueMidgame / 8;
1753 // Initialize a MovePicker object for the current position, and prepare
1754 // to search the moves. Because the depth is <= 0 here, only captures,
1755 // queen promotions and checks (only if depth == 0 or depth == -OnePly
1756 // and we are near beta) will be generated.
1757 MovePicker mp = MovePicker(pos, ttMove, deepChecks ? Depth(0) : depth, H);
1759 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1760 futilityBase = staticValue + FutilityMarginQS + ei.futilityMargin;
1762 // Loop through the moves until no moves remain or a beta cutoff
1764 while ( alpha < beta
1765 && (move = mp.get_next_move()) != MOVE_NONE)
1767 assert(move_is_ok(move));
1769 moveIsCheck = pos.move_is_check(move, ci);
1771 // Update current move
1773 ss[ply].currentMove = move;
1781 && !move_is_promotion(move)
1782 && !pos.move_is_passed_pawn_push(move))
1784 futilityValue = futilityBase
1785 + pos.endgame_value_of_piece_on(move_to(move))
1786 + (move_is_ep(move) ? PawnValueEndgame : Value(0));
1788 if (futilityValue < alpha)
1790 if (futilityValue > bestValue)
1791 bestValue = futilityValue;
1796 // Detect blocking evasions that are candidate to be pruned
1797 evasionPrunable = isCheck
1798 && bestValue != -VALUE_INFINITE
1799 && !pos.move_is_capture(move)
1800 && pos.type_of_piece_on(move_from(move)) != KING
1801 && !pos.can_castle(pos.side_to_move());
1803 // Don't search moves with negative SEE values
1804 if ( (!isCheck || evasionPrunable)
1806 && !move_is_promotion(move)
1807 && pos.see_sign(move) < 0)
1810 // Make and search the move
1811 pos.do_move(move, st, ci, moveIsCheck);
1812 value = -qsearch(pos, ss, -beta, -alpha, depth-OnePly, ply+1, threadID);
1813 pos.undo_move(move);
1815 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1818 if (value > bestValue)
1829 // All legal moves have been searched. A special case: If we're in check
1830 // and no legal moves were found, it is checkmate.
1831 if (!moveCount && pos.is_check()) // Mate!
1832 return value_mated_in(ply);
1834 // Update transposition table
1835 Depth d = (depth == Depth(0) ? Depth(0) : Depth(-1));
1836 if (bestValue < beta)
1838 // If bestValue isn't changed it means it is still the static evaluation
1839 // of the node, so keep this info to avoid a future evaluation() call.
1840 ValueType type = (bestValue == staticValue && !ei.futilityMargin ? VALUE_TYPE_EV_UP : VALUE_TYPE_UPPER);
1841 TT.store(pos.get_key(), value_to_tt(bestValue, ply), type, d, MOVE_NONE);
1845 move = ss[ply].pv[ply];
1846 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, d, move);
1848 // Update killers only for good checking moves
1849 if (!pos.move_is_capture_or_promotion(move))
1850 update_killers(move, ss[ply]);
1853 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1859 // sp_search() is used to search from a split point. This function is called
1860 // by each thread working at the split point. It is similar to the normal
1861 // search() function, but simpler. Because we have already probed the hash
1862 // table, done a null move search, and searched the first move before
1863 // splitting, we don't have to repeat all this work in sp_search(). We
1864 // also don't need to store anything to the hash table here: This is taken
1865 // care of after we return from the split point.
1867 void sp_search(SplitPoint* sp, int threadID) {
1869 assert(threadID >= 0 && threadID < ActiveThreads);
1870 assert(ActiveThreads > 1);
1872 Position pos(*sp->pos);
1874 SearchStack* ss = sp->sstack[threadID];
1875 Value value = -VALUE_INFINITE;
1878 bool isCheck = pos.is_check();
1879 bool useFutilityPruning = sp->depth < SelectiveDepth
1882 const int FutilityMoveCountMargin = 3 + (1 << (3 * int(sp->depth) / 8));
1884 while ( lock_grab_bool(&(sp->lock))
1885 && sp->bestValue < sp->beta
1886 && !thread_should_stop(threadID)
1887 && (move = sp->mp->get_next_move()) != MOVE_NONE)
1889 moveCount = ++sp->moves;
1890 lock_release(&(sp->lock));
1892 assert(move_is_ok(move));
1894 bool moveIsCheck = pos.move_is_check(move, ci);
1895 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
1897 ss[sp->ply].currentMove = move;
1899 // Decide the new search depth
1901 Depth ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, false, false, &dangerous);
1902 Depth newDepth = sp->depth - OnePly + ext;
1905 if ( useFutilityPruning
1907 && !captureOrPromotion)
1909 // Move count based pruning
1910 if ( moveCount >= FutilityMoveCountMargin
1911 && ok_to_prune(pos, move, ss[sp->ply].threatMove)
1912 && sp->bestValue > value_mated_in(PLY_MAX))
1915 // Value based pruning
1916 Value futilityValueScaled = sp->futilityValue - moveCount * IncrementalFutilityMargin;
1918 if (futilityValueScaled < sp->beta)
1920 if (futilityValueScaled > sp->bestValue) // Less then 1% of cases
1922 lock_grab(&(sp->lock));
1923 if (futilityValueScaled > sp->bestValue)
1924 sp->bestValue = futilityValueScaled;
1925 lock_release(&(sp->lock));
1931 // Make and search the move.
1933 pos.do_move(move, st, ci, moveIsCheck);
1935 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1936 // if the move fails high will be re-searched at full depth.
1937 bool doFullDepthSearch = true;
1940 && !captureOrPromotion
1941 && !move_is_castle(move)
1942 && !move_is_killer(move, ss[sp->ply]))
1944 double red = 0.5 + ln(moveCount) * ln(sp->depth / 2) / 3.0;
1947 ss[sp->ply].reduction = Depth(int(floor(red * int(OnePly))));
1948 value = -search(pos, ss, -(sp->beta-1), newDepth-ss[sp->ply].reduction, sp->ply+1, true, threadID);
1949 doFullDepthSearch = (value >= sp->beta);
1953 if (doFullDepthSearch) // Go with full depth non-pv search
1955 ss[sp->ply].reduction = Depth(0);
1956 value = -search(pos, ss, -(sp->beta - 1), newDepth, sp->ply+1, true, threadID);
1958 pos.undo_move(move);
1960 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1962 if (thread_should_stop(threadID))
1966 if (value > sp->bestValue) // Less then 2% of cases
1968 lock_grab(&(sp->lock));
1969 if (value > sp->bestValue && !thread_should_stop(threadID))
1971 sp->bestValue = value;
1972 if (sp->bestValue >= sp->beta)
1974 sp_update_pv(sp->parentSstack, ss, sp->ply);
1975 for (int i = 0; i < ActiveThreads; i++)
1976 if (i != threadID && (i == sp->master || sp->slaves[i]))
1977 Threads[i].stop = true;
1979 sp->finished = true;
1982 lock_release(&(sp->lock));
1986 /* Here we have the lock still grabbed */
1988 // If this is the master thread and we have been asked to stop because of
1989 // a beta cutoff higher up in the tree, stop all slave threads.
1990 if (sp->master == threadID && thread_should_stop(threadID))
1991 for (int i = 0; i < ActiveThreads; i++)
1993 Threads[i].stop = true;
1996 sp->slaves[threadID] = 0;
1998 lock_release(&(sp->lock));
2002 // sp_search_pv() is used to search from a PV split point. This function
2003 // is called by each thread working at the split point. It is similar to
2004 // the normal search_pv() function, but simpler. Because we have already
2005 // probed the hash table and searched the first move before splitting, we
2006 // don't have to repeat all this work in sp_search_pv(). We also don't
2007 // need to store anything to the hash table here: This is taken care of
2008 // after we return from the split point.
2010 void sp_search_pv(SplitPoint* sp, int threadID) {
2012 assert(threadID >= 0 && threadID < ActiveThreads);
2013 assert(ActiveThreads > 1);
2015 Position pos(*sp->pos);
2017 SearchStack* ss = sp->sstack[threadID];
2018 Value value = -VALUE_INFINITE;
2022 while ( lock_grab_bool(&(sp->lock))
2023 && sp->alpha < sp->beta
2024 && !thread_should_stop(threadID)
2025 && (move = sp->mp->get_next_move()) != MOVE_NONE)
2027 moveCount = ++sp->moves;
2028 lock_release(&(sp->lock));
2030 assert(move_is_ok(move));
2032 bool moveIsCheck = pos.move_is_check(move, ci);
2033 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
2035 ss[sp->ply].currentMove = move;
2037 // Decide the new search depth
2039 Depth ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, false, false, &dangerous);
2040 Depth newDepth = sp->depth - OnePly + ext;
2042 // Make and search the move.
2044 pos.do_move(move, st, ci, moveIsCheck);
2046 // Try to reduce non-pv search depth by one ply if move seems not problematic,
2047 // if the move fails high will be re-searched at full depth.
2048 bool doFullDepthSearch = true;
2051 && !captureOrPromotion
2052 && !move_is_castle(move)
2053 && !move_is_killer(move, ss[sp->ply]))
2055 double red = 0.5 + ln(moveCount) * ln(sp->depth / 2) / 6.0;
2058 Value localAlpha = sp->alpha;
2059 ss[sp->ply].reduction = Depth(int(floor(red * int(OnePly))));
2060 value = -search(pos, ss, -localAlpha, newDepth-ss[sp->ply].reduction, sp->ply+1, true, threadID);
2061 doFullDepthSearch = (value > localAlpha);
2065 if (doFullDepthSearch) // Go with full depth non-pv search
2067 Value localAlpha = sp->alpha;
2068 ss[sp->ply].reduction = Depth(0);
2069 value = -search(pos, ss, -localAlpha, newDepth, sp->ply+1, true, threadID);
2071 if (value > localAlpha && value < sp->beta)
2073 // When the search fails high at ply 1 while searching the first
2074 // move at the root, set the flag failHighPly1. This is used for
2075 // time managment: We don't want to stop the search early in
2076 // such cases, because resolving the fail high at ply 1 could
2077 // result in a big drop in score at the root.
2078 if (sp->ply == 1 && RootMoveNumber == 1)
2079 Threads[threadID].failHighPly1 = true;
2081 // If another thread has failed high then sp->alpha has been increased
2082 // to be higher or equal then beta, if so, avoid to start a PV search.
2083 localAlpha = sp->alpha;
2084 if (localAlpha < sp->beta)
2085 value = -search_pv(pos, ss, -sp->beta, -localAlpha, newDepth, sp->ply+1, threadID);
2087 assert(thread_should_stop(threadID));
2089 Threads[threadID].failHighPly1 = false;
2092 pos.undo_move(move);
2094 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
2096 if (thread_should_stop(threadID))
2100 if (value > sp->bestValue) // Less then 2% of cases
2102 lock_grab(&(sp->lock));
2103 if (value > sp->bestValue && !thread_should_stop(threadID))
2105 sp->bestValue = value;
2106 if (value > sp->alpha)
2108 // Ask threads to stop before to modify sp->alpha
2109 if (value >= sp->beta)
2111 for (int i = 0; i < ActiveThreads; i++)
2112 if (i != threadID && (i == sp->master || sp->slaves[i]))
2113 Threads[i].stop = true;
2115 sp->finished = true;
2120 sp_update_pv(sp->parentSstack, ss, sp->ply);
2121 if (value == value_mate_in(sp->ply + 1))
2122 ss[sp->ply].mateKiller = move;
2124 // If we are at ply 1, and we are searching the first root move at
2125 // ply 0, set the 'Problem' variable if the score has dropped a lot
2126 // (from the computer's point of view) since the previous iteration.
2129 && -value <= IterationInfo[Iteration-1].value - ProblemMargin)
2132 lock_release(&(sp->lock));
2136 /* Here we have the lock still grabbed */
2138 // If this is the master thread and we have been asked to stop because of
2139 // a beta cutoff higher up in the tree, stop all slave threads.
2140 if (sp->master == threadID && thread_should_stop(threadID))
2141 for (int i = 0; i < ActiveThreads; i++)
2143 Threads[i].stop = true;
2146 sp->slaves[threadID] = 0;
2148 lock_release(&(sp->lock));
2151 /// The BetaCounterType class
2153 BetaCounterType::BetaCounterType() { clear(); }
2155 void BetaCounterType::clear() {
2157 for (int i = 0; i < THREAD_MAX; i++)
2158 Threads[i].betaCutOffs[WHITE] = Threads[i].betaCutOffs[BLACK] = 0ULL;
2161 void BetaCounterType::add(Color us, Depth d, int threadID) {
2163 // Weighted count based on depth
2164 Threads[threadID].betaCutOffs[us] += unsigned(d);
2167 void BetaCounterType::read(Color us, int64_t& our, int64_t& their) {
2170 for (int i = 0; i < THREAD_MAX; i++)
2172 our += Threads[i].betaCutOffs[us];
2173 their += Threads[i].betaCutOffs[opposite_color(us)];
2178 /// The RootMoveList class
2180 // RootMoveList c'tor
2182 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) : count(0) {
2184 MoveStack mlist[MaxRootMoves];
2185 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
2187 // Generate all legal moves
2188 MoveStack* last = generate_moves(pos, mlist);
2190 // Add each move to the moves[] array
2191 for (MoveStack* cur = mlist; cur != last; cur++)
2193 bool includeMove = includeAllMoves;
2195 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
2196 includeMove = (searchMoves[k] == cur->move);
2201 // Find a quick score for the move
2203 SearchStack ss[PLY_MAX_PLUS_2];
2206 moves[count].move = cur->move;
2207 pos.do_move(moves[count].move, st);
2208 moves[count].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE, Depth(0), 1, 0);
2209 pos.undo_move(moves[count].move);
2210 moves[count].pv[0] = moves[count].move;
2211 moves[count].pv[1] = MOVE_NONE;
2218 // RootMoveList simple methods definitions
2220 void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) {
2222 moves[moveNum].nodes = nodes;
2223 moves[moveNum].cumulativeNodes += nodes;
2226 void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) {
2228 moves[moveNum].ourBeta = our;
2229 moves[moveNum].theirBeta = their;
2232 void RootMoveList::set_move_pv(int moveNum, const Move pv[]) {
2236 for (j = 0; pv[j] != MOVE_NONE; j++)
2237 moves[moveNum].pv[j] = pv[j];
2239 moves[moveNum].pv[j] = MOVE_NONE;
2243 // RootMoveList::sort() sorts the root move list at the beginning of a new
2246 void RootMoveList::sort() {
2248 sort_multipv(count - 1); // Sort all items
2252 // RootMoveList::sort_multipv() sorts the first few moves in the root move
2253 // list by their scores and depths. It is used to order the different PVs
2254 // correctly in MultiPV mode.
2256 void RootMoveList::sort_multipv(int n) {
2260 for (i = 1; i <= n; i++)
2262 RootMove rm = moves[i];
2263 for (j = i; j > 0 && moves[j - 1] < rm; j--)
2264 moves[j] = moves[j - 1];
2271 // init_node() is called at the beginning of all the search functions
2272 // (search(), search_pv(), qsearch(), and so on) and initializes the
2273 // search stack object corresponding to the current node. Once every
2274 // NodesBetweenPolls nodes, init_node() also calls poll(), which polls
2275 // for user input and checks whether it is time to stop the search.
2277 void init_node(SearchStack ss[], int ply, int threadID) {
2279 assert(ply >= 0 && ply < PLY_MAX);
2280 assert(threadID >= 0 && threadID < ActiveThreads);
2282 Threads[threadID].nodes++;
2287 if (NodesSincePoll >= NodesBetweenPolls)
2294 ss[ply + 2].initKillers();
2296 if (Threads[threadID].printCurrentLine)
2297 print_current_line(ss, ply, threadID);
2301 // update_pv() is called whenever a search returns a value > alpha.
2302 // It updates the PV in the SearchStack object corresponding to the
2305 void update_pv(SearchStack ss[], int ply) {
2307 assert(ply >= 0 && ply < PLY_MAX);
2311 ss[ply].pv[ply] = ss[ply].currentMove;
2313 for (p = ply + 1; ss[ply + 1].pv[p] != MOVE_NONE; p++)
2314 ss[ply].pv[p] = ss[ply + 1].pv[p];
2316 ss[ply].pv[p] = MOVE_NONE;
2320 // sp_update_pv() is a variant of update_pv for use at split points. The
2321 // difference between the two functions is that sp_update_pv also updates
2322 // the PV at the parent node.
2324 void sp_update_pv(SearchStack* pss, SearchStack ss[], int ply) {
2326 assert(ply >= 0 && ply < PLY_MAX);
2330 ss[ply].pv[ply] = pss[ply].pv[ply] = ss[ply].currentMove;
2332 for (p = ply + 1; ss[ply + 1].pv[p] != MOVE_NONE; p++)
2333 ss[ply].pv[p] = pss[ply].pv[p] = ss[ply + 1].pv[p];
2335 ss[ply].pv[p] = pss[ply].pv[p] = MOVE_NONE;
2339 // connected_moves() tests whether two moves are 'connected' in the sense
2340 // that the first move somehow made the second move possible (for instance
2341 // if the moving piece is the same in both moves). The first move is assumed
2342 // to be the move that was made to reach the current position, while the
2343 // second move is assumed to be a move from the current position.
2345 bool connected_moves(const Position& pos, Move m1, Move m2) {
2347 Square f1, t1, f2, t2;
2350 assert(move_is_ok(m1));
2351 assert(move_is_ok(m2));
2353 if (m2 == MOVE_NONE)
2356 // Case 1: The moving piece is the same in both moves
2362 // Case 2: The destination square for m2 was vacated by m1
2368 // Case 3: Moving through the vacated square
2369 if ( piece_is_slider(pos.piece_on(f2))
2370 && bit_is_set(squares_between(f2, t2), f1))
2373 // Case 4: The destination square for m2 is defended by the moving piece in m1
2374 p = pos.piece_on(t1);
2375 if (bit_is_set(pos.attacks_from(p, t1), t2))
2378 // Case 5: Discovered check, checking piece is the piece moved in m1
2379 if ( piece_is_slider(p)
2380 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
2381 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
2383 // discovered_check_candidates() works also if the Position's side to
2384 // move is the opposite of the checking piece.
2385 Color them = opposite_color(pos.side_to_move());
2386 Bitboard dcCandidates = pos.discovered_check_candidates(them);
2388 if (bit_is_set(dcCandidates, f2))
2395 // value_is_mate() checks if the given value is a mate one
2396 // eventually compensated for the ply.
2398 bool value_is_mate(Value value) {
2400 assert(abs(value) <= VALUE_INFINITE);
2402 return value <= value_mated_in(PLY_MAX)
2403 || value >= value_mate_in(PLY_MAX);
2407 // move_is_killer() checks if the given move is among the
2408 // killer moves of that ply.
2410 bool move_is_killer(Move m, const SearchStack& ss) {
2412 const Move* k = ss.killers;
2413 for (int i = 0; i < KILLER_MAX; i++, k++)
2421 // extension() decides whether a move should be searched with normal depth,
2422 // or with extended depth. Certain classes of moves (checking moves, in
2423 // particular) are searched with bigger depth than ordinary moves and in
2424 // any case are marked as 'dangerous'. Note that also if a move is not
2425 // extended, as example because the corresponding UCI option is set to zero,
2426 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
2428 Depth extension(const Position& pos, Move m, bool pvNode, bool captureOrPromotion,
2429 bool moveIsCheck, bool singleEvasion, bool mateThreat, bool* dangerous) {
2431 assert(m != MOVE_NONE);
2433 Depth result = Depth(0);
2434 *dangerous = moveIsCheck | singleEvasion | mateThreat;
2439 result += CheckExtension[pvNode];
2442 result += SingleEvasionExtension[pvNode];
2445 result += MateThreatExtension[pvNode];
2448 if (pos.type_of_piece_on(move_from(m)) == PAWN)
2450 Color c = pos.side_to_move();
2451 if (relative_rank(c, move_to(m)) == RANK_7)
2453 result += PawnPushTo7thExtension[pvNode];
2456 if (pos.pawn_is_passed(c, move_to(m)))
2458 result += PassedPawnExtension[pvNode];
2463 if ( captureOrPromotion
2464 && pos.type_of_piece_on(move_to(m)) != PAWN
2465 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
2466 - pos.midgame_value_of_piece_on(move_to(m)) == Value(0))
2467 && !move_is_promotion(m)
2470 result += PawnEndgameExtension[pvNode];
2475 && captureOrPromotion
2476 && pos.type_of_piece_on(move_to(m)) != PAWN
2477 && pos.see_sign(m) >= 0)
2483 return Min(result, OnePly);
2487 // ok_to_do_nullmove() looks at the current position and decides whether
2488 // doing a 'null move' should be allowed. In order to avoid zugzwang
2489 // problems, null moves are not allowed when the side to move has very
2490 // little material left. Currently, the test is a bit too simple: Null
2491 // moves are avoided only when the side to move has only pawns left.
2492 // It's probably a good idea to avoid null moves in at least some more
2493 // complicated endgames, e.g. KQ vs KR. FIXME
2495 bool ok_to_do_nullmove(const Position& pos) {
2497 return pos.non_pawn_material(pos.side_to_move()) != Value(0);
2501 // ok_to_prune() tests whether it is safe to forward prune a move. Only
2502 // non-tactical moves late in the move list close to the leaves are
2503 // candidates for pruning.
2505 bool ok_to_prune(const Position& pos, Move m, Move threat) {
2507 assert(move_is_ok(m));
2508 assert(threat == MOVE_NONE || move_is_ok(threat));
2509 assert(!pos.move_is_check(m));
2510 assert(!pos.move_is_capture_or_promotion(m));
2511 assert(!pos.move_is_passed_pawn_push(m));
2513 Square mfrom, mto, tfrom, tto;
2515 // Prune if there isn't any threat move
2516 if (threat == MOVE_NONE)
2519 mfrom = move_from(m);
2521 tfrom = move_from(threat);
2522 tto = move_to(threat);
2524 // Case 1: Don't prune moves which move the threatened piece
2528 // Case 2: If the threatened piece has value less than or equal to the
2529 // value of the threatening piece, don't prune move which defend it.
2530 if ( pos.move_is_capture(threat)
2531 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
2532 || pos.type_of_piece_on(tfrom) == KING)
2533 && pos.move_attacks_square(m, tto))
2536 // Case 3: If the moving piece in the threatened move is a slider, don't
2537 // prune safe moves which block its ray.
2538 if ( piece_is_slider(pos.piece_on(tfrom))
2539 && bit_is_set(squares_between(tfrom, tto), mto)
2540 && pos.see_sign(m) >= 0)
2547 // ok_to_use_TT() returns true if a transposition table score
2548 // can be used at a given point in search.
2550 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
2552 Value v = value_from_tt(tte->value(), ply);
2554 return ( tte->depth() >= depth
2555 || v >= Max(value_mate_in(PLY_MAX), beta)
2556 || v < Min(value_mated_in(PLY_MAX), beta))
2558 && ( (is_lower_bound(tte->type()) && v >= beta)
2559 || (is_upper_bound(tte->type()) && v < beta));
2563 // refine_eval() returns the transposition table score if
2564 // possible otherwise falls back on static position evaluation.
2566 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
2571 Value v = value_from_tt(tte->value(), ply);
2573 if ( (is_lower_bound(tte->type()) && v >= defaultEval)
2574 || (is_upper_bound(tte->type()) && v < defaultEval))
2580 // update_history() registers a good move that produced a beta-cutoff
2581 // in history and marks as failures all the other moves of that ply.
2583 void update_history(const Position& pos, Move move, Depth depth,
2584 Move movesSearched[], int moveCount) {
2588 H.success(pos.piece_on(move_from(move)), move_to(move), depth);
2590 for (int i = 0; i < moveCount - 1; i++)
2592 m = movesSearched[i];
2596 if (!pos.move_is_capture_or_promotion(m))
2597 H.failure(pos.piece_on(move_from(m)), move_to(m), depth);
2602 // update_killers() add a good move that produced a beta-cutoff
2603 // among the killer moves of that ply.
2605 void update_killers(Move m, SearchStack& ss) {
2607 if (m == ss.killers[0])
2610 for (int i = KILLER_MAX - 1; i > 0; i--)
2611 ss.killers[i] = ss.killers[i - 1];
2617 // update_gains() updates the gains table of a non-capture move given
2618 // the static position evaluation before and after the move.
2620 void update_gains(const Position& pos, Move m, Value before, Value after) {
2623 && before != VALUE_NONE
2624 && after != VALUE_NONE
2625 && pos.captured_piece() == NO_PIECE_TYPE
2626 && !move_is_castle(m)
2627 && !move_is_promotion(m))
2628 H.set_gain(pos.piece_on(move_to(m)), move_from(m), move_to(m), -(before + after));
2632 // fail_high_ply_1() checks if some thread is currently resolving a fail
2633 // high at ply 1 at the node below the first root node. This information
2634 // is used for time management.
2636 bool fail_high_ply_1() {
2638 for (int i = 0; i < ActiveThreads; i++)
2639 if (Threads[i].failHighPly1)
2646 // current_search_time() returns the number of milliseconds which have passed
2647 // since the beginning of the current search.
2649 int current_search_time() {
2651 return get_system_time() - SearchStartTime;
2655 // nps() computes the current nodes/second count.
2659 int t = current_search_time();
2660 return (t > 0 ? int((nodes_searched() * 1000) / t) : 0);
2664 // poll() performs two different functions: It polls for user input, and it
2665 // looks at the time consumed so far and decides if it's time to abort the
2670 static int lastInfoTime;
2671 int t = current_search_time();
2676 // We are line oriented, don't read single chars
2677 std::string command;
2679 if (!std::getline(std::cin, command))
2682 if (command == "quit")
2685 PonderSearch = false;
2689 else if (command == "stop")
2692 PonderSearch = false;
2694 else if (command == "ponderhit")
2698 // Print search information
2702 else if (lastInfoTime > t)
2703 // HACK: Must be a new search where we searched less than
2704 // NodesBetweenPolls nodes during the first second of search.
2707 else if (t - lastInfoTime >= 1000)
2715 if (dbg_show_hit_rate)
2716 dbg_print_hit_rate();
2718 cout << "info nodes " << nodes_searched() << " nps " << nps()
2719 << " time " << t << " hashfull " << TT.full() << endl;
2721 lock_release(&IOLock);
2723 if (ShowCurrentLine)
2724 Threads[0].printCurrentLine = true;
2727 // Should we stop the search?
2731 bool stillAtFirstMove = RootMoveNumber == 1
2733 && t > MaxSearchTime + ExtraSearchTime;
2735 bool noProblemFound = !FailHigh
2737 && !fail_high_ply_1()
2739 && t > 6 * (MaxSearchTime + ExtraSearchTime);
2741 bool noMoreTime = t > AbsoluteMaxSearchTime
2742 || stillAtFirstMove //FIXME: We are not checking any problem flags, BUG?
2745 if ( (Iteration >= 3 && UseTimeManagement && noMoreTime)
2746 || (ExactMaxTime && t >= ExactMaxTime)
2747 || (Iteration >= 3 && MaxNodes && nodes_searched() >= MaxNodes))
2752 // ponderhit() is called when the program is pondering (i.e. thinking while
2753 // it's the opponent's turn to move) in order to let the engine know that
2754 // it correctly predicted the opponent's move.
2758 int t = current_search_time();
2759 PonderSearch = false;
2761 bool stillAtFirstMove = RootMoveNumber == 1
2763 && t > MaxSearchTime + ExtraSearchTime;
2765 bool noProblemFound = !FailHigh
2767 && !fail_high_ply_1()
2769 && t > 6 * (MaxSearchTime + ExtraSearchTime);
2771 bool noMoreTime = t > AbsoluteMaxSearchTime
2775 if (Iteration >= 3 && UseTimeManagement && (noMoreTime || StopOnPonderhit))
2780 // print_current_line() prints the current line of search for a given
2781 // thread. Called when the UCI option UCI_ShowCurrLine is 'true'.
2783 void print_current_line(SearchStack ss[], int ply, int threadID) {
2785 assert(ply >= 0 && ply < PLY_MAX);
2786 assert(threadID >= 0 && threadID < ActiveThreads);
2788 if (!Threads[threadID].idle)
2791 cout << "info currline " << (threadID + 1);
2792 for (int p = 0; p < ply; p++)
2793 cout << " " << ss[p].currentMove;
2796 lock_release(&IOLock);
2798 Threads[threadID].printCurrentLine = false;
2799 if (threadID + 1 < ActiveThreads)
2800 Threads[threadID + 1].printCurrentLine = true;
2804 // init_ss_array() does a fast reset of the first entries of a SearchStack array
2806 void init_ss_array(SearchStack ss[]) {
2808 for (int i = 0; i < 3; i++)
2811 ss[i].initKillers();
2816 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2817 // while the program is pondering. The point is to work around a wrinkle in
2818 // the UCI protocol: When pondering, the engine is not allowed to give a
2819 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2820 // We simply wait here until one of these commands is sent, and return,
2821 // after which the bestmove and pondermove will be printed (in id_loop()).
2823 void wait_for_stop_or_ponderhit() {
2825 std::string command;
2829 if (!std::getline(std::cin, command))
2832 if (command == "quit")
2837 else if (command == "ponderhit" || command == "stop")
2843 // idle_loop() is where the threads are parked when they have no work to do.
2844 // The parameter "waitSp", if non-NULL, is a pointer to an active SplitPoint
2845 // object for which the current thread is the master.
2847 void idle_loop(int threadID, SplitPoint* waitSp) {
2849 assert(threadID >= 0 && threadID < THREAD_MAX);
2851 Threads[threadID].running = true;
2855 if (AllThreadsShouldExit && threadID != 0)
2858 // If we are not thinking, wait for a condition to be signaled
2859 // instead of wasting CPU time polling for work.
2860 while (threadID != 0 && (Idle || threadID >= ActiveThreads))
2863 #if !defined(_MSC_VER)
2864 pthread_mutex_lock(&WaitLock);
2865 if (Idle || threadID >= ActiveThreads)
2866 pthread_cond_wait(&WaitCond, &WaitLock);
2868 pthread_mutex_unlock(&WaitLock);
2870 WaitForSingleObject(SitIdleEvent[threadID], INFINITE);
2874 // If this thread has been assigned work, launch a search
2875 if (Threads[threadID].workIsWaiting)
2877 assert(!Threads[threadID].idle);
2879 Threads[threadID].workIsWaiting = false;
2880 if (Threads[threadID].splitPoint->pvNode)
2881 sp_search_pv(Threads[threadID].splitPoint, threadID);
2883 sp_search(Threads[threadID].splitPoint, threadID);
2885 Threads[threadID].idle = true;
2888 // If this thread is the master of a split point and all threads have
2889 // finished their work at this split point, return from the idle loop.
2890 if (waitSp != NULL && waitSp->cpus == 0)
2894 Threads[threadID].running = false;
2898 // init_split_point_stack() is called during program initialization, and
2899 // initializes all split point objects.
2901 void init_split_point_stack() {
2903 for (int i = 0; i < THREAD_MAX; i++)
2904 for (int j = 0; j < ACTIVE_SPLIT_POINTS_MAX; j++)
2906 SplitPointStack[i][j].parent = NULL;
2907 lock_init(&(SplitPointStack[i][j].lock), NULL);
2912 // destroy_split_point_stack() is called when the program exits, and
2913 // destroys all locks in the precomputed split point objects.
2915 void destroy_split_point_stack() {
2917 for (int i = 0; i < THREAD_MAX; i++)
2918 for (int j = 0; j < ACTIVE_SPLIT_POINTS_MAX; j++)
2919 lock_destroy(&(SplitPointStack[i][j].lock));
2923 // thread_should_stop() checks whether the thread with a given threadID has
2924 // been asked to stop, directly or indirectly. This can happen if a beta
2925 // cutoff has occurred in the thread's currently active split point, or in
2926 // some ancestor of the current split point.
2928 bool thread_should_stop(int threadID) {
2930 assert(threadID >= 0 && threadID < ActiveThreads);
2934 if (Threads[threadID].stop)
2936 if (ActiveThreads <= 2)
2938 for (sp = Threads[threadID].splitPoint; sp != NULL; sp = sp->parent)
2941 Threads[threadID].stop = true;
2948 // thread_is_available() checks whether the thread with threadID "slave" is
2949 // available to help the thread with threadID "master" at a split point. An
2950 // obvious requirement is that "slave" must be idle. With more than two
2951 // threads, this is not by itself sufficient: If "slave" is the master of
2952 // some active split point, it is only available as a slave to the other
2953 // threads which are busy searching the split point at the top of "slave"'s
2954 // split point stack (the "helpful master concept" in YBWC terminology).
2956 bool thread_is_available(int slave, int master) {
2958 assert(slave >= 0 && slave < ActiveThreads);
2959 assert(master >= 0 && master < ActiveThreads);
2960 assert(ActiveThreads > 1);
2962 if (!Threads[slave].idle || slave == master)
2965 // Make a local copy to be sure doesn't change under our feet
2966 int localActiveSplitPoints = Threads[slave].activeSplitPoints;
2968 if (localActiveSplitPoints == 0)
2969 // No active split points means that the thread is available as
2970 // a slave for any other thread.
2973 if (ActiveThreads == 2)
2976 // Apply the "helpful master" concept if possible. Use localActiveSplitPoints
2977 // that is known to be > 0, instead of Threads[slave].activeSplitPoints that
2978 // could have been set to 0 by another thread leading to an out of bound access.
2979 if (SplitPointStack[slave][localActiveSplitPoints - 1].slaves[master])
2986 // idle_thread_exists() tries to find an idle thread which is available as
2987 // a slave for the thread with threadID "master".
2989 bool idle_thread_exists(int master) {
2991 assert(master >= 0 && master < ActiveThreads);
2992 assert(ActiveThreads > 1);
2994 for (int i = 0; i < ActiveThreads; i++)
2995 if (thread_is_available(i, master))
3002 // split() does the actual work of distributing the work at a node between
3003 // several threads at PV nodes. If it does not succeed in splitting the
3004 // node (because no idle threads are available, or because we have no unused
3005 // split point objects), the function immediately returns false. If
3006 // splitting is possible, a SplitPoint object is initialized with all the
3007 // data that must be copied to the helper threads (the current position and
3008 // search stack, alpha, beta, the search depth, etc.), and we tell our
3009 // helper threads that they have been assigned work. This will cause them
3010 // to instantly leave their idle loops and call sp_search_pv(). When all
3011 // threads have returned from sp_search_pv (or, equivalently, when
3012 // splitPoint->cpus becomes 0), split() returns true.
3014 bool split(const Position& p, SearchStack* sstck, int ply,
3015 Value* alpha, Value* beta, Value* bestValue, const Value futilityValue,
3016 Depth depth, int* moves, MovePicker* mp, int master, bool pvNode) {
3019 assert(sstck != NULL);
3020 assert(ply >= 0 && ply < PLY_MAX);
3021 assert(*bestValue >= -VALUE_INFINITE && *bestValue <= *alpha);
3022 assert(!pvNode || *alpha < *beta);
3023 assert(*beta <= VALUE_INFINITE);
3024 assert(depth > Depth(0));
3025 assert(master >= 0 && master < ActiveThreads);
3026 assert(ActiveThreads > 1);
3028 SplitPoint* splitPoint;
3032 // If no other thread is available to help us, or if we have too many
3033 // active split points, don't split.
3034 if ( !idle_thread_exists(master)
3035 || Threads[master].activeSplitPoints >= ACTIVE_SPLIT_POINTS_MAX)
3037 lock_release(&MPLock);
3041 // Pick the next available split point object from the split point stack
3042 splitPoint = SplitPointStack[master] + Threads[master].activeSplitPoints;
3043 Threads[master].activeSplitPoints++;
3045 // Initialize the split point object
3046 splitPoint->parent = Threads[master].splitPoint;
3047 splitPoint->finished = false;
3048 splitPoint->ply = ply;
3049 splitPoint->depth = depth;
3050 splitPoint->alpha = pvNode ? *alpha : (*beta - 1);
3051 splitPoint->beta = *beta;
3052 splitPoint->pvNode = pvNode;
3053 splitPoint->bestValue = *bestValue;
3054 splitPoint->futilityValue = futilityValue;
3055 splitPoint->master = master;
3056 splitPoint->mp = mp;
3057 splitPoint->moves = *moves;
3058 splitPoint->cpus = 1;
3059 splitPoint->pos = &p;
3060 splitPoint->parentSstack = sstck;
3061 for (int i = 0; i < ActiveThreads; i++)
3062 splitPoint->slaves[i] = 0;
3064 Threads[master].idle = false;
3065 Threads[master].stop = false;
3066 Threads[master].splitPoint = splitPoint;
3068 // Allocate available threads setting idle flag to false
3069 for (int i = 0; i < ActiveThreads && splitPoint->cpus < MaxThreadsPerSplitPoint; i++)
3070 if (thread_is_available(i, master))
3072 Threads[i].idle = false;
3073 Threads[i].stop = false;
3074 Threads[i].splitPoint = splitPoint;
3075 splitPoint->slaves[i] = 1;
3079 assert(splitPoint->cpus > 1);
3081 // We can release the lock because master and slave threads are already booked
3082 lock_release(&MPLock);
3084 // Tell the threads that they have work to do. This will make them leave
3085 // their idle loop. But before copy search stack tail for each thread.
3086 for (int i = 0; i < ActiveThreads; i++)
3087 if (i == master || splitPoint->slaves[i])
3089 memcpy(splitPoint->sstack[i] + ply - 1, sstck + ply - 1, 3 * sizeof(SearchStack));
3090 Threads[i].workIsWaiting = true; // This makes the slave to exit from idle_loop()
3093 // Everything is set up. The master thread enters the idle loop, from
3094 // which it will instantly launch a search, because its workIsWaiting
3095 // slot is 'true'. We send the split point as a second parameter to the
3096 // idle loop, which means that the main thread will return from the idle
3097 // loop when all threads have finished their work at this split point
3098 // (i.e. when splitPoint->cpus == 0).
3099 idle_loop(master, splitPoint);
3101 // We have returned from the idle loop, which means that all threads are
3102 // finished. Update alpha, beta and bestValue, and return.
3106 *alpha = splitPoint->alpha;
3108 *beta = splitPoint->beta;
3109 *bestValue = splitPoint->bestValue;
3110 Threads[master].stop = false;
3111 Threads[master].idle = false;
3112 Threads[master].activeSplitPoints--;
3113 Threads[master].splitPoint = splitPoint->parent;
3115 lock_release(&MPLock);
3120 // wake_sleeping_threads() wakes up all sleeping threads when it is time
3121 // to start a new search from the root.
3123 void wake_sleeping_threads() {
3125 if (ActiveThreads > 1)
3127 for (int i = 1; i < ActiveThreads; i++)
3129 Threads[i].idle = true;
3130 Threads[i].workIsWaiting = false;
3133 #if !defined(_MSC_VER)
3134 pthread_mutex_lock(&WaitLock);
3135 pthread_cond_broadcast(&WaitCond);
3136 pthread_mutex_unlock(&WaitLock);
3138 for (int i = 1; i < THREAD_MAX; i++)
3139 SetEvent(SitIdleEvent[i]);
3145 // init_thread() is the function which is called when a new thread is
3146 // launched. It simply calls the idle_loop() function with the supplied
3147 // threadID. There are two versions of this function; one for POSIX
3148 // threads and one for Windows threads.
3150 #if !defined(_MSC_VER)
3152 void* init_thread(void *threadID) {
3154 idle_loop(*(int*)threadID, NULL);
3160 DWORD WINAPI init_thread(LPVOID threadID) {
3162 idle_loop(*(int*)threadID, NULL);