2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2009 Marco Costalba
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
42 #include "ucioption.h"
46 //// Local definitions
53 // IterationInfoType stores search results for each iteration
55 // Because we use relatively small (dynamic) aspiration window,
56 // there happens many fail highs and fail lows in root. And
57 // because we don't do researches in those cases, "value" stored
58 // here is not necessarily exact. Instead in case of fail high/low
59 // we guess what the right value might be and store our guess
60 // as a "speculated value" and then move on. Speculated values are
61 // used just to calculate aspiration window width, so also if are
62 // not exact is not big a problem.
64 struct IterationInfoType {
66 IterationInfoType(Value v = Value(0), Value sv = Value(0))
67 : value(v), speculatedValue(sv) {}
69 Value value, speculatedValue;
73 // The BetaCounterType class is used to order moves at ply one.
74 // Apart for the first one that has its score, following moves
75 // normally have score -VALUE_INFINITE, so are ordered according
76 // to the number of beta cutoffs occurred under their subtree during
77 // the last iteration. The counters are per thread variables to avoid
78 // concurrent accessing under SMP case.
80 struct BetaCounterType {
84 void add(Color us, Depth d, int threadID);
85 void read(Color us, int64_t& our, int64_t& their);
89 // The RootMove class is used for moves at the root at the tree. For each
90 // root move, we store a score, a node count, and a PV (really a refutation
91 // in the case of moves which fail low).
96 bool operator<(const RootMove&); // used to sort
100 int64_t nodes, cumulativeNodes;
101 Move pv[PLY_MAX_PLUS_2];
102 int64_t ourBeta, theirBeta;
106 // The RootMoveList class is essentially an array of RootMove objects, with
107 // a handful of methods for accessing the data in the individual moves.
112 RootMoveList(Position& pos, Move searchMoves[]);
113 inline Move get_move(int moveNum) const;
114 inline Value get_move_score(int moveNum) const;
115 inline void set_move_score(int moveNum, Value score);
116 inline void set_move_nodes(int moveNum, int64_t nodes);
117 inline void set_beta_counters(int moveNum, int64_t our, int64_t their);
118 void set_move_pv(int moveNum, const Move pv[]);
119 inline Move get_move_pv(int moveNum, int i) const;
120 inline int64_t get_move_cumulative_nodes(int moveNum) const;
121 inline int move_count() const;
122 Move scan_for_easy_move() const;
124 void sort_multipv(int n);
127 static const int MaxRootMoves = 500;
128 RootMove moves[MaxRootMoves];
135 // Search depth at iteration 1
136 const Depth InitialDepth = OnePly /*+ OnePly/2*/;
138 // Depth limit for selective search
139 const Depth SelectiveDepth = 7 * OnePly;
141 // Use internal iterative deepening?
142 const bool UseIIDAtPVNodes = true;
143 const bool UseIIDAtNonPVNodes = false;
145 // Internal iterative deepening margin. At Non-PV moves, when
146 // UseIIDAtNonPVNodes is true, we do an internal iterative deepening
147 // search when the static evaluation is at most IIDMargin below beta.
148 const Value IIDMargin = Value(0x100);
150 // Easy move margin. An easy move candidate must be at least this much
151 // better than the second best move.
152 const Value EasyMoveMargin = Value(0x200);
154 // Problem margin. If the score of the first move at iteration N+1 has
155 // dropped by more than this since iteration N, the boolean variable
156 // "Problem" is set to true, which will make the program spend some extra
157 // time looking for a better move.
158 const Value ProblemMargin = Value(0x28);
160 // No problem margin. If the boolean "Problem" is true, and a new move
161 // is found at the root which is less than NoProblemMargin worse than the
162 // best move from the previous iteration, Problem is set back to false.
163 const Value NoProblemMargin = Value(0x14);
165 // Null move margin. A null move search will not be done if the approximate
166 // evaluation of the position is more than NullMoveMargin below beta.
167 const Value NullMoveMargin = Value(0x300);
169 // Pruning criterions. See the code and comments in ok_to_prune() to
170 // understand their precise meaning.
171 const bool PruneEscapeMoves = false;
172 const bool PruneDefendingMoves = false;
173 const bool PruneBlockingMoves = false;
175 // Margins for futility pruning in the quiescence search, and at frontier
176 // and near frontier nodes.
177 const Value FutilityMarginQS = Value(0x80);
179 // Remaining depth: 1 ply 1.5 ply 2 ply 2.5 ply 3 ply 3.5 ply
180 const Value FutilityMargins[12] = { Value(0x100), Value(0x120), Value(0x200), Value(0x220), Value(0x250), Value(0x270),
181 // 4 ply 4.5 ply 5 ply 5.5 ply 6 ply 6.5 ply
182 Value(0x2A0), Value(0x2C0), Value(0x340), Value(0x360), Value(0x3A0), Value(0x3C0) };
184 const Depth RazorDepth = 4*OnePly;
186 // Remaining depth: 1 ply 1.5 ply 2 ply 2.5 ply 3 ply 3.5 ply
187 const Value RazorMargins[6] = { Value(0x180), Value(0x300), Value(0x300), Value(0x3C0), Value(0x3C0), Value(0x3C0) };
189 // Remaining depth: 1 ply 1.5 ply 2 ply 2.5 ply 3 ply 3.5 ply
190 const Value RazorApprMargins[6] = { Value(0x520), Value(0x300), Value(0x300), Value(0x300), Value(0x300), Value(0x300) };
193 /// Variables initialized by UCI options
195 // Minimum number of full depth (i.e. non-reduced) moves at PV and non-PV nodes
196 int LMRPVMoves, LMRNonPVMoves; // heavy SMP read access for the latter
198 // Depth limit for use of dynamic threat detection
199 Depth ThreatDepth; // heavy SMP read access
201 // Last seconds noise filtering (LSN)
202 const bool UseLSNFiltering = true;
203 const int LSNTime = 4000; // In milliseconds
204 const Value LSNValue = value_from_centipawns(200);
205 bool loseOnTime = false;
207 // Extensions. Array index 0 is used at non-PV nodes, index 1 at PV nodes.
208 // There is heavy SMP read access on these arrays
209 Depth CheckExtension[2], SingleReplyExtension[2], PawnPushTo7thExtension[2];
210 Depth PassedPawnExtension[2], PawnEndgameExtension[2], MateThreatExtension[2];
212 // Iteration counters
214 BetaCounterType BetaCounter; // has per-thread internal data
216 // Scores and number of times the best move changed for each iteration
217 IterationInfoType IterationInfo[PLY_MAX_PLUS_2];
218 int BestMoveChangesByIteration[PLY_MAX_PLUS_2];
223 // Time managment variables
225 int MaxNodes, MaxDepth;
226 int MaxSearchTime, AbsoluteMaxSearchTime, ExtraSearchTime, ExactMaxTime;
230 bool StopOnPonderhit;
231 bool AbortSearch; // heavy SMP read access
237 // Show current line?
238 bool ShowCurrentLine;
242 std::ofstream LogFile;
244 // MP related variables
245 int ActiveThreads = 1;
246 Depth MinimumSplitDepth;
247 int MaxThreadsPerSplitPoint;
248 Thread Threads[THREAD_MAX];
251 bool AllThreadsShouldExit = false;
252 const int MaxActiveSplitPoints = 8;
253 SplitPoint SplitPointStack[THREAD_MAX][MaxActiveSplitPoints];
256 #if !defined(_MSC_VER)
257 pthread_cond_t WaitCond;
258 pthread_mutex_t WaitLock;
260 HANDLE SitIdleEvent[THREAD_MAX];
263 // Node counters, used only by thread[0] but try to keep in different
264 // cache lines (64 bytes each) from the heavy SMP read accessed variables.
266 int NodesBetweenPolls = 30000;
274 Value id_loop(const Position& pos, Move searchMoves[]);
275 Value root_search(Position& pos, SearchStack ss[], RootMoveList& rml, Value alpha, Value beta);
276 Value search_pv(Position& pos, SearchStack ss[], Value alpha, Value beta, Depth depth, int ply, int threadID);
277 Value search(Position& pos, SearchStack ss[], Value beta, Depth depth, int ply, bool allowNullmove, int threadID);
278 Value qsearch(Position& pos, SearchStack ss[], Value alpha, Value beta, Depth depth, int ply, int threadID);
279 void sp_search(SplitPoint* sp, int threadID);
280 void sp_search_pv(SplitPoint* sp, int threadID);
281 void init_node(SearchStack ss[], int ply, int threadID);
282 void update_pv(SearchStack ss[], int ply);
283 void sp_update_pv(SearchStack* pss, SearchStack ss[], int ply);
284 bool connected_moves(const Position& pos, Move m1, Move m2);
285 bool value_is_mate(Value value);
286 bool move_is_killer(Move m, const SearchStack& ss);
287 Depth extension(const Position& pos, Move m, bool pvNode, bool capture, bool check, bool singleReply, bool mateThreat, bool* dangerous);
288 bool ok_to_do_nullmove(const Position& pos);
289 bool ok_to_prune(const Position& pos, Move m, Move threat, Depth d);
290 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply);
291 void update_history(const Position& pos, Move m, Depth depth, Move movesSearched[], int moveCount);
292 void update_killers(Move m, SearchStack& ss);
294 bool fail_high_ply_1();
295 int current_search_time();
299 void print_current_line(SearchStack ss[], int ply, int threadID);
300 void wait_for_stop_or_ponderhit();
301 void init_ss_array(SearchStack ss[]);
303 void idle_loop(int threadID, SplitPoint* waitSp);
304 void init_split_point_stack();
305 void destroy_split_point_stack();
306 bool thread_should_stop(int threadID);
307 bool thread_is_available(int slave, int master);
308 bool idle_thread_exists(int master);
309 bool split(const Position& pos, SearchStack* ss, int ply,
310 Value *alpha, Value *beta, Value *bestValue,
311 const Value futilityValue, const Value approximateValue,
312 Depth depth, int *moves,
313 MovePicker *mp, int master, bool pvNode);
314 void wake_sleeping_threads();
316 #if !defined(_MSC_VER)
317 void *init_thread(void *threadID);
319 DWORD WINAPI init_thread(LPVOID threadID);
330 /// perft() is our utility to verify move generation is bug free. All the
331 /// legal moves up to given depth are generated and counted and the sum returned.
333 int perft(Position& pos, Depth depth)
337 MovePicker mp = MovePicker(pos, MOVE_NONE, depth, H);
339 // If we are at the last ply we don't need to do and undo
340 // the moves, just to count them.
341 if (depth <= OnePly) // Replace with '<' to test also qsearch
343 while (mp.get_next_move()) sum++;
347 // Loop through all legal moves
349 while ((move = mp.get_next_move()) != MOVE_NONE)
352 pos.do_move(move, st, ci, pos.move_is_check(move, ci));
353 sum += perft(pos, depth - OnePly);
360 /// think() is the external interface to Stockfish's search, and is called when
361 /// the program receives the UCI 'go' command. It initializes various
362 /// search-related global variables, and calls root_search(). It returns false
363 /// when a quit command is received during the search.
365 bool think(const Position& pos, bool infinite, bool ponder, int side_to_move,
366 int time[], int increment[], int movesToGo, int maxDepth,
367 int maxNodes, int maxTime, Move searchMoves[]) {
369 // Look for a book move
370 if (!infinite && !ponder && get_option_value_bool("OwnBook"))
373 if (get_option_value_string("Book File") != OpeningBook.file_name())
374 OpeningBook.open("book.bin");
376 bookMove = OpeningBook.get_move(pos);
377 if (bookMove != MOVE_NONE)
379 std::cout << "bestmove " << bookMove << std::endl;
384 // Initialize global search variables
386 SearchStartTime = get_system_time();
387 for (int i = 0; i < THREAD_MAX; i++)
389 Threads[i].nodes = 0ULL;
390 Threads[i].failHighPly1 = false;
393 InfiniteSearch = infinite;
394 PonderSearch = ponder;
395 StopOnPonderhit = false;
401 ExactMaxTime = maxTime;
403 // Read UCI option values
404 TT.set_size(get_option_value_int("Hash"));
405 if (button_was_pressed("Clear Hash"))
408 loseOnTime = false; // reset at the beginning of a new game
411 bool PonderingEnabled = get_option_value_bool("Ponder");
412 MultiPV = get_option_value_int("MultiPV");
414 CheckExtension[1] = Depth(get_option_value_int("Check Extension (PV nodes)"));
415 CheckExtension[0] = Depth(get_option_value_int("Check Extension (non-PV nodes)"));
417 SingleReplyExtension[1] = Depth(get_option_value_int("Single Reply Extension (PV nodes)"));
418 SingleReplyExtension[0] = Depth(get_option_value_int("Single Reply Extension (non-PV nodes)"));
420 PawnPushTo7thExtension[1] = Depth(get_option_value_int("Pawn Push to 7th Extension (PV nodes)"));
421 PawnPushTo7thExtension[0] = Depth(get_option_value_int("Pawn Push to 7th Extension (non-PV nodes)"));
423 PassedPawnExtension[1] = Depth(get_option_value_int("Passed Pawn Extension (PV nodes)"));
424 PassedPawnExtension[0] = Depth(get_option_value_int("Passed Pawn Extension (non-PV nodes)"));
426 PawnEndgameExtension[1] = Depth(get_option_value_int("Pawn Endgame Extension (PV nodes)"));
427 PawnEndgameExtension[0] = Depth(get_option_value_int("Pawn Endgame Extension (non-PV nodes)"));
429 MateThreatExtension[1] = Depth(get_option_value_int("Mate Threat Extension (PV nodes)"));
430 MateThreatExtension[0] = Depth(get_option_value_int("Mate Threat Extension (non-PV nodes)"));
432 LMRPVMoves = get_option_value_int("Full Depth Moves (PV nodes)") + 1;
433 LMRNonPVMoves = get_option_value_int("Full Depth Moves (non-PV nodes)") + 1;
434 ThreatDepth = get_option_value_int("Threat Depth") * OnePly;
436 Chess960 = get_option_value_bool("UCI_Chess960");
437 ShowCurrentLine = get_option_value_bool("UCI_ShowCurrLine");
438 UseLogFile = get_option_value_bool("Use Search Log");
440 LogFile.open(get_option_value_string("Search Log Filename").c_str(), std::ios::out | std::ios::app);
442 MinimumSplitDepth = get_option_value_int("Minimum Split Depth") * OnePly;
443 MaxThreadsPerSplitPoint = get_option_value_int("Maximum Number of Threads per Split Point");
445 read_weights(pos.side_to_move());
447 // Set the number of active threads
448 int newActiveThreads = get_option_value_int("Threads");
449 if (newActiveThreads != ActiveThreads)
451 ActiveThreads = newActiveThreads;
452 init_eval(ActiveThreads);
455 // Wake up sleeping threads
456 wake_sleeping_threads();
458 for (int i = 1; i < ActiveThreads; i++)
459 assert(thread_is_available(i, 0));
462 int myTime = time[side_to_move];
463 int myIncrement = increment[side_to_move];
465 if (!movesToGo) // Sudden death time control
469 MaxSearchTime = myTime / 30 + myIncrement;
470 AbsoluteMaxSearchTime = Max(myTime / 4, myIncrement - 100);
471 } else { // Blitz game without increment
472 MaxSearchTime = myTime / 30;
473 AbsoluteMaxSearchTime = myTime / 8;
476 else // (x moves) / (y minutes)
480 MaxSearchTime = myTime / 2;
481 AbsoluteMaxSearchTime =
482 (myTime > 3000)? (myTime - 500) : ((myTime * 3) / 4);
484 MaxSearchTime = myTime / Min(movesToGo, 20);
485 AbsoluteMaxSearchTime = Min((4 * myTime) / movesToGo, myTime / 3);
489 if (PonderingEnabled)
491 MaxSearchTime += MaxSearchTime / 4;
492 MaxSearchTime = Min(MaxSearchTime, AbsoluteMaxSearchTime);
495 // Fixed depth or fixed number of nodes?
498 InfiniteSearch = true; // HACK
503 NodesBetweenPolls = Min(MaxNodes, 30000);
504 InfiniteSearch = true; // HACK
506 else if (myTime && myTime < 1000)
507 NodesBetweenPolls = 1000;
508 else if (myTime && myTime < 5000)
509 NodesBetweenPolls = 5000;
511 NodesBetweenPolls = 30000;
513 // Write information to search log file
515 LogFile << "Searching: " << pos.to_fen() << std::endl
516 << "infinite: " << infinite
517 << " ponder: " << ponder
518 << " time: " << myTime
519 << " increment: " << myIncrement
520 << " moves to go: " << movesToGo << std::endl;
523 // We're ready to start thinking. Call the iterative deepening loop function
525 // FIXME we really need to cleanup all this LSN ugliness
528 Value v = id_loop(pos, searchMoves);
529 loseOnTime = ( UseLSNFiltering
536 loseOnTime = false; // reset for next match
537 while (SearchStartTime + myTime + 1000 > get_system_time())
539 id_loop(pos, searchMoves); // to fail gracefully
550 /// init_threads() is called during startup. It launches all helper threads,
551 /// and initializes the split point stack and the global locks and condition
554 void init_threads() {
558 #if !defined(_MSC_VER)
559 pthread_t pthread[1];
562 for (i = 0; i < THREAD_MAX; i++)
563 Threads[i].activeSplitPoints = 0;
565 // Initialize global locks
566 lock_init(&MPLock, NULL);
567 lock_init(&IOLock, NULL);
569 init_split_point_stack();
571 #if !defined(_MSC_VER)
572 pthread_mutex_init(&WaitLock, NULL);
573 pthread_cond_init(&WaitCond, NULL);
575 for (i = 0; i < THREAD_MAX; i++)
576 SitIdleEvent[i] = CreateEvent(0, FALSE, FALSE, 0);
579 // All threads except the main thread should be initialized to idle state
580 for (i = 1; i < THREAD_MAX; i++)
582 Threads[i].stop = false;
583 Threads[i].workIsWaiting = false;
584 Threads[i].idle = true;
585 Threads[i].running = false;
588 // Launch the helper threads
589 for(i = 1; i < THREAD_MAX; i++)
591 #if !defined(_MSC_VER)
592 pthread_create(pthread, NULL, init_thread, (void*)(&i));
595 CreateThread(NULL, 0, init_thread, (LPVOID)(&i), 0, iID);
598 // Wait until the thread has finished launching
599 while (!Threads[i].running);
604 /// stop_threads() is called when the program exits. It makes all the
605 /// helper threads exit cleanly.
607 void stop_threads() {
609 ActiveThreads = THREAD_MAX; // HACK
610 Idle = false; // HACK
611 wake_sleeping_threads();
612 AllThreadsShouldExit = true;
613 for (int i = 1; i < THREAD_MAX; i++)
615 Threads[i].stop = true;
616 while(Threads[i].running);
618 destroy_split_point_stack();
622 /// nodes_searched() returns the total number of nodes searched so far in
623 /// the current search.
625 int64_t nodes_searched() {
627 int64_t result = 0ULL;
628 for (int i = 0; i < ActiveThreads; i++)
629 result += Threads[i].nodes;
634 // SearchStack::init() initializes a search stack. Used at the beginning of a
635 // new search from the root.
636 void SearchStack::init(int ply) {
638 pv[ply] = pv[ply + 1] = MOVE_NONE;
639 currentMove = threatMove = MOVE_NONE;
640 reduction = Depth(0);
643 void SearchStack::initKillers() {
645 mateKiller = MOVE_NONE;
646 for (int i = 0; i < KILLER_MAX; i++)
647 killers[i] = MOVE_NONE;
652 // id_loop() is the main iterative deepening loop. It calls root_search
653 // repeatedly with increasing depth until the allocated thinking time has
654 // been consumed, the user stops the search, or the maximum search depth is
657 Value id_loop(const Position& pos, Move searchMoves[]) {
660 SearchStack ss[PLY_MAX_PLUS_2];
662 // searchMoves are verified, copied, scored and sorted
663 RootMoveList rml(p, searchMoves);
665 // Print RootMoveList c'tor startup scoring to the standard output,
666 // so that we print information also for iteration 1.
667 std::cout << "info depth " << 1 << "\ninfo depth " << 1
668 << " score " << value_to_string(rml.get_move_score(0))
669 << " time " << current_search_time()
670 << " nodes " << nodes_searched()
672 << " pv " << rml.get_move(0) << "\n";
678 IterationInfo[1] = IterationInfoType(rml.get_move_score(0), rml.get_move_score(0));
681 Move EasyMove = rml.scan_for_easy_move();
683 // Iterative deepening loop
684 while (Iteration < PLY_MAX)
686 // Initialize iteration
689 BestMoveChangesByIteration[Iteration] = 0;
693 std::cout << "info depth " << Iteration << std::endl;
695 // Calculate dynamic search window based on previous iterations
698 if (MultiPV == 1 && Iteration >= 6 && abs(IterationInfo[Iteration - 1].value) < VALUE_KNOWN_WIN)
700 int prevDelta1 = IterationInfo[Iteration - 1].speculatedValue - IterationInfo[Iteration - 2].speculatedValue;
701 int prevDelta2 = IterationInfo[Iteration - 2].speculatedValue - IterationInfo[Iteration - 3].speculatedValue;
703 int delta = Max(2 * abs(prevDelta1) + abs(prevDelta2), ProblemMargin);
705 alpha = Max(IterationInfo[Iteration - 1].value - delta, -VALUE_INFINITE);
706 beta = Min(IterationInfo[Iteration - 1].value + delta, VALUE_INFINITE);
710 alpha = - VALUE_INFINITE;
711 beta = VALUE_INFINITE;
714 // Search to the current depth
715 Value value = root_search(p, ss, rml, alpha, beta);
717 // Write PV to transposition table, in case the relevant entries have
718 // been overwritten during the search.
719 TT.insert_pv(p, ss[0].pv);
722 break; // Value cannot be trusted. Break out immediately!
724 //Save info about search result
725 Value speculatedValue;
728 Value delta = value - IterationInfo[Iteration - 1].value;
735 speculatedValue = value + delta;
736 BestMoveChangesByIteration[Iteration] += 2; // Allocate more time
738 else if (value <= alpha)
740 assert(value == alpha);
744 speculatedValue = value + delta;
745 BestMoveChangesByIteration[Iteration] += 3; // Allocate more time
747 speculatedValue = value;
749 speculatedValue = Min(Max(speculatedValue, -VALUE_INFINITE), VALUE_INFINITE);
750 IterationInfo[Iteration] = IterationInfoType(value, speculatedValue);
752 // Erase the easy move if it differs from the new best move
753 if (ss[0].pv[0] != EasyMove)
754 EasyMove = MOVE_NONE;
761 bool stopSearch = false;
763 // Stop search early if there is only a single legal move
764 if (Iteration >= 6 && rml.move_count() == 1)
767 // Stop search early when the last two iterations returned a mate score
769 && abs(IterationInfo[Iteration].value) >= abs(VALUE_MATE) - 100
770 && abs(IterationInfo[Iteration-1].value) >= abs(VALUE_MATE) - 100)
773 // Stop search early if one move seems to be much better than the rest
774 int64_t nodes = nodes_searched();
778 && EasyMove == ss[0].pv[0]
779 && ( ( rml.get_move_cumulative_nodes(0) > (nodes * 85) / 100
780 && current_search_time() > MaxSearchTime / 16)
781 ||( rml.get_move_cumulative_nodes(0) > (nodes * 98) / 100
782 && current_search_time() > MaxSearchTime / 32)))
785 // Add some extra time if the best move has changed during the last two iterations
786 if (Iteration > 5 && Iteration <= 50)
787 ExtraSearchTime = BestMoveChangesByIteration[Iteration] * (MaxSearchTime / 2)
788 + BestMoveChangesByIteration[Iteration-1] * (MaxSearchTime / 3);
790 // Stop search if most of MaxSearchTime is consumed at the end of the
791 // iteration. We probably don't have enough time to search the first
792 // move at the next iteration anyway.
793 if (current_search_time() > ((MaxSearchTime + ExtraSearchTime)*80) / 128)
798 //FIXME: Implement fail-low emergency measures
802 StopOnPonderhit = true;
806 if (MaxDepth && Iteration >= MaxDepth)
812 // If we are pondering, we shouldn't print the best move before we
815 wait_for_stop_or_ponderhit();
817 // Print final search statistics
818 std::cout << "info nodes " << nodes_searched()
820 << " time " << current_search_time()
821 << " hashfull " << TT.full() << std::endl;
823 // Print the best move and the ponder move to the standard output
824 if (ss[0].pv[0] == MOVE_NONE)
826 ss[0].pv[0] = rml.get_move(0);
827 ss[0].pv[1] = MOVE_NONE;
829 std::cout << "bestmove " << ss[0].pv[0];
830 if (ss[0].pv[1] != MOVE_NONE)
831 std::cout << " ponder " << ss[0].pv[1];
833 std::cout << std::endl;
838 dbg_print_mean(LogFile);
840 if (dbg_show_hit_rate)
841 dbg_print_hit_rate(LogFile);
844 LogFile << "Nodes: " << nodes_searched() << std::endl
845 << "Nodes/second: " << nps() << std::endl
846 << "Best move: " << move_to_san(p, ss[0].pv[0]) << std::endl;
848 p.do_move(ss[0].pv[0], st);
849 LogFile << "Ponder move: " << move_to_san(p, ss[0].pv[1])
850 << std::endl << std::endl;
852 return rml.get_move_score(0);
856 // root_search() is the function which searches the root node. It is
857 // similar to search_pv except that it uses a different move ordering
858 // scheme (perhaps we should try to use this at internal PV nodes, too?)
859 // and prints some information to the standard output.
861 Value root_search(Position& pos, SearchStack ss[], RootMoveList &rml, Value alpha, Value beta) {
863 Value oldAlpha = alpha;
867 // Loop through all the moves in the root move list
868 for (int i = 0; i < rml.move_count() && !AbortSearch; i++)
872 // We failed high, invalidate and skip next moves, leave node-counters
873 // and beta-counters as they are and quickly return, we will try to do
874 // a research at the next iteration with a bigger aspiration window.
875 rml.set_move_score(i, -VALUE_INFINITE);
883 RootMoveNumber = i + 1;
886 // Remember the node count before the move is searched. The node counts
887 // are used to sort the root moves at the next iteration.
888 nodes = nodes_searched();
890 // Reset beta cut-off counters
893 // Pick the next root move, and print the move and the move number to
894 // the standard output.
895 move = ss[0].currentMove = rml.get_move(i);
896 if (current_search_time() >= 1000)
897 std::cout << "info currmove " << move
898 << " currmovenumber " << i + 1 << std::endl;
900 // Decide search depth for this move
901 bool moveIsCheck = pos.move_is_check(move);
902 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
904 ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, false, false, &dangerous);
905 newDepth = (Iteration - 2) * OnePly + ext + InitialDepth;
907 // Make the move, and search it
908 pos.do_move(move, st, ci, moveIsCheck);
912 // Aspiration window is disabled in multi-pv case
914 alpha = -VALUE_INFINITE;
916 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
917 // If the value has dropped a lot compared to the last iteration,
918 // set the boolean variable Problem to true. This variable is used
919 // for time managment: When Problem is true, we try to complete the
920 // current iteration before playing a move.
921 Problem = (Iteration >= 2 && value <= IterationInfo[Iteration-1].value - ProblemMargin);
923 if (Problem && StopOnPonderhit)
924 StopOnPonderhit = false;
928 if ( newDepth >= 3*OnePly
929 && i >= MultiPV + LMRPVMoves
931 && !captureOrPromotion
932 && !move_is_castle(move))
934 ss[0].reduction = OnePly;
935 value = -search(pos, ss, -alpha, newDepth-OnePly, 1, true, 0);
937 value = alpha + 1; // Just to trigger next condition
941 value = -search(pos, ss, -alpha, newDepth, 1, true, 0);
944 // Fail high! Set the boolean variable FailHigh to true, and
945 // re-search the move with a big window. The variable FailHigh is
946 // used for time managment: We try to avoid aborting the search
947 // prematurely during a fail high research.
949 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
956 // Finished searching the move. If AbortSearch is true, the search
957 // was aborted because the user interrupted the search or because we
958 // ran out of time. In this case, the return value of the search cannot
959 // be trusted, and we break out of the loop without updating the best
964 // Remember the node count for this move. The node counts are used to
965 // sort the root moves at the next iteration.
966 rml.set_move_nodes(i, nodes_searched() - nodes);
968 // Remember the beta-cutoff statistics
970 BetaCounter.read(pos.side_to_move(), our, their);
971 rml.set_beta_counters(i, our, their);
973 assert(value >= -VALUE_INFINITE && value <= VALUE_INFINITE);
975 if (value <= alpha && i >= MultiPV)
976 rml.set_move_score(i, -VALUE_INFINITE);
979 // PV move or new best move!
982 rml.set_move_score(i, value);
984 TT.extract_pv(pos, ss[0].pv, PLY_MAX);
985 rml.set_move_pv(i, ss[0].pv);
989 // We record how often the best move has been changed in each
990 // iteration. This information is used for time managment: When
991 // the best move changes frequently, we allocate some more time.
993 BestMoveChangesByIteration[Iteration]++;
995 // Print search information to the standard output
996 std::cout << "info depth " << Iteration
997 << " score " << value_to_string(value)
999 " lowerbound" : ((value <= alpha)? " upperbound" : ""))
1000 << " time " << current_search_time()
1001 << " nodes " << nodes_searched()
1005 for (int j = 0; ss[0].pv[j] != MOVE_NONE && j < PLY_MAX; j++)
1006 std::cout << ss[0].pv[j] << " ";
1008 std::cout << std::endl;
1011 LogFile << pretty_pv(pos, current_search_time(), Iteration, nodes_searched(), value,
1012 ((value >= beta)? VALUE_TYPE_LOWER
1013 : ((value <= alpha)? VALUE_TYPE_UPPER : VALUE_TYPE_EXACT)),
1020 // Reset the global variable Problem to false if the value isn't too
1021 // far below the final value from the last iteration.
1022 if (value > IterationInfo[Iteration - 1].value - NoProblemMargin)
1027 rml.sort_multipv(i);
1028 for (int j = 0; j < Min(MultiPV, rml.move_count()); j++)
1031 std::cout << "info multipv " << j + 1
1032 << " score " << value_to_string(rml.get_move_score(j))
1033 << " depth " << ((j <= i)? Iteration : Iteration - 1)
1034 << " time " << current_search_time()
1035 << " nodes " << nodes_searched()
1039 for (k = 0; rml.get_move_pv(j, k) != MOVE_NONE && k < PLY_MAX; k++)
1040 std::cout << rml.get_move_pv(j, k) << " ";
1042 std::cout << std::endl;
1044 alpha = rml.get_move_score(Min(i, MultiPV-1));
1046 } // New best move case
1048 assert(alpha >= oldAlpha);
1050 FailLow = (alpha == oldAlpha);
1056 // search_pv() is the main search function for PV nodes.
1058 Value search_pv(Position& pos, SearchStack ss[], Value alpha, Value beta,
1059 Depth depth, int ply, int threadID) {
1061 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1062 assert(beta > alpha && beta <= VALUE_INFINITE);
1063 assert(ply >= 0 && ply < PLY_MAX);
1064 assert(threadID >= 0 && threadID < ActiveThreads);
1066 Move movesSearched[256];
1071 Depth ext, newDepth;
1072 Value oldAlpha, value;
1073 bool isCheck, mateThreat, singleReply, moveIsCheck, captureOrPromotion, dangerous;
1075 Value bestValue = -VALUE_INFINITE;
1078 return qsearch(pos, ss, alpha, beta, Depth(0), ply, threadID);
1080 // Initialize, and make an early exit in case of an aborted search,
1081 // an instant draw, maximum ply reached, etc.
1082 init_node(ss, ply, threadID);
1084 // After init_node() that calls poll()
1085 if (AbortSearch || thread_should_stop(threadID))
1091 if (ply >= PLY_MAX - 1)
1092 return pos.is_check() ? quick_evaluate(pos) : evaluate(pos, ei, threadID);
1094 // Mate distance pruning
1096 alpha = Max(value_mated_in(ply), alpha);
1097 beta = Min(value_mate_in(ply+1), beta);
1101 // Transposition table lookup. At PV nodes, we don't use the TT for
1102 // pruning, but only for move ordering.
1103 tte = TT.retrieve(pos.get_key());
1104 ttMove = (tte ? tte->move() : MOVE_NONE);
1106 // Go with internal iterative deepening if we don't have a TT move
1107 if (UseIIDAtPVNodes && ttMove == MOVE_NONE && depth >= 5*OnePly)
1109 search_pv(pos, ss, alpha, beta, depth-2*OnePly, ply, threadID);
1110 ttMove = ss[ply].pv[ply];
1113 // Initialize a MovePicker object for the current position, and prepare
1114 // to search all moves
1115 isCheck = pos.is_check();
1116 mateThreat = pos.has_mate_threat(opposite_color(pos.side_to_move()));
1118 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
1120 // Loop through all legal moves until no moves remain or a beta cutoff
1122 while ( alpha < beta
1123 && (move = mp.get_next_move()) != MOVE_NONE
1124 && !thread_should_stop(threadID))
1126 assert(move_is_ok(move));
1128 singleReply = (isCheck && mp.number_of_evasions() == 1);
1129 moveIsCheck = pos.move_is_check(move, ci);
1130 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1132 movesSearched[moveCount++] = ss[ply].currentMove = move;
1134 // Decide the new search depth
1135 ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, singleReply, mateThreat, &dangerous);
1136 newDepth = depth - OnePly + ext;
1138 // Make and search the move
1139 pos.do_move(move, st, ci, moveIsCheck);
1141 if (moveCount == 1) // The first move in list is the PV
1142 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1145 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1146 // if the move fails high will be re-searched at full depth.
1147 if ( depth >= 3*OnePly
1148 && moveCount >= LMRPVMoves
1150 && !captureOrPromotion
1151 && !move_is_castle(move)
1152 && !move_is_killer(move, ss[ply]))
1154 ss[ply].reduction = OnePly;
1155 value = -search(pos, ss, -alpha, newDepth-OnePly, ply+1, true, threadID);
1158 value = alpha + 1; // Just to trigger next condition
1160 if (value > alpha) // Go with full depth non-pv search
1162 ss[ply].reduction = Depth(0);
1163 value = -search(pos, ss, -alpha, newDepth, ply+1, true, threadID);
1164 if (value > alpha && value < beta)
1166 // When the search fails high at ply 1 while searching the first
1167 // move at the root, set the flag failHighPly1. This is used for
1168 // time managment: We don't want to stop the search early in
1169 // such cases, because resolving the fail high at ply 1 could
1170 // result in a big drop in score at the root.
1171 if (ply == 1 && RootMoveNumber == 1)
1172 Threads[threadID].failHighPly1 = true;
1174 // A fail high occurred. Re-search at full window (pv search)
1175 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1176 Threads[threadID].failHighPly1 = false;
1180 pos.undo_move(move);
1182 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1185 if (value > bestValue)
1192 if (value == value_mate_in(ply + 1))
1193 ss[ply].mateKiller = move;
1195 // If we are at ply 1, and we are searching the first root move at
1196 // ply 0, set the 'Problem' variable if the score has dropped a lot
1197 // (from the computer's point of view) since the previous iteration.
1200 && -value <= IterationInfo[Iteration-1].value - ProblemMargin)
1205 if ( ActiveThreads > 1
1207 && depth >= MinimumSplitDepth
1209 && idle_thread_exists(threadID)
1211 && !thread_should_stop(threadID)
1212 && split(pos, ss, ply, &alpha, &beta, &bestValue, VALUE_NONE, VALUE_NONE,
1213 depth, &moveCount, &mp, threadID, true))
1217 // All legal moves have been searched. A special case: If there were
1218 // no legal moves, it must be mate or stalemate.
1220 return (isCheck ? value_mated_in(ply) : VALUE_DRAW);
1222 // If the search is not aborted, update the transposition table,
1223 // history counters, and killer moves.
1224 if (AbortSearch || thread_should_stop(threadID))
1227 if (bestValue <= oldAlpha)
1228 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1230 else if (bestValue >= beta)
1232 BetaCounter.add(pos.side_to_move(), depth, threadID);
1233 move = ss[ply].pv[ply];
1234 if (!pos.move_is_capture_or_promotion(move))
1236 update_history(pos, move, depth, movesSearched, moveCount);
1237 update_killers(move, ss[ply]);
1239 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, move);
1242 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EXACT, depth, ss[ply].pv[ply]);
1248 // search() is the search function for zero-width nodes.
1250 Value search(Position& pos, SearchStack ss[], Value beta, Depth depth,
1251 int ply, bool allowNullmove, int threadID) {
1253 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1254 assert(ply >= 0 && ply < PLY_MAX);
1255 assert(threadID >= 0 && threadID < ActiveThreads);
1257 Move movesSearched[256];
1262 Depth ext, newDepth;
1263 Value approximateEval, nullValue, value, futilityValue;
1264 bool isCheck, useFutilityPruning, singleReply, moveIsCheck, captureOrPromotion, dangerous;
1265 bool mateThreat = false;
1267 Value bestValue = -VALUE_INFINITE;
1270 return qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1272 // Initialize, and make an early exit in case of an aborted search,
1273 // an instant draw, maximum ply reached, etc.
1274 init_node(ss, ply, threadID);
1276 // After init_node() that calls poll()
1277 if (AbortSearch || thread_should_stop(threadID))
1283 if (ply >= PLY_MAX - 1)
1284 return pos.is_check() ? quick_evaluate(pos) : evaluate(pos, ei, threadID);
1286 // Mate distance pruning
1287 if (value_mated_in(ply) >= beta)
1290 if (value_mate_in(ply + 1) < beta)
1293 // Transposition table lookup
1294 tte = TT.retrieve(pos.get_key());
1295 ttMove = (tte ? tte->move() : MOVE_NONE);
1297 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1299 ss[ply].currentMove = ttMove; // can be MOVE_NONE
1300 return value_from_tt(tte->value(), ply);
1303 approximateEval = quick_evaluate(pos);
1304 isCheck = pos.is_check();
1310 && !value_is_mate(beta)
1311 && ok_to_do_nullmove(pos)
1312 && approximateEval >= beta - NullMoveMargin)
1314 ss[ply].currentMove = MOVE_NULL;
1316 pos.do_null_move(st);
1318 // Null move dynamic reduction based on depth
1319 int R = (depth >= 5 * OnePly ? 4 : 3);
1321 // Null move dynamic reduction based on value
1322 if (approximateEval - beta > PawnValueMidgame)
1325 nullValue = -search(pos, ss, -(beta-1), depth-R*OnePly, ply+1, false, threadID);
1327 pos.undo_null_move();
1329 if (nullValue >= beta)
1331 if (depth < 6 * OnePly)
1334 // Do zugzwang verification search
1335 Value v = search(pos, ss, beta, depth-5*OnePly, ply, false, threadID);
1339 // The null move failed low, which means that we may be faced with
1340 // some kind of threat. If the previous move was reduced, check if
1341 // the move that refuted the null move was somehow connected to the
1342 // move which was reduced. If a connection is found, return a fail
1343 // low score (which will cause the reduced move to fail high in the
1344 // parent node, which will trigger a re-search with full depth).
1345 if (nullValue == value_mated_in(ply + 2))
1348 ss[ply].threatMove = ss[ply + 1].currentMove;
1349 if ( depth < ThreatDepth
1350 && ss[ply - 1].reduction
1351 && connected_moves(pos, ss[ply - 1].currentMove, ss[ply].threatMove))
1355 // Null move search not allowed, try razoring
1356 else if ( !value_is_mate(beta)
1357 && depth < RazorDepth
1358 && approximateEval < beta - RazorApprMargins[int(depth) - 2]
1359 && ss[ply - 1].currentMove != MOVE_NULL
1360 && ttMove == MOVE_NONE
1361 && !pos.has_pawn_on_7th(pos.side_to_move()))
1363 Value rbeta = beta - RazorMargins[int(depth) - 2];
1364 Value v = qsearch(pos, ss, rbeta-1, rbeta, Depth(0), ply, threadID);
1369 // Go with internal iterative deepening if we don't have a TT move
1370 if (UseIIDAtNonPVNodes && ttMove == MOVE_NONE && depth >= 8*OnePly &&
1371 evaluate(pos, ei, threadID) >= beta - IIDMargin)
1373 search(pos, ss, beta, Min(depth/2, depth-2*OnePly), ply, false, threadID);
1374 ttMove = ss[ply].pv[ply];
1377 // Initialize a MovePicker object for the current position, and prepare
1378 // to search all moves.
1379 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
1381 futilityValue = VALUE_NONE;
1382 useFutilityPruning = depth < SelectiveDepth && !isCheck;
1384 // Avoid calling evaluate() if we already have the score in TT
1385 if (tte && (tte->type() & VALUE_TYPE_EVAL))
1386 futilityValue = value_from_tt(tte->value(), ply) + FutilityMargins[int(depth) - 2];
1388 // Loop through all legal moves until no moves remain or a beta cutoff
1390 while ( bestValue < beta
1391 && (move = mp.get_next_move()) != MOVE_NONE
1392 && !thread_should_stop(threadID))
1394 assert(move_is_ok(move));
1396 singleReply = (isCheck && mp.number_of_evasions() == 1);
1397 moveIsCheck = pos.move_is_check(move, ci);
1398 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1400 movesSearched[moveCount++] = ss[ply].currentMove = move;
1402 // Decide the new search depth
1403 ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, singleReply, mateThreat, &dangerous);
1404 newDepth = depth - OnePly + ext;
1407 if ( useFutilityPruning
1409 && !captureOrPromotion
1412 // History pruning. See ok_to_prune() definition
1413 if ( moveCount >= 2 + int(depth)
1414 && ok_to_prune(pos, move, ss[ply].threatMove, depth)
1415 && bestValue > value_mated_in(PLY_MAX))
1418 // Value based pruning
1419 if (approximateEval < beta)
1421 if (futilityValue == VALUE_NONE)
1422 futilityValue = evaluate(pos, ei, threadID)
1423 + FutilityMargins[int(depth) - 2];
1425 if (futilityValue < beta)
1427 if (futilityValue > bestValue)
1428 bestValue = futilityValue;
1434 // Make and search the move
1435 pos.do_move(move, st, ci, moveIsCheck);
1437 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1438 // if the move fails high will be re-searched at full depth.
1439 if ( depth >= 3*OnePly
1440 && moveCount >= LMRNonPVMoves
1442 && !captureOrPromotion
1443 && !move_is_castle(move)
1444 && !move_is_killer(move, ss[ply]))
1446 ss[ply].reduction = OnePly;
1447 value = -search(pos, ss, -(beta-1), newDepth-OnePly, ply+1, true, threadID);
1450 value = beta; // Just to trigger next condition
1452 if (value >= beta) // Go with full depth non-pv search
1454 ss[ply].reduction = Depth(0);
1455 value = -search(pos, ss, -(beta-1), newDepth, ply+1, true, threadID);
1457 pos.undo_move(move);
1459 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1462 if (value > bestValue)
1468 if (value == value_mate_in(ply + 1))
1469 ss[ply].mateKiller = move;
1473 if ( ActiveThreads > 1
1475 && depth >= MinimumSplitDepth
1477 && idle_thread_exists(threadID)
1479 && !thread_should_stop(threadID)
1480 && split(pos, ss, ply, &beta, &beta, &bestValue, futilityValue, approximateEval,
1481 depth, &moveCount, &mp, threadID, false))
1485 // All legal moves have been searched. A special case: If there were
1486 // no legal moves, it must be mate or stalemate.
1488 return (pos.is_check() ? value_mated_in(ply) : VALUE_DRAW);
1490 // If the search is not aborted, update the transposition table,
1491 // history counters, and killer moves.
1492 if (AbortSearch || thread_should_stop(threadID))
1495 if (bestValue < beta)
1496 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1499 BetaCounter.add(pos.side_to_move(), depth, threadID);
1500 move = ss[ply].pv[ply];
1501 if (!pos.move_is_capture_or_promotion(move))
1503 update_history(pos, move, depth, movesSearched, moveCount);
1504 update_killers(move, ss[ply]);
1506 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, move);
1509 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1515 // qsearch() is the quiescence search function, which is called by the main
1516 // search function when the remaining depth is zero (or, to be more precise,
1517 // less than OnePly).
1519 Value qsearch(Position& pos, SearchStack ss[], Value alpha, Value beta,
1520 Depth depth, int ply, int threadID) {
1522 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1523 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1525 assert(ply >= 0 && ply < PLY_MAX);
1526 assert(threadID >= 0 && threadID < ActiveThreads);
1531 Value staticValue, bestValue, value, futilityValue;
1532 bool isCheck, enoughMaterial, moveIsCheck;
1533 const TTEntry* tte = NULL;
1535 bool pvNode = (beta - alpha != 1);
1537 // Initialize, and make an early exit in case of an aborted search,
1538 // an instant draw, maximum ply reached, etc.
1539 init_node(ss, ply, threadID);
1541 // After init_node() that calls poll()
1542 if (AbortSearch || thread_should_stop(threadID))
1548 // Transposition table lookup, only when not in PV
1551 tte = TT.retrieve(pos.get_key());
1552 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1554 assert(tte->type() != VALUE_TYPE_EVAL);
1556 return value_from_tt(tte->value(), ply);
1559 ttMove = (tte ? tte->move() : MOVE_NONE);
1561 // Evaluate the position statically
1562 isCheck = pos.is_check();
1563 ei.futilityMargin = Value(0); // Manually initialize futilityMargin
1566 staticValue = -VALUE_INFINITE;
1568 else if (tte && (tte->type() & VALUE_TYPE_EVAL))
1570 // Use the cached evaluation score if possible
1571 assert(ei.futilityMargin == Value(0));
1573 staticValue = tte->value();
1576 staticValue = evaluate(pos, ei, threadID);
1578 if (ply >= PLY_MAX - 1)
1579 return pos.is_check() ? quick_evaluate(pos) : evaluate(pos, ei, threadID);
1581 // Initialize "stand pat score", and return it immediately if it is
1583 bestValue = staticValue;
1585 if (bestValue >= beta)
1587 // Store the score to avoid a future costly evaluation() call
1588 if (!isCheck && !tte && ei.futilityMargin == 0)
1589 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EV_LO, Depth(-127*OnePly), MOVE_NONE);
1594 if (bestValue > alpha)
1597 // Initialize a MovePicker object for the current position, and prepare
1598 // to search the moves. Because the depth is <= 0 here, only captures,
1599 // queen promotions and checks (only if depth == 0) will be generated.
1600 MovePicker mp = MovePicker(pos, ttMove, depth, H);
1602 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1604 // Loop through the moves until no moves remain or a beta cutoff
1606 while ( alpha < beta
1607 && (move = mp.get_next_move()) != MOVE_NONE)
1609 assert(move_is_ok(move));
1612 ss[ply].currentMove = move;
1614 moveIsCheck = pos.move_is_check(move, ci);
1622 && !move_is_promotion(move)
1623 && !pos.move_is_passed_pawn_push(move))
1625 futilityValue = staticValue
1626 + Max(pos.midgame_value_of_piece_on(move_to(move)),
1627 pos.endgame_value_of_piece_on(move_to(move)))
1628 + (move_is_ep(move) ? PawnValueEndgame : Value(0))
1630 + ei.futilityMargin;
1632 if (futilityValue < alpha)
1634 if (futilityValue > bestValue)
1635 bestValue = futilityValue;
1640 // Don't search captures and checks with negative SEE values
1643 && !move_is_promotion(move)
1644 && pos.see_sign(move) < 0)
1647 // Make and search the move
1648 pos.do_move(move, st, ci, moveIsCheck);
1649 value = -qsearch(pos, ss, -beta, -alpha, depth-OnePly, ply+1, threadID);
1650 pos.undo_move(move);
1652 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1655 if (value > bestValue)
1666 // All legal moves have been searched. A special case: If we're in check
1667 // and no legal moves were found, it is checkmate.
1668 if (!moveCount && pos.is_check()) // Mate!
1669 return value_mated_in(ply);
1671 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1673 // Update transposition table
1674 move = ss[ply].pv[ply];
1677 // If bestValue isn't changed it means it is still the static evaluation of
1678 // the node, so keep this info to avoid a future costly evaluation() call.
1679 ValueType type = (bestValue == staticValue && !ei.futilityMargin ? VALUE_TYPE_EV_UP : VALUE_TYPE_UPPER);
1680 Depth d = (depth == Depth(0) ? Depth(0) : Depth(-1));
1682 if (bestValue < beta)
1683 TT.store(pos.get_key(), value_to_tt(bestValue, ply), type, d, MOVE_NONE);
1685 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, d, move);
1688 // Update killers only for good check moves
1689 if (alpha >= beta && !pos.move_is_capture_or_promotion(move))
1690 update_killers(move, ss[ply]);
1696 // sp_search() is used to search from a split point. This function is called
1697 // by each thread working at the split point. It is similar to the normal
1698 // search() function, but simpler. Because we have already probed the hash
1699 // table, done a null move search, and searched the first move before
1700 // splitting, we don't have to repeat all this work in sp_search(). We
1701 // also don't need to store anything to the hash table here: This is taken
1702 // care of after we return from the split point.
1704 void sp_search(SplitPoint* sp, int threadID) {
1706 assert(threadID >= 0 && threadID < ActiveThreads);
1707 assert(ActiveThreads > 1);
1709 Position pos = Position(sp->pos);
1711 SearchStack* ss = sp->sstack[threadID];
1714 bool isCheck = pos.is_check();
1715 bool useFutilityPruning = sp->depth < SelectiveDepth
1718 while ( sp->bestValue < sp->beta
1719 && !thread_should_stop(threadID)
1720 && (move = sp->mp->get_next_move(sp->lock)) != MOVE_NONE)
1722 assert(move_is_ok(move));
1724 bool moveIsCheck = pos.move_is_check(move, ci);
1725 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
1727 lock_grab(&(sp->lock));
1728 int moveCount = ++sp->moves;
1729 lock_release(&(sp->lock));
1731 ss[sp->ply].currentMove = move;
1733 // Decide the new search depth.
1735 Depth ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, false, false, &dangerous);
1736 Depth newDepth = sp->depth - OnePly + ext;
1739 if ( useFutilityPruning
1741 && !captureOrPromotion)
1743 // History pruning. See ok_to_prune() definition
1744 if ( moveCount >= 2 + int(sp->depth)
1745 && ok_to_prune(pos, move, ss[sp->ply].threatMove, sp->depth)
1746 && sp->bestValue > value_mated_in(PLY_MAX))
1749 // Value based pruning
1750 if (sp->approximateEval < sp->beta)
1752 if (sp->futilityValue == VALUE_NONE)
1755 sp->futilityValue = evaluate(pos, ei, threadID)
1756 + FutilityMargins[int(sp->depth) - 2];
1759 if (sp->futilityValue < sp->beta)
1761 if (sp->futilityValue > sp->bestValue) // Less then 1% of cases
1763 lock_grab(&(sp->lock));
1764 if (sp->futilityValue > sp->bestValue)
1765 sp->bestValue = sp->futilityValue;
1766 lock_release(&(sp->lock));
1773 // Make and search the move.
1775 pos.do_move(move, st, ci, moveIsCheck);
1777 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1778 // if the move fails high will be re-searched at full depth.
1780 && moveCount >= LMRNonPVMoves
1781 && !captureOrPromotion
1782 && !move_is_castle(move)
1783 && !move_is_killer(move, ss[sp->ply]))
1785 ss[sp->ply].reduction = OnePly;
1786 value = -search(pos, ss, -(sp->beta-1), newDepth - OnePly, sp->ply+1, true, threadID);
1789 value = sp->beta; // Just to trigger next condition
1791 if (value >= sp->beta) // Go with full depth non-pv search
1793 ss[sp->ply].reduction = Depth(0);
1794 value = -search(pos, ss, -(sp->beta - 1), newDepth, sp->ply+1, true, threadID);
1796 pos.undo_move(move);
1798 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1800 if (thread_should_stop(threadID))
1804 if (value > sp->bestValue) // Less then 2% of cases
1806 lock_grab(&(sp->lock));
1807 if (value > sp->bestValue && !thread_should_stop(threadID))
1809 sp->bestValue = value;
1810 if (sp->bestValue >= sp->beta)
1812 sp_update_pv(sp->parentSstack, ss, sp->ply);
1813 for (int i = 0; i < ActiveThreads; i++)
1814 if (i != threadID && (i == sp->master || sp->slaves[i]))
1815 Threads[i].stop = true;
1817 sp->finished = true;
1820 lock_release(&(sp->lock));
1824 lock_grab(&(sp->lock));
1826 // If this is the master thread and we have been asked to stop because of
1827 // a beta cutoff higher up in the tree, stop all slave threads.
1828 if (sp->master == threadID && thread_should_stop(threadID))
1829 for (int i = 0; i < ActiveThreads; i++)
1831 Threads[i].stop = true;
1834 sp->slaves[threadID] = 0;
1836 lock_release(&(sp->lock));
1840 // sp_search_pv() is used to search from a PV split point. This function
1841 // is called by each thread working at the split point. It is similar to
1842 // the normal search_pv() function, but simpler. Because we have already
1843 // probed the hash table and searched the first move before splitting, we
1844 // don't have to repeat all this work in sp_search_pv(). We also don't
1845 // need to store anything to the hash table here: This is taken care of
1846 // after we return from the split point.
1848 void sp_search_pv(SplitPoint* sp, int threadID) {
1850 assert(threadID >= 0 && threadID < ActiveThreads);
1851 assert(ActiveThreads > 1);
1853 Position pos = Position(sp->pos);
1855 SearchStack* ss = sp->sstack[threadID];
1859 while ( sp->alpha < sp->beta
1860 && !thread_should_stop(threadID)
1861 && (move = sp->mp->get_next_move(sp->lock)) != MOVE_NONE)
1863 bool moveIsCheck = pos.move_is_check(move, ci);
1864 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
1866 assert(move_is_ok(move));
1868 lock_grab(&(sp->lock));
1869 int moveCount = ++sp->moves;
1870 lock_release(&(sp->lock));
1872 ss[sp->ply].currentMove = move;
1874 // Decide the new search depth.
1876 Depth ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, false, false, &dangerous);
1877 Depth newDepth = sp->depth - OnePly + ext;
1879 // Make and search the move.
1881 pos.do_move(move, st, ci, moveIsCheck);
1883 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1884 // if the move fails high will be re-searched at full depth.
1886 && moveCount >= LMRPVMoves
1887 && !captureOrPromotion
1888 && !move_is_castle(move)
1889 && !move_is_killer(move, ss[sp->ply]))
1891 ss[sp->ply].reduction = OnePly;
1892 value = -search(pos, ss, -sp->alpha, newDepth - OnePly, sp->ply+1, true, threadID);
1895 value = sp->alpha + 1; // Just to trigger next condition
1897 if (value > sp->alpha) // Go with full depth non-pv search
1899 ss[sp->ply].reduction = Depth(0);
1900 value = -search(pos, ss, -sp->alpha, newDepth, sp->ply+1, true, threadID);
1902 if (value > sp->alpha && value < sp->beta)
1904 // When the search fails high at ply 1 while searching the first
1905 // move at the root, set the flag failHighPly1. This is used for
1906 // time managment: We don't want to stop the search early in
1907 // such cases, because resolving the fail high at ply 1 could
1908 // result in a big drop in score at the root.
1909 if (sp->ply == 1 && RootMoveNumber == 1)
1910 Threads[threadID].failHighPly1 = true;
1912 value = -search_pv(pos, ss, -sp->beta, -sp->alpha, newDepth, sp->ply+1, threadID);
1913 Threads[threadID].failHighPly1 = false;
1916 pos.undo_move(move);
1918 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1920 if (thread_should_stop(threadID))
1924 lock_grab(&(sp->lock));
1925 if (value > sp->bestValue && !thread_should_stop(threadID))
1927 sp->bestValue = value;
1928 if (value > sp->alpha)
1931 sp_update_pv(sp->parentSstack, ss, sp->ply);
1932 if (value == value_mate_in(sp->ply + 1))
1933 ss[sp->ply].mateKiller = move;
1935 if (value >= sp->beta)
1937 for (int i = 0; i < ActiveThreads; i++)
1938 if (i != threadID && (i == sp->master || sp->slaves[i]))
1939 Threads[i].stop = true;
1941 sp->finished = true;
1944 // If we are at ply 1, and we are searching the first root move at
1945 // ply 0, set the 'Problem' variable if the score has dropped a lot
1946 // (from the computer's point of view) since the previous iteration.
1949 && -value <= IterationInfo[Iteration-1].value - ProblemMargin)
1952 lock_release(&(sp->lock));
1955 lock_grab(&(sp->lock));
1957 // If this is the master thread and we have been asked to stop because of
1958 // a beta cutoff higher up in the tree, stop all slave threads.
1959 if (sp->master == threadID && thread_should_stop(threadID))
1960 for (int i = 0; i < ActiveThreads; i++)
1962 Threads[i].stop = true;
1965 sp->slaves[threadID] = 0;
1967 lock_release(&(sp->lock));
1970 /// The BetaCounterType class
1972 BetaCounterType::BetaCounterType() { clear(); }
1974 void BetaCounterType::clear() {
1976 for (int i = 0; i < THREAD_MAX; i++)
1977 Threads[i].betaCutOffs[WHITE] = Threads[i].betaCutOffs[BLACK] = 0ULL;
1980 void BetaCounterType::add(Color us, Depth d, int threadID) {
1982 // Weighted count based on depth
1983 Threads[threadID].betaCutOffs[us] += unsigned(d);
1986 void BetaCounterType::read(Color us, int64_t& our, int64_t& their) {
1989 for (int i = 0; i < THREAD_MAX; i++)
1991 our += Threads[i].betaCutOffs[us];
1992 their += Threads[i].betaCutOffs[opposite_color(us)];
1997 /// The RootMove class
2001 RootMove::RootMove() {
2002 nodes = cumulativeNodes = ourBeta = theirBeta = 0ULL;
2005 // RootMove::operator<() is the comparison function used when
2006 // sorting the moves. A move m1 is considered to be better
2007 // than a move m2 if it has a higher score, or if the moves
2008 // have equal score but m1 has the higher node count.
2010 bool RootMove::operator<(const RootMove& m) {
2012 if (score != m.score)
2013 return (score < m.score);
2015 return theirBeta <= m.theirBeta;
2018 /// The RootMoveList class
2022 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) : count(0) {
2024 MoveStack mlist[MaxRootMoves];
2025 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
2027 // Generate all legal moves
2028 MoveStack* last = generate_moves(pos, mlist);
2030 // Add each move to the moves[] array
2031 for (MoveStack* cur = mlist; cur != last; cur++)
2033 bool includeMove = includeAllMoves;
2035 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
2036 includeMove = (searchMoves[k] == cur->move);
2041 // Find a quick score for the move
2043 SearchStack ss[PLY_MAX_PLUS_2];
2046 moves[count].move = cur->move;
2047 pos.do_move(moves[count].move, st);
2048 moves[count].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE, Depth(0), 1, 0);
2049 pos.undo_move(moves[count].move);
2050 moves[count].pv[0] = moves[count].move;
2051 moves[count].pv[1] = MOVE_NONE; // FIXME
2058 // Simple accessor methods for the RootMoveList class
2060 inline Move RootMoveList::get_move(int moveNum) const {
2061 return moves[moveNum].move;
2064 inline Value RootMoveList::get_move_score(int moveNum) const {
2065 return moves[moveNum].score;
2068 inline void RootMoveList::set_move_score(int moveNum, Value score) {
2069 moves[moveNum].score = score;
2072 inline void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) {
2073 moves[moveNum].nodes = nodes;
2074 moves[moveNum].cumulativeNodes += nodes;
2077 inline void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) {
2078 moves[moveNum].ourBeta = our;
2079 moves[moveNum].theirBeta = their;
2082 void RootMoveList::set_move_pv(int moveNum, const Move pv[]) {
2084 for(j = 0; pv[j] != MOVE_NONE; j++)
2085 moves[moveNum].pv[j] = pv[j];
2086 moves[moveNum].pv[j] = MOVE_NONE;
2089 inline Move RootMoveList::get_move_pv(int moveNum, int i) const {
2090 return moves[moveNum].pv[i];
2093 inline int64_t RootMoveList::get_move_cumulative_nodes(int moveNum) const {
2094 return moves[moveNum].cumulativeNodes;
2097 inline int RootMoveList::move_count() const {
2102 // RootMoveList::scan_for_easy_move() is called at the end of the first
2103 // iteration, and is used to detect an "easy move", i.e. a move which appears
2104 // to be much bester than all the rest. If an easy move is found, the move
2105 // is returned, otherwise the function returns MOVE_NONE. It is very
2106 // important that this function is called at the right moment: The code
2107 // assumes that the first iteration has been completed and the moves have
2108 // been sorted. This is done in RootMoveList c'tor.
2110 Move RootMoveList::scan_for_easy_move() const {
2117 // moves are sorted so just consider the best and the second one
2118 if (get_move_score(0) > get_move_score(1) + EasyMoveMargin)
2124 // RootMoveList::sort() sorts the root move list at the beginning of a new
2127 inline void RootMoveList::sort() {
2129 sort_multipv(count - 1); // all items
2133 // RootMoveList::sort_multipv() sorts the first few moves in the root move
2134 // list by their scores and depths. It is used to order the different PVs
2135 // correctly in MultiPV mode.
2137 void RootMoveList::sort_multipv(int n) {
2139 for (int i = 1; i <= n; i++)
2141 RootMove rm = moves[i];
2143 for (j = i; j > 0 && moves[j-1] < rm; j--)
2144 moves[j] = moves[j-1];
2150 // init_node() is called at the beginning of all the search functions
2151 // (search(), search_pv(), qsearch(), and so on) and initializes the search
2152 // stack object corresponding to the current node. Once every
2153 // NodesBetweenPolls nodes, init_node() also calls poll(), which polls
2154 // for user input and checks whether it is time to stop the search.
2156 void init_node(SearchStack ss[], int ply, int threadID) {
2158 assert(ply >= 0 && ply < PLY_MAX);
2159 assert(threadID >= 0 && threadID < ActiveThreads);
2161 Threads[threadID].nodes++;
2166 if (NodesSincePoll >= NodesBetweenPolls)
2173 ss[ply+2].initKillers();
2175 if (Threads[threadID].printCurrentLine)
2176 print_current_line(ss, ply, threadID);
2180 // update_pv() is called whenever a search returns a value > alpha. It
2181 // updates the PV in the SearchStack object corresponding to the current
2184 void update_pv(SearchStack ss[], int ply) {
2185 assert(ply >= 0 && ply < PLY_MAX);
2187 ss[ply].pv[ply] = ss[ply].currentMove;
2189 for(p = ply + 1; ss[ply+1].pv[p] != MOVE_NONE; p++)
2190 ss[ply].pv[p] = ss[ply+1].pv[p];
2191 ss[ply].pv[p] = MOVE_NONE;
2195 // sp_update_pv() is a variant of update_pv for use at split points. The
2196 // difference between the two functions is that sp_update_pv also updates
2197 // the PV at the parent node.
2199 void sp_update_pv(SearchStack* pss, SearchStack ss[], int ply) {
2200 assert(ply >= 0 && ply < PLY_MAX);
2202 ss[ply].pv[ply] = pss[ply].pv[ply] = ss[ply].currentMove;
2204 for(p = ply + 1; ss[ply+1].pv[p] != MOVE_NONE; p++)
2205 ss[ply].pv[p] = pss[ply].pv[p] = ss[ply+1].pv[p];
2206 ss[ply].pv[p] = pss[ply].pv[p] = MOVE_NONE;
2210 // connected_moves() tests whether two moves are 'connected' in the sense
2211 // that the first move somehow made the second move possible (for instance
2212 // if the moving piece is the same in both moves). The first move is
2213 // assumed to be the move that was made to reach the current position, while
2214 // the second move is assumed to be a move from the current position.
2216 bool connected_moves(const Position& pos, Move m1, Move m2) {
2218 Square f1, t1, f2, t2;
2221 assert(move_is_ok(m1));
2222 assert(move_is_ok(m2));
2224 if (m2 == MOVE_NONE)
2227 // Case 1: The moving piece is the same in both moves
2233 // Case 2: The destination square for m2 was vacated by m1
2239 // Case 3: Moving through the vacated square
2240 if ( piece_is_slider(pos.piece_on(f2))
2241 && bit_is_set(squares_between(f2, t2), f1))
2244 // Case 4: The destination square for m2 is attacked by the moving piece in m1
2245 p = pos.piece_on(t1);
2246 if (bit_is_set(pos.attacks_from(p, t1), t2))
2249 // Case 5: Discovered check, checking piece is the piece moved in m1
2250 if ( piece_is_slider(p)
2251 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
2252 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
2254 Bitboard occ = pos.occupied_squares();
2255 Color us = pos.side_to_move();
2256 Square ksq = pos.king_square(us);
2257 clear_bit(&occ, f2);
2258 if (type_of_piece(p) == BISHOP)
2260 if (bit_is_set(bishop_attacks_bb(ksq, occ), t1))
2263 else if (type_of_piece(p) == ROOK)
2265 if (bit_is_set(rook_attacks_bb(ksq, occ), t1))
2270 assert(type_of_piece(p) == QUEEN);
2271 if (bit_is_set(queen_attacks_bb(ksq, occ), t1))
2279 // value_is_mate() checks if the given value is a mate one
2280 // eventually compensated for the ply.
2282 bool value_is_mate(Value value) {
2284 assert(abs(value) <= VALUE_INFINITE);
2286 return value <= value_mated_in(PLY_MAX)
2287 || value >= value_mate_in(PLY_MAX);
2291 // move_is_killer() checks if the given move is among the
2292 // killer moves of that ply.
2294 bool move_is_killer(Move m, const SearchStack& ss) {
2296 const Move* k = ss.killers;
2297 for (int i = 0; i < KILLER_MAX; i++, k++)
2305 // extension() decides whether a move should be searched with normal depth,
2306 // or with extended depth. Certain classes of moves (checking moves, in
2307 // particular) are searched with bigger depth than ordinary moves and in
2308 // any case are marked as 'dangerous'. Note that also if a move is not
2309 // extended, as example because the corresponding UCI option is set to zero,
2310 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
2312 Depth extension(const Position& pos, Move m, bool pvNode, bool captureOrPromotion,
2313 bool check, bool singleReply, bool mateThreat, bool* dangerous) {
2315 assert(m != MOVE_NONE);
2317 Depth result = Depth(0);
2318 *dangerous = check | singleReply | mateThreat;
2323 result += CheckExtension[pvNode];
2326 result += SingleReplyExtension[pvNode];
2329 result += MateThreatExtension[pvNode];
2332 if (pos.type_of_piece_on(move_from(m)) == PAWN)
2334 Color c = pos.side_to_move();
2335 if (relative_rank(c, move_to(m)) == RANK_7)
2337 result += PawnPushTo7thExtension[pvNode];
2340 if (pos.pawn_is_passed(c, move_to(m)))
2342 result += PassedPawnExtension[pvNode];
2347 if ( captureOrPromotion
2348 && pos.type_of_piece_on(move_to(m)) != PAWN
2349 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
2350 - pos.midgame_value_of_piece_on(move_to(m)) == Value(0))
2351 && !move_is_promotion(m)
2354 result += PawnEndgameExtension[pvNode];
2359 && captureOrPromotion
2360 && pos.type_of_piece_on(move_to(m)) != PAWN
2361 && pos.see_sign(m) >= 0)
2367 return Min(result, OnePly);
2371 // ok_to_do_nullmove() looks at the current position and decides whether
2372 // doing a 'null move' should be allowed. In order to avoid zugzwang
2373 // problems, null moves are not allowed when the side to move has very
2374 // little material left. Currently, the test is a bit too simple: Null
2375 // moves are avoided only when the side to move has only pawns left. It's
2376 // probably a good idea to avoid null moves in at least some more
2377 // complicated endgames, e.g. KQ vs KR. FIXME
2379 bool ok_to_do_nullmove(const Position& pos) {
2381 return pos.non_pawn_material(pos.side_to_move()) != Value(0);
2385 // ok_to_prune() tests whether it is safe to forward prune a move. Only
2386 // non-tactical moves late in the move list close to the leaves are
2387 // candidates for pruning.
2389 bool ok_to_prune(const Position& pos, Move m, Move threat, Depth d) {
2391 assert(move_is_ok(m));
2392 assert(threat == MOVE_NONE || move_is_ok(threat));
2393 assert(!pos.move_is_check(m));
2394 assert(!pos.move_is_capture_or_promotion(m));
2395 assert(!pos.move_is_passed_pawn_push(m));
2396 assert(d >= OnePly);
2398 Square mfrom, mto, tfrom, tto;
2400 mfrom = move_from(m);
2402 tfrom = move_from(threat);
2403 tto = move_to(threat);
2405 // Case 1: Castling moves are never pruned
2406 if (move_is_castle(m))
2409 // Case 2: Don't prune moves which move the threatened piece
2410 if (!PruneEscapeMoves && threat != MOVE_NONE && mfrom == tto)
2413 // Case 3: If the threatened piece has value less than or equal to the
2414 // value of the threatening piece, don't prune move which defend it.
2415 if ( !PruneDefendingMoves
2416 && threat != MOVE_NONE
2417 && pos.move_is_capture(threat)
2418 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
2419 || pos.type_of_piece_on(tfrom) == KING)
2420 && pos.move_attacks_square(m, tto))
2423 // Case 4: Don't prune moves with good history
2424 if (!H.ok_to_prune(pos.piece_on(mfrom), mto, d))
2427 // Case 5: If the moving piece in the threatened move is a slider, don't
2428 // prune safe moves which block its ray.
2429 if ( !PruneBlockingMoves
2430 && threat != MOVE_NONE
2431 && piece_is_slider(pos.piece_on(tfrom))
2432 && bit_is_set(squares_between(tfrom, tto), mto)
2433 && pos.see_sign(m) >= 0)
2440 // ok_to_use_TT() returns true if a transposition table score
2441 // can be used at a given point in search.
2443 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
2445 Value v = value_from_tt(tte->value(), ply);
2447 return ( tte->depth() >= depth
2448 || v >= Max(value_mate_in(100), beta)
2449 || v < Min(value_mated_in(100), beta))
2451 && ( (is_lower_bound(tte->type()) && v >= beta)
2452 || (is_upper_bound(tte->type()) && v < beta));
2456 // update_history() registers a good move that produced a beta-cutoff
2457 // in history and marks as failures all the other moves of that ply.
2459 void update_history(const Position& pos, Move m, Depth depth,
2460 Move movesSearched[], int moveCount) {
2462 H.success(pos.piece_on(move_from(m)), move_to(m), depth);
2464 for (int i = 0; i < moveCount - 1; i++)
2466 assert(m != movesSearched[i]);
2467 if (!pos.move_is_capture_or_promotion(movesSearched[i]))
2468 H.failure(pos.piece_on(move_from(movesSearched[i])), move_to(movesSearched[i]));
2473 // update_killers() add a good move that produced a beta-cutoff
2474 // among the killer moves of that ply.
2476 void update_killers(Move m, SearchStack& ss) {
2478 if (m == ss.killers[0])
2481 for (int i = KILLER_MAX - 1; i > 0; i--)
2482 ss.killers[i] = ss.killers[i - 1];
2488 // fail_high_ply_1() checks if some thread is currently resolving a fail
2489 // high at ply 1 at the node below the first root node. This information
2490 // is used for time managment.
2492 bool fail_high_ply_1() {
2494 for(int i = 0; i < ActiveThreads; i++)
2495 if (Threads[i].failHighPly1)
2502 // current_search_time() returns the number of milliseconds which have passed
2503 // since the beginning of the current search.
2505 int current_search_time() {
2506 return get_system_time() - SearchStartTime;
2510 // nps() computes the current nodes/second count.
2513 int t = current_search_time();
2514 return (t > 0)? int((nodes_searched() * 1000) / t) : 0;
2518 // poll() performs two different functions: It polls for user input, and it
2519 // looks at the time consumed so far and decides if it's time to abort the
2524 static int lastInfoTime;
2525 int t = current_search_time();
2530 // We are line oriented, don't read single chars
2531 std::string command;
2532 if (!std::getline(std::cin, command))
2535 if (command == "quit")
2538 PonderSearch = false;
2542 else if (command == "stop")
2545 PonderSearch = false;
2547 else if (command == "ponderhit")
2550 // Print search information
2554 else if (lastInfoTime > t)
2555 // HACK: Must be a new search where we searched less than
2556 // NodesBetweenPolls nodes during the first second of search.
2559 else if (t - lastInfoTime >= 1000)
2566 if (dbg_show_hit_rate)
2567 dbg_print_hit_rate();
2569 std::cout << "info nodes " << nodes_searched() << " nps " << nps()
2570 << " time " << t << " hashfull " << TT.full() << std::endl;
2571 lock_release(&IOLock);
2572 if (ShowCurrentLine)
2573 Threads[0].printCurrentLine = true;
2575 // Should we stop the search?
2579 bool overTime = t > AbsoluteMaxSearchTime
2580 || (RootMoveNumber == 1 && t > MaxSearchTime + ExtraSearchTime && !FailLow) //FIXME: We are not checking any problem flags, BUG?
2581 || ( !FailHigh && !FailLow && !fail_high_ply_1() && !Problem
2582 && t > 6*(MaxSearchTime + ExtraSearchTime));
2584 if ( (Iteration >= 3 && (!InfiniteSearch && overTime))
2585 || (ExactMaxTime && t >= ExactMaxTime)
2586 || (Iteration >= 3 && MaxNodes && nodes_searched() >= MaxNodes))
2591 // ponderhit() is called when the program is pondering (i.e. thinking while
2592 // it's the opponent's turn to move) in order to let the engine know that
2593 // it correctly predicted the opponent's move.
2597 int t = current_search_time();
2598 PonderSearch = false;
2599 if (Iteration >= 3 &&
2600 (!InfiniteSearch && (StopOnPonderhit ||
2601 t > AbsoluteMaxSearchTime ||
2602 (RootMoveNumber == 1 &&
2603 t > MaxSearchTime + ExtraSearchTime && !FailLow) ||
2604 (!FailHigh && !FailLow && !fail_high_ply_1() && !Problem &&
2605 t > 6*(MaxSearchTime + ExtraSearchTime)))))
2610 // print_current_line() prints the current line of search for a given
2611 // thread. Called when the UCI option UCI_ShowCurrLine is 'true'.
2613 void print_current_line(SearchStack ss[], int ply, int threadID) {
2615 assert(ply >= 0 && ply < PLY_MAX);
2616 assert(threadID >= 0 && threadID < ActiveThreads);
2618 if (!Threads[threadID].idle)
2621 std::cout << "info currline " << (threadID + 1);
2622 for (int p = 0; p < ply; p++)
2623 std::cout << " " << ss[p].currentMove;
2625 std::cout << std::endl;
2626 lock_release(&IOLock);
2628 Threads[threadID].printCurrentLine = false;
2629 if (threadID + 1 < ActiveThreads)
2630 Threads[threadID + 1].printCurrentLine = true;
2634 // init_ss_array() does a fast reset of the first entries of a SearchStack array
2636 void init_ss_array(SearchStack ss[]) {
2638 for (int i = 0; i < 3; i++)
2641 ss[i].initKillers();
2646 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2647 // while the program is pondering. The point is to work around a wrinkle in
2648 // the UCI protocol: When pondering, the engine is not allowed to give a
2649 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2650 // We simply wait here until one of these commands is sent, and return,
2651 // after which the bestmove and pondermove will be printed (in id_loop()).
2653 void wait_for_stop_or_ponderhit() {
2655 std::string command;
2659 if (!std::getline(std::cin, command))
2662 if (command == "quit")
2667 else if (command == "ponderhit" || command == "stop")
2673 // idle_loop() is where the threads are parked when they have no work to do.
2674 // The parameter "waitSp", if non-NULL, is a pointer to an active SplitPoint
2675 // object for which the current thread is the master.
2677 void idle_loop(int threadID, SplitPoint* waitSp) {
2678 assert(threadID >= 0 && threadID < THREAD_MAX);
2680 Threads[threadID].running = true;
2683 if(AllThreadsShouldExit && threadID != 0)
2686 // If we are not thinking, wait for a condition to be signaled instead
2687 // of wasting CPU time polling for work:
2688 while(threadID != 0 && (Idle || threadID >= ActiveThreads)) {
2689 #if !defined(_MSC_VER)
2690 pthread_mutex_lock(&WaitLock);
2691 if(Idle || threadID >= ActiveThreads)
2692 pthread_cond_wait(&WaitCond, &WaitLock);
2693 pthread_mutex_unlock(&WaitLock);
2695 WaitForSingleObject(SitIdleEvent[threadID], INFINITE);
2699 // If this thread has been assigned work, launch a search
2700 if(Threads[threadID].workIsWaiting) {
2701 Threads[threadID].workIsWaiting = false;
2702 if(Threads[threadID].splitPoint->pvNode)
2703 sp_search_pv(Threads[threadID].splitPoint, threadID);
2705 sp_search(Threads[threadID].splitPoint, threadID);
2706 Threads[threadID].idle = true;
2709 // If this thread is the master of a split point and all threads have
2710 // finished their work at this split point, return from the idle loop.
2711 if(waitSp != NULL && waitSp->cpus == 0)
2715 Threads[threadID].running = false;
2719 // init_split_point_stack() is called during program initialization, and
2720 // initializes all split point objects.
2722 void init_split_point_stack() {
2723 for(int i = 0; i < THREAD_MAX; i++)
2724 for(int j = 0; j < MaxActiveSplitPoints; j++) {
2725 SplitPointStack[i][j].parent = NULL;
2726 lock_init(&(SplitPointStack[i][j].lock), NULL);
2731 // destroy_split_point_stack() is called when the program exits, and
2732 // destroys all locks in the precomputed split point objects.
2734 void destroy_split_point_stack() {
2735 for(int i = 0; i < THREAD_MAX; i++)
2736 for(int j = 0; j < MaxActiveSplitPoints; j++)
2737 lock_destroy(&(SplitPointStack[i][j].lock));
2741 // thread_should_stop() checks whether the thread with a given threadID has
2742 // been asked to stop, directly or indirectly. This can happen if a beta
2743 // cutoff has occured in thre thread's currently active split point, or in
2744 // some ancestor of the current split point.
2746 bool thread_should_stop(int threadID) {
2747 assert(threadID >= 0 && threadID < ActiveThreads);
2751 if(Threads[threadID].stop)
2753 if(ActiveThreads <= 2)
2755 for(sp = Threads[threadID].splitPoint; sp != NULL; sp = sp->parent)
2757 Threads[threadID].stop = true;
2764 // thread_is_available() checks whether the thread with threadID "slave" is
2765 // available to help the thread with threadID "master" at a split point. An
2766 // obvious requirement is that "slave" must be idle. With more than two
2767 // threads, this is not by itself sufficient: If "slave" is the master of
2768 // some active split point, it is only available as a slave to the other
2769 // threads which are busy searching the split point at the top of "slave"'s
2770 // split point stack (the "helpful master concept" in YBWC terminology).
2772 bool thread_is_available(int slave, int master) {
2773 assert(slave >= 0 && slave < ActiveThreads);
2774 assert(master >= 0 && master < ActiveThreads);
2775 assert(ActiveThreads > 1);
2777 if(!Threads[slave].idle || slave == master)
2780 if(Threads[slave].activeSplitPoints == 0)
2781 // No active split points means that the thread is available as a slave
2782 // for any other thread.
2785 if(ActiveThreads == 2)
2788 // Apply the "helpful master" concept if possible.
2789 if(SplitPointStack[slave][Threads[slave].activeSplitPoints-1].slaves[master])
2796 // idle_thread_exists() tries to find an idle thread which is available as
2797 // a slave for the thread with threadID "master".
2799 bool idle_thread_exists(int master) {
2800 assert(master >= 0 && master < ActiveThreads);
2801 assert(ActiveThreads > 1);
2803 for(int i = 0; i < ActiveThreads; i++)
2804 if(thread_is_available(i, master))
2810 // split() does the actual work of distributing the work at a node between
2811 // several threads at PV nodes. If it does not succeed in splitting the
2812 // node (because no idle threads are available, or because we have no unused
2813 // split point objects), the function immediately returns false. If
2814 // splitting is possible, a SplitPoint object is initialized with all the
2815 // data that must be copied to the helper threads (the current position and
2816 // search stack, alpha, beta, the search depth, etc.), and we tell our
2817 // helper threads that they have been assigned work. This will cause them
2818 // to instantly leave their idle loops and call sp_search_pv(). When all
2819 // threads have returned from sp_search_pv (or, equivalently, when
2820 // splitPoint->cpus becomes 0), split() returns true.
2822 bool split(const Position& p, SearchStack* sstck, int ply,
2823 Value* alpha, Value* beta, Value* bestValue, const Value futilityValue,
2824 const Value approximateEval, Depth depth, int* moves,
2825 MovePicker* mp, int master, bool pvNode) {
2828 assert(sstck != NULL);
2829 assert(ply >= 0 && ply < PLY_MAX);
2830 assert(*bestValue >= -VALUE_INFINITE && *bestValue <= *alpha);
2831 assert(!pvNode || *alpha < *beta);
2832 assert(*beta <= VALUE_INFINITE);
2833 assert(depth > Depth(0));
2834 assert(master >= 0 && master < ActiveThreads);
2835 assert(ActiveThreads > 1);
2837 SplitPoint* splitPoint;
2842 // If no other thread is available to help us, or if we have too many
2843 // active split points, don't split.
2844 if(!idle_thread_exists(master) ||
2845 Threads[master].activeSplitPoints >= MaxActiveSplitPoints) {
2846 lock_release(&MPLock);
2850 // Pick the next available split point object from the split point stack
2851 splitPoint = SplitPointStack[master] + Threads[master].activeSplitPoints;
2852 Threads[master].activeSplitPoints++;
2854 // Initialize the split point object
2855 splitPoint->parent = Threads[master].splitPoint;
2856 splitPoint->finished = false;
2857 splitPoint->ply = ply;
2858 splitPoint->depth = depth;
2859 splitPoint->alpha = pvNode? *alpha : (*beta - 1);
2860 splitPoint->beta = *beta;
2861 splitPoint->pvNode = pvNode;
2862 splitPoint->bestValue = *bestValue;
2863 splitPoint->futilityValue = futilityValue;
2864 splitPoint->approximateEval = approximateEval;
2865 splitPoint->master = master;
2866 splitPoint->mp = mp;
2867 splitPoint->moves = *moves;
2868 splitPoint->cpus = 1;
2869 splitPoint->pos.copy(p);
2870 splitPoint->parentSstack = sstck;
2871 for(i = 0; i < ActiveThreads; i++)
2872 splitPoint->slaves[i] = 0;
2874 // Copy the current position and the search stack to the master thread
2875 memcpy(splitPoint->sstack[master], sstck, (ply+1)*sizeof(SearchStack));
2876 Threads[master].splitPoint = splitPoint;
2878 // Make copies of the current position and search stack for each thread
2879 for(i = 0; i < ActiveThreads && splitPoint->cpus < MaxThreadsPerSplitPoint;
2881 if(thread_is_available(i, master)) {
2882 memcpy(splitPoint->sstack[i], sstck, (ply+1)*sizeof(SearchStack));
2883 Threads[i].splitPoint = splitPoint;
2884 splitPoint->slaves[i] = 1;
2888 // Tell the threads that they have work to do. This will make them leave
2890 for(i = 0; i < ActiveThreads; i++)
2891 if(i == master || splitPoint->slaves[i]) {
2892 Threads[i].workIsWaiting = true;
2893 Threads[i].idle = false;
2894 Threads[i].stop = false;
2897 lock_release(&MPLock);
2899 // Everything is set up. The master thread enters the idle loop, from
2900 // which it will instantly launch a search, because its workIsWaiting
2901 // slot is 'true'. We send the split point as a second parameter to the
2902 // idle loop, which means that the main thread will return from the idle
2903 // loop when all threads have finished their work at this split point
2904 // (i.e. when // splitPoint->cpus == 0).
2905 idle_loop(master, splitPoint);
2907 // We have returned from the idle loop, which means that all threads are
2908 // finished. Update alpha, beta and bestvalue, and return.
2910 if(pvNode) *alpha = splitPoint->alpha;
2911 *beta = splitPoint->beta;
2912 *bestValue = splitPoint->bestValue;
2913 Threads[master].stop = false;
2914 Threads[master].idle = false;
2915 Threads[master].activeSplitPoints--;
2916 Threads[master].splitPoint = splitPoint->parent;
2917 lock_release(&MPLock);
2923 // wake_sleeping_threads() wakes up all sleeping threads when it is time
2924 // to start a new search from the root.
2926 void wake_sleeping_threads() {
2927 if(ActiveThreads > 1) {
2928 for(int i = 1; i < ActiveThreads; i++) {
2929 Threads[i].idle = true;
2930 Threads[i].workIsWaiting = false;
2932 #if !defined(_MSC_VER)
2933 pthread_mutex_lock(&WaitLock);
2934 pthread_cond_broadcast(&WaitCond);
2935 pthread_mutex_unlock(&WaitLock);
2937 for(int i = 1; i < THREAD_MAX; i++)
2938 SetEvent(SitIdleEvent[i]);
2944 // init_thread() is the function which is called when a new thread is
2945 // launched. It simply calls the idle_loop() function with the supplied
2946 // threadID. There are two versions of this function; one for POSIX threads
2947 // and one for Windows threads.
2949 #if !defined(_MSC_VER)
2951 void *init_thread(void *threadID) {
2952 idle_loop(*(int *)threadID, NULL);
2958 DWORD WINAPI init_thread(LPVOID threadID) {
2959 idle_loop(*(int *)threadID, NULL);