2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
43 #include "ucioption.h"
49 //// Local definitions
57 // ThreadsManager class is used to handle all the threads related stuff in search,
58 // init, starting, parking and, the most important, launching a slave thread at a
59 // split point are what this class does. All the access to shared thread data is
60 // done through this class, so that we avoid using global variables instead.
62 class ThreadsManager {
63 /* As long as the single ThreadsManager object is defined as a global we don't
64 need to explicitly initialize to zero its data members because variables with
65 static storage duration are automatically set to zero before enter main()
71 int active_threads() const { return ActiveThreads; }
72 void set_active_threads(int newActiveThreads) { ActiveThreads = newActiveThreads; }
73 void incrementNodeCounter(int threadID) { threads[threadID].nodes++; }
74 void incrementBetaCounter(Color us, Depth d, int threadID) { threads[threadID].betaCutOffs[us] += unsigned(d); }
76 void resetNodeCounters();
77 void resetBetaCounters();
78 int64_t nodes_searched() const;
79 void get_beta_counters(Color us, int64_t& our, int64_t& their) const;
80 bool available_thread_exists(int master) const;
81 bool thread_is_available(int slave, int master) const;
82 bool thread_should_stop(int threadID) const;
83 void wake_sleeping_threads();
84 void put_threads_to_sleep();
85 void idle_loop(int threadID, SplitPoint* waitSp);
86 bool split(const Position& pos, SearchStack* ss, int ply, Value* alpha, const Value beta, Value* bestValue,
87 Depth depth, bool mateThreat, int* moves, MovePicker* mp, int master, bool pvNode);
93 volatile bool AllThreadsShouldExit, AllThreadsShouldSleep;
94 Thread threads[MAX_THREADS];
95 SplitPoint SplitPointStack[MAX_THREADS][ACTIVE_SPLIT_POINTS_MAX];
97 Lock MPLock, WaitLock;
99 #if !defined(_MSC_VER)
100 pthread_cond_t WaitCond;
102 HANDLE SitIdleEvent[MAX_THREADS];
108 // RootMove struct is used for moves at the root at the tree. For each
109 // root move, we store a score, a node count, and a PV (really a refutation
110 // in the case of moves which fail low).
114 RootMove() { nodes = cumulativeNodes = ourBeta = theirBeta = 0ULL; }
116 // RootMove::operator<() is the comparison function used when
117 // sorting the moves. A move m1 is considered to be better
118 // than a move m2 if it has a higher score, or if the moves
119 // have equal score but m1 has the higher node count.
120 bool operator<(const RootMove& m) const {
122 return score != m.score ? score < m.score : theirBeta <= m.theirBeta;
127 int64_t nodes, cumulativeNodes, ourBeta, theirBeta;
128 Move pv[PLY_MAX_PLUS_2];
132 // The RootMoveList class is essentially an array of RootMove objects, with
133 // a handful of methods for accessing the data in the individual moves.
138 RootMoveList(Position& pos, Move searchMoves[]);
140 int move_count() const { return count; }
141 Move get_move(int moveNum) const { return moves[moveNum].move; }
142 Value get_move_score(int moveNum) const { return moves[moveNum].score; }
143 void set_move_score(int moveNum, Value score) { moves[moveNum].score = score; }
144 Move get_move_pv(int moveNum, int i) const { return moves[moveNum].pv[i]; }
145 int64_t get_move_cumulative_nodes(int moveNum) const { return moves[moveNum].cumulativeNodes; }
147 void set_move_nodes(int moveNum, int64_t nodes);
148 void set_beta_counters(int moveNum, int64_t our, int64_t their);
149 void set_move_pv(int moveNum, const Move pv[]);
151 void sort_multipv(int n);
154 static const int MaxRootMoves = 500;
155 RootMove moves[MaxRootMoves];
164 // Maximum depth for razoring
165 const Depth RazorDepth = 4 * OnePly;
167 // Dynamic razoring margin based on depth
168 inline Value razor_margin(Depth d) { return Value(0x200 + 0x10 * int(d)); }
170 // Step 8. Null move search with verification search
172 // Null move margin. A null move search will not be done if the static
173 // evaluation of the position is more than NullMoveMargin below beta.
174 const Value NullMoveMargin = Value(0x200);
176 // Maximum depth for use of dynamic threat detection when null move fails low
177 const Depth ThreatDepth = 5 * OnePly;
179 // Step 9. Internal iterative deepening
181 // Minimum depth for use of internal iterative deepening
182 const Depth IIDDepthAtPVNodes = 5 * OnePly;
183 const Depth IIDDepthAtNonPVNodes = 8 * OnePly;
185 // At Non-PV nodes we do an internal iterative deepening search
186 // when the static evaluation is at most IIDMargin below beta.
187 const Value IIDMargin = Value(0x100);
189 // Step 11. Decide the new search depth
191 // Extensions. Configurable UCI options
192 // Array index 0 is used at non-PV nodes, index 1 at PV nodes.
193 Depth CheckExtension[2], SingleEvasionExtension[2], PawnPushTo7thExtension[2];
194 Depth PassedPawnExtension[2], PawnEndgameExtension[2], MateThreatExtension[2];
196 // Minimum depth for use of singular extension
197 const Depth SingularExtensionDepthAtPVNodes = 6 * OnePly;
198 const Depth SingularExtensionDepthAtNonPVNodes = 8 * OnePly;
200 // If the TT move is at least SingularExtensionMargin better then the
201 // remaining ones we will extend it.
202 const Value SingularExtensionMargin = Value(0x20);
204 // Step 12. Futility pruning
206 // Futility margin for quiescence search
207 const Value FutilityMarginQS = Value(0x80);
209 // Futility lookup tables (initialized at startup) and their getter functions
210 int32_t FutilityMarginsMatrix[16][64]; // [depth][moveNumber]
211 int FutilityMoveCountArray[32]; // [depth]
213 inline Value futility_margin(Depth d, int mn) { return Value(d < 7 * OnePly ? FutilityMarginsMatrix[Max(d, 0)][Min(mn, 63)] : 2 * VALUE_INFINITE); }
214 inline int futility_move_count(Depth d) { return d < 16 * OnePly ? FutilityMoveCountArray[d] : 512; }
216 // Step 14. Reduced search
218 // Reduction lookup tables (initialized at startup) and their getter functions
219 int8_t PVReductionMatrix[64][64]; // [depth][moveNumber]
220 int8_t NonPVReductionMatrix[64][64]; // [depth][moveNumber]
222 inline Depth pv_reduction(Depth d, int mn) { return (Depth) PVReductionMatrix[Min(d / 2, 63)][Min(mn, 63)]; }
223 inline Depth nonpv_reduction(Depth d, int mn) { return (Depth) NonPVReductionMatrix[Min(d / 2, 63)][Min(mn, 63)]; }
225 // Common adjustments
227 // Search depth at iteration 1
228 const Depth InitialDepth = OnePly;
230 // Easy move margin. An easy move candidate must be at least this much
231 // better than the second best move.
232 const Value EasyMoveMargin = Value(0x200);
234 // Last seconds noise filtering (LSN)
235 const bool UseLSNFiltering = false;
236 const int LSNTime = 4000; // In milliseconds
237 const Value LSNValue = value_from_centipawns(200);
238 bool loseOnTime = false;
246 // Scores and number of times the best move changed for each iteration
247 Value ValueByIteration[PLY_MAX_PLUS_2];
248 int BestMoveChangesByIteration[PLY_MAX_PLUS_2];
250 // Search window management
256 // Time managment variables
257 int SearchStartTime, MaxNodes, MaxDepth, MaxSearchTime;
258 int AbsoluteMaxSearchTime, ExtraSearchTime, ExactMaxTime;
259 bool UseTimeManagement, InfiniteSearch, PonderSearch, StopOnPonderhit;
260 bool FirstRootMove, AbortSearch, Quit, AspirationFailLow;
264 std::ofstream LogFile;
266 // Multi-threads related variables
267 Depth MinimumSplitDepth;
268 int MaxThreadsPerSplitPoint;
271 // Node counters, used only by thread[0] but try to keep in different cache
272 // lines (64 bytes each) from the heavy multi-thread read accessed variables.
274 int NodesBetweenPolls = 30000;
281 Value id_loop(const Position& pos, Move searchMoves[]);
282 Value root_search(Position& pos, SearchStack ss[], RootMoveList& rml, Value* alphaPtr, Value* betaPtr);
283 Value search_pv(Position& pos, SearchStack ss[], Value alpha, Value beta, Depth depth, int ply, int threadID);
284 Value search(Position& pos, SearchStack ss[], Value beta, Depth depth, int ply, bool allowNullmove, int threadID, Move excludedMove = MOVE_NONE);
285 Value qsearch(Position& pos, SearchStack ss[], Value alpha, Value beta, Depth depth, int ply, int threadID);
286 void sp_search(SplitPoint* sp, int threadID);
287 void sp_search_pv(SplitPoint* sp, int threadID);
288 void init_node(SearchStack ss[], int ply, int threadID);
289 void update_pv(SearchStack ss[], int ply);
290 void sp_update_pv(SearchStack* pss, SearchStack ss[], int ply);
291 bool connected_moves(const Position& pos, Move m1, Move m2);
292 bool value_is_mate(Value value);
293 bool move_is_killer(Move m, const SearchStack& ss);
294 Depth extension(const Position&, Move, bool, bool, bool, bool, bool, bool*);
295 bool ok_to_do_nullmove(const Position& pos);
296 bool ok_to_prune(const Position& pos, Move m, Move threat);
297 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply, bool allowNullmove);
298 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply);
299 void update_history(const Position& pos, Move move, Depth depth, Move movesSearched[], int moveCount);
300 void update_killers(Move m, SearchStack& ss);
301 void update_gains(const Position& pos, Move move, Value before, Value after);
303 int current_search_time();
307 void wait_for_stop_or_ponderhit();
308 void init_ss_array(SearchStack ss[]);
309 void print_pv_info(const Position& pos, SearchStack ss[], Value alpha, Value beta, Value value);
311 #if !defined(_MSC_VER)
312 void *init_thread(void *threadID);
314 DWORD WINAPI init_thread(LPVOID threadID);
324 /// init_threads(), exit_threads() and nodes_searched() are helpers to
325 /// give accessibility to some TM methods from outside of current file.
327 void init_threads() { TM.init_threads(); }
328 void exit_threads() { TM.exit_threads(); }
329 int64_t nodes_searched() { return TM.nodes_searched(); }
332 /// perft() is our utility to verify move generation is bug free. All the legal
333 /// moves up to given depth are generated and counted and the sum returned.
335 int perft(Position& pos, Depth depth)
340 MovePicker mp(pos, MOVE_NONE, depth, H);
342 // If we are at the last ply we don't need to do and undo
343 // the moves, just to count them.
344 if (depth <= OnePly) // Replace with '<' to test also qsearch
346 while (mp.get_next_move()) sum++;
350 // Loop through all legal moves
352 while ((move = mp.get_next_move()) != MOVE_NONE)
354 pos.do_move(move, st, ci, pos.move_is_check(move, ci));
355 sum += perft(pos, depth - OnePly);
362 /// think() is the external interface to Stockfish's search, and is called when
363 /// the program receives the UCI 'go' command. It initializes various
364 /// search-related global variables, and calls root_search(). It returns false
365 /// when a quit command is received during the search.
367 bool think(const Position& pos, bool infinite, bool ponder, int side_to_move,
368 int time[], int increment[], int movesToGo, int maxDepth,
369 int maxNodes, int maxTime, Move searchMoves[]) {
371 // Initialize global search variables
372 StopOnPonderhit = AbortSearch = Quit = AspirationFailLow = false;
373 MaxSearchTime = AbsoluteMaxSearchTime = ExtraSearchTime = 0;
375 TM.resetNodeCounters();
376 SearchStartTime = get_system_time();
377 ExactMaxTime = maxTime;
380 InfiniteSearch = infinite;
381 PonderSearch = ponder;
382 UseTimeManagement = !ExactMaxTime && !MaxDepth && !MaxNodes && !InfiniteSearch;
384 // Look for a book move, only during games, not tests
385 if (UseTimeManagement && get_option_value_bool("OwnBook"))
387 if (get_option_value_string("Book File") != OpeningBook.file_name())
388 OpeningBook.open(get_option_value_string("Book File"));
390 Move bookMove = OpeningBook.get_move(pos);
391 if (bookMove != MOVE_NONE)
394 wait_for_stop_or_ponderhit();
396 cout << "bestmove " << bookMove << endl;
401 // Reset loseOnTime flag at the beginning of a new game
402 if (button_was_pressed("New Game"))
405 // Read UCI option values
406 TT.set_size(get_option_value_int("Hash"));
407 if (button_was_pressed("Clear Hash"))
410 CheckExtension[1] = Depth(get_option_value_int("Check Extension (PV nodes)"));
411 CheckExtension[0] = Depth(get_option_value_int("Check Extension (non-PV nodes)"));
412 SingleEvasionExtension[1] = Depth(get_option_value_int("Single Evasion Extension (PV nodes)"));
413 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)"));
416 PassedPawnExtension[1] = Depth(get_option_value_int("Passed Pawn Extension (PV nodes)"));
417 PassedPawnExtension[0] = Depth(get_option_value_int("Passed Pawn Extension (non-PV nodes)"));
418 PawnEndgameExtension[1] = Depth(get_option_value_int("Pawn Endgame Extension (PV nodes)"));
419 PawnEndgameExtension[0] = Depth(get_option_value_int("Pawn Endgame Extension (non-PV nodes)"));
420 MateThreatExtension[1] = Depth(get_option_value_int("Mate Threat Extension (PV nodes)"));
421 MateThreatExtension[0] = Depth(get_option_value_int("Mate Threat Extension (non-PV nodes)"));
423 MinimumSplitDepth = get_option_value_int("Minimum Split Depth") * OnePly;
424 MaxThreadsPerSplitPoint = get_option_value_int("Maximum Number of Threads per Split Point");
425 MultiPV = get_option_value_int("MultiPV");
426 Chess960 = get_option_value_bool("UCI_Chess960");
427 UseLogFile = get_option_value_bool("Use Search Log");
430 LogFile.open(get_option_value_string("Search Log Filename").c_str(), std::ios::out | std::ios::app);
432 read_weights(pos.side_to_move());
434 // Set the number of active threads
435 int newActiveThreads = get_option_value_int("Threads");
436 if (newActiveThreads != TM.active_threads())
438 TM.set_active_threads(newActiveThreads);
439 init_eval(TM.active_threads());
442 // Wake up sleeping threads
443 TM.wake_sleeping_threads();
446 int myTime = time[side_to_move];
447 int myIncrement = increment[side_to_move];
448 if (UseTimeManagement)
450 if (!movesToGo) // Sudden death time control
454 MaxSearchTime = myTime / 30 + myIncrement;
455 AbsoluteMaxSearchTime = Max(myTime / 4, myIncrement - 100);
457 else // Blitz game without increment
459 MaxSearchTime = myTime / 30;
460 AbsoluteMaxSearchTime = myTime / 8;
463 else // (x moves) / (y minutes)
467 MaxSearchTime = myTime / 2;
468 AbsoluteMaxSearchTime = (myTime > 3000)? (myTime - 500) : ((myTime * 3) / 4);
472 MaxSearchTime = myTime / Min(movesToGo, 20);
473 AbsoluteMaxSearchTime = Min((4 * myTime) / movesToGo, myTime / 3);
477 if (get_option_value_bool("Ponder"))
479 MaxSearchTime += MaxSearchTime / 4;
480 MaxSearchTime = Min(MaxSearchTime, AbsoluteMaxSearchTime);
484 // Set best NodesBetweenPolls interval to avoid lagging under
485 // heavy time pressure.
487 NodesBetweenPolls = Min(MaxNodes, 30000);
488 else if (myTime && myTime < 1000)
489 NodesBetweenPolls = 1000;
490 else if (myTime && myTime < 5000)
491 NodesBetweenPolls = 5000;
493 NodesBetweenPolls = 30000;
495 // Write search information to log file
497 LogFile << "Searching: " << pos.to_fen() << endl
498 << "infinite: " << infinite
499 << " ponder: " << ponder
500 << " time: " << myTime
501 << " increment: " << myIncrement
502 << " moves to go: " << movesToGo << endl;
504 // LSN filtering. Used only for developing purposes, disabled by default
508 // Step 2. If after last move we decided to lose on time, do it now!
509 while (SearchStartTime + myTime + 1000 > get_system_time())
513 // We're ready to start thinking. Call the iterative deepening loop function
514 Value v = id_loop(pos, searchMoves);
518 // Step 1. If this is sudden death game and our position is hopeless,
519 // decide to lose on time.
520 if ( !loseOnTime // If we already lost on time, go to step 3.
530 // Step 3. Now after stepping over the time limit, reset flag for next match.
538 TM.put_threads_to_sleep();
544 /// init_search() is called during startup. It initializes various lookup tables
548 // Init our reduction lookup tables
549 for (int i = 1; i < 64; i++) // i == depth (OnePly = 1)
550 for (int j = 1; j < 64; j++) // j == moveNumber
552 double pvRed = 0.5 + log(double(i)) * log(double(j)) / 6.0;
553 double nonPVRed = 0.5 + log(double(i)) * log(double(j)) / 3.0;
554 PVReductionMatrix[i][j] = (int8_t) ( pvRed >= 1.0 ? floor( pvRed * int(OnePly)) : 0);
555 NonPVReductionMatrix[i][j] = (int8_t) (nonPVRed >= 1.0 ? floor(nonPVRed * int(OnePly)) : 0);
558 // Init futility margins array
559 for (int i = 0; i < 16; i++) // i == depth (OnePly = 2)
560 for (int j = 0; j < 64; j++) // j == moveNumber
562 // FIXME: test using log instead of BSR
563 FutilityMarginsMatrix[i][j] = (i < 2 ? 0 : 112 * bitScanReverse32(i * i / 2)) - 8 * j;
566 // Init futility move count array
567 for (int i = 0; i < 32; i++) // i == depth (OnePly = 2)
568 FutilityMoveCountArray[i] = 3 + (1 << (3 * i / 8));
572 // SearchStack::init() initializes a search stack. Used at the beginning of a
573 // new search from the root.
574 void SearchStack::init(int ply) {
576 pv[ply] = pv[ply + 1] = MOVE_NONE;
577 currentMove = threatMove = MOVE_NONE;
578 reduction = Depth(0);
582 void SearchStack::initKillers() {
584 mateKiller = MOVE_NONE;
585 for (int i = 0; i < KILLER_MAX; i++)
586 killers[i] = MOVE_NONE;
591 // id_loop() is the main iterative deepening loop. It calls root_search
592 // repeatedly with increasing depth until the allocated thinking time has
593 // been consumed, the user stops the search, or the maximum search depth is
596 Value id_loop(const Position& pos, Move searchMoves[]) {
599 SearchStack ss[PLY_MAX_PLUS_2];
600 Move EasyMove = MOVE_NONE;
601 Value value, alpha = -VALUE_INFINITE, beta = VALUE_INFINITE;
603 // Moves to search are verified, copied, scored and sorted
604 RootMoveList rml(p, searchMoves);
606 // Handle special case of searching on a mate/stale position
607 if (rml.move_count() == 0)
610 wait_for_stop_or_ponderhit();
612 return pos.is_check() ? -VALUE_MATE : VALUE_DRAW;
615 // Print RootMoveList startup scoring to the standard output,
616 // so to output information also for iteration 1.
617 cout << "info depth " << 1
618 << "\ninfo depth " << 1
619 << " score " << value_to_string(rml.get_move_score(0))
620 << " time " << current_search_time()
621 << " nodes " << TM.nodes_searched()
623 << " pv " << rml.get_move(0) << "\n";
629 ValueByIteration[1] = rml.get_move_score(0);
632 // Is one move significantly better than others after initial scoring ?
633 if ( rml.move_count() == 1
634 || rml.get_move_score(0) > rml.get_move_score(1) + EasyMoveMargin)
635 EasyMove = rml.get_move(0);
637 // Iterative deepening loop
638 while (Iteration < PLY_MAX)
640 // Initialize iteration
642 BestMoveChangesByIteration[Iteration] = 0;
644 cout << "info depth " << Iteration << endl;
646 // Calculate dynamic aspiration window based on previous iterations
647 if (MultiPV == 1 && Iteration >= 6 && abs(ValueByIteration[Iteration - 1]) < VALUE_KNOWN_WIN)
649 int prevDelta1 = ValueByIteration[Iteration - 1] - ValueByIteration[Iteration - 2];
650 int prevDelta2 = ValueByIteration[Iteration - 2] - ValueByIteration[Iteration - 3];
652 AspirationDelta = Max(abs(prevDelta1) + abs(prevDelta2) / 2, 16);
653 AspirationDelta = (AspirationDelta + 7) / 8 * 8; // Round to match grainSize
655 alpha = Max(ValueByIteration[Iteration - 1] - AspirationDelta, -VALUE_INFINITE);
656 beta = Min(ValueByIteration[Iteration - 1] + AspirationDelta, VALUE_INFINITE);
659 // Search to the current depth, rml is updated and sorted, alpha and beta could change
660 value = root_search(p, ss, rml, &alpha, &beta);
662 // Write PV to transposition table, in case the relevant entries have
663 // been overwritten during the search.
664 TT.insert_pv(p, ss[0].pv);
667 break; // Value cannot be trusted. Break out immediately!
669 //Save info about search result
670 ValueByIteration[Iteration] = value;
672 // Drop the easy move if differs from the new best move
673 if (ss[0].pv[0] != EasyMove)
674 EasyMove = MOVE_NONE;
676 if (UseTimeManagement)
679 bool stopSearch = false;
681 // Stop search early if there is only a single legal move,
682 // we search up to Iteration 6 anyway to get a proper score.
683 if (Iteration >= 6 && rml.move_count() == 1)
686 // Stop search early when the last two iterations returned a mate score
688 && abs(ValueByIteration[Iteration]) >= abs(VALUE_MATE) - 100
689 && abs(ValueByIteration[Iteration-1]) >= abs(VALUE_MATE) - 100)
692 // Stop search early if one move seems to be much better than the others
693 int64_t nodes = TM.nodes_searched();
695 && EasyMove == ss[0].pv[0]
696 && ( ( rml.get_move_cumulative_nodes(0) > (nodes * 85) / 100
697 && current_search_time() > MaxSearchTime / 16)
698 ||( rml.get_move_cumulative_nodes(0) > (nodes * 98) / 100
699 && current_search_time() > MaxSearchTime / 32)))
702 // Add some extra time if the best move has changed during the last two iterations
703 if (Iteration > 5 && Iteration <= 50)
704 ExtraSearchTime = BestMoveChangesByIteration[Iteration] * (MaxSearchTime / 2)
705 + BestMoveChangesByIteration[Iteration-1] * (MaxSearchTime / 3);
707 // Stop search if most of MaxSearchTime is consumed at the end of the
708 // iteration. We probably don't have enough time to search the first
709 // move at the next iteration anyway.
710 if (current_search_time() > ((MaxSearchTime + ExtraSearchTime) * 80) / 128)
716 StopOnPonderhit = true;
722 if (MaxDepth && Iteration >= MaxDepth)
726 // If we are pondering or in infinite search, we shouldn't print the
727 // best move before we are told to do so.
728 if (!AbortSearch && (PonderSearch || InfiniteSearch))
729 wait_for_stop_or_ponderhit();
731 // Print final search statistics
732 cout << "info nodes " << TM.nodes_searched()
734 << " time " << current_search_time()
735 << " hashfull " << TT.full() << endl;
737 // Print the best move and the ponder move to the standard output
738 if (ss[0].pv[0] == MOVE_NONE)
740 ss[0].pv[0] = rml.get_move(0);
741 ss[0].pv[1] = MOVE_NONE;
744 assert(ss[0].pv[0] != MOVE_NONE);
746 cout << "bestmove " << ss[0].pv[0];
748 if (ss[0].pv[1] != MOVE_NONE)
749 cout << " ponder " << ss[0].pv[1];
756 dbg_print_mean(LogFile);
758 if (dbg_show_hit_rate)
759 dbg_print_hit_rate(LogFile);
761 LogFile << "\nNodes: " << TM.nodes_searched()
762 << "\nNodes/second: " << nps()
763 << "\nBest move: " << move_to_san(p, ss[0].pv[0]);
766 p.do_move(ss[0].pv[0], st);
767 LogFile << "\nPonder move: "
768 << move_to_san(p, ss[0].pv[1]) // Works also with MOVE_NONE
771 return rml.get_move_score(0);
775 // root_search() is the function which searches the root node. It is
776 // similar to search_pv except that it uses a different move ordering
777 // scheme, prints some information to the standard output and handles
778 // the fail low/high loops.
780 Value root_search(Position& pos, SearchStack ss[], RootMoveList& rml, Value* alphaPtr, Value* betaPtr) {
787 Depth depth, ext, newDepth;
788 Value value, alpha, beta;
789 bool isCheck, moveIsCheck, captureOrPromotion, dangerous;
790 int researchCountFH, researchCountFL;
792 researchCountFH = researchCountFL = 0;
795 isCheck = pos.is_check();
797 // Step 1. Initialize node and poll (omitted at root, but I can see no good reason for this, FIXME)
798 // Step 2. Check for aborted search (omitted at root, because we do not initialize root node)
799 // Step 3. Mate distance pruning (omitted at root)
800 // Step 4. Transposition table lookup (omitted at root)
802 // Step 5. Evaluate the position statically
803 // At root we do this only to get reference value for child nodes
805 ss[0].eval = evaluate(pos, ei, 0);
807 ss[0].eval = VALUE_NONE; // HACK because we do not initialize root node
809 // Step 6. Razoring (omitted at root)
810 // Step 7. Static null move pruning (omitted at root)
811 // Step 8. Null move search with verification search (omitted at root)
812 // Step 9. Internal iterative deepening (omitted at root)
814 // Step extra. Fail low loop
815 // We start with small aspiration window and in case of fail low, we research
816 // with bigger window until we are not failing low anymore.
819 // Sort the moves before to (re)search
822 // Step 10. Loop through all moves in the root move list
823 for (int i = 0; i < rml.move_count() && !AbortSearch; i++)
825 // This is used by time management
826 FirstRootMove = (i == 0);
828 // Save the current node count before the move is searched
829 nodes = TM.nodes_searched();
831 // Reset beta cut-off counters
832 TM.resetBetaCounters();
834 // Pick the next root move, and print the move and the move number to
835 // the standard output.
836 move = ss[0].currentMove = rml.get_move(i);
838 if (current_search_time() >= 1000)
839 cout << "info currmove " << move
840 << " currmovenumber " << i + 1 << endl;
842 moveIsCheck = pos.move_is_check(move);
843 captureOrPromotion = pos.move_is_capture_or_promotion(move);
845 // Step 11. Decide the new search depth
846 depth = (Iteration - 2) * OnePly + InitialDepth;
847 ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, false, false, &dangerous);
848 newDepth = depth + ext;
850 // Step 12. Futility pruning (omitted at root)
852 // Step extra. Fail high loop
853 // If move fails high, we research with bigger window until we are not failing
855 value = - VALUE_INFINITE;
859 // Step 13. Make the move
860 pos.do_move(move, st, ci, moveIsCheck);
862 // Step extra. pv search
863 // We do pv search for first moves (i < MultiPV)
864 // and for fail high research (value > alpha)
865 if (i < MultiPV || value > alpha)
867 // Aspiration window is disabled in multi-pv case
869 alpha = -VALUE_INFINITE;
871 // Full depth PV search, done on first move or after a fail high
872 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
876 // Step 14. Reduced search
877 // if the move fails high will be re-searched at full depth
878 bool doFullDepthSearch = true;
880 if ( depth >= 3 * OnePly
882 && !captureOrPromotion
883 && !move_is_castle(move))
885 ss[0].reduction = pv_reduction(depth, i - MultiPV + 2);
888 // Reduced depth non-pv search using alpha as upperbound
889 value = -search(pos, ss, -alpha, newDepth-ss[0].reduction, 1, true, 0);
890 doFullDepthSearch = (value > alpha);
894 // Step 15. Full depth search
895 if (doFullDepthSearch)
897 // Full depth non-pv search using alpha as upperbound
898 ss[0].reduction = Depth(0);
899 value = -search(pos, ss, -alpha, newDepth, 1, true, 0);
901 // If we are above alpha then research at same depth but as PV
902 // to get a correct score or eventually a fail high above beta.
904 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
908 // Step 16. Undo move
911 // Can we exit fail high loop ?
912 if (AbortSearch || value < beta)
915 // We are failing high and going to do a research. It's important to update
916 // the score before research in case we run out of time while researching.
917 rml.set_move_score(i, value);
919 TT.extract_pv(pos, ss[0].pv, PLY_MAX);
920 rml.set_move_pv(i, ss[0].pv);
922 // Print information to the standard output
923 print_pv_info(pos, ss, alpha, beta, value);
925 // Prepare for a research after a fail high, each time with a wider window
926 *betaPtr = beta = Min(beta + AspirationDelta * (1 << researchCountFH), VALUE_INFINITE);
929 } // End of fail high loop
931 // Finished searching the move. If AbortSearch is true, the search
932 // was aborted because the user interrupted the search or because we
933 // ran out of time. In this case, the return value of the search cannot
934 // be trusted, and we break out of the loop without updating the best
939 // Remember beta-cutoff and searched nodes counts for this move. The
940 // info is used to sort the root moves for the next iteration.
942 TM.get_beta_counters(pos.side_to_move(), our, their);
943 rml.set_beta_counters(i, our, their);
944 rml.set_move_nodes(i, TM.nodes_searched() - nodes);
946 assert(value >= -VALUE_INFINITE && value <= VALUE_INFINITE);
947 assert(value < beta);
949 // Step 17. Check for new best move
950 if (value <= alpha && i >= MultiPV)
951 rml.set_move_score(i, -VALUE_INFINITE);
954 // PV move or new best move!
957 rml.set_move_score(i, value);
959 TT.extract_pv(pos, ss[0].pv, PLY_MAX);
960 rml.set_move_pv(i, ss[0].pv);
964 // We record how often the best move has been changed in each
965 // iteration. This information is used for time managment: When
966 // the best move changes frequently, we allocate some more time.
968 BestMoveChangesByIteration[Iteration]++;
970 // Print information to the standard output
971 print_pv_info(pos, ss, alpha, beta, value);
973 // Raise alpha to setup proper non-pv search upper bound
980 for (int j = 0; j < Min(MultiPV, rml.move_count()); j++)
982 cout << "info multipv " << j + 1
983 << " score " << value_to_string(rml.get_move_score(j))
984 << " depth " << (j <= i ? Iteration : Iteration - 1)
985 << " time " << current_search_time()
986 << " nodes " << TM.nodes_searched()
990 for (int k = 0; rml.get_move_pv(j, k) != MOVE_NONE && k < PLY_MAX; k++)
991 cout << rml.get_move_pv(j, k) << " ";
995 alpha = rml.get_move_score(Min(i, MultiPV - 1));
997 } // PV move or new best move
999 assert(alpha >= *alphaPtr);
1001 AspirationFailLow = (alpha == *alphaPtr);
1003 if (AspirationFailLow && StopOnPonderhit)
1004 StopOnPonderhit = false;
1007 // Can we exit fail low loop ?
1008 if (AbortSearch || !AspirationFailLow)
1011 // Prepare for a research after a fail low, each time with a wider window
1012 *alphaPtr = alpha = Max(alpha - AspirationDelta * (1 << researchCountFL), -VALUE_INFINITE);
1017 // Sort the moves before to return
1024 // search_pv() is the main search function for PV nodes.
1026 Value search_pv(Position& pos, SearchStack ss[], Value alpha, Value beta,
1027 Depth depth, int ply, int threadID) {
1029 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1030 assert(beta > alpha && beta <= VALUE_INFINITE);
1031 assert(ply >= 0 && ply < PLY_MAX);
1032 assert(threadID >= 0 && threadID < TM.active_threads());
1034 Move movesSearched[256];
1039 Depth ext, newDepth;
1040 Value bestValue, value, oldAlpha;
1041 bool isCheck, singleEvasion, moveIsCheck, captureOrPromotion, dangerous;
1042 bool mateThreat = false;
1044 bestValue = value = -VALUE_INFINITE;
1047 return qsearch(pos, ss, alpha, beta, Depth(0), ply, threadID);
1049 // Step 1. Initialize node and poll
1050 // Polling can abort search.
1051 init_node(ss, ply, threadID);
1053 // Step 2. Check for aborted search and immediate draw
1054 if (AbortSearch || TM.thread_should_stop(threadID))
1057 if (pos.is_draw() || ply >= PLY_MAX - 1)
1060 // Step 3. Mate distance pruning
1062 alpha = Max(value_mated_in(ply), alpha);
1063 beta = Min(value_mate_in(ply+1), beta);
1067 // Step 4. Transposition table lookup
1068 // At PV nodes, we don't use the TT for pruning, but only for move ordering.
1069 // This is to avoid problems in the following areas:
1071 // * Repetition draw detection
1072 // * Fifty move rule detection
1073 // * Searching for a mate
1074 // * Printing of full PV line
1075 tte = TT.retrieve(pos.get_key());
1076 ttMove = (tte ? tte->move() : MOVE_NONE);
1078 // Step 5. Evaluate the position statically
1079 // At PV nodes we do this only to update gain statistics
1080 isCheck = pos.is_check();
1083 ss[ply].eval = evaluate(pos, ei, threadID);
1084 update_gains(pos, ss[ply - 1].currentMove, ss[ply - 1].eval, ss[ply].eval);
1087 // Step 6. Razoring (is omitted in PV nodes)
1088 // Step 7. Static null move pruning (is omitted in PV nodes)
1089 // Step 8. Null move search with verification search (is omitted in PV nodes)
1091 // Step 9. Internal iterative deepening
1092 if ( depth >= IIDDepthAtPVNodes
1093 && ttMove == MOVE_NONE)
1095 search_pv(pos, ss, alpha, beta, depth-2*OnePly, ply, threadID);
1096 ttMove = ss[ply].pv[ply];
1097 tte = TT.retrieve(pos.get_key());
1100 // Initialize a MovePicker object for the current position
1101 mateThreat = pos.has_mate_threat(opposite_color(pos.side_to_move()));
1102 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
1105 // Step 10. Loop through moves
1106 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1107 while ( alpha < beta
1108 && (move = mp.get_next_move()) != MOVE_NONE
1109 && !TM.thread_should_stop(threadID))
1111 assert(move_is_ok(move));
1113 singleEvasion = (isCheck && mp.number_of_evasions() == 1);
1114 moveIsCheck = pos.move_is_check(move, ci);
1115 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1117 // Step 11. Decide the new search depth
1118 ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, singleEvasion, mateThreat, &dangerous);
1120 // Singular extension search. We extend the TT move if its value is much better than
1121 // its siblings. To verify this we do a reduced search on all the other moves but the
1122 // ttMove, if result is lower then ttValue minus a margin then we extend ttMove.
1123 if ( depth >= SingularExtensionDepthAtPVNodes
1125 && move == tte->move()
1127 && is_lower_bound(tte->type())
1128 && tte->depth() >= depth - 3 * OnePly)
1130 Value ttValue = value_from_tt(tte->value(), ply);
1132 if (abs(ttValue) < VALUE_KNOWN_WIN)
1134 Value excValue = search(pos, ss, ttValue - SingularExtensionMargin, depth / 2, ply, false, threadID, move);
1136 if (excValue < ttValue - SingularExtensionMargin)
1141 newDepth = depth - OnePly + ext;
1143 // Update current move (this must be done after singular extension search)
1144 movesSearched[moveCount++] = ss[ply].currentMove = move;
1146 // Step 12. Futility pruning (is omitted in PV nodes)
1148 // Step 13. Make the move
1149 pos.do_move(move, st, ci, moveIsCheck);
1151 // Step extra. pv search (only in PV nodes)
1152 // The first move in list is the expected PV
1154 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1157 // Step 14. Reduced search
1158 // if the move fails high will be re-searched at full depth.
1159 bool doFullDepthSearch = true;
1161 if ( depth >= 3 * OnePly
1163 && !captureOrPromotion
1164 && !move_is_castle(move)
1165 && !move_is_killer(move, ss[ply]))
1167 ss[ply].reduction = pv_reduction(depth, moveCount);
1168 if (ss[ply].reduction)
1170 value = -search(pos, ss, -alpha, newDepth-ss[ply].reduction, ply+1, true, threadID);
1171 doFullDepthSearch = (value > alpha);
1175 // Step 15. Full depth search
1176 if (doFullDepthSearch)
1178 ss[ply].reduction = Depth(0);
1179 value = -search(pos, ss, -alpha, newDepth, ply+1, true, threadID);
1181 // Step extra. pv search (only in PV nodes)
1182 if (value > alpha && value < beta)
1183 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1187 // Step 16. Undo move
1188 pos.undo_move(move);
1190 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1192 // Step 17. Check for new best move
1193 if (value > bestValue)
1200 if (value == value_mate_in(ply + 1))
1201 ss[ply].mateKiller = move;
1205 // Step 18. Check for split
1206 if ( TM.active_threads() > 1
1208 && depth >= MinimumSplitDepth
1210 && TM.available_thread_exists(threadID)
1212 && !TM.thread_should_stop(threadID)
1213 && TM.split(pos, ss, ply, &alpha, beta, &bestValue,
1214 depth, mateThreat, &moveCount, &mp, threadID, true))
1218 // Step 19. Check for mate and stalemate
1219 // All legal moves have been searched and if there were
1220 // no legal moves, it must be mate or stalemate.
1222 return (isCheck ? value_mated_in(ply) : VALUE_DRAW);
1224 // Step 20. Update tables
1225 // If the search is not aborted, update the transposition table,
1226 // history counters, and killer moves.
1227 if (AbortSearch || TM.thread_should_stop(threadID))
1230 if (bestValue <= oldAlpha)
1231 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1233 else if (bestValue >= beta)
1235 TM.incrementBetaCounter(pos.side_to_move(), depth, threadID);
1236 move = ss[ply].pv[ply];
1237 if (!pos.move_is_capture_or_promotion(move))
1239 update_history(pos, move, depth, movesSearched, moveCount);
1240 update_killers(move, ss[ply]);
1242 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, move);
1245 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EXACT, depth, ss[ply].pv[ply]);
1251 // search() is the search function for zero-width nodes.
1253 Value search(Position& pos, SearchStack ss[], Value beta, Depth depth,
1254 int ply, bool allowNullmove, int threadID, Move excludedMove) {
1256 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1257 assert(ply >= 0 && ply < PLY_MAX);
1258 assert(threadID >= 0 && threadID < TM.active_threads());
1260 Move movesSearched[256];
1265 Depth ext, newDepth;
1266 Value bestValue, refinedValue, nullValue, value, futilityValueScaled;
1267 bool isCheck, singleEvasion, moveIsCheck, captureOrPromotion, dangerous;
1268 bool mateThreat = false;
1270 refinedValue = bestValue = value = -VALUE_INFINITE;
1273 return qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1275 // Step 1. Initialize node and poll
1276 // Polling can abort search.
1277 init_node(ss, ply, threadID);
1279 // Step 2. Check for aborted search and immediate draw
1280 if (AbortSearch || TM.thread_should_stop(threadID))
1283 if (pos.is_draw() || ply >= PLY_MAX - 1)
1286 // Step 3. Mate distance pruning
1287 if (value_mated_in(ply) >= beta)
1290 if (value_mate_in(ply + 1) < beta)
1293 // Step 4. Transposition table lookup
1295 // We don't want the score of a partial search to overwrite a previous full search
1296 // TT value, so we use a different position key in case of an excluded move exists.
1297 Key posKey = excludedMove ? pos.get_exclusion_key() : pos.get_key();
1299 tte = TT.retrieve(posKey);
1300 ttMove = (tte ? tte->move() : MOVE_NONE);
1302 if (tte && ok_to_use_TT(tte, depth, beta, ply, allowNullmove))
1304 ss[ply].currentMove = ttMove; // Can be MOVE_NONE
1305 return value_from_tt(tte->value(), ply);
1308 // Step 5. Evaluate the position statically
1309 isCheck = pos.is_check();
1313 if (tte && (tte->type() & VALUE_TYPE_EVAL))
1314 ss[ply].eval = value_from_tt(tte->value(), ply);
1316 ss[ply].eval = evaluate(pos, ei, threadID);
1318 refinedValue = refine_eval(tte, ss[ply].eval, ply); // Enhance accuracy with TT value if possible
1319 update_gains(pos, ss[ply - 1].currentMove, ss[ply - 1].eval, ss[ply].eval);
1323 if ( refinedValue < beta - razor_margin(depth)
1324 && ttMove == MOVE_NONE
1325 && ss[ply - 1].currentMove != MOVE_NULL
1326 && depth < RazorDepth
1328 && !value_is_mate(beta)
1329 && !pos.has_pawn_on_7th(pos.side_to_move()))
1331 Value rbeta = beta - razor_margin(depth);
1332 Value v = qsearch(pos, ss, rbeta-1, rbeta, Depth(0), ply, threadID);
1334 // Logically we should return (v + razor_margin(depth)), but
1335 // surprisingly this did slightly weaker in tests.
1339 // Step 7. Static null move pruning
1340 // We're betting that the opponent doesn't have a move that will reduce
1341 // the score by more than futility_margin(depth) if we do a null move.
1343 && depth < RazorDepth
1345 && !value_is_mate(beta)
1346 && ok_to_do_nullmove(pos)
1347 && refinedValue >= beta + futility_margin(depth, 0))
1348 return refinedValue - futility_margin(depth, 0);
1350 // Step 8. Null move search with verification search
1351 // When we jump directly to qsearch() we do a null move only if static value is
1352 // at least beta. Otherwise we do a null move if static value is not more than
1353 // NullMoveMargin under beta.
1357 && !value_is_mate(beta)
1358 && ok_to_do_nullmove(pos)
1359 && refinedValue >= beta - (depth >= 4 * OnePly ? NullMoveMargin : 0))
1361 ss[ply].currentMove = MOVE_NULL;
1363 // Null move dynamic reduction based on depth
1364 int R = 3 + (depth >= 5 * OnePly ? depth / 8 : 0);
1366 // Null move dynamic reduction based on value
1367 if (refinedValue - beta > PawnValueMidgame)
1370 pos.do_null_move(st);
1372 nullValue = -search(pos, ss, -(beta-1), depth-R*OnePly, ply+1, false, threadID);
1374 pos.undo_null_move();
1376 if (nullValue >= beta)
1378 // Do not return unproven mate scores
1379 if (nullValue >= value_mate_in(PLY_MAX))
1382 // Do zugzwang verification search for high depths, don't store in TT
1383 // if search was stopped.
1384 if ( ( depth < 6 * OnePly
1385 || search(pos, ss, beta, depth-5*OnePly, ply, false, threadID) >= beta)
1387 && !TM.thread_should_stop(threadID))
1389 assert(value_to_tt(nullValue, ply) == nullValue);
1391 // Special flag null values that are not zugzwang checked
1392 ValueType vt = (depth < 6 * OnePly ? VALUE_TYPE_NS_LO : VALUE_TYPE_LOWER);
1393 TT.store(posKey, nullValue, vt, depth, MOVE_NONE);
1397 // The null move failed low, which means that we may be faced with
1398 // some kind of threat. If the previous move was reduced, check if
1399 // the move that refuted the null move was somehow connected to the
1400 // move which was reduced. If a connection is found, return a fail
1401 // low score (which will cause the reduced move to fail high in the
1402 // parent node, which will trigger a re-search with full depth).
1403 if (nullValue == value_mated_in(ply + 2))
1406 ss[ply].threatMove = ss[ply + 1].currentMove;
1407 if ( depth < ThreatDepth
1408 && ss[ply - 1].reduction
1409 && connected_moves(pos, ss[ply - 1].currentMove, ss[ply].threatMove))
1414 // Step 9. Internal iterative deepening
1415 if ( depth >= IIDDepthAtNonPVNodes
1416 && ttMove == MOVE_NONE
1418 && ss[ply].eval >= beta - IIDMargin)
1420 search(pos, ss, beta, depth/2, ply, false, threadID);
1421 ttMove = ss[ply].pv[ply];
1422 tte = TT.retrieve(posKey);
1425 // Initialize a MovePicker object for the current position
1426 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply], beta);
1429 // Step 10. Loop through moves
1430 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1431 while ( bestValue < beta
1432 && (move = mp.get_next_move()) != MOVE_NONE
1433 && !TM.thread_should_stop(threadID))
1435 assert(move_is_ok(move));
1437 if (move == excludedMove)
1440 moveIsCheck = pos.move_is_check(move, ci);
1441 singleEvasion = (isCheck && mp.number_of_evasions() == 1);
1442 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1444 // Step 11. Decide the new search depth
1445 ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, singleEvasion, mateThreat, &dangerous);
1447 // Singular extension search. We extend the TT move if its value is much better than
1448 // its siblings. To verify this we do a reduced search on all the other moves but the
1449 // ttMove, if result is lower then ttValue minus a margin then we extend ttMove.
1450 if ( depth >= SingularExtensionDepthAtNonPVNodes
1452 && move == tte->move()
1453 && !excludedMove // Do not allow recursive singular extension search
1455 && is_lower_bound(tte->type())
1456 && tte->depth() >= depth - 3 * OnePly)
1458 Value ttValue = value_from_tt(tte->value(), ply);
1460 if (abs(ttValue) < VALUE_KNOWN_WIN)
1462 Value excValue = search(pos, ss, ttValue - SingularExtensionMargin, depth / 2, ply, false, threadID, move);
1464 if (excValue < ttValue - SingularExtensionMargin)
1469 newDepth = depth - OnePly + ext;
1471 // Update current move (this must be done after singular extension search)
1472 movesSearched[moveCount++] = ss[ply].currentMove = move;
1474 // Step 12. Futility pruning
1477 && !captureOrPromotion
1478 && !move_is_castle(move)
1481 // Move count based pruning
1482 if ( moveCount >= futility_move_count(depth)
1483 && ok_to_prune(pos, move, ss[ply].threatMove)
1484 && bestValue > value_mated_in(PLY_MAX))
1487 // Value based pruning
1488 Depth predictedDepth = newDepth - nonpv_reduction(depth, moveCount); // We illogically ignore reduction condition depth >= 3*OnePly
1489 futilityValueScaled = ss[ply].eval + futility_margin(predictedDepth, moveCount)
1490 + H.gain(pos.piece_on(move_from(move)), move_to(move)) + 45;
1492 if (futilityValueScaled < beta)
1494 if (futilityValueScaled > bestValue)
1495 bestValue = futilityValueScaled;
1500 // Step 13. Make the move
1501 pos.do_move(move, st, ci, moveIsCheck);
1503 // Step 14. Reduced search, if the move fails high
1504 // will be re-searched at full depth.
1505 bool doFullDepthSearch = true;
1507 if ( depth >= 3*OnePly
1509 && !captureOrPromotion
1510 && !move_is_castle(move)
1511 && !move_is_killer(move, ss[ply]))
1513 ss[ply].reduction = nonpv_reduction(depth, moveCount);
1514 if (ss[ply].reduction)
1516 value = -search(pos, ss, -(beta-1), newDepth-ss[ply].reduction, ply+1, true, threadID);
1517 doFullDepthSearch = (value >= beta);
1521 // Step 15. Full depth search
1522 if (doFullDepthSearch)
1524 ss[ply].reduction = Depth(0);
1525 value = -search(pos, ss, -(beta-1), newDepth, ply+1, true, threadID);
1528 // Step 16. Undo move
1529 pos.undo_move(move);
1531 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1533 // Step 17. Check for new best move
1534 if (value > bestValue)
1540 if (value == value_mate_in(ply + 1))
1541 ss[ply].mateKiller = move;
1544 // Step 18. Check for split
1545 if ( TM.active_threads() > 1
1547 && depth >= MinimumSplitDepth
1549 && TM.available_thread_exists(threadID)
1551 && !TM.thread_should_stop(threadID)
1552 && TM.split(pos, ss, ply, NULL, beta, &bestValue,
1553 depth, mateThreat, &moveCount, &mp, threadID, false))
1557 // Step 19. Check for mate and stalemate
1558 // All legal moves have been searched and if there are
1559 // no legal moves, it must be mate or stalemate.
1560 // If one move was excluded return fail low score.
1562 return excludedMove ? beta - 1 : (isCheck ? value_mated_in(ply) : VALUE_DRAW);
1564 // Step 20. Update tables
1565 // If the search is not aborted, update the transposition table,
1566 // history counters, and killer moves.
1567 if (AbortSearch || TM.thread_should_stop(threadID))
1570 if (bestValue < beta)
1571 TT.store(posKey, value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1574 TM.incrementBetaCounter(pos.side_to_move(), depth, threadID);
1575 move = ss[ply].pv[ply];
1576 TT.store(posKey, value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, move);
1577 if (!pos.move_is_capture_or_promotion(move))
1579 update_history(pos, move, depth, movesSearched, moveCount);
1580 update_killers(move, ss[ply]);
1585 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1591 // qsearch() is the quiescence search function, which is called by the main
1592 // search function when the remaining depth is zero (or, to be more precise,
1593 // less than OnePly).
1595 Value qsearch(Position& pos, SearchStack ss[], Value alpha, Value beta,
1596 Depth depth, int ply, int threadID) {
1598 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1599 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1601 assert(ply >= 0 && ply < PLY_MAX);
1602 assert(threadID >= 0 && threadID < TM.active_threads());
1607 Value staticValue, bestValue, value, futilityBase, futilityValue;
1608 bool isCheck, enoughMaterial, moveIsCheck, evasionPrunable;
1609 const TTEntry* tte = NULL;
1611 bool pvNode = (beta - alpha != 1);
1612 Value oldAlpha = alpha;
1614 // Initialize, and make an early exit in case of an aborted search,
1615 // an instant draw, maximum ply reached, etc.
1616 init_node(ss, ply, threadID);
1618 // After init_node() that calls poll()
1619 if (AbortSearch || TM.thread_should_stop(threadID))
1622 if (pos.is_draw() || ply >= PLY_MAX - 1)
1625 // Transposition table lookup. At PV nodes, we don't use the TT for
1626 // pruning, but only for move ordering.
1627 tte = TT.retrieve(pos.get_key());
1628 ttMove = (tte ? tte->move() : MOVE_NONE);
1630 if (!pvNode && tte && ok_to_use_TT(tte, depth, beta, ply, true))
1632 assert(tte->type() != VALUE_TYPE_EVAL);
1634 ss[ply].currentMove = ttMove; // Can be MOVE_NONE
1635 return value_from_tt(tte->value(), ply);
1638 isCheck = pos.is_check();
1640 // Evaluate the position statically
1642 staticValue = -VALUE_INFINITE;
1643 else if (tte && (tte->type() & VALUE_TYPE_EVAL))
1644 staticValue = value_from_tt(tte->value(), ply);
1646 staticValue = evaluate(pos, ei, threadID);
1650 ss[ply].eval = staticValue;
1651 update_gains(pos, ss[ply - 1].currentMove, ss[ply - 1].eval, ss[ply].eval);
1654 // Initialize "stand pat score", and return it immediately if it is
1656 bestValue = staticValue;
1658 if (bestValue >= beta)
1660 // Store the score to avoid a future costly evaluation() call
1661 if (!isCheck && !tte && ei.futilityMargin[pos.side_to_move()] == 0)
1662 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EV_LO, Depth(-127*OnePly), MOVE_NONE);
1667 if (bestValue > alpha)
1670 // If we are near beta then try to get a cutoff pushing checks a bit further
1671 bool deepChecks = (depth == -OnePly && staticValue >= beta - PawnValueMidgame / 8);
1673 // Initialize a MovePicker object for the current position, and prepare
1674 // to search the moves. Because the depth is <= 0 here, only captures,
1675 // queen promotions and checks (only if depth == 0 or depth == -OnePly
1676 // and we are near beta) will be generated.
1677 MovePicker mp = MovePicker(pos, ttMove, deepChecks ? Depth(0) : depth, H);
1679 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1680 futilityBase = staticValue + FutilityMarginQS + ei.futilityMargin[pos.side_to_move()];
1682 // Loop through the moves until no moves remain or a beta cutoff occurs
1683 while ( alpha < beta
1684 && (move = mp.get_next_move()) != MOVE_NONE)
1686 assert(move_is_ok(move));
1688 moveIsCheck = pos.move_is_check(move, ci);
1690 // Update current move
1692 ss[ply].currentMove = move;
1700 && !move_is_promotion(move)
1701 && !pos.move_is_passed_pawn_push(move))
1703 futilityValue = futilityBase
1704 + pos.endgame_value_of_piece_on(move_to(move))
1705 + (move_is_ep(move) ? PawnValueEndgame : Value(0));
1707 if (futilityValue < alpha)
1709 if (futilityValue > bestValue)
1710 bestValue = futilityValue;
1715 // Detect blocking evasions that are candidate to be pruned
1716 evasionPrunable = isCheck
1717 && bestValue != -VALUE_INFINITE
1718 && !pos.move_is_capture(move)
1719 && pos.type_of_piece_on(move_from(move)) != KING
1720 && !pos.can_castle(pos.side_to_move());
1722 // Don't search moves with negative SEE values
1723 if ( (!isCheck || evasionPrunable)
1726 && !move_is_promotion(move)
1727 && pos.see_sign(move) < 0)
1730 // Make and search the move
1731 pos.do_move(move, st, ci, moveIsCheck);
1732 value = -qsearch(pos, ss, -beta, -alpha, depth-OnePly, ply+1, threadID);
1733 pos.undo_move(move);
1735 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1738 if (value > bestValue)
1749 // All legal moves have been searched. A special case: If we're in check
1750 // and no legal moves were found, it is checkmate.
1751 if (!moveCount && isCheck) // Mate!
1752 return value_mated_in(ply);
1754 // Update transposition table
1755 Depth d = (depth == Depth(0) ? Depth(0) : Depth(-1));
1756 if (bestValue <= oldAlpha)
1758 // If bestValue isn't changed it means it is still the static evaluation
1759 // of the node, so keep this info to avoid a future evaluation() call.
1760 ValueType type = (bestValue == staticValue && !ei.futilityMargin[pos.side_to_move()] ? VALUE_TYPE_EV_UP : VALUE_TYPE_UPPER);
1761 TT.store(pos.get_key(), value_to_tt(bestValue, ply), type, d, MOVE_NONE);
1763 else if (bestValue >= beta)
1765 move = ss[ply].pv[ply];
1766 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, d, move);
1768 // Update killers only for good checking moves
1769 if (!pos.move_is_capture_or_promotion(move))
1770 update_killers(move, ss[ply]);
1773 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EXACT, d, ss[ply].pv[ply]);
1775 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1781 // sp_search() is used to search from a split point. This function is called
1782 // by each thread working at the split point. It is similar to the normal
1783 // search() function, but simpler. Because we have already probed the hash
1784 // table, done a null move search, and searched the first move before
1785 // splitting, we don't have to repeat all this work in sp_search(). We
1786 // also don't need to store anything to the hash table here: This is taken
1787 // care of after we return from the split point.
1789 void sp_search(SplitPoint* sp, int threadID) {
1791 assert(threadID >= 0 && threadID < TM.active_threads());
1792 assert(TM.active_threads() > 1);
1796 Depth ext, newDepth;
1797 Value value, futilityValueScaled;
1798 bool isCheck, moveIsCheck, captureOrPromotion, dangerous;
1800 value = -VALUE_INFINITE;
1802 Position pos(*sp->pos);
1804 SearchStack* ss = sp->sstack[threadID];
1805 isCheck = pos.is_check();
1807 // Step 10. Loop through moves
1808 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1809 lock_grab(&(sp->lock));
1811 while ( sp->bestValue < sp->beta
1812 && !TM.thread_should_stop(threadID)
1813 && (move = sp->mp->get_next_move()) != MOVE_NONE)
1815 moveCount = ++sp->moves;
1816 lock_release(&(sp->lock));
1818 assert(move_is_ok(move));
1820 moveIsCheck = pos.move_is_check(move, ci);
1821 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1823 // Step 11. Decide the new search depth
1824 ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, false, sp->mateThreat, &dangerous);
1825 newDepth = sp->depth - OnePly + ext;
1827 // Update current move
1828 ss[sp->ply].currentMove = move;
1830 // Step 12. Futility pruning
1833 && !captureOrPromotion
1834 && !move_is_castle(move))
1836 // Move count based pruning
1837 if ( moveCount >= futility_move_count(sp->depth)
1838 && ok_to_prune(pos, move, ss[sp->ply].threatMove)
1839 && sp->bestValue > value_mated_in(PLY_MAX))
1841 lock_grab(&(sp->lock));
1845 // Value based pruning
1846 Depth predictedDepth = newDepth - nonpv_reduction(sp->depth, moveCount);
1847 futilityValueScaled = ss[sp->ply].eval + futility_margin(predictedDepth, moveCount)
1848 + H.gain(pos.piece_on(move_from(move)), move_to(move)) + 45;
1850 if (futilityValueScaled < sp->beta)
1852 lock_grab(&(sp->lock));
1854 if (futilityValueScaled > sp->bestValue)
1855 sp->bestValue = futilityValueScaled;
1860 // Step 13. Make the move
1861 pos.do_move(move, st, ci, moveIsCheck);
1863 // Step 14. Reduced search
1864 // if the move fails high will be re-searched at full depth.
1865 bool doFullDepthSearch = true;
1868 && !captureOrPromotion
1869 && !move_is_castle(move)
1870 && !move_is_killer(move, ss[sp->ply]))
1872 ss[sp->ply].reduction = nonpv_reduction(sp->depth, moveCount);
1873 if (ss[sp->ply].reduction)
1875 value = -search(pos, ss, -(sp->beta-1), newDepth-ss[sp->ply].reduction, sp->ply+1, true, threadID);
1876 doFullDepthSearch = (value >= sp->beta && !TM.thread_should_stop(threadID));
1880 // Step 15. Full depth search
1881 if (doFullDepthSearch)
1883 ss[sp->ply].reduction = Depth(0);
1884 value = -search(pos, ss, -(sp->beta - 1), newDepth, sp->ply+1, true, threadID);
1887 // Step 16. Undo move
1888 pos.undo_move(move);
1890 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1892 // Step 17. Check for new best move
1893 lock_grab(&(sp->lock));
1895 if (value > sp->bestValue && !TM.thread_should_stop(threadID))
1897 sp->bestValue = value;
1898 if (sp->bestValue >= sp->beta)
1900 sp->stopRequest = true;
1901 sp_update_pv(sp->parentSstack, ss, sp->ply);
1906 /* Here we have the lock still grabbed */
1908 sp->slaves[threadID] = 0;
1911 lock_release(&(sp->lock));
1915 // sp_search_pv() is used to search from a PV split point. This function
1916 // is called by each thread working at the split point. It is similar to
1917 // the normal search_pv() function, but simpler. Because we have already
1918 // probed the hash table and searched the first move before splitting, we
1919 // don't have to repeat all this work in sp_search_pv(). We also don't
1920 // need to store anything to the hash table here: This is taken care of
1921 // after we return from the split point.
1923 void sp_search_pv(SplitPoint* sp, int threadID) {
1925 assert(threadID >= 0 && threadID < TM.active_threads());
1926 assert(TM.active_threads() > 1);
1930 Depth ext, newDepth;
1932 bool moveIsCheck, captureOrPromotion, dangerous;
1934 value = -VALUE_INFINITE;
1936 Position pos(*sp->pos);
1938 SearchStack* ss = sp->sstack[threadID];
1940 // Step 10. Loop through moves
1941 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1942 lock_grab(&(sp->lock));
1944 while ( sp->alpha < sp->beta
1945 && !TM.thread_should_stop(threadID)
1946 && (move = sp->mp->get_next_move()) != MOVE_NONE)
1948 moveCount = ++sp->moves;
1949 lock_release(&(sp->lock));
1951 assert(move_is_ok(move));
1953 moveIsCheck = pos.move_is_check(move, ci);
1954 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1956 // Step 11. Decide the new search depth
1957 ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, false, sp->mateThreat, &dangerous);
1958 newDepth = sp->depth - OnePly + ext;
1960 // Update current move
1961 ss[sp->ply].currentMove = move;
1963 // Step 12. Futility pruning (is omitted in PV nodes)
1965 // Step 13. Make the move
1966 pos.do_move(move, st, ci, moveIsCheck);
1968 // Step 14. Reduced search
1969 // if the move fails high will be re-searched at full depth.
1970 bool doFullDepthSearch = true;
1973 && !captureOrPromotion
1974 && !move_is_castle(move)
1975 && !move_is_killer(move, ss[sp->ply]))
1977 ss[sp->ply].reduction = pv_reduction(sp->depth, moveCount);
1978 if (ss[sp->ply].reduction)
1980 Value localAlpha = sp->alpha;
1981 value = -search(pos, ss, -localAlpha, newDepth-ss[sp->ply].reduction, sp->ply+1, true, threadID);
1982 doFullDepthSearch = (value > localAlpha && !TM.thread_should_stop(threadID));
1986 // Step 15. Full depth search
1987 if (doFullDepthSearch)
1989 Value localAlpha = sp->alpha;
1990 ss[sp->ply].reduction = Depth(0);
1991 value = -search(pos, ss, -localAlpha, newDepth, sp->ply+1, true, threadID);
1993 if (value > localAlpha && value < sp->beta && !TM.thread_should_stop(threadID))
1995 // If another thread has failed high then sp->alpha has been increased
1996 // to be higher or equal then beta, if so, avoid to start a PV search.
1997 localAlpha = sp->alpha;
1998 if (localAlpha < sp->beta)
1999 value = -search_pv(pos, ss, -sp->beta, -localAlpha, newDepth, sp->ply+1, threadID);
2003 // Step 16. Undo move
2004 pos.undo_move(move);
2006 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
2008 // Step 17. Check for new best move
2009 lock_grab(&(sp->lock));
2011 if (value > sp->bestValue && !TM.thread_should_stop(threadID))
2013 sp->bestValue = value;
2014 if (value > sp->alpha)
2016 // Ask threads to stop before to modify sp->alpha
2017 if (value >= sp->beta)
2018 sp->stopRequest = true;
2022 sp_update_pv(sp->parentSstack, ss, sp->ply);
2023 if (value == value_mate_in(sp->ply + 1))
2024 ss[sp->ply].mateKiller = move;
2029 /* Here we have the lock still grabbed */
2031 sp->slaves[threadID] = 0;
2034 lock_release(&(sp->lock));
2038 // init_node() is called at the beginning of all the search functions
2039 // (search(), search_pv(), qsearch(), and so on) and initializes the
2040 // search stack object corresponding to the current node. Once every
2041 // NodesBetweenPolls nodes, init_node() also calls poll(), which polls
2042 // for user input and checks whether it is time to stop the search.
2044 void init_node(SearchStack ss[], int ply, int threadID) {
2046 assert(ply >= 0 && ply < PLY_MAX);
2047 assert(threadID >= 0 && threadID < TM.active_threads());
2049 TM.incrementNodeCounter(threadID);
2054 if (NodesSincePoll >= NodesBetweenPolls)
2061 ss[ply + 2].initKillers();
2065 // update_pv() is called whenever a search returns a value > alpha.
2066 // It updates the PV in the SearchStack object corresponding to the
2069 void update_pv(SearchStack ss[], int ply) {
2071 assert(ply >= 0 && ply < PLY_MAX);
2075 ss[ply].pv[ply] = ss[ply].currentMove;
2077 for (p = ply + 1; ss[ply + 1].pv[p] != MOVE_NONE; p++)
2078 ss[ply].pv[p] = ss[ply + 1].pv[p];
2080 ss[ply].pv[p] = MOVE_NONE;
2084 // sp_update_pv() is a variant of update_pv for use at split points. The
2085 // difference between the two functions is that sp_update_pv also updates
2086 // the PV at the parent node.
2088 void sp_update_pv(SearchStack* pss, SearchStack ss[], int ply) {
2090 assert(ply >= 0 && ply < PLY_MAX);
2094 ss[ply].pv[ply] = pss[ply].pv[ply] = ss[ply].currentMove;
2096 for (p = ply + 1; ss[ply + 1].pv[p] != MOVE_NONE; p++)
2097 ss[ply].pv[p] = pss[ply].pv[p] = ss[ply + 1].pv[p];
2099 ss[ply].pv[p] = pss[ply].pv[p] = MOVE_NONE;
2103 // connected_moves() tests whether two moves are 'connected' in the sense
2104 // that the first move somehow made the second move possible (for instance
2105 // if the moving piece is the same in both moves). The first move is assumed
2106 // to be the move that was made to reach the current position, while the
2107 // second move is assumed to be a move from the current position.
2109 bool connected_moves(const Position& pos, Move m1, Move m2) {
2111 Square f1, t1, f2, t2;
2114 assert(move_is_ok(m1));
2115 assert(move_is_ok(m2));
2117 if (m2 == MOVE_NONE)
2120 // Case 1: The moving piece is the same in both moves
2126 // Case 2: The destination square for m2 was vacated by m1
2132 // Case 3: Moving through the vacated square
2133 if ( piece_is_slider(pos.piece_on(f2))
2134 && bit_is_set(squares_between(f2, t2), f1))
2137 // Case 4: The destination square for m2 is defended by the moving piece in m1
2138 p = pos.piece_on(t1);
2139 if (bit_is_set(pos.attacks_from(p, t1), t2))
2142 // Case 5: Discovered check, checking piece is the piece moved in m1
2143 if ( piece_is_slider(p)
2144 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
2145 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
2147 // discovered_check_candidates() works also if the Position's side to
2148 // move is the opposite of the checking piece.
2149 Color them = opposite_color(pos.side_to_move());
2150 Bitboard dcCandidates = pos.discovered_check_candidates(them);
2152 if (bit_is_set(dcCandidates, f2))
2159 // value_is_mate() checks if the given value is a mate one
2160 // eventually compensated for the ply.
2162 bool value_is_mate(Value value) {
2164 assert(abs(value) <= VALUE_INFINITE);
2166 return value <= value_mated_in(PLY_MAX)
2167 || value >= value_mate_in(PLY_MAX);
2171 // move_is_killer() checks if the given move is among the
2172 // killer moves of that ply.
2174 bool move_is_killer(Move m, const SearchStack& ss) {
2176 const Move* k = ss.killers;
2177 for (int i = 0; i < KILLER_MAX; i++, k++)
2185 // extension() decides whether a move should be searched with normal depth,
2186 // or with extended depth. Certain classes of moves (checking moves, in
2187 // particular) are searched with bigger depth than ordinary moves and in
2188 // any case are marked as 'dangerous'. Note that also if a move is not
2189 // extended, as example because the corresponding UCI option is set to zero,
2190 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
2192 Depth extension(const Position& pos, Move m, bool pvNode, bool captureOrPromotion,
2193 bool moveIsCheck, bool singleEvasion, bool mateThreat, bool* dangerous) {
2195 assert(m != MOVE_NONE);
2197 Depth result = Depth(0);
2198 *dangerous = moveIsCheck | singleEvasion | mateThreat;
2203 result += CheckExtension[pvNode];
2206 result += SingleEvasionExtension[pvNode];
2209 result += MateThreatExtension[pvNode];
2212 if (pos.type_of_piece_on(move_from(m)) == PAWN)
2214 Color c = pos.side_to_move();
2215 if (relative_rank(c, move_to(m)) == RANK_7)
2217 result += PawnPushTo7thExtension[pvNode];
2220 if (pos.pawn_is_passed(c, move_to(m)))
2222 result += PassedPawnExtension[pvNode];
2227 if ( captureOrPromotion
2228 && pos.type_of_piece_on(move_to(m)) != PAWN
2229 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
2230 - pos.midgame_value_of_piece_on(move_to(m)) == Value(0))
2231 && !move_is_promotion(m)
2234 result += PawnEndgameExtension[pvNode];
2239 && captureOrPromotion
2240 && pos.type_of_piece_on(move_to(m)) != PAWN
2241 && pos.see_sign(m) >= 0)
2247 return Min(result, OnePly);
2251 // ok_to_do_nullmove() looks at the current position and decides whether
2252 // doing a 'null move' should be allowed. In order to avoid zugzwang
2253 // problems, null moves are not allowed when the side to move has very
2254 // little material left. Currently, the test is a bit too simple: Null
2255 // moves are avoided only when the side to move has only pawns left.
2256 // It's probably a good idea to avoid null moves in at least some more
2257 // complicated endgames, e.g. KQ vs KR. FIXME
2259 bool ok_to_do_nullmove(const Position& pos) {
2261 return pos.non_pawn_material(pos.side_to_move()) != Value(0);
2265 // ok_to_prune() tests whether it is safe to forward prune a move. Only
2266 // non-tactical moves late in the move list close to the leaves are
2267 // candidates for pruning.
2269 bool ok_to_prune(const Position& pos, Move m, Move threat) {
2271 assert(move_is_ok(m));
2272 assert(threat == MOVE_NONE || move_is_ok(threat));
2273 assert(!pos.move_is_check(m));
2274 assert(!pos.move_is_capture_or_promotion(m));
2275 assert(!pos.move_is_passed_pawn_push(m));
2277 Square mfrom, mto, tfrom, tto;
2279 // Prune if there isn't any threat move
2280 if (threat == MOVE_NONE)
2283 mfrom = move_from(m);
2285 tfrom = move_from(threat);
2286 tto = move_to(threat);
2288 // Case 1: Don't prune moves which move the threatened piece
2292 // Case 2: If the threatened piece has value less than or equal to the
2293 // value of the threatening piece, don't prune move which defend it.
2294 if ( pos.move_is_capture(threat)
2295 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
2296 || pos.type_of_piece_on(tfrom) == KING)
2297 && pos.move_attacks_square(m, tto))
2300 // Case 3: If the moving piece in the threatened move is a slider, don't
2301 // prune safe moves which block its ray.
2302 if ( piece_is_slider(pos.piece_on(tfrom))
2303 && bit_is_set(squares_between(tfrom, tto), mto)
2304 && pos.see_sign(m) >= 0)
2311 // ok_to_use_TT() returns true if a transposition table score can be used at a
2312 // given point in search. To avoid zugzwang issues TT cutoffs at the root node
2313 // of a null move verification search are not allowed if the TT value was found
2314 // by a null search, this is implemented testing allowNullmove and TT entry type.
2316 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply, bool allowNullmove) {
2318 Value v = value_from_tt(tte->value(), ply);
2320 return (allowNullmove || !(tte->type() & VALUE_TYPE_NULL))
2322 && ( tte->depth() >= depth
2323 || v >= Max(value_mate_in(PLY_MAX), beta)
2324 || v < Min(value_mated_in(PLY_MAX), beta))
2326 && ( (is_lower_bound(tte->type()) && v >= beta)
2327 || (is_upper_bound(tte->type()) && v < beta));
2331 // refine_eval() returns the transposition table score if
2332 // possible otherwise falls back on static position evaluation.
2334 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
2339 Value v = value_from_tt(tte->value(), ply);
2341 if ( (is_lower_bound(tte->type()) && v >= defaultEval)
2342 || (is_upper_bound(tte->type()) && v < defaultEval))
2349 // update_history() registers a good move that produced a beta-cutoff
2350 // in history and marks as failures all the other moves of that ply.
2352 void update_history(const Position& pos, Move move, Depth depth,
2353 Move movesSearched[], int moveCount) {
2357 H.success(pos.piece_on(move_from(move)), move_to(move), depth);
2359 for (int i = 0; i < moveCount - 1; i++)
2361 m = movesSearched[i];
2365 if (!pos.move_is_capture_or_promotion(m))
2366 H.failure(pos.piece_on(move_from(m)), move_to(m), depth);
2371 // update_killers() add a good move that produced a beta-cutoff
2372 // among the killer moves of that ply.
2374 void update_killers(Move m, SearchStack& ss) {
2376 if (m == ss.killers[0])
2379 for (int i = KILLER_MAX - 1; i > 0; i--)
2380 ss.killers[i] = ss.killers[i - 1];
2386 // update_gains() updates the gains table of a non-capture move given
2387 // the static position evaluation before and after the move.
2389 void update_gains(const Position& pos, Move m, Value before, Value after) {
2392 && before != VALUE_NONE
2393 && after != VALUE_NONE
2394 && pos.captured_piece() == NO_PIECE_TYPE
2395 && !move_is_castle(m)
2396 && !move_is_promotion(m))
2397 H.set_gain(pos.piece_on(move_to(m)), move_to(m), -(before + after));
2401 // current_search_time() returns the number of milliseconds which have passed
2402 // since the beginning of the current search.
2404 int current_search_time() {
2406 return get_system_time() - SearchStartTime;
2410 // nps() computes the current nodes/second count.
2414 int t = current_search_time();
2415 return (t > 0 ? int((TM.nodes_searched() * 1000) / t) : 0);
2419 // poll() performs two different functions: It polls for user input, and it
2420 // looks at the time consumed so far and decides if it's time to abort the
2425 static int lastInfoTime;
2426 int t = current_search_time();
2431 // We are line oriented, don't read single chars
2432 std::string command;
2434 if (!std::getline(std::cin, command))
2437 if (command == "quit")
2440 PonderSearch = false;
2444 else if (command == "stop")
2447 PonderSearch = false;
2449 else if (command == "ponderhit")
2453 // Print search information
2457 else if (lastInfoTime > t)
2458 // HACK: Must be a new search where we searched less than
2459 // NodesBetweenPolls nodes during the first second of search.
2462 else if (t - lastInfoTime >= 1000)
2469 if (dbg_show_hit_rate)
2470 dbg_print_hit_rate();
2472 cout << "info nodes " << TM.nodes_searched() << " nps " << nps()
2473 << " time " << t << " hashfull " << TT.full() << endl;
2476 // Should we stop the search?
2480 bool stillAtFirstMove = FirstRootMove
2481 && !AspirationFailLow
2482 && t > MaxSearchTime + ExtraSearchTime;
2484 bool noMoreTime = t > AbsoluteMaxSearchTime
2485 || stillAtFirstMove;
2487 if ( (Iteration >= 3 && UseTimeManagement && noMoreTime)
2488 || (ExactMaxTime && t >= ExactMaxTime)
2489 || (Iteration >= 3 && MaxNodes && TM.nodes_searched() >= MaxNodes))
2494 // ponderhit() is called when the program is pondering (i.e. thinking while
2495 // it's the opponent's turn to move) in order to let the engine know that
2496 // it correctly predicted the opponent's move.
2500 int t = current_search_time();
2501 PonderSearch = false;
2503 bool stillAtFirstMove = FirstRootMove
2504 && !AspirationFailLow
2505 && t > MaxSearchTime + ExtraSearchTime;
2507 bool noMoreTime = t > AbsoluteMaxSearchTime
2508 || stillAtFirstMove;
2510 if (Iteration >= 3 && UseTimeManagement && (noMoreTime || StopOnPonderhit))
2515 // init_ss_array() does a fast reset of the first entries of a SearchStack array
2517 void init_ss_array(SearchStack ss[]) {
2519 for (int i = 0; i < 3; i++)
2522 ss[i].initKillers();
2527 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2528 // while the program is pondering. The point is to work around a wrinkle in
2529 // the UCI protocol: When pondering, the engine is not allowed to give a
2530 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2531 // We simply wait here until one of these commands is sent, and return,
2532 // after which the bestmove and pondermove will be printed (in id_loop()).
2534 void wait_for_stop_or_ponderhit() {
2536 std::string command;
2540 if (!std::getline(std::cin, command))
2543 if (command == "quit")
2548 else if (command == "ponderhit" || command == "stop")
2554 // print_pv_info() prints to standard output and eventually to log file information on
2555 // the current PV line. It is called at each iteration or after a new pv is found.
2557 void print_pv_info(const Position& pos, SearchStack ss[], Value alpha, Value beta, Value value) {
2559 cout << "info depth " << Iteration
2560 << " score " << value_to_string(value)
2561 << ((value >= beta) ? " lowerbound" :
2562 ((value <= alpha)? " upperbound" : ""))
2563 << " time " << current_search_time()
2564 << " nodes " << TM.nodes_searched()
2568 for (int j = 0; ss[0].pv[j] != MOVE_NONE && j < PLY_MAX; j++)
2569 cout << ss[0].pv[j] << " ";
2575 ValueType type = (value >= beta ? VALUE_TYPE_LOWER
2576 : (value <= alpha ? VALUE_TYPE_UPPER : VALUE_TYPE_EXACT));
2578 LogFile << pretty_pv(pos, current_search_time(), Iteration,
2579 TM.nodes_searched(), value, type, ss[0].pv) << endl;
2584 // init_thread() is the function which is called when a new thread is
2585 // launched. It simply calls the idle_loop() function with the supplied
2586 // threadID. There are two versions of this function; one for POSIX
2587 // threads and one for Windows threads.
2589 #if !defined(_MSC_VER)
2591 void* init_thread(void *threadID) {
2593 TM.idle_loop(*(int*)threadID, NULL);
2599 DWORD WINAPI init_thread(LPVOID threadID) {
2601 TM.idle_loop(*(int*)threadID, NULL);
2608 /// The ThreadsManager class
2610 // resetNodeCounters(), resetBetaCounters(), searched_nodes() and
2611 // get_beta_counters() are getters/setters for the per thread
2612 // counters used to sort the moves at root.
2614 void ThreadsManager::resetNodeCounters() {
2616 for (int i = 0; i < MAX_THREADS; i++)
2617 threads[i].nodes = 0ULL;
2620 void ThreadsManager::resetBetaCounters() {
2622 for (int i = 0; i < MAX_THREADS; i++)
2623 threads[i].betaCutOffs[WHITE] = threads[i].betaCutOffs[BLACK] = 0ULL;
2626 int64_t ThreadsManager::nodes_searched() const {
2628 int64_t result = 0ULL;
2629 for (int i = 0; i < ActiveThreads; i++)
2630 result += threads[i].nodes;
2635 void ThreadsManager::get_beta_counters(Color us, int64_t& our, int64_t& their) const {
2638 for (int i = 0; i < MAX_THREADS; i++)
2640 our += threads[i].betaCutOffs[us];
2641 their += threads[i].betaCutOffs[opposite_color(us)];
2646 // idle_loop() is where the threads are parked when they have no work to do.
2647 // The parameter "waitSp", if non-NULL, is a pointer to an active SplitPoint
2648 // object for which the current thread is the master.
2650 void ThreadsManager::idle_loop(int threadID, SplitPoint* waitSp) {
2652 assert(threadID >= 0 && threadID < MAX_THREADS);
2656 // Slave threads can exit as soon as AllThreadsShouldExit raises,
2657 // master should exit as last one.
2658 if (AllThreadsShouldExit)
2661 threads[threadID].state = THREAD_TERMINATED;
2665 // If we are not thinking, wait for a condition to be signaled
2666 // instead of wasting CPU time polling for work.
2667 while (AllThreadsShouldSleep || threadID >= ActiveThreads)
2670 assert(threadID != 0);
2671 threads[threadID].state = THREAD_SLEEPING;
2673 #if !defined(_MSC_VER)
2674 lock_grab(&WaitLock);
2675 if (AllThreadsShouldSleep || threadID >= ActiveThreads)
2676 pthread_cond_wait(&WaitCond, &WaitLock);
2677 lock_release(&WaitLock);
2679 WaitForSingleObject(SitIdleEvent[threadID], INFINITE);
2683 // If thread has just woken up, mark it as available
2684 if (threads[threadID].state == THREAD_SLEEPING)
2685 threads[threadID].state = THREAD_AVAILABLE;
2687 // If this thread has been assigned work, launch a search
2688 if (threads[threadID].state == THREAD_WORKISWAITING)
2690 assert(!AllThreadsShouldExit && !AllThreadsShouldSleep);
2692 threads[threadID].state = THREAD_SEARCHING;
2694 if (threads[threadID].splitPoint->pvNode)
2695 sp_search_pv(threads[threadID].splitPoint, threadID);
2697 sp_search(threads[threadID].splitPoint, threadID);
2699 assert(threads[threadID].state == THREAD_SEARCHING);
2701 threads[threadID].state = THREAD_AVAILABLE;
2704 // If this thread is the master of a split point and all threads have
2705 // finished their work at this split point, return from the idle loop.
2706 if (waitSp != NULL && waitSp->cpus == 0)
2708 assert(threads[threadID].state == THREAD_AVAILABLE);
2710 threads[threadID].state = THREAD_SEARCHING;
2717 // init_threads() is called during startup. It launches all helper threads,
2718 // and initializes the split point stack and the global locks and condition
2721 void ThreadsManager::init_threads() {
2726 #if !defined(_MSC_VER)
2727 pthread_t pthread[1];
2730 // Initialize global locks
2731 lock_init(&MPLock, NULL);
2732 lock_init(&WaitLock, NULL);
2734 #if !defined(_MSC_VER)
2735 pthread_cond_init(&WaitCond, NULL);
2737 for (i = 0; i < MAX_THREADS; i++)
2738 SitIdleEvent[i] = CreateEvent(0, FALSE, FALSE, 0);
2741 // Initialize SplitPointStack locks
2742 for (i = 0; i < MAX_THREADS; i++)
2743 for (int j = 0; j < ACTIVE_SPLIT_POINTS_MAX; j++)
2745 SplitPointStack[i][j].parent = NULL;
2746 lock_init(&(SplitPointStack[i][j].lock), NULL);
2749 // Will be set just before program exits to properly end the threads
2750 AllThreadsShouldExit = false;
2752 // Threads will be put to sleep as soon as created
2753 AllThreadsShouldSleep = true;
2755 // All threads except the main thread should be initialized to THREAD_AVAILABLE
2757 threads[0].state = THREAD_SEARCHING;
2758 for (i = 1; i < MAX_THREADS; i++)
2759 threads[i].state = THREAD_AVAILABLE;
2761 // Launch the helper threads
2762 for (i = 1; i < MAX_THREADS; i++)
2765 #if !defined(_MSC_VER)
2766 ok = (pthread_create(pthread, NULL, init_thread, (void*)(&i)) == 0);
2768 ok = (CreateThread(NULL, 0, init_thread, (LPVOID)(&i), 0, NULL) != NULL);
2773 cout << "Failed to create thread number " << i << endl;
2774 Application::exit_with_failure();
2777 // Wait until the thread has finished launching and is gone to sleep
2778 while (threads[i].state != THREAD_SLEEPING);
2783 // exit_threads() is called when the program exits. It makes all the
2784 // helper threads exit cleanly.
2786 void ThreadsManager::exit_threads() {
2788 ActiveThreads = MAX_THREADS; // HACK
2789 AllThreadsShouldSleep = true; // HACK
2790 wake_sleeping_threads();
2792 // This makes the threads to exit idle_loop()
2793 AllThreadsShouldExit = true;
2795 // Wait for thread termination
2796 for (int i = 1; i < MAX_THREADS; i++)
2797 while (threads[i].state != THREAD_TERMINATED);
2799 // Now we can safely destroy the locks
2800 for (int i = 0; i < MAX_THREADS; i++)
2801 for (int j = 0; j < ACTIVE_SPLIT_POINTS_MAX; j++)
2802 lock_destroy(&(SplitPointStack[i][j].lock));
2804 lock_destroy(&WaitLock);
2805 lock_destroy(&MPLock);
2809 // thread_should_stop() checks whether the thread should stop its search.
2810 // This can happen if a beta cutoff has occurred in the thread's currently
2811 // active split point, or in some ancestor of the current split point.
2813 bool ThreadsManager::thread_should_stop(int threadID) const {
2815 assert(threadID >= 0 && threadID < ActiveThreads);
2819 for (sp = threads[threadID].splitPoint; sp && !sp->stopRequest; sp = sp->parent);
2824 // thread_is_available() checks whether the thread with threadID "slave" is
2825 // available to help the thread with threadID "master" at a split point. An
2826 // obvious requirement is that "slave" must be idle. With more than two
2827 // threads, this is not by itself sufficient: If "slave" is the master of
2828 // some active split point, it is only available as a slave to the other
2829 // threads which are busy searching the split point at the top of "slave"'s
2830 // split point stack (the "helpful master concept" in YBWC terminology).
2832 bool ThreadsManager::thread_is_available(int slave, int master) const {
2834 assert(slave >= 0 && slave < ActiveThreads);
2835 assert(master >= 0 && master < ActiveThreads);
2836 assert(ActiveThreads > 1);
2838 if (threads[slave].state != THREAD_AVAILABLE || slave == master)
2841 // Make a local copy to be sure doesn't change under our feet
2842 int localActiveSplitPoints = threads[slave].activeSplitPoints;
2844 if (localActiveSplitPoints == 0)
2845 // No active split points means that the thread is available as
2846 // a slave for any other thread.
2849 if (ActiveThreads == 2)
2852 // Apply the "helpful master" concept if possible. Use localActiveSplitPoints
2853 // that is known to be > 0, instead of threads[slave].activeSplitPoints that
2854 // could have been set to 0 by another thread leading to an out of bound access.
2855 if (SplitPointStack[slave][localActiveSplitPoints - 1].slaves[master])
2862 // available_thread_exists() tries to find an idle thread which is available as
2863 // a slave for the thread with threadID "master".
2865 bool ThreadsManager::available_thread_exists(int master) const {
2867 assert(master >= 0 && master < ActiveThreads);
2868 assert(ActiveThreads > 1);
2870 for (int i = 0; i < ActiveThreads; i++)
2871 if (thread_is_available(i, master))
2878 // split() does the actual work of distributing the work at a node between
2879 // several threads at PV nodes. If it does not succeed in splitting the
2880 // node (because no idle threads are available, or because we have no unused
2881 // split point objects), the function immediately returns false. If
2882 // splitting is possible, a SplitPoint object is initialized with all the
2883 // data that must be copied to the helper threads (the current position and
2884 // search stack, alpha, beta, the search depth, etc.), and we tell our
2885 // helper threads that they have been assigned work. This will cause them
2886 // to instantly leave their idle loops and call sp_search_pv(). When all
2887 // threads have returned from sp_search_pv (or, equivalently, when
2888 // splitPoint->cpus becomes 0), split() returns true.
2890 bool ThreadsManager::split(const Position& p, SearchStack* sstck, int ply,
2891 Value* alpha, const Value beta, Value* bestValue,
2892 Depth depth, bool mateThreat, int* moves, MovePicker* mp, int master, bool pvNode) {
2895 assert(sstck != NULL);
2896 assert(ply >= 0 && ply < PLY_MAX);
2897 assert(*bestValue >= -VALUE_INFINITE);
2898 assert( ( pvNode && *bestValue <= *alpha)
2899 || (!pvNode && *bestValue < beta ));
2900 assert(!pvNode || *alpha < beta);
2901 assert(beta <= VALUE_INFINITE);
2902 assert(depth > Depth(0));
2903 assert(master >= 0 && master < ActiveThreads);
2904 assert(ActiveThreads > 1);
2906 SplitPoint* splitPoint;
2910 // If no other thread is available to help us, or if we have too many
2911 // active split points, don't split.
2912 if ( !available_thread_exists(master)
2913 || threads[master].activeSplitPoints >= ACTIVE_SPLIT_POINTS_MAX)
2915 lock_release(&MPLock);
2919 // Pick the next available split point object from the split point stack
2920 splitPoint = &SplitPointStack[master][threads[master].activeSplitPoints];
2922 // Initialize the split point object
2923 splitPoint->parent = threads[master].splitPoint;
2924 splitPoint->stopRequest = false;
2925 splitPoint->ply = ply;
2926 splitPoint->depth = depth;
2927 splitPoint->mateThreat = mateThreat;
2928 splitPoint->alpha = pvNode ? *alpha : beta - 1;
2929 splitPoint->beta = beta;
2930 splitPoint->pvNode = pvNode;
2931 splitPoint->bestValue = *bestValue;
2932 splitPoint->master = master;
2933 splitPoint->mp = mp;
2934 splitPoint->moves = *moves;
2935 splitPoint->cpus = 1;
2936 splitPoint->pos = &p;
2937 splitPoint->parentSstack = sstck;
2938 for (int i = 0; i < ActiveThreads; i++)
2939 splitPoint->slaves[i] = 0;
2941 threads[master].splitPoint = splitPoint;
2942 threads[master].activeSplitPoints++;
2944 // If we are here it means we are not available
2945 assert(threads[master].state != THREAD_AVAILABLE);
2947 // Allocate available threads setting state to THREAD_BOOKED
2948 for (int i = 0; i < ActiveThreads && splitPoint->cpus < MaxThreadsPerSplitPoint; i++)
2949 if (thread_is_available(i, master))
2951 threads[i].state = THREAD_BOOKED;
2952 threads[i].splitPoint = splitPoint;
2953 splitPoint->slaves[i] = 1;
2957 assert(splitPoint->cpus > 1);
2959 // We can release the lock because slave threads are already booked and master is not available
2960 lock_release(&MPLock);
2962 // Tell the threads that they have work to do. This will make them leave
2963 // their idle loop. But before copy search stack tail for each thread.
2964 for (int i = 0; i < ActiveThreads; i++)
2965 if (i == master || splitPoint->slaves[i])
2967 memcpy(splitPoint->sstack[i] + ply - 1, sstck + ply - 1, 4 * sizeof(SearchStack));
2969 assert(i == master || threads[i].state == THREAD_BOOKED);
2971 threads[i].state = THREAD_WORKISWAITING; // This makes the slave to exit from idle_loop()
2974 // Everything is set up. The master thread enters the idle loop, from
2975 // which it will instantly launch a search, because its state is
2976 // THREAD_WORKISWAITING. We send the split point as a second parameter to the
2977 // idle loop, which means that the main thread will return from the idle
2978 // loop when all threads have finished their work at this split point
2979 // (i.e. when splitPoint->cpus == 0).
2980 idle_loop(master, splitPoint);
2982 // We have returned from the idle loop, which means that all threads are
2983 // finished. Update alpha, beta and bestValue, and return.
2987 *alpha = splitPoint->alpha;
2989 *bestValue = splitPoint->bestValue;
2990 threads[master].activeSplitPoints--;
2991 threads[master].splitPoint = splitPoint->parent;
2993 lock_release(&MPLock);
2998 // wake_sleeping_threads() wakes up all sleeping threads when it is time
2999 // to start a new search from the root.
3001 void ThreadsManager::wake_sleeping_threads() {
3003 assert(AllThreadsShouldSleep);
3004 assert(ActiveThreads > 0);
3006 AllThreadsShouldSleep = false;
3008 if (ActiveThreads == 1)
3011 #if !defined(_MSC_VER)
3012 pthread_mutex_lock(&WaitLock);
3013 pthread_cond_broadcast(&WaitCond);
3014 pthread_mutex_unlock(&WaitLock);
3016 for (int i = 1; i < MAX_THREADS; i++)
3017 SetEvent(SitIdleEvent[i]);
3023 // put_threads_to_sleep() makes all the threads go to sleep just before
3024 // to leave think(), at the end of the search. Threads should have already
3025 // finished the job and should be idle.
3027 void ThreadsManager::put_threads_to_sleep() {
3029 assert(!AllThreadsShouldSleep);
3031 // This makes the threads to go to sleep
3032 AllThreadsShouldSleep = true;
3035 /// The RootMoveList class
3037 // RootMoveList c'tor
3039 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) : count(0) {
3041 SearchStack ss[PLY_MAX_PLUS_2];
3042 MoveStack mlist[MaxRootMoves];
3044 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
3046 // Generate all legal moves
3047 MoveStack* last = generate_moves(pos, mlist);
3049 // Add each move to the moves[] array
3050 for (MoveStack* cur = mlist; cur != last; cur++)
3052 bool includeMove = includeAllMoves;
3054 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
3055 includeMove = (searchMoves[k] == cur->move);
3060 // Find a quick score for the move
3062 pos.do_move(cur->move, st);
3063 moves[count].move = cur->move;
3064 moves[count].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE, Depth(0), 1, 0);
3065 moves[count].pv[0] = cur->move;
3066 moves[count].pv[1] = MOVE_NONE;
3067 pos.undo_move(cur->move);
3074 // RootMoveList simple methods definitions
3076 void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) {
3078 moves[moveNum].nodes = nodes;
3079 moves[moveNum].cumulativeNodes += nodes;
3082 void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) {
3084 moves[moveNum].ourBeta = our;
3085 moves[moveNum].theirBeta = their;
3088 void RootMoveList::set_move_pv(int moveNum, const Move pv[]) {
3092 for (j = 0; pv[j] != MOVE_NONE; j++)
3093 moves[moveNum].pv[j] = pv[j];
3095 moves[moveNum].pv[j] = MOVE_NONE;
3099 // RootMoveList::sort() sorts the root move list at the beginning of a new
3102 void RootMoveList::sort() {
3104 sort_multipv(count - 1); // Sort all items
3108 // RootMoveList::sort_multipv() sorts the first few moves in the root move
3109 // list by their scores and depths. It is used to order the different PVs
3110 // correctly in MultiPV mode.
3112 void RootMoveList::sort_multipv(int n) {
3116 for (i = 1; i <= n; i++)
3118 RootMove rm = moves[i];
3119 for (j = i; j > 0 && moves[j - 1] < rm; j--)
3120 moves[j] = moves[j - 1];