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, Bitboard dcCandidates, 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)
336 MovePicker mp = MovePicker(pos, MOVE_NONE, depth, H);
337 Bitboard dcCandidates = mp.discovered_check_candidates();
340 // If we are at the last ply we don't need to do and undo
341 // the moves, just to count them.
342 if (depth <= OnePly) // Replace with '<' to test also qsearch
344 while ((move = mp.get_next_move()) != MOVE_NONE) sum++;
348 // Loop through all legal moves
349 while ((move = mp.get_next_move()) != MOVE_NONE)
352 pos.do_move(move, st, dcCandidates);
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;
865 Bitboard dcCandidates = pos.discovered_check_candidates(pos.side_to_move());
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 captureOrPromotion = pos.move_is_capture_or_promotion(move);
903 ext = extension(pos, move, true, captureOrPromotion, pos.move_is_check(move), false, false, &dangerous);
904 newDepth = (Iteration - 2) * OnePly + ext + InitialDepth;
906 // Make the move, and search it
907 pos.do_move(move, st, dcCandidates);
911 // Aspiration window is disabled in multi-pv case
913 alpha = -VALUE_INFINITE;
915 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
916 // If the value has dropped a lot compared to the last iteration,
917 // set the boolean variable Problem to true. This variable is used
918 // for time managment: When Problem is true, we try to complete the
919 // current iteration before playing a move.
920 Problem = (Iteration >= 2 && value <= IterationInfo[Iteration-1].value - ProblemMargin);
922 if (Problem && StopOnPonderhit)
923 StopOnPonderhit = false;
927 if ( newDepth >= 3*OnePly
928 && i >= MultiPV + LMRPVMoves
930 && !captureOrPromotion
931 && !move_is_castle(move))
933 ss[0].reduction = OnePly;
934 value = -search(pos, ss, -alpha, newDepth-OnePly, 1, true, 0);
936 value = alpha + 1; // Just to trigger next condition
940 value = -search(pos, ss, -alpha, newDepth, 1, true, 0);
943 // Fail high! Set the boolean variable FailHigh to true, and
944 // re-search the move with a big window. The variable FailHigh is
945 // used for time managment: We try to avoid aborting the search
946 // prematurely during a fail high research.
948 value = -search_pv(pos, ss, -beta, -alpha, newDepth, 1, 0);
955 // Finished searching the move. If AbortSearch is true, the search
956 // was aborted because the user interrupted the search or because we
957 // ran out of time. In this case, the return value of the search cannot
958 // be trusted, and we break out of the loop without updating the best
963 // Remember the node count for this move. The node counts are used to
964 // sort the root moves at the next iteration.
965 rml.set_move_nodes(i, nodes_searched() - nodes);
967 // Remember the beta-cutoff statistics
969 BetaCounter.read(pos.side_to_move(), our, their);
970 rml.set_beta_counters(i, our, their);
972 assert(value >= -VALUE_INFINITE && value <= VALUE_INFINITE);
974 if (value <= alpha && i >= MultiPV)
975 rml.set_move_score(i, -VALUE_INFINITE);
978 // PV move or new best move!
981 rml.set_move_score(i, value);
983 TT.extract_pv(pos, ss[0].pv, PLY_MAX);
984 rml.set_move_pv(i, ss[0].pv);
988 // We record how often the best move has been changed in each
989 // iteration. This information is used for time managment: When
990 // the best move changes frequently, we allocate some more time.
992 BestMoveChangesByIteration[Iteration]++;
994 // Print search information to the standard output
995 std::cout << "info depth " << Iteration
996 << " score " << value_to_string(value)
998 " lowerbound" : ((value <= alpha)? " upperbound" : ""))
999 << " time " << current_search_time()
1000 << " nodes " << nodes_searched()
1004 for (int j = 0; ss[0].pv[j] != MOVE_NONE && j < PLY_MAX; j++)
1005 std::cout << ss[0].pv[j] << " ";
1007 std::cout << std::endl;
1010 LogFile << pretty_pv(pos, current_search_time(), Iteration, nodes_searched(), value,
1011 ((value >= beta)? VALUE_TYPE_LOWER
1012 : ((value <= alpha)? VALUE_TYPE_UPPER : VALUE_TYPE_EXACT)),
1019 // Reset the global variable Problem to false if the value isn't too
1020 // far below the final value from the last iteration.
1021 if (value > IterationInfo[Iteration - 1].value - NoProblemMargin)
1026 rml.sort_multipv(i);
1027 for (int j = 0; j < Min(MultiPV, rml.move_count()); j++)
1030 std::cout << "info multipv " << j + 1
1031 << " score " << value_to_string(rml.get_move_score(j))
1032 << " depth " << ((j <= i)? Iteration : Iteration - 1)
1033 << " time " << current_search_time()
1034 << " nodes " << nodes_searched()
1038 for (k = 0; rml.get_move_pv(j, k) != MOVE_NONE && k < PLY_MAX; k++)
1039 std::cout << rml.get_move_pv(j, k) << " ";
1041 std::cout << std::endl;
1043 alpha = rml.get_move_score(Min(i, MultiPV-1));
1045 } // New best move case
1047 assert(alpha >= oldAlpha);
1049 FailLow = (alpha == oldAlpha);
1055 // search_pv() is the main search function for PV nodes.
1057 Value search_pv(Position& pos, SearchStack ss[], Value alpha, Value beta,
1058 Depth depth, int ply, int threadID) {
1060 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1061 assert(beta > alpha && beta <= VALUE_INFINITE);
1062 assert(ply >= 0 && ply < PLY_MAX);
1063 assert(threadID >= 0 && threadID < ActiveThreads);
1066 return qsearch(pos, ss, alpha, beta, Depth(0), ply, threadID);
1068 // Initialize, and make an early exit in case of an aborted search,
1069 // an instant draw, maximum ply reached, etc.
1070 init_node(ss, ply, threadID);
1072 // After init_node() that calls poll()
1073 if (AbortSearch || thread_should_stop(threadID))
1081 if (ply >= PLY_MAX - 1)
1082 return pos.is_check() ? quick_evaluate(pos) : evaluate(pos, ei, threadID);
1084 // Mate distance pruning
1085 Value oldAlpha = alpha;
1086 alpha = Max(value_mated_in(ply), alpha);
1087 beta = Min(value_mate_in(ply+1), beta);
1091 // Transposition table lookup. At PV nodes, we don't use the TT for
1092 // pruning, but only for move ordering.
1093 const TTEntry* tte = TT.retrieve(pos.get_key());
1094 Move ttMove = (tte ? tte->move() : MOVE_NONE);
1096 // Go with internal iterative deepening if we don't have a TT move
1097 if (UseIIDAtPVNodes && ttMove == MOVE_NONE && depth >= 5*OnePly)
1099 search_pv(pos, ss, alpha, beta, depth-2*OnePly, ply, threadID);
1100 ttMove = ss[ply].pv[ply];
1103 // Initialize a MovePicker object for the current position, and prepare
1104 // to search all moves
1105 Move move, movesSearched[256];
1107 Value value, bestValue = -VALUE_INFINITE;
1108 Color us = pos.side_to_move();
1109 bool isCheck = pos.is_check();
1110 bool mateThreat = pos.has_mate_threat(opposite_color(us));
1112 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
1113 Bitboard dcCandidates = mp.discovered_check_candidates();
1115 // Loop through all legal moves until no moves remain or a beta cutoff
1117 while ( alpha < beta
1118 && (move = mp.get_next_move()) != MOVE_NONE
1119 && !thread_should_stop(threadID))
1121 assert(move_is_ok(move));
1123 bool singleReply = (isCheck && mp.number_of_evasions() == 1);
1124 bool moveIsCheck = pos.move_is_check(move, dcCandidates);
1125 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
1127 movesSearched[moveCount++] = ss[ply].currentMove = move;
1129 // Decide the new search depth
1131 Depth ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, singleReply, mateThreat, &dangerous);
1132 Depth newDepth = depth - OnePly + ext;
1134 // Make and search the move
1136 pos.do_move(move, st, dcCandidates);
1138 if (moveCount == 1) // The first move in list is the PV
1139 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1142 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1143 // if the move fails high will be re-searched at full depth.
1144 if ( depth >= 3*OnePly
1145 && moveCount >= LMRPVMoves
1147 && !captureOrPromotion
1148 && !move_is_castle(move)
1149 && !move_is_killer(move, ss[ply]))
1151 ss[ply].reduction = OnePly;
1152 value = -search(pos, ss, -alpha, newDepth-OnePly, ply+1, true, threadID);
1155 value = alpha + 1; // Just to trigger next condition
1157 if (value > alpha) // Go with full depth non-pv search
1159 ss[ply].reduction = Depth(0);
1160 value = -search(pos, ss, -alpha, newDepth, ply+1, true, threadID);
1161 if (value > alpha && value < beta)
1163 // When the search fails high at ply 1 while searching the first
1164 // move at the root, set the flag failHighPly1. This is used for
1165 // time managment: We don't want to stop the search early in
1166 // such cases, because resolving the fail high at ply 1 could
1167 // result in a big drop in score at the root.
1168 if (ply == 1 && RootMoveNumber == 1)
1169 Threads[threadID].failHighPly1 = true;
1171 // A fail high occurred. Re-search at full window (pv search)
1172 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1173 Threads[threadID].failHighPly1 = false;
1177 pos.undo_move(move);
1179 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1182 if (value > bestValue)
1189 if (value == value_mate_in(ply + 1))
1190 ss[ply].mateKiller = move;
1192 // If we are at ply 1, and we are searching the first root move at
1193 // ply 0, set the 'Problem' variable if the score has dropped a lot
1194 // (from the computer's point of view) since the previous iteration.
1197 && -value <= IterationInfo[Iteration-1].value - ProblemMargin)
1202 if ( ActiveThreads > 1
1204 && depth >= MinimumSplitDepth
1206 && idle_thread_exists(threadID)
1208 && !thread_should_stop(threadID)
1209 && split(pos, ss, ply, &alpha, &beta, &bestValue, VALUE_NONE, VALUE_NONE, depth,
1210 &moveCount, &mp, dcCandidates, threadID, true))
1214 // All legal moves have been searched. A special case: If there were
1215 // no legal moves, it must be mate or stalemate.
1217 return (isCheck ? value_mated_in(ply) : VALUE_DRAW);
1219 // If the search is not aborted, update the transposition table,
1220 // history counters, and killer moves.
1221 if (AbortSearch || thread_should_stop(threadID))
1224 if (bestValue <= oldAlpha)
1225 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1227 else if (bestValue >= beta)
1229 BetaCounter.add(pos.side_to_move(), depth, threadID);
1230 Move m = ss[ply].pv[ply];
1231 if (!pos.move_is_capture_or_promotion(m))
1233 update_history(pos, m, depth, movesSearched, moveCount);
1234 update_killers(m, ss[ply]);
1236 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, m);
1239 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EXACT, depth, ss[ply].pv[ply]);
1245 // search() is the search function for zero-width nodes.
1247 Value search(Position& pos, SearchStack ss[], Value beta, Depth depth,
1248 int ply, bool allowNullmove, int threadID) {
1250 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1251 assert(ply >= 0 && ply < PLY_MAX);
1252 assert(threadID >= 0 && threadID < ActiveThreads);
1255 return qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1257 // Initialize, and make an early exit in case of an aborted search,
1258 // an instant draw, maximum ply reached, etc.
1259 init_node(ss, ply, threadID);
1261 // After init_node() that calls poll()
1262 if (AbortSearch || thread_should_stop(threadID))
1270 if (ply >= PLY_MAX - 1)
1271 return pos.is_check() ? quick_evaluate(pos) : evaluate(pos, ei, threadID);
1273 // Mate distance pruning
1274 if (value_mated_in(ply) >= beta)
1277 if (value_mate_in(ply + 1) < beta)
1280 // Transposition table lookup
1281 const TTEntry* tte = TT.retrieve(pos.get_key());
1282 Move ttMove = (tte ? tte->move() : MOVE_NONE);
1284 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1286 ss[ply].currentMove = ttMove; // can be MOVE_NONE
1287 return value_from_tt(tte->value(), ply);
1290 Value approximateEval = quick_evaluate(pos);
1291 bool mateThreat = false;
1292 bool isCheck = pos.is_check();
1298 && !value_is_mate(beta)
1299 && ok_to_do_nullmove(pos)
1300 && approximateEval >= beta - NullMoveMargin)
1302 ss[ply].currentMove = MOVE_NULL;
1305 pos.do_null_move(st);
1306 int R = (depth >= 5 * OnePly ? 4 : 3); // Null move dynamic reduction
1308 Value nullValue = -search(pos, ss, -(beta-1), depth-R*OnePly, ply+1, false, threadID);
1310 pos.undo_null_move();
1312 if (nullValue >= beta)
1314 if (depth < 6 * OnePly)
1317 // Do zugzwang verification search
1318 Value v = search(pos, ss, beta, depth-5*OnePly, ply, false, threadID);
1322 // The null move failed low, which means that we may be faced with
1323 // some kind of threat. If the previous move was reduced, check if
1324 // the move that refuted the null move was somehow connected to the
1325 // move which was reduced. If a connection is found, return a fail
1326 // low score (which will cause the reduced move to fail high in the
1327 // parent node, which will trigger a re-search with full depth).
1328 if (nullValue == value_mated_in(ply + 2))
1331 ss[ply].threatMove = ss[ply + 1].currentMove;
1332 if ( depth < ThreatDepth
1333 && ss[ply - 1].reduction
1334 && connected_moves(pos, ss[ply - 1].currentMove, ss[ply].threatMove))
1338 // Null move search not allowed, try razoring
1339 else if ( !value_is_mate(beta)
1340 && depth < RazorDepth
1341 && approximateEval < beta - RazorApprMargins[int(depth) - 2]
1342 && ss[ply - 1].currentMove != MOVE_NULL
1343 && ttMove == MOVE_NONE
1344 && !pos.has_pawn_on_7th(pos.side_to_move()))
1346 Value v = qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1347 if (v < beta - RazorMargins[int(depth) - 2])
1351 // Go with internal iterative deepening if we don't have a TT move
1352 if (UseIIDAtNonPVNodes && ttMove == MOVE_NONE && depth >= 8*OnePly &&
1353 evaluate(pos, ei, threadID) >= beta - IIDMargin)
1355 search(pos, ss, beta, Min(depth/2, depth-2*OnePly), ply, false, threadID);
1356 ttMove = ss[ply].pv[ply];
1359 // Initialize a MovePicker object for the current position, and prepare
1360 // to search all moves.
1361 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
1363 Move move, movesSearched[256];
1365 Value value, bestValue = -VALUE_INFINITE;
1366 Bitboard dcCandidates = mp.discovered_check_candidates();
1367 Value futilityValue = VALUE_NONE;
1368 bool useFutilityPruning = depth < SelectiveDepth
1371 // Avoid calling evaluate() if we already have the score in TT
1372 if (tte && (tte->type() & VALUE_TYPE_EVAL))
1373 futilityValue = value_from_tt(tte->value(), ply) + FutilityMargins[int(depth) - 2];
1375 // Loop through all legal moves until no moves remain or a beta cutoff
1377 while ( bestValue < beta
1378 && (move = mp.get_next_move()) != MOVE_NONE
1379 && !thread_should_stop(threadID))
1381 assert(move_is_ok(move));
1383 bool singleReply = (isCheck && mp.number_of_evasions() == 1);
1384 bool moveIsCheck = pos.move_is_check(move, dcCandidates);
1385 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
1387 movesSearched[moveCount++] = ss[ply].currentMove = move;
1389 // Decide the new search depth
1391 Depth ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, singleReply, mateThreat, &dangerous);
1392 Depth newDepth = depth - OnePly + ext;
1395 if ( useFutilityPruning
1397 && !captureOrPromotion)
1399 // History pruning. See ok_to_prune() definition
1400 if ( moveCount >= 2 + int(depth)
1401 && ok_to_prune(pos, move, ss[ply].threatMove, depth)
1402 && bestValue > value_mated_in(PLY_MAX))
1405 // Value based pruning
1406 if (approximateEval < beta)
1408 if (futilityValue == VALUE_NONE)
1409 futilityValue = evaluate(pos, ei, threadID)
1410 + FutilityMargins[int(depth) - 2];
1412 if (futilityValue < beta)
1414 if (futilityValue > bestValue)
1415 bestValue = futilityValue;
1421 // Make and search the move
1423 pos.do_move(move, st, dcCandidates);
1425 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1426 // if the move fails high will be re-searched at full depth.
1427 if ( depth >= 3*OnePly
1428 && moveCount >= LMRNonPVMoves
1430 && !captureOrPromotion
1431 && !move_is_castle(move)
1432 && !move_is_killer(move, ss[ply]))
1434 ss[ply].reduction = OnePly;
1435 value = -search(pos, ss, -(beta-1), newDepth-OnePly, ply+1, true, threadID);
1438 value = beta; // Just to trigger next condition
1440 if (value >= beta) // Go with full depth non-pv search
1442 ss[ply].reduction = Depth(0);
1443 value = -search(pos, ss, -(beta-1), newDepth, ply+1, true, threadID);
1445 pos.undo_move(move);
1447 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1450 if (value > bestValue)
1456 if (value == value_mate_in(ply + 1))
1457 ss[ply].mateKiller = move;
1461 if ( ActiveThreads > 1
1463 && depth >= MinimumSplitDepth
1465 && idle_thread_exists(threadID)
1467 && !thread_should_stop(threadID)
1468 && split(pos, ss, ply, &beta, &beta, &bestValue, futilityValue, approximateEval, depth, &moveCount,
1469 &mp, dcCandidates, threadID, false))
1473 // All legal moves have been searched. A special case: If there were
1474 // no legal moves, it must be mate or stalemate.
1476 return (pos.is_check() ? value_mated_in(ply) : VALUE_DRAW);
1478 // If the search is not aborted, update the transposition table,
1479 // history counters, and killer moves.
1480 if (AbortSearch || thread_should_stop(threadID))
1483 if (bestValue < beta)
1484 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1487 BetaCounter.add(pos.side_to_move(), depth, threadID);
1488 Move m = ss[ply].pv[ply];
1489 if (!pos.move_is_capture_or_promotion(m))
1491 update_history(pos, m, depth, movesSearched, moveCount);
1492 update_killers(m, ss[ply]);
1494 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, m);
1497 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1503 // qsearch() is the quiescence search function, which is called by the main
1504 // search function when the remaining depth is zero (or, to be more precise,
1505 // less than OnePly).
1507 Value qsearch(Position& pos, SearchStack ss[], Value alpha, Value beta,
1508 Depth depth, int ply, int threadID) {
1510 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1511 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1513 assert(ply >= 0 && ply < PLY_MAX);
1514 assert(threadID >= 0 && threadID < ActiveThreads);
1516 // Initialize, and make an early exit in case of an aborted search,
1517 // an instant draw, maximum ply reached, etc.
1518 init_node(ss, ply, threadID);
1520 // After init_node() that calls poll()
1521 if (AbortSearch || thread_should_stop(threadID))
1527 // Transposition table lookup, only when not in PV
1528 TTEntry* tte = NULL;
1529 bool pvNode = (beta - alpha != 1);
1532 tte = TT.retrieve(pos.get_key());
1533 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1535 assert(tte->type() != VALUE_TYPE_EVAL);
1537 return value_from_tt(tte->value(), ply);
1540 Move ttMove = (tte ? tte->move() : MOVE_NONE);
1542 // Evaluate the position statically
1545 bool isCheck = pos.is_check();
1546 ei.futilityMargin = Value(0); // Manually initialize futilityMargin
1549 staticValue = -VALUE_INFINITE;
1551 else if (tte && (tte->type() & VALUE_TYPE_EVAL))
1553 // Use the cached evaluation score if possible
1554 assert(ei.futilityMargin == Value(0));
1556 staticValue = tte->value();
1559 staticValue = evaluate(pos, ei, threadID);
1561 if (ply >= PLY_MAX - 1)
1562 return pos.is_check() ? quick_evaluate(pos) : evaluate(pos, ei, threadID);
1564 // Initialize "stand pat score", and return it immediately if it is
1566 Value bestValue = staticValue;
1568 if (bestValue >= beta)
1570 // Store the score to avoid a future costly evaluation() call
1571 if (!isCheck && !tte && ei.futilityMargin == 0)
1572 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EV_LO, Depth(-127*OnePly), MOVE_NONE);
1577 if (bestValue > alpha)
1580 // Initialize a MovePicker object for the current position, and prepare
1581 // to search the moves. Because the depth is <= 0 here, only captures,
1582 // queen promotions and checks (only if depth == 0) will be generated.
1583 MovePicker mp = MovePicker(pos, ttMove, depth, H);
1586 Bitboard dcCandidates = mp.discovered_check_candidates();
1587 Color us = pos.side_to_move();
1588 bool enoughMaterial = pos.non_pawn_material(us) > RookValueMidgame;
1590 // Loop through the moves until no moves remain or a beta cutoff
1592 while ( alpha < beta
1593 && (move = mp.get_next_move()) != MOVE_NONE)
1595 assert(move_is_ok(move));
1598 ss[ply].currentMove = move;
1604 && !move_is_promotion(move)
1605 && !pos.move_is_check(move, dcCandidates)
1606 && !pos.move_is_passed_pawn_push(move))
1608 Value futilityValue = staticValue
1609 + Max(pos.midgame_value_of_piece_on(move_to(move)),
1610 pos.endgame_value_of_piece_on(move_to(move)))
1611 + (move_is_ep(move) ? PawnValueEndgame : Value(0))
1613 + ei.futilityMargin;
1615 if (futilityValue < alpha)
1617 if (futilityValue > bestValue)
1618 bestValue = futilityValue;
1623 // Don't search captures and checks with negative SEE values
1626 && !move_is_promotion(move)
1627 && pos.see_sign(move) < 0)
1630 // Make and search the move.
1632 pos.do_move(move, st, dcCandidates);
1633 Value value = -qsearch(pos, ss, -beta, -alpha, depth-OnePly, ply+1, threadID);
1634 pos.undo_move(move);
1636 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1639 if (value > bestValue)
1650 // All legal moves have been searched. A special case: If we're in check
1651 // and no legal moves were found, it is checkmate.
1652 if (!moveCount && pos.is_check()) // Mate!
1653 return value_mated_in(ply);
1655 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1657 // Update transposition table
1658 Move m = ss[ply].pv[ply];
1661 // If bestValue isn't changed it means it is still the static evaluation of
1662 // the node, so keep this info to avoid a future costly evaluation() call.
1663 ValueType type = (bestValue == staticValue && !ei.futilityMargin ? VALUE_TYPE_EV_UP : VALUE_TYPE_UPPER);
1664 Depth d = (depth == Depth(0) ? Depth(0) : Depth(-1));
1666 if (bestValue < beta)
1667 TT.store(pos.get_key(), value_to_tt(bestValue, ply), type, d, MOVE_NONE);
1669 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, d, m);
1672 // Update killers only for good check moves
1673 if (alpha >= beta && !pos.move_is_capture_or_promotion(m))
1674 update_killers(m, ss[ply]);
1680 // sp_search() is used to search from a split point. This function is called
1681 // by each thread working at the split point. It is similar to the normal
1682 // search() function, but simpler. Because we have already probed the hash
1683 // table, done a null move search, and searched the first move before
1684 // splitting, we don't have to repeat all this work in sp_search(). We
1685 // also don't need to store anything to the hash table here: This is taken
1686 // care of after we return from the split point.
1688 void sp_search(SplitPoint* sp, int threadID) {
1690 assert(threadID >= 0 && threadID < ActiveThreads);
1691 assert(ActiveThreads > 1);
1693 Position pos = Position(sp->pos);
1694 SearchStack* ss = sp->sstack[threadID];
1697 bool isCheck = pos.is_check();
1698 bool useFutilityPruning = sp->depth < SelectiveDepth
1701 while ( sp->bestValue < sp->beta
1702 && !thread_should_stop(threadID)
1703 && (move = sp->mp->get_next_move(sp->lock)) != MOVE_NONE)
1705 assert(move_is_ok(move));
1707 bool moveIsCheck = pos.move_is_check(move, sp->dcCandidates);
1708 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
1710 lock_grab(&(sp->lock));
1711 int moveCount = ++sp->moves;
1712 lock_release(&(sp->lock));
1714 ss[sp->ply].currentMove = move;
1716 // Decide the new search depth.
1718 Depth ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, false, false, &dangerous);
1719 Depth newDepth = sp->depth - OnePly + ext;
1722 if ( useFutilityPruning
1724 && !captureOrPromotion)
1726 // History pruning. See ok_to_prune() definition
1727 if ( moveCount >= 2 + int(sp->depth)
1728 && ok_to_prune(pos, move, ss[sp->ply].threatMove, sp->depth)
1729 && sp->bestValue > value_mated_in(PLY_MAX))
1732 // Value based pruning
1733 if (sp->approximateEval < sp->beta)
1735 if (sp->futilityValue == VALUE_NONE)
1738 sp->futilityValue = evaluate(pos, ei, threadID)
1739 + FutilityMargins[int(sp->depth) - 2];
1742 if (sp->futilityValue < sp->beta)
1744 if (sp->futilityValue > sp->bestValue) // Less then 1% of cases
1746 lock_grab(&(sp->lock));
1747 if (sp->futilityValue > sp->bestValue)
1748 sp->bestValue = sp->futilityValue;
1749 lock_release(&(sp->lock));
1756 // Make and search the move.
1758 pos.do_move(move, st, sp->dcCandidates);
1760 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1761 // if the move fails high will be re-searched at full depth.
1763 && moveCount >= LMRNonPVMoves
1764 && !captureOrPromotion
1765 && !move_is_castle(move)
1766 && !move_is_killer(move, ss[sp->ply]))
1768 ss[sp->ply].reduction = OnePly;
1769 value = -search(pos, ss, -(sp->beta-1), newDepth - OnePly, sp->ply+1, true, threadID);
1772 value = sp->beta; // Just to trigger next condition
1774 if (value >= sp->beta) // Go with full depth non-pv search
1776 ss[sp->ply].reduction = Depth(0);
1777 value = -search(pos, ss, -(sp->beta - 1), newDepth, sp->ply+1, true, threadID);
1779 pos.undo_move(move);
1781 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1783 if (thread_should_stop(threadID))
1787 if (value > sp->bestValue) // Less then 2% of cases
1789 lock_grab(&(sp->lock));
1790 if (value > sp->bestValue && !thread_should_stop(threadID))
1792 sp->bestValue = value;
1793 if (sp->bestValue >= sp->beta)
1795 sp_update_pv(sp->parentSstack, ss, sp->ply);
1796 for (int i = 0; i < ActiveThreads; i++)
1797 if (i != threadID && (i == sp->master || sp->slaves[i]))
1798 Threads[i].stop = true;
1800 sp->finished = true;
1803 lock_release(&(sp->lock));
1807 lock_grab(&(sp->lock));
1809 // If this is the master thread and we have been asked to stop because of
1810 // a beta cutoff higher up in the tree, stop all slave threads.
1811 if (sp->master == threadID && thread_should_stop(threadID))
1812 for (int i = 0; i < ActiveThreads; i++)
1814 Threads[i].stop = true;
1817 sp->slaves[threadID] = 0;
1819 lock_release(&(sp->lock));
1823 // sp_search_pv() is used to search from a PV split point. This function
1824 // is called by each thread working at the split point. It is similar to
1825 // the normal search_pv() function, but simpler. Because we have already
1826 // probed the hash table and searched the first move before splitting, we
1827 // don't have to repeat all this work in sp_search_pv(). We also don't
1828 // need to store anything to the hash table here: This is taken care of
1829 // after we return from the split point.
1831 void sp_search_pv(SplitPoint* sp, int threadID) {
1833 assert(threadID >= 0 && threadID < ActiveThreads);
1834 assert(ActiveThreads > 1);
1836 Position pos = Position(sp->pos);
1837 SearchStack* ss = sp->sstack[threadID];
1841 while ( sp->alpha < sp->beta
1842 && !thread_should_stop(threadID)
1843 && (move = sp->mp->get_next_move(sp->lock)) != MOVE_NONE)
1845 bool moveIsCheck = pos.move_is_check(move, sp->dcCandidates);
1846 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
1848 assert(move_is_ok(move));
1850 lock_grab(&(sp->lock));
1851 int moveCount = ++sp->moves;
1852 lock_release(&(sp->lock));
1854 ss[sp->ply].currentMove = move;
1856 // Decide the new search depth.
1858 Depth ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, false, false, &dangerous);
1859 Depth newDepth = sp->depth - OnePly + ext;
1861 // Make and search the move.
1863 pos.do_move(move, st, sp->dcCandidates);
1865 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1866 // if the move fails high will be re-searched at full depth.
1868 && moveCount >= LMRPVMoves
1869 && !captureOrPromotion
1870 && !move_is_castle(move)
1871 && !move_is_killer(move, ss[sp->ply]))
1873 ss[sp->ply].reduction = OnePly;
1874 value = -search(pos, ss, -sp->alpha, newDepth - OnePly, sp->ply+1, true, threadID);
1877 value = sp->alpha + 1; // Just to trigger next condition
1879 if (value > sp->alpha) // Go with full depth non-pv search
1881 ss[sp->ply].reduction = Depth(0);
1882 value = -search(pos, ss, -sp->alpha, newDepth, sp->ply+1, true, threadID);
1884 if (value > sp->alpha && value < sp->beta)
1886 // When the search fails high at ply 1 while searching the first
1887 // move at the root, set the flag failHighPly1. This is used for
1888 // time managment: We don't want to stop the search early in
1889 // such cases, because resolving the fail high at ply 1 could
1890 // result in a big drop in score at the root.
1891 if (sp->ply == 1 && RootMoveNumber == 1)
1892 Threads[threadID].failHighPly1 = true;
1894 value = -search_pv(pos, ss, -sp->beta, -sp->alpha, newDepth, sp->ply+1, threadID);
1895 Threads[threadID].failHighPly1 = false;
1898 pos.undo_move(move);
1900 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1902 if (thread_should_stop(threadID))
1906 lock_grab(&(sp->lock));
1907 if (value > sp->bestValue && !thread_should_stop(threadID))
1909 sp->bestValue = value;
1910 if (value > sp->alpha)
1913 sp_update_pv(sp->parentSstack, ss, sp->ply);
1914 if (value == value_mate_in(sp->ply + 1))
1915 ss[sp->ply].mateKiller = move;
1917 if (value >= sp->beta)
1919 for (int i = 0; i < ActiveThreads; i++)
1920 if (i != threadID && (i == sp->master || sp->slaves[i]))
1921 Threads[i].stop = true;
1923 sp->finished = true;
1926 // If we are at ply 1, and we are searching the first root move at
1927 // ply 0, set the 'Problem' variable if the score has dropped a lot
1928 // (from the computer's point of view) since the previous iteration.
1931 && -value <= IterationInfo[Iteration-1].value - ProblemMargin)
1934 lock_release(&(sp->lock));
1937 lock_grab(&(sp->lock));
1939 // If this is the master thread and we have been asked to stop because of
1940 // a beta cutoff higher up in the tree, stop all slave threads.
1941 if (sp->master == threadID && thread_should_stop(threadID))
1942 for (int i = 0; i < ActiveThreads; i++)
1944 Threads[i].stop = true;
1947 sp->slaves[threadID] = 0;
1949 lock_release(&(sp->lock));
1952 /// The BetaCounterType class
1954 BetaCounterType::BetaCounterType() { clear(); }
1956 void BetaCounterType::clear() {
1958 for (int i = 0; i < THREAD_MAX; i++)
1959 Threads[i].betaCutOffs[WHITE] = Threads[i].betaCutOffs[BLACK] = 0ULL;
1962 void BetaCounterType::add(Color us, Depth d, int threadID) {
1964 // Weighted count based on depth
1965 Threads[threadID].betaCutOffs[us] += unsigned(d);
1968 void BetaCounterType::read(Color us, int64_t& our, int64_t& their) {
1971 for (int i = 0; i < THREAD_MAX; i++)
1973 our += Threads[i].betaCutOffs[us];
1974 their += Threads[i].betaCutOffs[opposite_color(us)];
1979 /// The RootMove class
1983 RootMove::RootMove() {
1984 nodes = cumulativeNodes = ourBeta = theirBeta = 0ULL;
1987 // RootMove::operator<() is the comparison function used when
1988 // sorting the moves. A move m1 is considered to be better
1989 // than a move m2 if it has a higher score, or if the moves
1990 // have equal score but m1 has the higher node count.
1992 bool RootMove::operator<(const RootMove& m) {
1994 if (score != m.score)
1995 return (score < m.score);
1997 return theirBeta <= m.theirBeta;
2000 /// The RootMoveList class
2004 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) : count(0) {
2006 MoveStack mlist[MaxRootMoves];
2007 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
2009 // Generate all legal moves
2010 MoveStack* last = generate_moves(pos, mlist);
2012 // Add each move to the moves[] array
2013 for (MoveStack* cur = mlist; cur != last; cur++)
2015 bool includeMove = includeAllMoves;
2017 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
2018 includeMove = (searchMoves[k] == cur->move);
2023 // Find a quick score for the move
2025 SearchStack ss[PLY_MAX_PLUS_2];
2028 moves[count].move = cur->move;
2029 pos.do_move(moves[count].move, st);
2030 moves[count].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE, Depth(0), 1, 0);
2031 pos.undo_move(moves[count].move);
2032 moves[count].pv[0] = moves[count].move;
2033 moves[count].pv[1] = MOVE_NONE; // FIXME
2040 // Simple accessor methods for the RootMoveList class
2042 inline Move RootMoveList::get_move(int moveNum) const {
2043 return moves[moveNum].move;
2046 inline Value RootMoveList::get_move_score(int moveNum) const {
2047 return moves[moveNum].score;
2050 inline void RootMoveList::set_move_score(int moveNum, Value score) {
2051 moves[moveNum].score = score;
2054 inline void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) {
2055 moves[moveNum].nodes = nodes;
2056 moves[moveNum].cumulativeNodes += nodes;
2059 inline void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) {
2060 moves[moveNum].ourBeta = our;
2061 moves[moveNum].theirBeta = their;
2064 void RootMoveList::set_move_pv(int moveNum, const Move pv[]) {
2066 for(j = 0; pv[j] != MOVE_NONE; j++)
2067 moves[moveNum].pv[j] = pv[j];
2068 moves[moveNum].pv[j] = MOVE_NONE;
2071 inline Move RootMoveList::get_move_pv(int moveNum, int i) const {
2072 return moves[moveNum].pv[i];
2075 inline int64_t RootMoveList::get_move_cumulative_nodes(int moveNum) const {
2076 return moves[moveNum].cumulativeNodes;
2079 inline int RootMoveList::move_count() const {
2084 // RootMoveList::scan_for_easy_move() is called at the end of the first
2085 // iteration, and is used to detect an "easy move", i.e. a move which appears
2086 // to be much bester than all the rest. If an easy move is found, the move
2087 // is returned, otherwise the function returns MOVE_NONE. It is very
2088 // important that this function is called at the right moment: The code
2089 // assumes that the first iteration has been completed and the moves have
2090 // been sorted. This is done in RootMoveList c'tor.
2092 Move RootMoveList::scan_for_easy_move() const {
2099 // moves are sorted so just consider the best and the second one
2100 if (get_move_score(0) > get_move_score(1) + EasyMoveMargin)
2106 // RootMoveList::sort() sorts the root move list at the beginning of a new
2109 inline void RootMoveList::sort() {
2111 sort_multipv(count - 1); // all items
2115 // RootMoveList::sort_multipv() sorts the first few moves in the root move
2116 // list by their scores and depths. It is used to order the different PVs
2117 // correctly in MultiPV mode.
2119 void RootMoveList::sort_multipv(int n) {
2121 for (int i = 1; i <= n; i++)
2123 RootMove rm = moves[i];
2125 for (j = i; j > 0 && moves[j-1] < rm; j--)
2126 moves[j] = moves[j-1];
2132 // init_node() is called at the beginning of all the search functions
2133 // (search(), search_pv(), qsearch(), and so on) and initializes the search
2134 // stack object corresponding to the current node. Once every
2135 // NodesBetweenPolls nodes, init_node() also calls poll(), which polls
2136 // for user input and checks whether it is time to stop the search.
2138 void init_node(SearchStack ss[], int ply, int threadID) {
2140 assert(ply >= 0 && ply < PLY_MAX);
2141 assert(threadID >= 0 && threadID < ActiveThreads);
2143 Threads[threadID].nodes++;
2148 if (NodesSincePoll >= NodesBetweenPolls)
2155 ss[ply+2].initKillers();
2157 if (Threads[threadID].printCurrentLine)
2158 print_current_line(ss, ply, threadID);
2162 // update_pv() is called whenever a search returns a value > alpha. It
2163 // updates the PV in the SearchStack object corresponding to the current
2166 void update_pv(SearchStack ss[], int ply) {
2167 assert(ply >= 0 && ply < PLY_MAX);
2169 ss[ply].pv[ply] = ss[ply].currentMove;
2171 for(p = ply + 1; ss[ply+1].pv[p] != MOVE_NONE; p++)
2172 ss[ply].pv[p] = ss[ply+1].pv[p];
2173 ss[ply].pv[p] = MOVE_NONE;
2177 // sp_update_pv() is a variant of update_pv for use at split points. The
2178 // difference between the two functions is that sp_update_pv also updates
2179 // the PV at the parent node.
2181 void sp_update_pv(SearchStack* pss, SearchStack ss[], int ply) {
2182 assert(ply >= 0 && ply < PLY_MAX);
2184 ss[ply].pv[ply] = pss[ply].pv[ply] = ss[ply].currentMove;
2186 for(p = ply + 1; ss[ply+1].pv[p] != MOVE_NONE; p++)
2187 ss[ply].pv[p] = pss[ply].pv[p] = ss[ply+1].pv[p];
2188 ss[ply].pv[p] = pss[ply].pv[p] = MOVE_NONE;
2192 // connected_moves() tests whether two moves are 'connected' in the sense
2193 // that the first move somehow made the second move possible (for instance
2194 // if the moving piece is the same in both moves). The first move is
2195 // assumed to be the move that was made to reach the current position, while
2196 // the second move is assumed to be a move from the current position.
2198 bool connected_moves(const Position& pos, Move m1, Move m2) {
2200 Square f1, t1, f2, t2;
2203 assert(move_is_ok(m1));
2204 assert(move_is_ok(m2));
2206 if (m2 == MOVE_NONE)
2209 // Case 1: The moving piece is the same in both moves
2215 // Case 2: The destination square for m2 was vacated by m1
2221 // Case 3: Moving through the vacated square
2222 if ( piece_is_slider(pos.piece_on(f2))
2223 && bit_is_set(squares_between(f2, t2), f1))
2226 // Case 4: The destination square for m2 is attacked by the moving piece in m1
2227 p = pos.piece_on(t1);
2228 if (bit_is_set(pos.attacks_from(p, t1), t2))
2231 // Case 5: Discovered check, checking piece is the piece moved in m1
2232 if ( piece_is_slider(p)
2233 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
2234 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
2236 Bitboard occ = pos.occupied_squares();
2237 Color us = pos.side_to_move();
2238 Square ksq = pos.king_square(us);
2239 clear_bit(&occ, f2);
2240 if (type_of_piece(p) == BISHOP)
2242 if (bit_is_set(bishop_attacks_bb(ksq, occ), t1))
2245 else if (type_of_piece(p) == ROOK)
2247 if (bit_is_set(rook_attacks_bb(ksq, occ), t1))
2252 assert(type_of_piece(p) == QUEEN);
2253 if (bit_is_set(queen_attacks_bb(ksq, occ), t1))
2261 // value_is_mate() checks if the given value is a mate one
2262 // eventually compensated for the ply.
2264 bool value_is_mate(Value value) {
2266 assert(abs(value) <= VALUE_INFINITE);
2268 return value <= value_mated_in(PLY_MAX)
2269 || value >= value_mate_in(PLY_MAX);
2273 // move_is_killer() checks if the given move is among the
2274 // killer moves of that ply.
2276 bool move_is_killer(Move m, const SearchStack& ss) {
2278 const Move* k = ss.killers;
2279 for (int i = 0; i < KILLER_MAX; i++, k++)
2287 // extension() decides whether a move should be searched with normal depth,
2288 // or with extended depth. Certain classes of moves (checking moves, in
2289 // particular) are searched with bigger depth than ordinary moves and in
2290 // any case are marked as 'dangerous'. Note that also if a move is not
2291 // extended, as example because the corresponding UCI option is set to zero,
2292 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
2294 Depth extension(const Position& pos, Move m, bool pvNode, bool captureOrPromotion,
2295 bool check, bool singleReply, bool mateThreat, bool* dangerous) {
2297 assert(m != MOVE_NONE);
2299 Depth result = Depth(0);
2300 *dangerous = check | singleReply | mateThreat;
2305 result += CheckExtension[pvNode];
2308 result += SingleReplyExtension[pvNode];
2311 result += MateThreatExtension[pvNode];
2314 if (pos.type_of_piece_on(move_from(m)) == PAWN)
2316 Color c = pos.side_to_move();
2317 if (relative_rank(c, move_to(m)) == RANK_7)
2319 result += PawnPushTo7thExtension[pvNode];
2322 if (pos.pawn_is_passed(c, move_to(m)))
2324 result += PassedPawnExtension[pvNode];
2329 if ( captureOrPromotion
2330 && pos.type_of_piece_on(move_to(m)) != PAWN
2331 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
2332 - pos.midgame_value_of_piece_on(move_to(m)) == Value(0))
2333 && !move_is_promotion(m)
2336 result += PawnEndgameExtension[pvNode];
2341 && captureOrPromotion
2342 && pos.type_of_piece_on(move_to(m)) != PAWN
2343 && pos.see_sign(m) >= 0)
2349 return Min(result, OnePly);
2353 // ok_to_do_nullmove() looks at the current position and decides whether
2354 // doing a 'null move' should be allowed. In order to avoid zugzwang
2355 // problems, null moves are not allowed when the side to move has very
2356 // little material left. Currently, the test is a bit too simple: Null
2357 // moves are avoided only when the side to move has only pawns left. It's
2358 // probably a good idea to avoid null moves in at least some more
2359 // complicated endgames, e.g. KQ vs KR. FIXME
2361 bool ok_to_do_nullmove(const Position& pos) {
2363 return pos.non_pawn_material(pos.side_to_move()) != Value(0);
2367 // ok_to_prune() tests whether it is safe to forward prune a move. Only
2368 // non-tactical moves late in the move list close to the leaves are
2369 // candidates for pruning.
2371 bool ok_to_prune(const Position& pos, Move m, Move threat, Depth d) {
2373 assert(move_is_ok(m));
2374 assert(threat == MOVE_NONE || move_is_ok(threat));
2375 assert(!pos.move_is_check(m));
2376 assert(!pos.move_is_capture_or_promotion(m));
2377 assert(!pos.move_is_passed_pawn_push(m));
2378 assert(d >= OnePly);
2380 Square mfrom, mto, tfrom, tto;
2382 mfrom = move_from(m);
2384 tfrom = move_from(threat);
2385 tto = move_to(threat);
2387 // Case 1: Castling moves are never pruned
2388 if (move_is_castle(m))
2391 // Case 2: Don't prune moves which move the threatened piece
2392 if (!PruneEscapeMoves && threat != MOVE_NONE && mfrom == tto)
2395 // Case 3: If the threatened piece has value less than or equal to the
2396 // value of the threatening piece, don't prune move which defend it.
2397 if ( !PruneDefendingMoves
2398 && threat != MOVE_NONE
2399 && pos.move_is_capture(threat)
2400 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
2401 || pos.type_of_piece_on(tfrom) == KING)
2402 && pos.move_attacks_square(m, tto))
2405 // Case 4: Don't prune moves with good history
2406 if (!H.ok_to_prune(pos.piece_on(mfrom), mto, d))
2409 // Case 5: If the moving piece in the threatened move is a slider, don't
2410 // prune safe moves which block its ray.
2411 if ( !PruneBlockingMoves
2412 && threat != MOVE_NONE
2413 && piece_is_slider(pos.piece_on(tfrom))
2414 && bit_is_set(squares_between(tfrom, tto), mto)
2415 && pos.see_sign(m) >= 0)
2422 // ok_to_use_TT() returns true if a transposition table score
2423 // can be used at a given point in search.
2425 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
2427 Value v = value_from_tt(tte->value(), ply);
2429 return ( tte->depth() >= depth
2430 || v >= Max(value_mate_in(100), beta)
2431 || v < Min(value_mated_in(100), beta))
2433 && ( (is_lower_bound(tte->type()) && v >= beta)
2434 || (is_upper_bound(tte->type()) && v < beta));
2438 // update_history() registers a good move that produced a beta-cutoff
2439 // in history and marks as failures all the other moves of that ply.
2441 void update_history(const Position& pos, Move m, Depth depth,
2442 Move movesSearched[], int moveCount) {
2444 H.success(pos.piece_on(move_from(m)), move_to(m), depth);
2446 for (int i = 0; i < moveCount - 1; i++)
2448 assert(m != movesSearched[i]);
2449 if (!pos.move_is_capture_or_promotion(movesSearched[i]))
2450 H.failure(pos.piece_on(move_from(movesSearched[i])), move_to(movesSearched[i]));
2455 // update_killers() add a good move that produced a beta-cutoff
2456 // among the killer moves of that ply.
2458 void update_killers(Move m, SearchStack& ss) {
2460 if (m == ss.killers[0])
2463 for (int i = KILLER_MAX - 1; i > 0; i--)
2464 ss.killers[i] = ss.killers[i - 1];
2470 // fail_high_ply_1() checks if some thread is currently resolving a fail
2471 // high at ply 1 at the node below the first root node. This information
2472 // is used for time managment.
2474 bool fail_high_ply_1() {
2476 for(int i = 0; i < ActiveThreads; i++)
2477 if (Threads[i].failHighPly1)
2484 // current_search_time() returns the number of milliseconds which have passed
2485 // since the beginning of the current search.
2487 int current_search_time() {
2488 return get_system_time() - SearchStartTime;
2492 // nps() computes the current nodes/second count.
2495 int t = current_search_time();
2496 return (t > 0)? int((nodes_searched() * 1000) / t) : 0;
2500 // poll() performs two different functions: It polls for user input, and it
2501 // looks at the time consumed so far and decides if it's time to abort the
2506 static int lastInfoTime;
2507 int t = current_search_time();
2512 // We are line oriented, don't read single chars
2513 std::string command;
2514 if (!std::getline(std::cin, command))
2517 if (command == "quit")
2520 PonderSearch = false;
2524 else if (command == "stop")
2527 PonderSearch = false;
2529 else if (command == "ponderhit")
2532 // Print search information
2536 else if (lastInfoTime > t)
2537 // HACK: Must be a new search where we searched less than
2538 // NodesBetweenPolls nodes during the first second of search.
2541 else if (t - lastInfoTime >= 1000)
2548 if (dbg_show_hit_rate)
2549 dbg_print_hit_rate();
2551 std::cout << "info nodes " << nodes_searched() << " nps " << nps()
2552 << " time " << t << " hashfull " << TT.full() << std::endl;
2553 lock_release(&IOLock);
2554 if (ShowCurrentLine)
2555 Threads[0].printCurrentLine = true;
2557 // Should we stop the search?
2561 bool overTime = t > AbsoluteMaxSearchTime
2562 || (RootMoveNumber == 1 && t > MaxSearchTime + ExtraSearchTime && !FailLow) //FIXME: We are not checking any problem flags, BUG?
2563 || ( !FailHigh && !FailLow && !fail_high_ply_1() && !Problem
2564 && t > 6*(MaxSearchTime + ExtraSearchTime));
2566 if ( (Iteration >= 3 && (!InfiniteSearch && overTime))
2567 || (ExactMaxTime && t >= ExactMaxTime)
2568 || (Iteration >= 3 && MaxNodes && nodes_searched() >= MaxNodes))
2573 // ponderhit() is called when the program is pondering (i.e. thinking while
2574 // it's the opponent's turn to move) in order to let the engine know that
2575 // it correctly predicted the opponent's move.
2579 int t = current_search_time();
2580 PonderSearch = false;
2581 if (Iteration >= 3 &&
2582 (!InfiniteSearch && (StopOnPonderhit ||
2583 t > AbsoluteMaxSearchTime ||
2584 (RootMoveNumber == 1 &&
2585 t > MaxSearchTime + ExtraSearchTime && !FailLow) ||
2586 (!FailHigh && !FailLow && !fail_high_ply_1() && !Problem &&
2587 t > 6*(MaxSearchTime + ExtraSearchTime)))))
2592 // print_current_line() prints the current line of search for a given
2593 // thread. Called when the UCI option UCI_ShowCurrLine is 'true'.
2595 void print_current_line(SearchStack ss[], int ply, int threadID) {
2597 assert(ply >= 0 && ply < PLY_MAX);
2598 assert(threadID >= 0 && threadID < ActiveThreads);
2600 if (!Threads[threadID].idle)
2603 std::cout << "info currline " << (threadID + 1);
2604 for (int p = 0; p < ply; p++)
2605 std::cout << " " << ss[p].currentMove;
2607 std::cout << std::endl;
2608 lock_release(&IOLock);
2610 Threads[threadID].printCurrentLine = false;
2611 if (threadID + 1 < ActiveThreads)
2612 Threads[threadID + 1].printCurrentLine = true;
2616 // init_ss_array() does a fast reset of the first entries of a SearchStack array
2618 void init_ss_array(SearchStack ss[]) {
2620 for (int i = 0; i < 3; i++)
2623 ss[i].initKillers();
2628 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2629 // while the program is pondering. The point is to work around a wrinkle in
2630 // the UCI protocol: When pondering, the engine is not allowed to give a
2631 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2632 // We simply wait here until one of these commands is sent, and return,
2633 // after which the bestmove and pondermove will be printed (in id_loop()).
2635 void wait_for_stop_or_ponderhit() {
2637 std::string command;
2641 if (!std::getline(std::cin, command))
2644 if (command == "quit")
2649 else if (command == "ponderhit" || command == "stop")
2655 // idle_loop() is where the threads are parked when they have no work to do.
2656 // The parameter "waitSp", if non-NULL, is a pointer to an active SplitPoint
2657 // object for which the current thread is the master.
2659 void idle_loop(int threadID, SplitPoint* waitSp) {
2660 assert(threadID >= 0 && threadID < THREAD_MAX);
2662 Threads[threadID].running = true;
2665 if(AllThreadsShouldExit && threadID != 0)
2668 // If we are not thinking, wait for a condition to be signaled instead
2669 // of wasting CPU time polling for work:
2670 while(threadID != 0 && (Idle || threadID >= ActiveThreads)) {
2671 #if !defined(_MSC_VER)
2672 pthread_mutex_lock(&WaitLock);
2673 if(Idle || threadID >= ActiveThreads)
2674 pthread_cond_wait(&WaitCond, &WaitLock);
2675 pthread_mutex_unlock(&WaitLock);
2677 WaitForSingleObject(SitIdleEvent[threadID], INFINITE);
2681 // If this thread has been assigned work, launch a search
2682 if(Threads[threadID].workIsWaiting) {
2683 Threads[threadID].workIsWaiting = false;
2684 if(Threads[threadID].splitPoint->pvNode)
2685 sp_search_pv(Threads[threadID].splitPoint, threadID);
2687 sp_search(Threads[threadID].splitPoint, threadID);
2688 Threads[threadID].idle = true;
2691 // If this thread is the master of a split point and all threads have
2692 // finished their work at this split point, return from the idle loop.
2693 if(waitSp != NULL && waitSp->cpus == 0)
2697 Threads[threadID].running = false;
2701 // init_split_point_stack() is called during program initialization, and
2702 // initializes all split point objects.
2704 void init_split_point_stack() {
2705 for(int i = 0; i < THREAD_MAX; i++)
2706 for(int j = 0; j < MaxActiveSplitPoints; j++) {
2707 SplitPointStack[i][j].parent = NULL;
2708 lock_init(&(SplitPointStack[i][j].lock), NULL);
2713 // destroy_split_point_stack() is called when the program exits, and
2714 // destroys all locks in the precomputed split point objects.
2716 void destroy_split_point_stack() {
2717 for(int i = 0; i < THREAD_MAX; i++)
2718 for(int j = 0; j < MaxActiveSplitPoints; j++)
2719 lock_destroy(&(SplitPointStack[i][j].lock));
2723 // thread_should_stop() checks whether the thread with a given threadID has
2724 // been asked to stop, directly or indirectly. This can happen if a beta
2725 // cutoff has occured in thre thread's currently active split point, or in
2726 // some ancestor of the current split point.
2728 bool thread_should_stop(int threadID) {
2729 assert(threadID >= 0 && threadID < ActiveThreads);
2733 if(Threads[threadID].stop)
2735 if(ActiveThreads <= 2)
2737 for(sp = Threads[threadID].splitPoint; sp != NULL; sp = sp->parent)
2739 Threads[threadID].stop = true;
2746 // thread_is_available() checks whether the thread with threadID "slave" is
2747 // available to help the thread with threadID "master" at a split point. An
2748 // obvious requirement is that "slave" must be idle. With more than two
2749 // threads, this is not by itself sufficient: If "slave" is the master of
2750 // some active split point, it is only available as a slave to the other
2751 // threads which are busy searching the split point at the top of "slave"'s
2752 // split point stack (the "helpful master concept" in YBWC terminology).
2754 bool thread_is_available(int slave, int master) {
2755 assert(slave >= 0 && slave < ActiveThreads);
2756 assert(master >= 0 && master < ActiveThreads);
2757 assert(ActiveThreads > 1);
2759 if(!Threads[slave].idle || slave == master)
2762 if(Threads[slave].activeSplitPoints == 0)
2763 // No active split points means that the thread is available as a slave
2764 // for any other thread.
2767 if(ActiveThreads == 2)
2770 // Apply the "helpful master" concept if possible.
2771 if(SplitPointStack[slave][Threads[slave].activeSplitPoints-1].slaves[master])
2778 // idle_thread_exists() tries to find an idle thread which is available as
2779 // a slave for the thread with threadID "master".
2781 bool idle_thread_exists(int master) {
2782 assert(master >= 0 && master < ActiveThreads);
2783 assert(ActiveThreads > 1);
2785 for(int i = 0; i < ActiveThreads; i++)
2786 if(thread_is_available(i, master))
2792 // split() does the actual work of distributing the work at a node between
2793 // several threads at PV nodes. If it does not succeed in splitting the
2794 // node (because no idle threads are available, or because we have no unused
2795 // split point objects), the function immediately returns false. If
2796 // splitting is possible, a SplitPoint object is initialized with all the
2797 // data that must be copied to the helper threads (the current position and
2798 // search stack, alpha, beta, the search depth, etc.), and we tell our
2799 // helper threads that they have been assigned work. This will cause them
2800 // to instantly leave their idle loops and call sp_search_pv(). When all
2801 // threads have returned from sp_search_pv (or, equivalently, when
2802 // splitPoint->cpus becomes 0), split() returns true.
2804 bool split(const Position& p, SearchStack* sstck, int ply,
2805 Value* alpha, Value* beta, Value* bestValue, const Value futilityValue,
2806 const Value approximateEval, Depth depth, int* moves,
2807 MovePicker* mp, Bitboard dcCandidates, int master, bool pvNode) {
2810 assert(sstck != NULL);
2811 assert(ply >= 0 && ply < PLY_MAX);
2812 assert(*bestValue >= -VALUE_INFINITE && *bestValue <= *alpha);
2813 assert(!pvNode || *alpha < *beta);
2814 assert(*beta <= VALUE_INFINITE);
2815 assert(depth > Depth(0));
2816 assert(master >= 0 && master < ActiveThreads);
2817 assert(ActiveThreads > 1);
2819 SplitPoint* splitPoint;
2824 // If no other thread is available to help us, or if we have too many
2825 // active split points, don't split.
2826 if(!idle_thread_exists(master) ||
2827 Threads[master].activeSplitPoints >= MaxActiveSplitPoints) {
2828 lock_release(&MPLock);
2832 // Pick the next available split point object from the split point stack
2833 splitPoint = SplitPointStack[master] + Threads[master].activeSplitPoints;
2834 Threads[master].activeSplitPoints++;
2836 // Initialize the split point object
2837 splitPoint->parent = Threads[master].splitPoint;
2838 splitPoint->finished = false;
2839 splitPoint->ply = ply;
2840 splitPoint->depth = depth;
2841 splitPoint->alpha = pvNode? *alpha : (*beta - 1);
2842 splitPoint->beta = *beta;
2843 splitPoint->pvNode = pvNode;
2844 splitPoint->dcCandidates = dcCandidates;
2845 splitPoint->bestValue = *bestValue;
2846 splitPoint->futilityValue = futilityValue;
2847 splitPoint->approximateEval = approximateEval;
2848 splitPoint->master = master;
2849 splitPoint->mp = mp;
2850 splitPoint->moves = *moves;
2851 splitPoint->cpus = 1;
2852 splitPoint->pos.copy(p);
2853 splitPoint->parentSstack = sstck;
2854 for(i = 0; i < ActiveThreads; i++)
2855 splitPoint->slaves[i] = 0;
2857 // Copy the current position and the search stack to the master thread
2858 memcpy(splitPoint->sstack[master], sstck, (ply+1)*sizeof(SearchStack));
2859 Threads[master].splitPoint = splitPoint;
2861 // Make copies of the current position and search stack for each thread
2862 for(i = 0; i < ActiveThreads && splitPoint->cpus < MaxThreadsPerSplitPoint;
2864 if(thread_is_available(i, master)) {
2865 memcpy(splitPoint->sstack[i], sstck, (ply+1)*sizeof(SearchStack));
2866 Threads[i].splitPoint = splitPoint;
2867 splitPoint->slaves[i] = 1;
2871 // Tell the threads that they have work to do. This will make them leave
2873 for(i = 0; i < ActiveThreads; i++)
2874 if(i == master || splitPoint->slaves[i]) {
2875 Threads[i].workIsWaiting = true;
2876 Threads[i].idle = false;
2877 Threads[i].stop = false;
2880 lock_release(&MPLock);
2882 // Everything is set up. The master thread enters the idle loop, from
2883 // which it will instantly launch a search, because its workIsWaiting
2884 // slot is 'true'. We send the split point as a second parameter to the
2885 // idle loop, which means that the main thread will return from the idle
2886 // loop when all threads have finished their work at this split point
2887 // (i.e. when // splitPoint->cpus == 0).
2888 idle_loop(master, splitPoint);
2890 // We have returned from the idle loop, which means that all threads are
2891 // finished. Update alpha, beta and bestvalue, and return.
2893 if(pvNode) *alpha = splitPoint->alpha;
2894 *beta = splitPoint->beta;
2895 *bestValue = splitPoint->bestValue;
2896 Threads[master].stop = false;
2897 Threads[master].idle = false;
2898 Threads[master].activeSplitPoints--;
2899 Threads[master].splitPoint = splitPoint->parent;
2900 lock_release(&MPLock);
2906 // wake_sleeping_threads() wakes up all sleeping threads when it is time
2907 // to start a new search from the root.
2909 void wake_sleeping_threads() {
2910 if(ActiveThreads > 1) {
2911 for(int i = 1; i < ActiveThreads; i++) {
2912 Threads[i].idle = true;
2913 Threads[i].workIsWaiting = false;
2915 #if !defined(_MSC_VER)
2916 pthread_mutex_lock(&WaitLock);
2917 pthread_cond_broadcast(&WaitCond);
2918 pthread_mutex_unlock(&WaitLock);
2920 for(int i = 1; i < THREAD_MAX; i++)
2921 SetEvent(SitIdleEvent[i]);
2927 // init_thread() is the function which is called when a new thread is
2928 // launched. It simply calls the idle_loop() function with the supplied
2929 // threadID. There are two versions of this function; one for POSIX threads
2930 // and one for Windows threads.
2932 #if !defined(_MSC_VER)
2934 void *init_thread(void *threadID) {
2935 idle_loop(*(int *)threadID, NULL);
2941 DWORD WINAPI init_thread(LPVOID threadID) {
2942 idle_loop(*(int *)threadID, NULL);