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 = true;
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, get_option_value_bool("Best Book Move"));
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 TT.store(posKey, nullValue, VALUE_TYPE_NS_LO, depth, MOVE_NONE);
1395 // The null move failed low, which means that we may be faced with
1396 // some kind of threat. If the previous move was reduced, check if
1397 // the move that refuted the null move was somehow connected to the
1398 // move which was reduced. If a connection is found, return a fail
1399 // low score (which will cause the reduced move to fail high in the
1400 // parent node, which will trigger a re-search with full depth).
1401 if (nullValue == value_mated_in(ply + 2))
1404 ss[ply].threatMove = ss[ply + 1].currentMove;
1405 if ( depth < ThreatDepth
1406 && ss[ply - 1].reduction
1407 && connected_moves(pos, ss[ply - 1].currentMove, ss[ply].threatMove))
1412 // Step 9. Internal iterative deepening
1413 if ( depth >= IIDDepthAtNonPVNodes
1414 && ttMove == MOVE_NONE
1416 && ss[ply].eval >= beta - IIDMargin)
1418 search(pos, ss, beta, depth/2, ply, false, threadID);
1419 ttMove = ss[ply].pv[ply];
1420 tte = TT.retrieve(posKey);
1423 // Initialize a MovePicker object for the current position
1424 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply], beta);
1427 // Step 10. Loop through moves
1428 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1429 while ( bestValue < beta
1430 && (move = mp.get_next_move()) != MOVE_NONE
1431 && !TM.thread_should_stop(threadID))
1433 assert(move_is_ok(move));
1435 if (move == excludedMove)
1438 moveIsCheck = pos.move_is_check(move, ci);
1439 singleEvasion = (isCheck && mp.number_of_evasions() == 1);
1440 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1442 // Step 11. Decide the new search depth
1443 ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, singleEvasion, mateThreat, &dangerous);
1445 // Singular extension search. We extend the TT move if its value is much better than
1446 // its siblings. To verify this we do a reduced search on all the other moves but the
1447 // ttMove, if result is lower then ttValue minus a margin then we extend ttMove.
1448 if ( depth >= SingularExtensionDepthAtNonPVNodes
1450 && move == tte->move()
1451 && !excludedMove // Do not allow recursive singular extension search
1453 && is_lower_bound(tte->type())
1454 && tte->depth() >= depth - 3 * OnePly)
1456 Value ttValue = value_from_tt(tte->value(), ply);
1458 if (abs(ttValue) < VALUE_KNOWN_WIN)
1460 Value excValue = search(pos, ss, ttValue - SingularExtensionMargin, depth / 2, ply, false, threadID, move);
1462 if (excValue < ttValue - SingularExtensionMargin)
1467 newDepth = depth - OnePly + ext;
1469 // Update current move (this must be done after singular extension search)
1470 movesSearched[moveCount++] = ss[ply].currentMove = move;
1472 // Step 12. Futility pruning
1475 && !captureOrPromotion
1476 && !move_is_castle(move)
1479 // Move count based pruning
1480 if ( moveCount >= futility_move_count(depth)
1481 && ok_to_prune(pos, move, ss[ply].threatMove)
1482 && bestValue > value_mated_in(PLY_MAX))
1485 // Value based pruning
1486 Depth predictedDepth = newDepth - nonpv_reduction(depth, moveCount); // We illogically ignore reduction condition depth >= 3*OnePly
1487 futilityValueScaled = ss[ply].eval + futility_margin(predictedDepth, moveCount)
1488 + H.gain(pos.piece_on(move_from(move)), move_to(move)) + 45;
1490 if (futilityValueScaled < beta)
1492 if (futilityValueScaled > bestValue)
1493 bestValue = futilityValueScaled;
1498 // Step 13. Make the move
1499 pos.do_move(move, st, ci, moveIsCheck);
1501 // Step 14. Reduced search, if the move fails high
1502 // will be re-searched at full depth.
1503 bool doFullDepthSearch = true;
1505 if ( depth >= 3*OnePly
1507 && !captureOrPromotion
1508 && !move_is_castle(move)
1509 && !move_is_killer(move, ss[ply]))
1511 ss[ply].reduction = nonpv_reduction(depth, moveCount);
1512 if (ss[ply].reduction)
1514 value = -search(pos, ss, -(beta-1), newDepth-ss[ply].reduction, ply+1, true, threadID);
1515 doFullDepthSearch = (value >= beta);
1519 // Step 15. Full depth search
1520 if (doFullDepthSearch)
1522 ss[ply].reduction = Depth(0);
1523 value = -search(pos, ss, -(beta-1), newDepth, ply+1, true, threadID);
1526 // Step 16. Undo move
1527 pos.undo_move(move);
1529 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1531 // Step 17. Check for new best move
1532 if (value > bestValue)
1538 if (value == value_mate_in(ply + 1))
1539 ss[ply].mateKiller = move;
1542 // Step 18. Check for split
1543 if ( TM.active_threads() > 1
1545 && depth >= MinimumSplitDepth
1547 && TM.available_thread_exists(threadID)
1549 && !TM.thread_should_stop(threadID)
1550 && TM.split(pos, ss, ply, NULL, beta, &bestValue,
1551 depth, mateThreat, &moveCount, &mp, threadID, false))
1555 // Step 19. Check for mate and stalemate
1556 // All legal moves have been searched and if there are
1557 // no legal moves, it must be mate or stalemate.
1558 // If one move was excluded return fail low score.
1560 return excludedMove ? beta - 1 : (isCheck ? value_mated_in(ply) : VALUE_DRAW);
1562 // Step 20. Update tables
1563 // If the search is not aborted, update the transposition table,
1564 // history counters, and killer moves.
1565 if (AbortSearch || TM.thread_should_stop(threadID))
1568 if (bestValue < beta)
1569 TT.store(posKey, value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1572 TM.incrementBetaCounter(pos.side_to_move(), depth, threadID);
1573 move = ss[ply].pv[ply];
1574 TT.store(posKey, value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, move);
1575 if (!pos.move_is_capture_or_promotion(move))
1577 update_history(pos, move, depth, movesSearched, moveCount);
1578 update_killers(move, ss[ply]);
1583 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1589 // qsearch() is the quiescence search function, which is called by the main
1590 // search function when the remaining depth is zero (or, to be more precise,
1591 // less than OnePly).
1593 Value qsearch(Position& pos, SearchStack ss[], Value alpha, Value beta,
1594 Depth depth, int ply, int threadID) {
1596 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1597 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1599 assert(ply >= 0 && ply < PLY_MAX);
1600 assert(threadID >= 0 && threadID < TM.active_threads());
1605 Value staticValue, bestValue, value, futilityBase, futilityValue;
1606 bool isCheck, enoughMaterial, moveIsCheck, evasionPrunable;
1607 const TTEntry* tte = NULL;
1609 bool pvNode = (beta - alpha != 1);
1610 Value oldAlpha = alpha;
1612 // Initialize, and make an early exit in case of an aborted search,
1613 // an instant draw, maximum ply reached, etc.
1614 init_node(ss, ply, threadID);
1616 // After init_node() that calls poll()
1617 if (AbortSearch || TM.thread_should_stop(threadID))
1620 if (pos.is_draw() || ply >= PLY_MAX - 1)
1623 // Transposition table lookup. At PV nodes, we don't use the TT for
1624 // pruning, but only for move ordering.
1625 tte = TT.retrieve(pos.get_key());
1626 ttMove = (tte ? tte->move() : MOVE_NONE);
1628 if (!pvNode && tte && ok_to_use_TT(tte, depth, beta, ply, true))
1630 assert(tte->type() != VALUE_TYPE_EVAL);
1632 ss[ply].currentMove = ttMove; // Can be MOVE_NONE
1633 return value_from_tt(tte->value(), ply);
1636 isCheck = pos.is_check();
1638 // Evaluate the position statically
1640 staticValue = -VALUE_INFINITE;
1641 else if (tte && (tte->type() & VALUE_TYPE_EVAL))
1642 staticValue = value_from_tt(tte->value(), ply);
1644 staticValue = evaluate(pos, ei, threadID);
1648 ss[ply].eval = staticValue;
1649 update_gains(pos, ss[ply - 1].currentMove, ss[ply - 1].eval, ss[ply].eval);
1652 // Initialize "stand pat score", and return it immediately if it is
1654 bestValue = staticValue;
1656 if (bestValue >= beta)
1658 // Store the score to avoid a future costly evaluation() call
1659 if (!isCheck && !tte && ei.futilityMargin[pos.side_to_move()] == 0)
1660 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EV_LO, Depth(-127*OnePly), MOVE_NONE);
1665 if (bestValue > alpha)
1668 // If we are near beta then try to get a cutoff pushing checks a bit further
1669 bool deepChecks = (depth == -OnePly && staticValue >= beta - PawnValueMidgame / 8);
1671 // Initialize a MovePicker object for the current position, and prepare
1672 // to search the moves. Because the depth is <= 0 here, only captures,
1673 // queen promotions and checks (only if depth == 0 or depth == -OnePly
1674 // and we are near beta) will be generated.
1675 MovePicker mp = MovePicker(pos, ttMove, deepChecks ? Depth(0) : depth, H);
1677 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1678 futilityBase = staticValue + FutilityMarginQS + ei.futilityMargin[pos.side_to_move()];
1680 // Loop through the moves until no moves remain or a beta cutoff occurs
1681 while ( alpha < beta
1682 && (move = mp.get_next_move()) != MOVE_NONE)
1684 assert(move_is_ok(move));
1686 moveIsCheck = pos.move_is_check(move, ci);
1688 // Update current move
1690 ss[ply].currentMove = move;
1698 && !move_is_promotion(move)
1699 && !pos.move_is_passed_pawn_push(move))
1701 futilityValue = futilityBase
1702 + pos.endgame_value_of_piece_on(move_to(move))
1703 + (move_is_ep(move) ? PawnValueEndgame : Value(0));
1705 if (futilityValue < alpha)
1707 if (futilityValue > bestValue)
1708 bestValue = futilityValue;
1713 // Detect blocking evasions that are candidate to be pruned
1714 evasionPrunable = isCheck
1715 && bestValue > value_mated_in(PLY_MAX)
1716 && !pos.move_is_capture(move)
1717 && pos.type_of_piece_on(move_from(move)) != KING
1718 && !pos.can_castle(pos.side_to_move());
1720 // Don't search moves with negative SEE values
1721 if ( (!isCheck || evasionPrunable)
1724 && !move_is_promotion(move)
1725 && pos.see_sign(move) < 0)
1728 // Make and search the move
1729 pos.do_move(move, st, ci, moveIsCheck);
1730 value = -qsearch(pos, ss, -beta, -alpha, depth-OnePly, ply+1, threadID);
1731 pos.undo_move(move);
1733 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1736 if (value > bestValue)
1747 // All legal moves have been searched. A special case: If we're in check
1748 // and no legal moves were found, it is checkmate.
1749 if (!moveCount && isCheck) // Mate!
1750 return value_mated_in(ply);
1752 // Update transposition table
1753 Depth d = (depth == Depth(0) ? Depth(0) : Depth(-1));
1754 if (bestValue <= oldAlpha)
1756 // If bestValue isn't changed it means it is still the static evaluation
1757 // of the node, so keep this info to avoid a future evaluation() call.
1758 ValueType type = (bestValue == staticValue && !ei.futilityMargin[pos.side_to_move()] ? VALUE_TYPE_EV_UP : VALUE_TYPE_UPPER);
1759 TT.store(pos.get_key(), value_to_tt(bestValue, ply), type, d, MOVE_NONE);
1761 else if (bestValue >= beta)
1763 move = ss[ply].pv[ply];
1764 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, d, move);
1766 // Update killers only for good checking moves
1767 if (!pos.move_is_capture_or_promotion(move))
1768 update_killers(move, ss[ply]);
1771 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EXACT, d, ss[ply].pv[ply]);
1773 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1779 // sp_search() is used to search from a split point. This function is called
1780 // by each thread working at the split point. It is similar to the normal
1781 // search() function, but simpler. Because we have already probed the hash
1782 // table, done a null move search, and searched the first move before
1783 // splitting, we don't have to repeat all this work in sp_search(). We
1784 // also don't need to store anything to the hash table here: This is taken
1785 // care of after we return from the split point.
1787 void sp_search(SplitPoint* sp, int threadID) {
1789 assert(threadID >= 0 && threadID < TM.active_threads());
1790 assert(TM.active_threads() > 1);
1794 Depth ext, newDepth;
1795 Value value, futilityValueScaled;
1796 bool isCheck, moveIsCheck, captureOrPromotion, dangerous;
1798 value = -VALUE_INFINITE;
1800 Position pos(*sp->pos);
1802 SearchStack* ss = sp->sstack[threadID];
1803 isCheck = pos.is_check();
1805 // Step 10. Loop through moves
1806 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1807 lock_grab(&(sp->lock));
1809 while ( sp->bestValue < sp->beta
1810 && !TM.thread_should_stop(threadID)
1811 && (move = sp->mp->get_next_move()) != MOVE_NONE)
1813 moveCount = ++sp->moves;
1814 lock_release(&(sp->lock));
1816 assert(move_is_ok(move));
1818 moveIsCheck = pos.move_is_check(move, ci);
1819 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1821 // Step 11. Decide the new search depth
1822 ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, false, sp->mateThreat, &dangerous);
1823 newDepth = sp->depth - OnePly + ext;
1825 // Update current move
1826 ss[sp->ply].currentMove = move;
1828 // Step 12. Futility pruning
1831 && !captureOrPromotion
1832 && !move_is_castle(move))
1834 // Move count based pruning
1835 if ( moveCount >= futility_move_count(sp->depth)
1836 && ok_to_prune(pos, move, ss[sp->ply].threatMove)
1837 && sp->bestValue > value_mated_in(PLY_MAX))
1839 lock_grab(&(sp->lock));
1843 // Value based pruning
1844 Depth predictedDepth = newDepth - nonpv_reduction(sp->depth, moveCount);
1845 futilityValueScaled = ss[sp->ply].eval + futility_margin(predictedDepth, moveCount)
1846 + H.gain(pos.piece_on(move_from(move)), move_to(move)) + 45;
1848 if (futilityValueScaled < sp->beta)
1850 lock_grab(&(sp->lock));
1852 if (futilityValueScaled > sp->bestValue)
1853 sp->bestValue = futilityValueScaled;
1858 // Step 13. Make the move
1859 pos.do_move(move, st, ci, moveIsCheck);
1861 // Step 14. Reduced search
1862 // if the move fails high will be re-searched at full depth.
1863 bool doFullDepthSearch = true;
1866 && !captureOrPromotion
1867 && !move_is_castle(move)
1868 && !move_is_killer(move, ss[sp->ply]))
1870 ss[sp->ply].reduction = nonpv_reduction(sp->depth, moveCount);
1871 if (ss[sp->ply].reduction)
1873 value = -search(pos, ss, -(sp->beta-1), newDepth-ss[sp->ply].reduction, sp->ply+1, true, threadID);
1874 doFullDepthSearch = (value >= sp->beta && !TM.thread_should_stop(threadID));
1878 // Step 15. Full depth search
1879 if (doFullDepthSearch)
1881 ss[sp->ply].reduction = Depth(0);
1882 value = -search(pos, ss, -(sp->beta - 1), newDepth, sp->ply+1, true, threadID);
1885 // Step 16. Undo move
1886 pos.undo_move(move);
1888 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1890 // Step 17. Check for new best move
1891 lock_grab(&(sp->lock));
1893 if (value > sp->bestValue && !TM.thread_should_stop(threadID))
1895 sp->bestValue = value;
1896 if (sp->bestValue >= sp->beta)
1898 sp->stopRequest = true;
1899 sp_update_pv(sp->parentSstack, ss, sp->ply);
1904 /* Here we have the lock still grabbed */
1906 sp->slaves[threadID] = 0;
1909 lock_release(&(sp->lock));
1913 // sp_search_pv() is used to search from a PV split point. This function
1914 // is called by each thread working at the split point. It is similar to
1915 // the normal search_pv() function, but simpler. Because we have already
1916 // probed the hash table and searched the first move before splitting, we
1917 // don't have to repeat all this work in sp_search_pv(). We also don't
1918 // need to store anything to the hash table here: This is taken care of
1919 // after we return from the split point.
1921 void sp_search_pv(SplitPoint* sp, int threadID) {
1923 assert(threadID >= 0 && threadID < TM.active_threads());
1924 assert(TM.active_threads() > 1);
1928 Depth ext, newDepth;
1930 bool moveIsCheck, captureOrPromotion, dangerous;
1932 value = -VALUE_INFINITE;
1934 Position pos(*sp->pos);
1936 SearchStack* ss = sp->sstack[threadID];
1938 // Step 10. Loop through moves
1939 // Loop through all legal moves until no moves remain or a beta cutoff occurs
1940 lock_grab(&(sp->lock));
1942 while ( sp->alpha < sp->beta
1943 && !TM.thread_should_stop(threadID)
1944 && (move = sp->mp->get_next_move()) != MOVE_NONE)
1946 moveCount = ++sp->moves;
1947 lock_release(&(sp->lock));
1949 assert(move_is_ok(move));
1951 moveIsCheck = pos.move_is_check(move, ci);
1952 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1954 // Step 11. Decide the new search depth
1955 ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, false, sp->mateThreat, &dangerous);
1956 newDepth = sp->depth - OnePly + ext;
1958 // Update current move
1959 ss[sp->ply].currentMove = move;
1961 // Step 12. Futility pruning (is omitted in PV nodes)
1963 // Step 13. Make the move
1964 pos.do_move(move, st, ci, moveIsCheck);
1966 // Step 14. Reduced search
1967 // if the move fails high will be re-searched at full depth.
1968 bool doFullDepthSearch = true;
1971 && !captureOrPromotion
1972 && !move_is_castle(move)
1973 && !move_is_killer(move, ss[sp->ply]))
1975 ss[sp->ply].reduction = pv_reduction(sp->depth, moveCount);
1976 if (ss[sp->ply].reduction)
1978 Value localAlpha = sp->alpha;
1979 value = -search(pos, ss, -localAlpha, newDepth-ss[sp->ply].reduction, sp->ply+1, true, threadID);
1980 doFullDepthSearch = (value > localAlpha && !TM.thread_should_stop(threadID));
1984 // Step 15. Full depth search
1985 if (doFullDepthSearch)
1987 Value localAlpha = sp->alpha;
1988 ss[sp->ply].reduction = Depth(0);
1989 value = -search(pos, ss, -localAlpha, newDepth, sp->ply+1, true, threadID);
1991 if (value > localAlpha && value < sp->beta && !TM.thread_should_stop(threadID))
1993 // If another thread has failed high then sp->alpha has been increased
1994 // to be higher or equal then beta, if so, avoid to start a PV search.
1995 localAlpha = sp->alpha;
1996 if (localAlpha < sp->beta)
1997 value = -search_pv(pos, ss, -sp->beta, -localAlpha, newDepth, sp->ply+1, threadID);
2001 // Step 16. Undo move
2002 pos.undo_move(move);
2004 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
2006 // Step 17. Check for new best move
2007 lock_grab(&(sp->lock));
2009 if (value > sp->bestValue && !TM.thread_should_stop(threadID))
2011 sp->bestValue = value;
2012 if (value > sp->alpha)
2014 // Ask threads to stop before to modify sp->alpha
2015 if (value >= sp->beta)
2016 sp->stopRequest = true;
2020 sp_update_pv(sp->parentSstack, ss, sp->ply);
2021 if (value == value_mate_in(sp->ply + 1))
2022 ss[sp->ply].mateKiller = move;
2027 /* Here we have the lock still grabbed */
2029 sp->slaves[threadID] = 0;
2032 lock_release(&(sp->lock));
2036 // init_node() is called at the beginning of all the search functions
2037 // (search(), search_pv(), qsearch(), and so on) and initializes the
2038 // search stack object corresponding to the current node. Once every
2039 // NodesBetweenPolls nodes, init_node() also calls poll(), which polls
2040 // for user input and checks whether it is time to stop the search.
2042 void init_node(SearchStack ss[], int ply, int threadID) {
2044 assert(ply >= 0 && ply < PLY_MAX);
2045 assert(threadID >= 0 && threadID < TM.active_threads());
2047 TM.incrementNodeCounter(threadID);
2052 if (NodesSincePoll >= NodesBetweenPolls)
2059 ss[ply + 2].initKillers();
2063 // update_pv() is called whenever a search returns a value > alpha.
2064 // It updates the PV in the SearchStack object corresponding to the
2067 void update_pv(SearchStack ss[], int ply) {
2069 assert(ply >= 0 && ply < PLY_MAX);
2073 ss[ply].pv[ply] = ss[ply].currentMove;
2075 for (p = ply + 1; ss[ply + 1].pv[p] != MOVE_NONE; p++)
2076 ss[ply].pv[p] = ss[ply + 1].pv[p];
2078 ss[ply].pv[p] = MOVE_NONE;
2082 // sp_update_pv() is a variant of update_pv for use at split points. The
2083 // difference between the two functions is that sp_update_pv also updates
2084 // the PV at the parent node.
2086 void sp_update_pv(SearchStack* pss, SearchStack ss[], int ply) {
2088 assert(ply >= 0 && ply < PLY_MAX);
2092 ss[ply].pv[ply] = pss[ply].pv[ply] = ss[ply].currentMove;
2094 for (p = ply + 1; ss[ply + 1].pv[p] != MOVE_NONE; p++)
2095 ss[ply].pv[p] = pss[ply].pv[p] = ss[ply + 1].pv[p];
2097 ss[ply].pv[p] = pss[ply].pv[p] = MOVE_NONE;
2101 // connected_moves() tests whether two moves are 'connected' in the sense
2102 // that the first move somehow made the second move possible (for instance
2103 // if the moving piece is the same in both moves). The first move is assumed
2104 // to be the move that was made to reach the current position, while the
2105 // second move is assumed to be a move from the current position.
2107 bool connected_moves(const Position& pos, Move m1, Move m2) {
2109 Square f1, t1, f2, t2;
2112 assert(move_is_ok(m1));
2113 assert(move_is_ok(m2));
2115 if (m2 == MOVE_NONE)
2118 // Case 1: The moving piece is the same in both moves
2124 // Case 2: The destination square for m2 was vacated by m1
2130 // Case 3: Moving through the vacated square
2131 if ( piece_is_slider(pos.piece_on(f2))
2132 && bit_is_set(squares_between(f2, t2), f1))
2135 // Case 4: The destination square for m2 is defended by the moving piece in m1
2136 p = pos.piece_on(t1);
2137 if (bit_is_set(pos.attacks_from(p, t1), t2))
2140 // Case 5: Discovered check, checking piece is the piece moved in m1
2141 if ( piece_is_slider(p)
2142 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
2143 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
2145 // discovered_check_candidates() works also if the Position's side to
2146 // move is the opposite of the checking piece.
2147 Color them = opposite_color(pos.side_to_move());
2148 Bitboard dcCandidates = pos.discovered_check_candidates(them);
2150 if (bit_is_set(dcCandidates, f2))
2157 // value_is_mate() checks if the given value is a mate one
2158 // eventually compensated for the ply.
2160 bool value_is_mate(Value value) {
2162 assert(abs(value) <= VALUE_INFINITE);
2164 return value <= value_mated_in(PLY_MAX)
2165 || value >= value_mate_in(PLY_MAX);
2169 // move_is_killer() checks if the given move is among the
2170 // killer moves of that ply.
2172 bool move_is_killer(Move m, const SearchStack& ss) {
2174 const Move* k = ss.killers;
2175 for (int i = 0; i < KILLER_MAX; i++, k++)
2183 // extension() decides whether a move should be searched with normal depth,
2184 // or with extended depth. Certain classes of moves (checking moves, in
2185 // particular) are searched with bigger depth than ordinary moves and in
2186 // any case are marked as 'dangerous'. Note that also if a move is not
2187 // extended, as example because the corresponding UCI option is set to zero,
2188 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
2190 Depth extension(const Position& pos, Move m, bool pvNode, bool captureOrPromotion,
2191 bool moveIsCheck, bool singleEvasion, bool mateThreat, bool* dangerous) {
2193 assert(m != MOVE_NONE);
2195 Depth result = Depth(0);
2196 *dangerous = moveIsCheck | singleEvasion | mateThreat;
2201 result += CheckExtension[pvNode];
2204 result += SingleEvasionExtension[pvNode];
2207 result += MateThreatExtension[pvNode];
2210 if (pos.type_of_piece_on(move_from(m)) == PAWN)
2212 Color c = pos.side_to_move();
2213 if (relative_rank(c, move_to(m)) == RANK_7)
2215 result += PawnPushTo7thExtension[pvNode];
2218 if (pos.pawn_is_passed(c, move_to(m)))
2220 result += PassedPawnExtension[pvNode];
2225 if ( captureOrPromotion
2226 && pos.type_of_piece_on(move_to(m)) != PAWN
2227 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
2228 - pos.midgame_value_of_piece_on(move_to(m)) == Value(0))
2229 && !move_is_promotion(m)
2232 result += PawnEndgameExtension[pvNode];
2237 && captureOrPromotion
2238 && pos.type_of_piece_on(move_to(m)) != PAWN
2239 && pos.see_sign(m) >= 0)
2245 return Min(result, OnePly);
2249 // ok_to_do_nullmove() looks at the current position and decides whether
2250 // doing a 'null move' should be allowed. In order to avoid zugzwang
2251 // problems, null moves are not allowed when the side to move has very
2252 // little material left. Currently, the test is a bit too simple: Null
2253 // moves are avoided only when the side to move has only pawns left.
2254 // It's probably a good idea to avoid null moves in at least some more
2255 // complicated endgames, e.g. KQ vs KR. FIXME
2257 bool ok_to_do_nullmove(const Position& pos) {
2259 return pos.non_pawn_material(pos.side_to_move()) != Value(0);
2263 // ok_to_prune() tests whether it is safe to forward prune a move. Only
2264 // non-tactical moves late in the move list close to the leaves are
2265 // candidates for pruning.
2267 bool ok_to_prune(const Position& pos, Move m, Move threat) {
2269 assert(move_is_ok(m));
2270 assert(threat == MOVE_NONE || move_is_ok(threat));
2271 assert(!pos.move_is_check(m));
2272 assert(!pos.move_is_capture_or_promotion(m));
2273 assert(!pos.move_is_passed_pawn_push(m));
2275 Square mfrom, mto, tfrom, tto;
2277 // Prune if there isn't any threat move
2278 if (threat == MOVE_NONE)
2281 mfrom = move_from(m);
2283 tfrom = move_from(threat);
2284 tto = move_to(threat);
2286 // Case 1: Don't prune moves which move the threatened piece
2290 // Case 2: If the threatened piece has value less than or equal to the
2291 // value of the threatening piece, don't prune move which defend it.
2292 if ( pos.move_is_capture(threat)
2293 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
2294 || pos.type_of_piece_on(tfrom) == KING)
2295 && pos.move_attacks_square(m, tto))
2298 // Case 3: If the moving piece in the threatened move is a slider, don't
2299 // prune safe moves which block its ray.
2300 if ( piece_is_slider(pos.piece_on(tfrom))
2301 && bit_is_set(squares_between(tfrom, tto), mto)
2302 && pos.see_sign(m) >= 0)
2309 // ok_to_use_TT() returns true if a transposition table score can be used at a
2310 // given point in search. To avoid zugzwang issues TT cutoffs at the root node
2311 // of a null move verification search are not allowed if the TT value was found
2312 // by a null search, this is implemented testing allowNullmove and TT entry type.
2314 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply, bool allowNullmove) {
2316 Value v = value_from_tt(tte->value(), ply);
2318 return (allowNullmove || !(tte->type() & VALUE_TYPE_NULL))
2320 && ( tte->depth() >= depth
2321 || v >= Max(value_mate_in(PLY_MAX), beta)
2322 || v < Min(value_mated_in(PLY_MAX), beta))
2324 && ( (is_lower_bound(tte->type()) && v >= beta)
2325 || (is_upper_bound(tte->type()) && v < beta));
2329 // refine_eval() returns the transposition table score if
2330 // possible otherwise falls back on static position evaluation.
2332 Value refine_eval(const TTEntry* tte, Value defaultEval, int ply) {
2337 Value v = value_from_tt(tte->value(), ply);
2339 if ( (is_lower_bound(tte->type()) && v >= defaultEval)
2340 || (is_upper_bound(tte->type()) && v < defaultEval))
2347 // update_history() registers a good move that produced a beta-cutoff
2348 // in history and marks as failures all the other moves of that ply.
2350 void update_history(const Position& pos, Move move, Depth depth,
2351 Move movesSearched[], int moveCount) {
2355 H.success(pos.piece_on(move_from(move)), move_to(move), depth);
2357 for (int i = 0; i < moveCount - 1; i++)
2359 m = movesSearched[i];
2363 if (!pos.move_is_capture_or_promotion(m))
2364 H.failure(pos.piece_on(move_from(m)), move_to(m), depth);
2369 // update_killers() add a good move that produced a beta-cutoff
2370 // among the killer moves of that ply.
2372 void update_killers(Move m, SearchStack& ss) {
2374 if (m == ss.killers[0])
2377 for (int i = KILLER_MAX - 1; i > 0; i--)
2378 ss.killers[i] = ss.killers[i - 1];
2384 // update_gains() updates the gains table of a non-capture move given
2385 // the static position evaluation before and after the move.
2387 void update_gains(const Position& pos, Move m, Value before, Value after) {
2390 && before != VALUE_NONE
2391 && after != VALUE_NONE
2392 && pos.captured_piece() == NO_PIECE_TYPE
2393 && !move_is_castle(m)
2394 && !move_is_promotion(m))
2395 H.set_gain(pos.piece_on(move_to(m)), move_to(m), -(before + after));
2399 // current_search_time() returns the number of milliseconds which have passed
2400 // since the beginning of the current search.
2402 int current_search_time() {
2404 return get_system_time() - SearchStartTime;
2408 // nps() computes the current nodes/second count.
2412 int t = current_search_time();
2413 return (t > 0 ? int((TM.nodes_searched() * 1000) / t) : 0);
2417 // poll() performs two different functions: It polls for user input, and it
2418 // looks at the time consumed so far and decides if it's time to abort the
2423 static int lastInfoTime;
2424 int t = current_search_time();
2429 // We are line oriented, don't read single chars
2430 std::string command;
2432 if (!std::getline(std::cin, command))
2435 if (command == "quit")
2438 PonderSearch = false;
2442 else if (command == "stop")
2445 PonderSearch = false;
2447 else if (command == "ponderhit")
2451 // Print search information
2455 else if (lastInfoTime > t)
2456 // HACK: Must be a new search where we searched less than
2457 // NodesBetweenPolls nodes during the first second of search.
2460 else if (t - lastInfoTime >= 1000)
2467 if (dbg_show_hit_rate)
2468 dbg_print_hit_rate();
2470 cout << "info nodes " << TM.nodes_searched() << " nps " << nps()
2471 << " time " << t << " hashfull " << TT.full() << endl;
2474 // Should we stop the search?
2478 bool stillAtFirstMove = FirstRootMove
2479 && !AspirationFailLow
2480 && t > MaxSearchTime + ExtraSearchTime;
2482 bool noMoreTime = t > AbsoluteMaxSearchTime
2483 || stillAtFirstMove;
2485 if ( (Iteration >= 3 && UseTimeManagement && noMoreTime)
2486 || (ExactMaxTime && t >= ExactMaxTime)
2487 || (Iteration >= 3 && MaxNodes && TM.nodes_searched() >= MaxNodes))
2492 // ponderhit() is called when the program is pondering (i.e. thinking while
2493 // it's the opponent's turn to move) in order to let the engine know that
2494 // it correctly predicted the opponent's move.
2498 int t = current_search_time();
2499 PonderSearch = false;
2501 bool stillAtFirstMove = FirstRootMove
2502 && !AspirationFailLow
2503 && t > MaxSearchTime + ExtraSearchTime;
2505 bool noMoreTime = t > AbsoluteMaxSearchTime
2506 || stillAtFirstMove;
2508 if (Iteration >= 3 && UseTimeManagement && (noMoreTime || StopOnPonderhit))
2513 // init_ss_array() does a fast reset of the first entries of a SearchStack array
2515 void init_ss_array(SearchStack ss[]) {
2517 for (int i = 0; i < 3; i++)
2520 ss[i].initKillers();
2525 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2526 // while the program is pondering. The point is to work around a wrinkle in
2527 // the UCI protocol: When pondering, the engine is not allowed to give a
2528 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2529 // We simply wait here until one of these commands is sent, and return,
2530 // after which the bestmove and pondermove will be printed (in id_loop()).
2532 void wait_for_stop_or_ponderhit() {
2534 std::string command;
2538 if (!std::getline(std::cin, command))
2541 if (command == "quit")
2546 else if (command == "ponderhit" || command == "stop")
2552 // print_pv_info() prints to standard output and eventually to log file information on
2553 // the current PV line. It is called at each iteration or after a new pv is found.
2555 void print_pv_info(const Position& pos, SearchStack ss[], Value alpha, Value beta, Value value) {
2557 cout << "info depth " << Iteration
2558 << " score " << value_to_string(value)
2559 << ((value >= beta) ? " lowerbound" :
2560 ((value <= alpha)? " upperbound" : ""))
2561 << " time " << current_search_time()
2562 << " nodes " << TM.nodes_searched()
2566 for (int j = 0; ss[0].pv[j] != MOVE_NONE && j < PLY_MAX; j++)
2567 cout << ss[0].pv[j] << " ";
2573 ValueType type = (value >= beta ? VALUE_TYPE_LOWER
2574 : (value <= alpha ? VALUE_TYPE_UPPER : VALUE_TYPE_EXACT));
2576 LogFile << pretty_pv(pos, current_search_time(), Iteration,
2577 TM.nodes_searched(), value, type, ss[0].pv) << endl;
2582 // init_thread() is the function which is called when a new thread is
2583 // launched. It simply calls the idle_loop() function with the supplied
2584 // threadID. There are two versions of this function; one for POSIX
2585 // threads and one for Windows threads.
2587 #if !defined(_MSC_VER)
2589 void* init_thread(void *threadID) {
2591 TM.idle_loop(*(int*)threadID, NULL);
2597 DWORD WINAPI init_thread(LPVOID threadID) {
2599 TM.idle_loop(*(int*)threadID, NULL);
2606 /// The ThreadsManager class
2608 // resetNodeCounters(), resetBetaCounters(), searched_nodes() and
2609 // get_beta_counters() are getters/setters for the per thread
2610 // counters used to sort the moves at root.
2612 void ThreadsManager::resetNodeCounters() {
2614 for (int i = 0; i < MAX_THREADS; i++)
2615 threads[i].nodes = 0ULL;
2618 void ThreadsManager::resetBetaCounters() {
2620 for (int i = 0; i < MAX_THREADS; i++)
2621 threads[i].betaCutOffs[WHITE] = threads[i].betaCutOffs[BLACK] = 0ULL;
2624 int64_t ThreadsManager::nodes_searched() const {
2626 int64_t result = 0ULL;
2627 for (int i = 0; i < ActiveThreads; i++)
2628 result += threads[i].nodes;
2633 void ThreadsManager::get_beta_counters(Color us, int64_t& our, int64_t& their) const {
2636 for (int i = 0; i < MAX_THREADS; i++)
2638 our += threads[i].betaCutOffs[us];
2639 their += threads[i].betaCutOffs[opposite_color(us)];
2644 // idle_loop() is where the threads are parked when they have no work to do.
2645 // The parameter "waitSp", if non-NULL, is a pointer to an active SplitPoint
2646 // object for which the current thread is the master.
2648 void ThreadsManager::idle_loop(int threadID, SplitPoint* waitSp) {
2650 assert(threadID >= 0 && threadID < MAX_THREADS);
2654 // Slave threads can exit as soon as AllThreadsShouldExit raises,
2655 // master should exit as last one.
2656 if (AllThreadsShouldExit)
2659 threads[threadID].state = THREAD_TERMINATED;
2663 // If we are not thinking, wait for a condition to be signaled
2664 // instead of wasting CPU time polling for work.
2665 while (AllThreadsShouldSleep || threadID >= ActiveThreads)
2668 assert(threadID != 0);
2669 threads[threadID].state = THREAD_SLEEPING;
2671 #if !defined(_MSC_VER)
2672 lock_grab(&WaitLock);
2673 if (AllThreadsShouldSleep || threadID >= ActiveThreads)
2674 pthread_cond_wait(&WaitCond, &WaitLock);
2675 lock_release(&WaitLock);
2677 WaitForSingleObject(SitIdleEvent[threadID], INFINITE);
2681 // If thread has just woken up, mark it as available
2682 if (threads[threadID].state == THREAD_SLEEPING)
2683 threads[threadID].state = THREAD_AVAILABLE;
2685 // If this thread has been assigned work, launch a search
2686 if (threads[threadID].state == THREAD_WORKISWAITING)
2688 assert(!AllThreadsShouldExit && !AllThreadsShouldSleep);
2690 threads[threadID].state = THREAD_SEARCHING;
2692 if (threads[threadID].splitPoint->pvNode)
2693 sp_search_pv(threads[threadID].splitPoint, threadID);
2695 sp_search(threads[threadID].splitPoint, threadID);
2697 assert(threads[threadID].state == THREAD_SEARCHING);
2699 threads[threadID].state = THREAD_AVAILABLE;
2702 // If this thread is the master of a split point and all threads have
2703 // finished their work at this split point, return from the idle loop.
2704 if (waitSp != NULL && waitSp->cpus == 0)
2706 assert(threads[threadID].state == THREAD_AVAILABLE);
2708 threads[threadID].state = THREAD_SEARCHING;
2715 // init_threads() is called during startup. It launches all helper threads,
2716 // and initializes the split point stack and the global locks and condition
2719 void ThreadsManager::init_threads() {
2724 #if !defined(_MSC_VER)
2725 pthread_t pthread[1];
2728 // Initialize global locks
2729 lock_init(&MPLock, NULL);
2730 lock_init(&WaitLock, NULL);
2732 #if !defined(_MSC_VER)
2733 pthread_cond_init(&WaitCond, NULL);
2735 for (i = 0; i < MAX_THREADS; i++)
2736 SitIdleEvent[i] = CreateEvent(0, FALSE, FALSE, 0);
2739 // Initialize SplitPointStack locks
2740 for (i = 0; i < MAX_THREADS; i++)
2741 for (int j = 0; j < ACTIVE_SPLIT_POINTS_MAX; j++)
2743 SplitPointStack[i][j].parent = NULL;
2744 lock_init(&(SplitPointStack[i][j].lock), NULL);
2747 // Will be set just before program exits to properly end the threads
2748 AllThreadsShouldExit = false;
2750 // Threads will be put to sleep as soon as created
2751 AllThreadsShouldSleep = true;
2753 // All threads except the main thread should be initialized to THREAD_AVAILABLE
2755 threads[0].state = THREAD_SEARCHING;
2756 for (i = 1; i < MAX_THREADS; i++)
2757 threads[i].state = THREAD_AVAILABLE;
2759 // Launch the helper threads
2760 for (i = 1; i < MAX_THREADS; i++)
2763 #if !defined(_MSC_VER)
2764 ok = (pthread_create(pthread, NULL, init_thread, (void*)(&i)) == 0);
2766 ok = (CreateThread(NULL, 0, init_thread, (LPVOID)(&i), 0, NULL) != NULL);
2771 cout << "Failed to create thread number " << i << endl;
2772 Application::exit_with_failure();
2775 // Wait until the thread has finished launching and is gone to sleep
2776 while (threads[i].state != THREAD_SLEEPING) {}
2781 // exit_threads() is called when the program exits. It makes all the
2782 // helper threads exit cleanly.
2784 void ThreadsManager::exit_threads() {
2786 ActiveThreads = MAX_THREADS; // HACK
2787 AllThreadsShouldSleep = true; // HACK
2788 wake_sleeping_threads();
2790 // This makes the threads to exit idle_loop()
2791 AllThreadsShouldExit = true;
2793 // Wait for thread termination
2794 for (int i = 1; i < MAX_THREADS; i++)
2795 while (threads[i].state != THREAD_TERMINATED);
2797 // Now we can safely destroy the locks
2798 for (int i = 0; i < MAX_THREADS; i++)
2799 for (int j = 0; j < ACTIVE_SPLIT_POINTS_MAX; j++)
2800 lock_destroy(&(SplitPointStack[i][j].lock));
2802 lock_destroy(&WaitLock);
2803 lock_destroy(&MPLock);
2807 // thread_should_stop() checks whether the thread should stop its search.
2808 // This can happen if a beta cutoff has occurred in the thread's currently
2809 // active split point, or in some ancestor of the current split point.
2811 bool ThreadsManager::thread_should_stop(int threadID) const {
2813 assert(threadID >= 0 && threadID < ActiveThreads);
2817 for (sp = threads[threadID].splitPoint; sp && !sp->stopRequest; sp = sp->parent) {}
2822 // thread_is_available() checks whether the thread with threadID "slave" is
2823 // available to help the thread with threadID "master" at a split point. An
2824 // obvious requirement is that "slave" must be idle. With more than two
2825 // threads, this is not by itself sufficient: If "slave" is the master of
2826 // some active split point, it is only available as a slave to the other
2827 // threads which are busy searching the split point at the top of "slave"'s
2828 // split point stack (the "helpful master concept" in YBWC terminology).
2830 bool ThreadsManager::thread_is_available(int slave, int master) const {
2832 assert(slave >= 0 && slave < ActiveThreads);
2833 assert(master >= 0 && master < ActiveThreads);
2834 assert(ActiveThreads > 1);
2836 if (threads[slave].state != THREAD_AVAILABLE || slave == master)
2839 // Make a local copy to be sure doesn't change under our feet
2840 int localActiveSplitPoints = threads[slave].activeSplitPoints;
2842 if (localActiveSplitPoints == 0)
2843 // No active split points means that the thread is available as
2844 // a slave for any other thread.
2847 if (ActiveThreads == 2)
2850 // Apply the "helpful master" concept if possible. Use localActiveSplitPoints
2851 // that is known to be > 0, instead of threads[slave].activeSplitPoints that
2852 // could have been set to 0 by another thread leading to an out of bound access.
2853 if (SplitPointStack[slave][localActiveSplitPoints - 1].slaves[master])
2860 // available_thread_exists() tries to find an idle thread which is available as
2861 // a slave for the thread with threadID "master".
2863 bool ThreadsManager::available_thread_exists(int master) const {
2865 assert(master >= 0 && master < ActiveThreads);
2866 assert(ActiveThreads > 1);
2868 for (int i = 0; i < ActiveThreads; i++)
2869 if (thread_is_available(i, master))
2876 // split() does the actual work of distributing the work at a node between
2877 // several threads at PV nodes. If it does not succeed in splitting the
2878 // node (because no idle threads are available, or because we have no unused
2879 // split point objects), the function immediately returns false. If
2880 // splitting is possible, a SplitPoint object is initialized with all the
2881 // data that must be copied to the helper threads (the current position and
2882 // search stack, alpha, beta, the search depth, etc.), and we tell our
2883 // helper threads that they have been assigned work. This will cause them
2884 // to instantly leave their idle loops and call sp_search_pv(). When all
2885 // threads have returned from sp_search_pv (or, equivalently, when
2886 // splitPoint->cpus becomes 0), split() returns true.
2888 bool ThreadsManager::split(const Position& p, SearchStack* sstck, int ply,
2889 Value* alpha, const Value beta, Value* bestValue,
2890 Depth depth, bool mateThreat, int* moves, MovePicker* mp, int master, bool pvNode) {
2893 assert(sstck != NULL);
2894 assert(ply >= 0 && ply < PLY_MAX);
2895 assert(*bestValue >= -VALUE_INFINITE);
2896 assert( ( pvNode && *bestValue <= *alpha)
2897 || (!pvNode && *bestValue < beta ));
2898 assert(!pvNode || *alpha < beta);
2899 assert(beta <= VALUE_INFINITE);
2900 assert(depth > Depth(0));
2901 assert(master >= 0 && master < ActiveThreads);
2902 assert(ActiveThreads > 1);
2904 SplitPoint* splitPoint;
2908 // If no other thread is available to help us, or if we have too many
2909 // active split points, don't split.
2910 if ( !available_thread_exists(master)
2911 || threads[master].activeSplitPoints >= ACTIVE_SPLIT_POINTS_MAX)
2913 lock_release(&MPLock);
2917 // Pick the next available split point object from the split point stack
2918 splitPoint = &SplitPointStack[master][threads[master].activeSplitPoints];
2920 // Initialize the split point object
2921 splitPoint->parent = threads[master].splitPoint;
2922 splitPoint->stopRequest = false;
2923 splitPoint->ply = ply;
2924 splitPoint->depth = depth;
2925 splitPoint->mateThreat = mateThreat;
2926 splitPoint->alpha = pvNode ? *alpha : beta - 1;
2927 splitPoint->beta = beta;
2928 splitPoint->pvNode = pvNode;
2929 splitPoint->bestValue = *bestValue;
2930 splitPoint->master = master;
2931 splitPoint->mp = mp;
2932 splitPoint->moves = *moves;
2933 splitPoint->cpus = 1;
2934 splitPoint->pos = &p;
2935 splitPoint->parentSstack = sstck;
2936 for (int i = 0; i < ActiveThreads; i++)
2937 splitPoint->slaves[i] = 0;
2939 threads[master].splitPoint = splitPoint;
2940 threads[master].activeSplitPoints++;
2942 // If we are here it means we are not available
2943 assert(threads[master].state != THREAD_AVAILABLE);
2945 // Allocate available threads setting state to THREAD_BOOKED
2946 for (int i = 0; i < ActiveThreads && splitPoint->cpus < MaxThreadsPerSplitPoint; i++)
2947 if (thread_is_available(i, master))
2949 threads[i].state = THREAD_BOOKED;
2950 threads[i].splitPoint = splitPoint;
2951 splitPoint->slaves[i] = 1;
2955 assert(splitPoint->cpus > 1);
2957 // We can release the lock because slave threads are already booked and master is not available
2958 lock_release(&MPLock);
2960 // Tell the threads that they have work to do. This will make them leave
2961 // their idle loop. But before copy search stack tail for each thread.
2962 for (int i = 0; i < ActiveThreads; i++)
2963 if (i == master || splitPoint->slaves[i])
2965 memcpy(splitPoint->sstack[i] + ply - 1, sstck + ply - 1, 4 * sizeof(SearchStack));
2967 assert(i == master || threads[i].state == THREAD_BOOKED);
2969 threads[i].state = THREAD_WORKISWAITING; // This makes the slave to exit from idle_loop()
2972 // Everything is set up. The master thread enters the idle loop, from
2973 // which it will instantly launch a search, because its state is
2974 // THREAD_WORKISWAITING. We send the split point as a second parameter to the
2975 // idle loop, which means that the main thread will return from the idle
2976 // loop when all threads have finished their work at this split point
2977 // (i.e. when splitPoint->cpus == 0).
2978 idle_loop(master, splitPoint);
2980 // We have returned from the idle loop, which means that all threads are
2981 // finished. Update alpha, beta and bestValue, and return.
2985 *alpha = splitPoint->alpha;
2987 *bestValue = splitPoint->bestValue;
2988 threads[master].activeSplitPoints--;
2989 threads[master].splitPoint = splitPoint->parent;
2991 lock_release(&MPLock);
2996 // wake_sleeping_threads() wakes up all sleeping threads when it is time
2997 // to start a new search from the root.
2999 void ThreadsManager::wake_sleeping_threads() {
3001 assert(AllThreadsShouldSleep);
3002 assert(ActiveThreads > 0);
3004 AllThreadsShouldSleep = false;
3006 if (ActiveThreads == 1)
3009 #if !defined(_MSC_VER)
3010 pthread_mutex_lock(&WaitLock);
3011 pthread_cond_broadcast(&WaitCond);
3012 pthread_mutex_unlock(&WaitLock);
3014 for (int i = 1; i < MAX_THREADS; i++)
3015 SetEvent(SitIdleEvent[i]);
3021 // put_threads_to_sleep() makes all the threads go to sleep just before
3022 // to leave think(), at the end of the search. Threads should have already
3023 // finished the job and should be idle.
3025 void ThreadsManager::put_threads_to_sleep() {
3027 assert(!AllThreadsShouldSleep);
3029 // This makes the threads to go to sleep
3030 AllThreadsShouldSleep = true;
3033 /// The RootMoveList class
3035 // RootMoveList c'tor
3037 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) : count(0) {
3039 SearchStack ss[PLY_MAX_PLUS_2];
3040 MoveStack mlist[MaxRootMoves];
3042 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
3044 // Generate all legal moves
3045 MoveStack* last = generate_moves(pos, mlist);
3047 // Add each move to the moves[] array
3048 for (MoveStack* cur = mlist; cur != last; cur++)
3050 bool includeMove = includeAllMoves;
3052 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
3053 includeMove = (searchMoves[k] == cur->move);
3058 // Find a quick score for the move
3060 pos.do_move(cur->move, st);
3061 moves[count].move = cur->move;
3062 moves[count].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE, Depth(0), 1, 0);
3063 moves[count].pv[0] = cur->move;
3064 moves[count].pv[1] = MOVE_NONE;
3065 pos.undo_move(cur->move);
3072 // RootMoveList simple methods definitions
3074 void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) {
3076 moves[moveNum].nodes = nodes;
3077 moves[moveNum].cumulativeNodes += nodes;
3080 void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) {
3082 moves[moveNum].ourBeta = our;
3083 moves[moveNum].theirBeta = their;
3086 void RootMoveList::set_move_pv(int moveNum, const Move pv[]) {
3090 for (j = 0; pv[j] != MOVE_NONE; j++)
3091 moves[moveNum].pv[j] = pv[j];
3093 moves[moveNum].pv[j] = MOVE_NONE;
3097 // RootMoveList::sort() sorts the root move list at the beginning of a new
3100 void RootMoveList::sort() {
3102 sort_multipv(count - 1); // Sort all items
3106 // RootMoveList::sort_multipv() sorts the first few moves in the root move
3107 // list by their scores and depths. It is used to order the different PVs
3108 // correctly in MultiPV mode.
3110 void RootMoveList::sort_multipv(int n) {
3114 for (i = 1; i <= n; i++)
3116 RootMove rm = moves[i];
3117 for (j = i; j > 0 && moves[j - 1] < rm; j--)
3118 moves[j] = moves[j - 1];