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 = pos.discovered_check_candidates(pos.side_to_move());
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);
1065 Move movesSearched[256];
1068 Bitboard dcCandidates;
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 dcCandidates = ci.dc;
1119 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
1121 // Loop through all legal moves until no moves remain or a beta cutoff
1123 while ( alpha < beta
1124 && (move = mp.get_next_move()) != MOVE_NONE
1125 && !thread_should_stop(threadID))
1127 assert(move_is_ok(move));
1129 singleReply = (isCheck && mp.number_of_evasions() == 1);
1130 moveIsCheck = pos.move_is_check(move, dcCandidates);
1131 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1133 movesSearched[moveCount++] = ss[ply].currentMove = move;
1135 // Decide the new search depth
1136 ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, singleReply, mateThreat, &dangerous);
1137 newDepth = depth - OnePly + ext;
1139 // Make and search the move
1140 pos.do_move(move, st, dcCandidates);
1142 if (moveCount == 1) // The first move in list is the PV
1143 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1146 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1147 // if the move fails high will be re-searched at full depth.
1148 if ( depth >= 3*OnePly
1149 && moveCount >= LMRPVMoves
1151 && !captureOrPromotion
1152 && !move_is_castle(move)
1153 && !move_is_killer(move, ss[ply]))
1155 ss[ply].reduction = OnePly;
1156 value = -search(pos, ss, -alpha, newDepth-OnePly, ply+1, true, threadID);
1159 value = alpha + 1; // Just to trigger next condition
1161 if (value > alpha) // Go with full depth non-pv search
1163 ss[ply].reduction = Depth(0);
1164 value = -search(pos, ss, -alpha, newDepth, ply+1, true, threadID);
1165 if (value > alpha && value < beta)
1167 // When the search fails high at ply 1 while searching the first
1168 // move at the root, set the flag failHighPly1. This is used for
1169 // time managment: We don't want to stop the search early in
1170 // such cases, because resolving the fail high at ply 1 could
1171 // result in a big drop in score at the root.
1172 if (ply == 1 && RootMoveNumber == 1)
1173 Threads[threadID].failHighPly1 = true;
1175 // A fail high occurred. Re-search at full window (pv search)
1176 value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
1177 Threads[threadID].failHighPly1 = false;
1181 pos.undo_move(move);
1183 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1186 if (value > bestValue)
1193 if (value == value_mate_in(ply + 1))
1194 ss[ply].mateKiller = move;
1196 // If we are at ply 1, and we are searching the first root move at
1197 // ply 0, set the 'Problem' variable if the score has dropped a lot
1198 // (from the computer's point of view) since the previous iteration.
1201 && -value <= IterationInfo[Iteration-1].value - ProblemMargin)
1206 if ( ActiveThreads > 1
1208 && depth >= MinimumSplitDepth
1210 && idle_thread_exists(threadID)
1212 && !thread_should_stop(threadID)
1213 && split(pos, ss, ply, &alpha, &beta, &bestValue, VALUE_NONE, VALUE_NONE, depth,
1214 &moveCount, &mp, dcCandidates, threadID, true))
1218 // All legal moves have been searched. A special case: If there were
1219 // no legal moves, it must be mate or stalemate.
1221 return (isCheck ? value_mated_in(ply) : VALUE_DRAW);
1223 // If the search is not aborted, update the transposition table,
1224 // history counters, and killer moves.
1225 if (AbortSearch || thread_should_stop(threadID))
1228 if (bestValue <= oldAlpha)
1229 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1231 else if (bestValue >= beta)
1233 BetaCounter.add(pos.side_to_move(), depth, threadID);
1234 move = ss[ply].pv[ply];
1235 if (!pos.move_is_capture_or_promotion(move))
1237 update_history(pos, move, depth, movesSearched, moveCount);
1238 update_killers(move, ss[ply]);
1240 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, move);
1243 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EXACT, depth, ss[ply].pv[ply]);
1249 // search() is the search function for zero-width nodes.
1251 Value search(Position& pos, SearchStack ss[], Value beta, Depth depth,
1252 int ply, bool allowNullmove, int threadID) {
1254 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1255 assert(ply >= 0 && ply < PLY_MAX);
1256 assert(threadID >= 0 && threadID < ActiveThreads);
1258 Move movesSearched[256];
1261 Bitboard dcCandidates;
1264 Depth ext, newDepth;
1265 Value approximateEval, nullValue, value, futilityValue;
1266 bool isCheck, useFutilityPruning, singleReply, moveIsCheck, captureOrPromotion, dangerous;
1267 bool mateThreat = false;
1269 Value bestValue = -VALUE_INFINITE;
1272 return qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1274 // Initialize, and make an early exit in case of an aborted search,
1275 // an instant draw, maximum ply reached, etc.
1276 init_node(ss, ply, threadID);
1278 // After init_node() that calls poll()
1279 if (AbortSearch || thread_should_stop(threadID))
1285 if (ply >= PLY_MAX - 1)
1286 return pos.is_check() ? quick_evaluate(pos) : evaluate(pos, ei, threadID);
1288 // Mate distance pruning
1289 if (value_mated_in(ply) >= beta)
1292 if (value_mate_in(ply + 1) < beta)
1295 // Transposition table lookup
1296 tte = TT.retrieve(pos.get_key());
1297 ttMove = (tte ? tte->move() : MOVE_NONE);
1299 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1301 ss[ply].currentMove = ttMove; // can be MOVE_NONE
1302 return value_from_tt(tte->value(), ply);
1305 approximateEval = quick_evaluate(pos);
1306 isCheck = pos.is_check();
1312 && !value_is_mate(beta)
1313 && ok_to_do_nullmove(pos)
1314 && approximateEval >= beta - NullMoveMargin)
1316 ss[ply].currentMove = MOVE_NULL;
1318 pos.do_null_move(st);
1319 int R = (depth >= 5 * OnePly ? 4 : 3); // Null move dynamic reduction
1321 nullValue = -search(pos, ss, -(beta-1), depth-R*OnePly, ply+1, false, threadID);
1323 pos.undo_null_move();
1325 if (nullValue >= beta)
1327 if (depth < 6 * OnePly)
1330 // Do zugzwang verification search
1331 Value v = search(pos, ss, beta, depth-5*OnePly, ply, false, threadID);
1335 // The null move failed low, which means that we may be faced with
1336 // some kind of threat. If the previous move was reduced, check if
1337 // the move that refuted the null move was somehow connected to the
1338 // move which was reduced. If a connection is found, return a fail
1339 // low score (which will cause the reduced move to fail high in the
1340 // parent node, which will trigger a re-search with full depth).
1341 if (nullValue == value_mated_in(ply + 2))
1344 ss[ply].threatMove = ss[ply + 1].currentMove;
1345 if ( depth < ThreatDepth
1346 && ss[ply - 1].reduction
1347 && connected_moves(pos, ss[ply - 1].currentMove, ss[ply].threatMove))
1351 // Null move search not allowed, try razoring
1352 else if ( !value_is_mate(beta)
1353 && depth < RazorDepth
1354 && approximateEval < beta - RazorApprMargins[int(depth) - 2]
1355 && ss[ply - 1].currentMove != MOVE_NULL
1356 && ttMove == MOVE_NONE
1357 && !pos.has_pawn_on_7th(pos.side_to_move()))
1359 Value v = qsearch(pos, ss, beta-1, beta, Depth(0), ply, threadID);
1360 if (v < beta - RazorMargins[int(depth) - 2])
1364 // Go with internal iterative deepening if we don't have a TT move
1365 if (UseIIDAtNonPVNodes && ttMove == MOVE_NONE && depth >= 8*OnePly &&
1366 evaluate(pos, ei, threadID) >= beta - IIDMargin)
1368 search(pos, ss, beta, Min(depth/2, depth-2*OnePly), ply, false, threadID);
1369 ttMove = ss[ply].pv[ply];
1372 // Initialize a MovePicker object for the current position, and prepare
1373 // to search all moves.
1374 MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
1376 dcCandidates = ci.dc;
1377 futilityValue = VALUE_NONE;
1378 useFutilityPruning = depth < SelectiveDepth && !isCheck;
1380 // Avoid calling evaluate() if we already have the score in TT
1381 if (tte && (tte->type() & VALUE_TYPE_EVAL))
1382 futilityValue = value_from_tt(tte->value(), ply) + FutilityMargins[int(depth) - 2];
1384 // Loop through all legal moves until no moves remain or a beta cutoff
1386 while ( bestValue < beta
1387 && (move = mp.get_next_move()) != MOVE_NONE
1388 && !thread_should_stop(threadID))
1390 assert(move_is_ok(move));
1392 singleReply = (isCheck && mp.number_of_evasions() == 1);
1393 moveIsCheck = pos.move_is_check(move, dcCandidates);
1394 captureOrPromotion = pos.move_is_capture_or_promotion(move);
1396 movesSearched[moveCount++] = ss[ply].currentMove = move;
1398 // Decide the new search depth
1399 ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, singleReply, mateThreat, &dangerous);
1400 newDepth = depth - OnePly + ext;
1403 if ( useFutilityPruning
1405 && !captureOrPromotion)
1407 // History pruning. See ok_to_prune() definition
1408 if ( moveCount >= 2 + int(depth)
1409 && ok_to_prune(pos, move, ss[ply].threatMove, depth)
1410 && bestValue > value_mated_in(PLY_MAX))
1413 // Value based pruning
1414 if (approximateEval < beta)
1416 if (futilityValue == VALUE_NONE)
1417 futilityValue = evaluate(pos, ei, threadID)
1418 + FutilityMargins[int(depth) - 2];
1420 if (futilityValue < beta)
1422 if (futilityValue > bestValue)
1423 bestValue = futilityValue;
1429 // Make and search the move
1430 pos.do_move(move, st, dcCandidates);
1432 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1433 // if the move fails high will be re-searched at full depth.
1434 if ( depth >= 3*OnePly
1435 && moveCount >= LMRNonPVMoves
1437 && !captureOrPromotion
1438 && !move_is_castle(move)
1439 && !move_is_killer(move, ss[ply]))
1441 ss[ply].reduction = OnePly;
1442 value = -search(pos, ss, -(beta-1), newDepth-OnePly, ply+1, true, threadID);
1445 value = beta; // Just to trigger next condition
1447 if (value >= beta) // Go with full depth non-pv search
1449 ss[ply].reduction = Depth(0);
1450 value = -search(pos, ss, -(beta-1), newDepth, ply+1, true, threadID);
1452 pos.undo_move(move);
1454 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1457 if (value > bestValue)
1463 if (value == value_mate_in(ply + 1))
1464 ss[ply].mateKiller = move;
1468 if ( ActiveThreads > 1
1470 && depth >= MinimumSplitDepth
1472 && idle_thread_exists(threadID)
1474 && !thread_should_stop(threadID)
1475 && split(pos, ss, ply, &beta, &beta, &bestValue, futilityValue, approximateEval, depth, &moveCount,
1476 &mp, dcCandidates, threadID, false))
1480 // All legal moves have been searched. A special case: If there were
1481 // no legal moves, it must be mate or stalemate.
1483 return (pos.is_check() ? value_mated_in(ply) : VALUE_DRAW);
1485 // If the search is not aborted, update the transposition table,
1486 // history counters, and killer moves.
1487 if (AbortSearch || thread_should_stop(threadID))
1490 if (bestValue < beta)
1491 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_UPPER, depth, MOVE_NONE);
1494 BetaCounter.add(pos.side_to_move(), depth, threadID);
1495 move = ss[ply].pv[ply];
1496 if (!pos.move_is_capture_or_promotion(move))
1498 update_history(pos, move, depth, movesSearched, moveCount);
1499 update_killers(move, ss[ply]);
1501 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, move);
1504 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1510 // qsearch() is the quiescence search function, which is called by the main
1511 // search function when the remaining depth is zero (or, to be more precise,
1512 // less than OnePly).
1514 Value qsearch(Position& pos, SearchStack ss[], Value alpha, Value beta,
1515 Depth depth, int ply, int threadID) {
1517 assert(alpha >= -VALUE_INFINITE && alpha <= VALUE_INFINITE);
1518 assert(beta >= -VALUE_INFINITE && beta <= VALUE_INFINITE);
1520 assert(ply >= 0 && ply < PLY_MAX);
1521 assert(threadID >= 0 && threadID < ActiveThreads);
1525 Bitboard dcCandidates;
1527 Value staticValue, bestValue, value, futilityValue;
1528 bool isCheck, enoughMaterial;
1529 const TTEntry* tte = NULL;
1531 bool pvNode = (beta - alpha != 1);
1533 // Initialize, and make an early exit in case of an aborted search,
1534 // an instant draw, maximum ply reached, etc.
1535 init_node(ss, ply, threadID);
1537 // After init_node() that calls poll()
1538 if (AbortSearch || thread_should_stop(threadID))
1544 // Transposition table lookup, only when not in PV
1547 tte = TT.retrieve(pos.get_key());
1548 if (tte && ok_to_use_TT(tte, depth, beta, ply))
1550 assert(tte->type() != VALUE_TYPE_EVAL);
1552 return value_from_tt(tte->value(), ply);
1555 ttMove = (tte ? tte->move() : MOVE_NONE);
1557 // Evaluate the position statically
1558 isCheck = pos.is_check();
1559 ei.futilityMargin = Value(0); // Manually initialize futilityMargin
1562 staticValue = -VALUE_INFINITE;
1564 else if (tte && (tte->type() & VALUE_TYPE_EVAL))
1566 // Use the cached evaluation score if possible
1567 assert(ei.futilityMargin == Value(0));
1569 staticValue = tte->value();
1572 staticValue = evaluate(pos, ei, threadID);
1574 if (ply >= PLY_MAX - 1)
1575 return pos.is_check() ? quick_evaluate(pos) : evaluate(pos, ei, threadID);
1577 // Initialize "stand pat score", and return it immediately if it is
1579 bestValue = staticValue;
1581 if (bestValue >= beta)
1583 // Store the score to avoid a future costly evaluation() call
1584 if (!isCheck && !tte && ei.futilityMargin == 0)
1585 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_EV_LO, Depth(-127*OnePly), MOVE_NONE);
1590 if (bestValue > alpha)
1593 // Initialize a MovePicker object for the current position, and prepare
1594 // to search the moves. Because the depth is <= 0 here, only captures,
1595 // queen promotions and checks (only if depth == 0) will be generated.
1596 MovePicker mp = MovePicker(pos, ttMove, depth, H);
1598 dcCandidates = ci.dc;
1599 enoughMaterial = pos.non_pawn_material(pos.side_to_move()) > RookValueMidgame;
1601 // Loop through the moves until no moves remain or a beta cutoff
1603 while ( alpha < beta
1604 && (move = mp.get_next_move()) != MOVE_NONE)
1606 assert(move_is_ok(move));
1609 ss[ply].currentMove = move;
1615 && !move_is_promotion(move)
1616 && !pos.move_is_check(move, dcCandidates)
1617 && !pos.move_is_passed_pawn_push(move))
1619 futilityValue = staticValue
1620 + Max(pos.midgame_value_of_piece_on(move_to(move)),
1621 pos.endgame_value_of_piece_on(move_to(move)))
1622 + (move_is_ep(move) ? PawnValueEndgame : Value(0))
1624 + ei.futilityMargin;
1626 if (futilityValue < alpha)
1628 if (futilityValue > bestValue)
1629 bestValue = futilityValue;
1634 // Don't search captures and checks with negative SEE values
1637 && !move_is_promotion(move)
1638 && pos.see_sign(move) < 0)
1641 // Make and search the move
1642 pos.do_move(move, st, dcCandidates);
1643 value = -qsearch(pos, ss, -beta, -alpha, depth-OnePly, ply+1, threadID);
1644 pos.undo_move(move);
1646 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1649 if (value > bestValue)
1660 // All legal moves have been searched. A special case: If we're in check
1661 // and no legal moves were found, it is checkmate.
1662 if (!moveCount && pos.is_check()) // Mate!
1663 return value_mated_in(ply);
1665 assert(bestValue > -VALUE_INFINITE && bestValue < VALUE_INFINITE);
1667 // Update transposition table
1668 move = ss[ply].pv[ply];
1671 // If bestValue isn't changed it means it is still the static evaluation of
1672 // the node, so keep this info to avoid a future costly evaluation() call.
1673 ValueType type = (bestValue == staticValue && !ei.futilityMargin ? VALUE_TYPE_EV_UP : VALUE_TYPE_UPPER);
1674 Depth d = (depth == Depth(0) ? Depth(0) : Depth(-1));
1676 if (bestValue < beta)
1677 TT.store(pos.get_key(), value_to_tt(bestValue, ply), type, d, MOVE_NONE);
1679 TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, d, move);
1682 // Update killers only for good check moves
1683 if (alpha >= beta && !pos.move_is_capture_or_promotion(move))
1684 update_killers(move, ss[ply]);
1690 // sp_search() is used to search from a split point. This function is called
1691 // by each thread working at the split point. It is similar to the normal
1692 // search() function, but simpler. Because we have already probed the hash
1693 // table, done a null move search, and searched the first move before
1694 // splitting, we don't have to repeat all this work in sp_search(). We
1695 // also don't need to store anything to the hash table here: This is taken
1696 // care of after we return from the split point.
1698 void sp_search(SplitPoint* sp, int threadID) {
1700 assert(threadID >= 0 && threadID < ActiveThreads);
1701 assert(ActiveThreads > 1);
1703 Position pos = Position(sp->pos);
1704 SearchStack* ss = sp->sstack[threadID];
1707 bool isCheck = pos.is_check();
1708 bool useFutilityPruning = sp->depth < SelectiveDepth
1711 while ( sp->bestValue < sp->beta
1712 && !thread_should_stop(threadID)
1713 && (move = sp->mp->get_next_move(sp->lock)) != MOVE_NONE)
1715 assert(move_is_ok(move));
1717 bool moveIsCheck = pos.move_is_check(move, sp->dcCandidates);
1718 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
1720 lock_grab(&(sp->lock));
1721 int moveCount = ++sp->moves;
1722 lock_release(&(sp->lock));
1724 ss[sp->ply].currentMove = move;
1726 // Decide the new search depth.
1728 Depth ext = extension(pos, move, false, captureOrPromotion, moveIsCheck, false, false, &dangerous);
1729 Depth newDepth = sp->depth - OnePly + ext;
1732 if ( useFutilityPruning
1734 && !captureOrPromotion)
1736 // History pruning. See ok_to_prune() definition
1737 if ( moveCount >= 2 + int(sp->depth)
1738 && ok_to_prune(pos, move, ss[sp->ply].threatMove, sp->depth)
1739 && sp->bestValue > value_mated_in(PLY_MAX))
1742 // Value based pruning
1743 if (sp->approximateEval < sp->beta)
1745 if (sp->futilityValue == VALUE_NONE)
1748 sp->futilityValue = evaluate(pos, ei, threadID)
1749 + FutilityMargins[int(sp->depth) - 2];
1752 if (sp->futilityValue < sp->beta)
1754 if (sp->futilityValue > sp->bestValue) // Less then 1% of cases
1756 lock_grab(&(sp->lock));
1757 if (sp->futilityValue > sp->bestValue)
1758 sp->bestValue = sp->futilityValue;
1759 lock_release(&(sp->lock));
1766 // Make and search the move.
1768 pos.do_move(move, st, sp->dcCandidates);
1770 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1771 // if the move fails high will be re-searched at full depth.
1773 && moveCount >= LMRNonPVMoves
1774 && !captureOrPromotion
1775 && !move_is_castle(move)
1776 && !move_is_killer(move, ss[sp->ply]))
1778 ss[sp->ply].reduction = OnePly;
1779 value = -search(pos, ss, -(sp->beta-1), newDepth - OnePly, sp->ply+1, true, threadID);
1782 value = sp->beta; // Just to trigger next condition
1784 if (value >= sp->beta) // Go with full depth non-pv search
1786 ss[sp->ply].reduction = Depth(0);
1787 value = -search(pos, ss, -(sp->beta - 1), newDepth, sp->ply+1, true, threadID);
1789 pos.undo_move(move);
1791 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1793 if (thread_should_stop(threadID))
1797 if (value > sp->bestValue) // Less then 2% of cases
1799 lock_grab(&(sp->lock));
1800 if (value > sp->bestValue && !thread_should_stop(threadID))
1802 sp->bestValue = value;
1803 if (sp->bestValue >= sp->beta)
1805 sp_update_pv(sp->parentSstack, ss, sp->ply);
1806 for (int i = 0; i < ActiveThreads; i++)
1807 if (i != threadID && (i == sp->master || sp->slaves[i]))
1808 Threads[i].stop = true;
1810 sp->finished = true;
1813 lock_release(&(sp->lock));
1817 lock_grab(&(sp->lock));
1819 // If this is the master thread and we have been asked to stop because of
1820 // a beta cutoff higher up in the tree, stop all slave threads.
1821 if (sp->master == threadID && thread_should_stop(threadID))
1822 for (int i = 0; i < ActiveThreads; i++)
1824 Threads[i].stop = true;
1827 sp->slaves[threadID] = 0;
1829 lock_release(&(sp->lock));
1833 // sp_search_pv() is used to search from a PV split point. This function
1834 // is called by each thread working at the split point. It is similar to
1835 // the normal search_pv() function, but simpler. Because we have already
1836 // probed the hash table and searched the first move before splitting, we
1837 // don't have to repeat all this work in sp_search_pv(). We also don't
1838 // need to store anything to the hash table here: This is taken care of
1839 // after we return from the split point.
1841 void sp_search_pv(SplitPoint* sp, int threadID) {
1843 assert(threadID >= 0 && threadID < ActiveThreads);
1844 assert(ActiveThreads > 1);
1846 Position pos = Position(sp->pos);
1847 SearchStack* ss = sp->sstack[threadID];
1851 while ( sp->alpha < sp->beta
1852 && !thread_should_stop(threadID)
1853 && (move = sp->mp->get_next_move(sp->lock)) != MOVE_NONE)
1855 bool moveIsCheck = pos.move_is_check(move, sp->dcCandidates);
1856 bool captureOrPromotion = pos.move_is_capture_or_promotion(move);
1858 assert(move_is_ok(move));
1860 lock_grab(&(sp->lock));
1861 int moveCount = ++sp->moves;
1862 lock_release(&(sp->lock));
1864 ss[sp->ply].currentMove = move;
1866 // Decide the new search depth.
1868 Depth ext = extension(pos, move, true, captureOrPromotion, moveIsCheck, false, false, &dangerous);
1869 Depth newDepth = sp->depth - OnePly + ext;
1871 // Make and search the move.
1873 pos.do_move(move, st, sp->dcCandidates);
1875 // Try to reduce non-pv search depth by one ply if move seems not problematic,
1876 // if the move fails high will be re-searched at full depth.
1878 && moveCount >= LMRPVMoves
1879 && !captureOrPromotion
1880 && !move_is_castle(move)
1881 && !move_is_killer(move, ss[sp->ply]))
1883 ss[sp->ply].reduction = OnePly;
1884 value = -search(pos, ss, -sp->alpha, newDepth - OnePly, sp->ply+1, true, threadID);
1887 value = sp->alpha + 1; // Just to trigger next condition
1889 if (value > sp->alpha) // Go with full depth non-pv search
1891 ss[sp->ply].reduction = Depth(0);
1892 value = -search(pos, ss, -sp->alpha, newDepth, sp->ply+1, true, threadID);
1894 if (value > sp->alpha && value < sp->beta)
1896 // When the search fails high at ply 1 while searching the first
1897 // move at the root, set the flag failHighPly1. This is used for
1898 // time managment: We don't want to stop the search early in
1899 // such cases, because resolving the fail high at ply 1 could
1900 // result in a big drop in score at the root.
1901 if (sp->ply == 1 && RootMoveNumber == 1)
1902 Threads[threadID].failHighPly1 = true;
1904 value = -search_pv(pos, ss, -sp->beta, -sp->alpha, newDepth, sp->ply+1, threadID);
1905 Threads[threadID].failHighPly1 = false;
1908 pos.undo_move(move);
1910 assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
1912 if (thread_should_stop(threadID))
1916 lock_grab(&(sp->lock));
1917 if (value > sp->bestValue && !thread_should_stop(threadID))
1919 sp->bestValue = value;
1920 if (value > sp->alpha)
1923 sp_update_pv(sp->parentSstack, ss, sp->ply);
1924 if (value == value_mate_in(sp->ply + 1))
1925 ss[sp->ply].mateKiller = move;
1927 if (value >= sp->beta)
1929 for (int i = 0; i < ActiveThreads; i++)
1930 if (i != threadID && (i == sp->master || sp->slaves[i]))
1931 Threads[i].stop = true;
1933 sp->finished = true;
1936 // If we are at ply 1, and we are searching the first root move at
1937 // ply 0, set the 'Problem' variable if the score has dropped a lot
1938 // (from the computer's point of view) since the previous iteration.
1941 && -value <= IterationInfo[Iteration-1].value - ProblemMargin)
1944 lock_release(&(sp->lock));
1947 lock_grab(&(sp->lock));
1949 // If this is the master thread and we have been asked to stop because of
1950 // a beta cutoff higher up in the tree, stop all slave threads.
1951 if (sp->master == threadID && thread_should_stop(threadID))
1952 for (int i = 0; i < ActiveThreads; i++)
1954 Threads[i].stop = true;
1957 sp->slaves[threadID] = 0;
1959 lock_release(&(sp->lock));
1962 /// The BetaCounterType class
1964 BetaCounterType::BetaCounterType() { clear(); }
1966 void BetaCounterType::clear() {
1968 for (int i = 0; i < THREAD_MAX; i++)
1969 Threads[i].betaCutOffs[WHITE] = Threads[i].betaCutOffs[BLACK] = 0ULL;
1972 void BetaCounterType::add(Color us, Depth d, int threadID) {
1974 // Weighted count based on depth
1975 Threads[threadID].betaCutOffs[us] += unsigned(d);
1978 void BetaCounterType::read(Color us, int64_t& our, int64_t& their) {
1981 for (int i = 0; i < THREAD_MAX; i++)
1983 our += Threads[i].betaCutOffs[us];
1984 their += Threads[i].betaCutOffs[opposite_color(us)];
1989 /// The RootMove class
1993 RootMove::RootMove() {
1994 nodes = cumulativeNodes = ourBeta = theirBeta = 0ULL;
1997 // RootMove::operator<() is the comparison function used when
1998 // sorting the moves. A move m1 is considered to be better
1999 // than a move m2 if it has a higher score, or if the moves
2000 // have equal score but m1 has the higher node count.
2002 bool RootMove::operator<(const RootMove& m) {
2004 if (score != m.score)
2005 return (score < m.score);
2007 return theirBeta <= m.theirBeta;
2010 /// The RootMoveList class
2014 RootMoveList::RootMoveList(Position& pos, Move searchMoves[]) : count(0) {
2016 MoveStack mlist[MaxRootMoves];
2017 bool includeAllMoves = (searchMoves[0] == MOVE_NONE);
2019 // Generate all legal moves
2020 MoveStack* last = generate_moves(pos, mlist);
2022 // Add each move to the moves[] array
2023 for (MoveStack* cur = mlist; cur != last; cur++)
2025 bool includeMove = includeAllMoves;
2027 for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
2028 includeMove = (searchMoves[k] == cur->move);
2033 // Find a quick score for the move
2035 SearchStack ss[PLY_MAX_PLUS_2];
2038 moves[count].move = cur->move;
2039 pos.do_move(moves[count].move, st);
2040 moves[count].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE, Depth(0), 1, 0);
2041 pos.undo_move(moves[count].move);
2042 moves[count].pv[0] = moves[count].move;
2043 moves[count].pv[1] = MOVE_NONE; // FIXME
2050 // Simple accessor methods for the RootMoveList class
2052 inline Move RootMoveList::get_move(int moveNum) const {
2053 return moves[moveNum].move;
2056 inline Value RootMoveList::get_move_score(int moveNum) const {
2057 return moves[moveNum].score;
2060 inline void RootMoveList::set_move_score(int moveNum, Value score) {
2061 moves[moveNum].score = score;
2064 inline void RootMoveList::set_move_nodes(int moveNum, int64_t nodes) {
2065 moves[moveNum].nodes = nodes;
2066 moves[moveNum].cumulativeNodes += nodes;
2069 inline void RootMoveList::set_beta_counters(int moveNum, int64_t our, int64_t their) {
2070 moves[moveNum].ourBeta = our;
2071 moves[moveNum].theirBeta = their;
2074 void RootMoveList::set_move_pv(int moveNum, const Move pv[]) {
2076 for(j = 0; pv[j] != MOVE_NONE; j++)
2077 moves[moveNum].pv[j] = pv[j];
2078 moves[moveNum].pv[j] = MOVE_NONE;
2081 inline Move RootMoveList::get_move_pv(int moveNum, int i) const {
2082 return moves[moveNum].pv[i];
2085 inline int64_t RootMoveList::get_move_cumulative_nodes(int moveNum) const {
2086 return moves[moveNum].cumulativeNodes;
2089 inline int RootMoveList::move_count() const {
2094 // RootMoveList::scan_for_easy_move() is called at the end of the first
2095 // iteration, and is used to detect an "easy move", i.e. a move which appears
2096 // to be much bester than all the rest. If an easy move is found, the move
2097 // is returned, otherwise the function returns MOVE_NONE. It is very
2098 // important that this function is called at the right moment: The code
2099 // assumes that the first iteration has been completed and the moves have
2100 // been sorted. This is done in RootMoveList c'tor.
2102 Move RootMoveList::scan_for_easy_move() const {
2109 // moves are sorted so just consider the best and the second one
2110 if (get_move_score(0) > get_move_score(1) + EasyMoveMargin)
2116 // RootMoveList::sort() sorts the root move list at the beginning of a new
2119 inline void RootMoveList::sort() {
2121 sort_multipv(count - 1); // all items
2125 // RootMoveList::sort_multipv() sorts the first few moves in the root move
2126 // list by their scores and depths. It is used to order the different PVs
2127 // correctly in MultiPV mode.
2129 void RootMoveList::sort_multipv(int n) {
2131 for (int i = 1; i <= n; i++)
2133 RootMove rm = moves[i];
2135 for (j = i; j > 0 && moves[j-1] < rm; j--)
2136 moves[j] = moves[j-1];
2142 // init_node() is called at the beginning of all the search functions
2143 // (search(), search_pv(), qsearch(), and so on) and initializes the search
2144 // stack object corresponding to the current node. Once every
2145 // NodesBetweenPolls nodes, init_node() also calls poll(), which polls
2146 // for user input and checks whether it is time to stop the search.
2148 void init_node(SearchStack ss[], int ply, int threadID) {
2150 assert(ply >= 0 && ply < PLY_MAX);
2151 assert(threadID >= 0 && threadID < ActiveThreads);
2153 Threads[threadID].nodes++;
2158 if (NodesSincePoll >= NodesBetweenPolls)
2165 ss[ply+2].initKillers();
2167 if (Threads[threadID].printCurrentLine)
2168 print_current_line(ss, ply, threadID);
2172 // update_pv() is called whenever a search returns a value > alpha. It
2173 // updates the PV in the SearchStack object corresponding to the current
2176 void update_pv(SearchStack ss[], int ply) {
2177 assert(ply >= 0 && ply < PLY_MAX);
2179 ss[ply].pv[ply] = ss[ply].currentMove;
2181 for(p = ply + 1; ss[ply+1].pv[p] != MOVE_NONE; p++)
2182 ss[ply].pv[p] = ss[ply+1].pv[p];
2183 ss[ply].pv[p] = MOVE_NONE;
2187 // sp_update_pv() is a variant of update_pv for use at split points. The
2188 // difference between the two functions is that sp_update_pv also updates
2189 // the PV at the parent node.
2191 void sp_update_pv(SearchStack* pss, SearchStack ss[], int ply) {
2192 assert(ply >= 0 && ply < PLY_MAX);
2194 ss[ply].pv[ply] = pss[ply].pv[ply] = ss[ply].currentMove;
2196 for(p = ply + 1; ss[ply+1].pv[p] != MOVE_NONE; p++)
2197 ss[ply].pv[p] = pss[ply].pv[p] = ss[ply+1].pv[p];
2198 ss[ply].pv[p] = pss[ply].pv[p] = MOVE_NONE;
2202 // connected_moves() tests whether two moves are 'connected' in the sense
2203 // that the first move somehow made the second move possible (for instance
2204 // if the moving piece is the same in both moves). The first move is
2205 // assumed to be the move that was made to reach the current position, while
2206 // the second move is assumed to be a move from the current position.
2208 bool connected_moves(const Position& pos, Move m1, Move m2) {
2210 Square f1, t1, f2, t2;
2213 assert(move_is_ok(m1));
2214 assert(move_is_ok(m2));
2216 if (m2 == MOVE_NONE)
2219 // Case 1: The moving piece is the same in both moves
2225 // Case 2: The destination square for m2 was vacated by m1
2231 // Case 3: Moving through the vacated square
2232 if ( piece_is_slider(pos.piece_on(f2))
2233 && bit_is_set(squares_between(f2, t2), f1))
2236 // Case 4: The destination square for m2 is attacked by the moving piece in m1
2237 p = pos.piece_on(t1);
2238 if (bit_is_set(pos.attacks_from(p, t1), t2))
2241 // Case 5: Discovered check, checking piece is the piece moved in m1
2242 if ( piece_is_slider(p)
2243 && bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), f2)
2244 && !bit_is_set(squares_between(t1, pos.king_square(pos.side_to_move())), t2))
2246 Bitboard occ = pos.occupied_squares();
2247 Color us = pos.side_to_move();
2248 Square ksq = pos.king_square(us);
2249 clear_bit(&occ, f2);
2250 if (type_of_piece(p) == BISHOP)
2252 if (bit_is_set(bishop_attacks_bb(ksq, occ), t1))
2255 else if (type_of_piece(p) == ROOK)
2257 if (bit_is_set(rook_attacks_bb(ksq, occ), t1))
2262 assert(type_of_piece(p) == QUEEN);
2263 if (bit_is_set(queen_attacks_bb(ksq, occ), t1))
2271 // value_is_mate() checks if the given value is a mate one
2272 // eventually compensated for the ply.
2274 bool value_is_mate(Value value) {
2276 assert(abs(value) <= VALUE_INFINITE);
2278 return value <= value_mated_in(PLY_MAX)
2279 || value >= value_mate_in(PLY_MAX);
2283 // move_is_killer() checks if the given move is among the
2284 // killer moves of that ply.
2286 bool move_is_killer(Move m, const SearchStack& ss) {
2288 const Move* k = ss.killers;
2289 for (int i = 0; i < KILLER_MAX; i++, k++)
2297 // extension() decides whether a move should be searched with normal depth,
2298 // or with extended depth. Certain classes of moves (checking moves, in
2299 // particular) are searched with bigger depth than ordinary moves and in
2300 // any case are marked as 'dangerous'. Note that also if a move is not
2301 // extended, as example because the corresponding UCI option is set to zero,
2302 // the move is marked as 'dangerous' so, at least, we avoid to prune it.
2304 Depth extension(const Position& pos, Move m, bool pvNode, bool captureOrPromotion,
2305 bool check, bool singleReply, bool mateThreat, bool* dangerous) {
2307 assert(m != MOVE_NONE);
2309 Depth result = Depth(0);
2310 *dangerous = check | singleReply | mateThreat;
2315 result += CheckExtension[pvNode];
2318 result += SingleReplyExtension[pvNode];
2321 result += MateThreatExtension[pvNode];
2324 if (pos.type_of_piece_on(move_from(m)) == PAWN)
2326 Color c = pos.side_to_move();
2327 if (relative_rank(c, move_to(m)) == RANK_7)
2329 result += PawnPushTo7thExtension[pvNode];
2332 if (pos.pawn_is_passed(c, move_to(m)))
2334 result += PassedPawnExtension[pvNode];
2339 if ( captureOrPromotion
2340 && pos.type_of_piece_on(move_to(m)) != PAWN
2341 && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK)
2342 - pos.midgame_value_of_piece_on(move_to(m)) == Value(0))
2343 && !move_is_promotion(m)
2346 result += PawnEndgameExtension[pvNode];
2351 && captureOrPromotion
2352 && pos.type_of_piece_on(move_to(m)) != PAWN
2353 && pos.see_sign(m) >= 0)
2359 return Min(result, OnePly);
2363 // ok_to_do_nullmove() looks at the current position and decides whether
2364 // doing a 'null move' should be allowed. In order to avoid zugzwang
2365 // problems, null moves are not allowed when the side to move has very
2366 // little material left. Currently, the test is a bit too simple: Null
2367 // moves are avoided only when the side to move has only pawns left. It's
2368 // probably a good idea to avoid null moves in at least some more
2369 // complicated endgames, e.g. KQ vs KR. FIXME
2371 bool ok_to_do_nullmove(const Position& pos) {
2373 return pos.non_pawn_material(pos.side_to_move()) != Value(0);
2377 // ok_to_prune() tests whether it is safe to forward prune a move. Only
2378 // non-tactical moves late in the move list close to the leaves are
2379 // candidates for pruning.
2381 bool ok_to_prune(const Position& pos, Move m, Move threat, Depth d) {
2383 assert(move_is_ok(m));
2384 assert(threat == MOVE_NONE || move_is_ok(threat));
2385 assert(!pos.move_is_check(m));
2386 assert(!pos.move_is_capture_or_promotion(m));
2387 assert(!pos.move_is_passed_pawn_push(m));
2388 assert(d >= OnePly);
2390 Square mfrom, mto, tfrom, tto;
2392 mfrom = move_from(m);
2394 tfrom = move_from(threat);
2395 tto = move_to(threat);
2397 // Case 1: Castling moves are never pruned
2398 if (move_is_castle(m))
2401 // Case 2: Don't prune moves which move the threatened piece
2402 if (!PruneEscapeMoves && threat != MOVE_NONE && mfrom == tto)
2405 // Case 3: If the threatened piece has value less than or equal to the
2406 // value of the threatening piece, don't prune move which defend it.
2407 if ( !PruneDefendingMoves
2408 && threat != MOVE_NONE
2409 && pos.move_is_capture(threat)
2410 && ( pos.midgame_value_of_piece_on(tfrom) >= pos.midgame_value_of_piece_on(tto)
2411 || pos.type_of_piece_on(tfrom) == KING)
2412 && pos.move_attacks_square(m, tto))
2415 // Case 4: Don't prune moves with good history
2416 if (!H.ok_to_prune(pos.piece_on(mfrom), mto, d))
2419 // Case 5: If the moving piece in the threatened move is a slider, don't
2420 // prune safe moves which block its ray.
2421 if ( !PruneBlockingMoves
2422 && threat != MOVE_NONE
2423 && piece_is_slider(pos.piece_on(tfrom))
2424 && bit_is_set(squares_between(tfrom, tto), mto)
2425 && pos.see_sign(m) >= 0)
2432 // ok_to_use_TT() returns true if a transposition table score
2433 // can be used at a given point in search.
2435 bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply) {
2437 Value v = value_from_tt(tte->value(), ply);
2439 return ( tte->depth() >= depth
2440 || v >= Max(value_mate_in(100), beta)
2441 || v < Min(value_mated_in(100), beta))
2443 && ( (is_lower_bound(tte->type()) && v >= beta)
2444 || (is_upper_bound(tte->type()) && v < beta));
2448 // update_history() registers a good move that produced a beta-cutoff
2449 // in history and marks as failures all the other moves of that ply.
2451 void update_history(const Position& pos, Move m, Depth depth,
2452 Move movesSearched[], int moveCount) {
2454 H.success(pos.piece_on(move_from(m)), move_to(m), depth);
2456 for (int i = 0; i < moveCount - 1; i++)
2458 assert(m != movesSearched[i]);
2459 if (!pos.move_is_capture_or_promotion(movesSearched[i]))
2460 H.failure(pos.piece_on(move_from(movesSearched[i])), move_to(movesSearched[i]));
2465 // update_killers() add a good move that produced a beta-cutoff
2466 // among the killer moves of that ply.
2468 void update_killers(Move m, SearchStack& ss) {
2470 if (m == ss.killers[0])
2473 for (int i = KILLER_MAX - 1; i > 0; i--)
2474 ss.killers[i] = ss.killers[i - 1];
2480 // fail_high_ply_1() checks if some thread is currently resolving a fail
2481 // high at ply 1 at the node below the first root node. This information
2482 // is used for time managment.
2484 bool fail_high_ply_1() {
2486 for(int i = 0; i < ActiveThreads; i++)
2487 if (Threads[i].failHighPly1)
2494 // current_search_time() returns the number of milliseconds which have passed
2495 // since the beginning of the current search.
2497 int current_search_time() {
2498 return get_system_time() - SearchStartTime;
2502 // nps() computes the current nodes/second count.
2505 int t = current_search_time();
2506 return (t > 0)? int((nodes_searched() * 1000) / t) : 0;
2510 // poll() performs two different functions: It polls for user input, and it
2511 // looks at the time consumed so far and decides if it's time to abort the
2516 static int lastInfoTime;
2517 int t = current_search_time();
2522 // We are line oriented, don't read single chars
2523 std::string command;
2524 if (!std::getline(std::cin, command))
2527 if (command == "quit")
2530 PonderSearch = false;
2534 else if (command == "stop")
2537 PonderSearch = false;
2539 else if (command == "ponderhit")
2542 // Print search information
2546 else if (lastInfoTime > t)
2547 // HACK: Must be a new search where we searched less than
2548 // NodesBetweenPolls nodes during the first second of search.
2551 else if (t - lastInfoTime >= 1000)
2558 if (dbg_show_hit_rate)
2559 dbg_print_hit_rate();
2561 std::cout << "info nodes " << nodes_searched() << " nps " << nps()
2562 << " time " << t << " hashfull " << TT.full() << std::endl;
2563 lock_release(&IOLock);
2564 if (ShowCurrentLine)
2565 Threads[0].printCurrentLine = true;
2567 // Should we stop the search?
2571 bool overTime = t > AbsoluteMaxSearchTime
2572 || (RootMoveNumber == 1 && t > MaxSearchTime + ExtraSearchTime && !FailLow) //FIXME: We are not checking any problem flags, BUG?
2573 || ( !FailHigh && !FailLow && !fail_high_ply_1() && !Problem
2574 && t > 6*(MaxSearchTime + ExtraSearchTime));
2576 if ( (Iteration >= 3 && (!InfiniteSearch && overTime))
2577 || (ExactMaxTime && t >= ExactMaxTime)
2578 || (Iteration >= 3 && MaxNodes && nodes_searched() >= MaxNodes))
2583 // ponderhit() is called when the program is pondering (i.e. thinking while
2584 // it's the opponent's turn to move) in order to let the engine know that
2585 // it correctly predicted the opponent's move.
2589 int t = current_search_time();
2590 PonderSearch = false;
2591 if (Iteration >= 3 &&
2592 (!InfiniteSearch && (StopOnPonderhit ||
2593 t > AbsoluteMaxSearchTime ||
2594 (RootMoveNumber == 1 &&
2595 t > MaxSearchTime + ExtraSearchTime && !FailLow) ||
2596 (!FailHigh && !FailLow && !fail_high_ply_1() && !Problem &&
2597 t > 6*(MaxSearchTime + ExtraSearchTime)))))
2602 // print_current_line() prints the current line of search for a given
2603 // thread. Called when the UCI option UCI_ShowCurrLine is 'true'.
2605 void print_current_line(SearchStack ss[], int ply, int threadID) {
2607 assert(ply >= 0 && ply < PLY_MAX);
2608 assert(threadID >= 0 && threadID < ActiveThreads);
2610 if (!Threads[threadID].idle)
2613 std::cout << "info currline " << (threadID + 1);
2614 for (int p = 0; p < ply; p++)
2615 std::cout << " " << ss[p].currentMove;
2617 std::cout << std::endl;
2618 lock_release(&IOLock);
2620 Threads[threadID].printCurrentLine = false;
2621 if (threadID + 1 < ActiveThreads)
2622 Threads[threadID + 1].printCurrentLine = true;
2626 // init_ss_array() does a fast reset of the first entries of a SearchStack array
2628 void init_ss_array(SearchStack ss[]) {
2630 for (int i = 0; i < 3; i++)
2633 ss[i].initKillers();
2638 // wait_for_stop_or_ponderhit() is called when the maximum depth is reached
2639 // while the program is pondering. The point is to work around a wrinkle in
2640 // the UCI protocol: When pondering, the engine is not allowed to give a
2641 // "bestmove" before the GUI sends it a "stop" or "ponderhit" command.
2642 // We simply wait here until one of these commands is sent, and return,
2643 // after which the bestmove and pondermove will be printed (in id_loop()).
2645 void wait_for_stop_or_ponderhit() {
2647 std::string command;
2651 if (!std::getline(std::cin, command))
2654 if (command == "quit")
2659 else if (command == "ponderhit" || command == "stop")
2665 // idle_loop() is where the threads are parked when they have no work to do.
2666 // The parameter "waitSp", if non-NULL, is a pointer to an active SplitPoint
2667 // object for which the current thread is the master.
2669 void idle_loop(int threadID, SplitPoint* waitSp) {
2670 assert(threadID >= 0 && threadID < THREAD_MAX);
2672 Threads[threadID].running = true;
2675 if(AllThreadsShouldExit && threadID != 0)
2678 // If we are not thinking, wait for a condition to be signaled instead
2679 // of wasting CPU time polling for work:
2680 while(threadID != 0 && (Idle || threadID >= ActiveThreads)) {
2681 #if !defined(_MSC_VER)
2682 pthread_mutex_lock(&WaitLock);
2683 if(Idle || threadID >= ActiveThreads)
2684 pthread_cond_wait(&WaitCond, &WaitLock);
2685 pthread_mutex_unlock(&WaitLock);
2687 WaitForSingleObject(SitIdleEvent[threadID], INFINITE);
2691 // If this thread has been assigned work, launch a search
2692 if(Threads[threadID].workIsWaiting) {
2693 Threads[threadID].workIsWaiting = false;
2694 if(Threads[threadID].splitPoint->pvNode)
2695 sp_search_pv(Threads[threadID].splitPoint, threadID);
2697 sp_search(Threads[threadID].splitPoint, threadID);
2698 Threads[threadID].idle = true;
2701 // If this thread is the master of a split point and all threads have
2702 // finished their work at this split point, return from the idle loop.
2703 if(waitSp != NULL && waitSp->cpus == 0)
2707 Threads[threadID].running = false;
2711 // init_split_point_stack() is called during program initialization, and
2712 // initializes all split point objects.
2714 void init_split_point_stack() {
2715 for(int i = 0; i < THREAD_MAX; i++)
2716 for(int j = 0; j < MaxActiveSplitPoints; j++) {
2717 SplitPointStack[i][j].parent = NULL;
2718 lock_init(&(SplitPointStack[i][j].lock), NULL);
2723 // destroy_split_point_stack() is called when the program exits, and
2724 // destroys all locks in the precomputed split point objects.
2726 void destroy_split_point_stack() {
2727 for(int i = 0; i < THREAD_MAX; i++)
2728 for(int j = 0; j < MaxActiveSplitPoints; j++)
2729 lock_destroy(&(SplitPointStack[i][j].lock));
2733 // thread_should_stop() checks whether the thread with a given threadID has
2734 // been asked to stop, directly or indirectly. This can happen if a beta
2735 // cutoff has occured in thre thread's currently active split point, or in
2736 // some ancestor of the current split point.
2738 bool thread_should_stop(int threadID) {
2739 assert(threadID >= 0 && threadID < ActiveThreads);
2743 if(Threads[threadID].stop)
2745 if(ActiveThreads <= 2)
2747 for(sp = Threads[threadID].splitPoint; sp != NULL; sp = sp->parent)
2749 Threads[threadID].stop = true;
2756 // thread_is_available() checks whether the thread with threadID "slave" is
2757 // available to help the thread with threadID "master" at a split point. An
2758 // obvious requirement is that "slave" must be idle. With more than two
2759 // threads, this is not by itself sufficient: If "slave" is the master of
2760 // some active split point, it is only available as a slave to the other
2761 // threads which are busy searching the split point at the top of "slave"'s
2762 // split point stack (the "helpful master concept" in YBWC terminology).
2764 bool thread_is_available(int slave, int master) {
2765 assert(slave >= 0 && slave < ActiveThreads);
2766 assert(master >= 0 && master < ActiveThreads);
2767 assert(ActiveThreads > 1);
2769 if(!Threads[slave].idle || slave == master)
2772 if(Threads[slave].activeSplitPoints == 0)
2773 // No active split points means that the thread is available as a slave
2774 // for any other thread.
2777 if(ActiveThreads == 2)
2780 // Apply the "helpful master" concept if possible.
2781 if(SplitPointStack[slave][Threads[slave].activeSplitPoints-1].slaves[master])
2788 // idle_thread_exists() tries to find an idle thread which is available as
2789 // a slave for the thread with threadID "master".
2791 bool idle_thread_exists(int master) {
2792 assert(master >= 0 && master < ActiveThreads);
2793 assert(ActiveThreads > 1);
2795 for(int i = 0; i < ActiveThreads; i++)
2796 if(thread_is_available(i, master))
2802 // split() does the actual work of distributing the work at a node between
2803 // several threads at PV nodes. If it does not succeed in splitting the
2804 // node (because no idle threads are available, or because we have no unused
2805 // split point objects), the function immediately returns false. If
2806 // splitting is possible, a SplitPoint object is initialized with all the
2807 // data that must be copied to the helper threads (the current position and
2808 // search stack, alpha, beta, the search depth, etc.), and we tell our
2809 // helper threads that they have been assigned work. This will cause them
2810 // to instantly leave their idle loops and call sp_search_pv(). When all
2811 // threads have returned from sp_search_pv (or, equivalently, when
2812 // splitPoint->cpus becomes 0), split() returns true.
2814 bool split(const Position& p, SearchStack* sstck, int ply,
2815 Value* alpha, Value* beta, Value* bestValue, const Value futilityValue,
2816 const Value approximateEval, Depth depth, int* moves,
2817 MovePicker* mp, Bitboard dcCandidates, int master, bool pvNode) {
2820 assert(sstck != NULL);
2821 assert(ply >= 0 && ply < PLY_MAX);
2822 assert(*bestValue >= -VALUE_INFINITE && *bestValue <= *alpha);
2823 assert(!pvNode || *alpha < *beta);
2824 assert(*beta <= VALUE_INFINITE);
2825 assert(depth > Depth(0));
2826 assert(master >= 0 && master < ActiveThreads);
2827 assert(ActiveThreads > 1);
2829 SplitPoint* splitPoint;
2834 // If no other thread is available to help us, or if we have too many
2835 // active split points, don't split.
2836 if(!idle_thread_exists(master) ||
2837 Threads[master].activeSplitPoints >= MaxActiveSplitPoints) {
2838 lock_release(&MPLock);
2842 // Pick the next available split point object from the split point stack
2843 splitPoint = SplitPointStack[master] + Threads[master].activeSplitPoints;
2844 Threads[master].activeSplitPoints++;
2846 // Initialize the split point object
2847 splitPoint->parent = Threads[master].splitPoint;
2848 splitPoint->finished = false;
2849 splitPoint->ply = ply;
2850 splitPoint->depth = depth;
2851 splitPoint->alpha = pvNode? *alpha : (*beta - 1);
2852 splitPoint->beta = *beta;
2853 splitPoint->pvNode = pvNode;
2854 splitPoint->dcCandidates = dcCandidates;
2855 splitPoint->bestValue = *bestValue;
2856 splitPoint->futilityValue = futilityValue;
2857 splitPoint->approximateEval = approximateEval;
2858 splitPoint->master = master;
2859 splitPoint->mp = mp;
2860 splitPoint->moves = *moves;
2861 splitPoint->cpus = 1;
2862 splitPoint->pos.copy(p);
2863 splitPoint->parentSstack = sstck;
2864 for(i = 0; i < ActiveThreads; i++)
2865 splitPoint->slaves[i] = 0;
2867 // Copy the current position and the search stack to the master thread
2868 memcpy(splitPoint->sstack[master], sstck, (ply+1)*sizeof(SearchStack));
2869 Threads[master].splitPoint = splitPoint;
2871 // Make copies of the current position and search stack for each thread
2872 for(i = 0; i < ActiveThreads && splitPoint->cpus < MaxThreadsPerSplitPoint;
2874 if(thread_is_available(i, master)) {
2875 memcpy(splitPoint->sstack[i], sstck, (ply+1)*sizeof(SearchStack));
2876 Threads[i].splitPoint = splitPoint;
2877 splitPoint->slaves[i] = 1;
2881 // Tell the threads that they have work to do. This will make them leave
2883 for(i = 0; i < ActiveThreads; i++)
2884 if(i == master || splitPoint->slaves[i]) {
2885 Threads[i].workIsWaiting = true;
2886 Threads[i].idle = false;
2887 Threads[i].stop = false;
2890 lock_release(&MPLock);
2892 // Everything is set up. The master thread enters the idle loop, from
2893 // which it will instantly launch a search, because its workIsWaiting
2894 // slot is 'true'. We send the split point as a second parameter to the
2895 // idle loop, which means that the main thread will return from the idle
2896 // loop when all threads have finished their work at this split point
2897 // (i.e. when // splitPoint->cpus == 0).
2898 idle_loop(master, splitPoint);
2900 // We have returned from the idle loop, which means that all threads are
2901 // finished. Update alpha, beta and bestvalue, and return.
2903 if(pvNode) *alpha = splitPoint->alpha;
2904 *beta = splitPoint->beta;
2905 *bestValue = splitPoint->bestValue;
2906 Threads[master].stop = false;
2907 Threads[master].idle = false;
2908 Threads[master].activeSplitPoints--;
2909 Threads[master].splitPoint = splitPoint->parent;
2910 lock_release(&MPLock);
2916 // wake_sleeping_threads() wakes up all sleeping threads when it is time
2917 // to start a new search from the root.
2919 void wake_sleeping_threads() {
2920 if(ActiveThreads > 1) {
2921 for(int i = 1; i < ActiveThreads; i++) {
2922 Threads[i].idle = true;
2923 Threads[i].workIsWaiting = false;
2925 #if !defined(_MSC_VER)
2926 pthread_mutex_lock(&WaitLock);
2927 pthread_cond_broadcast(&WaitCond);
2928 pthread_mutex_unlock(&WaitLock);
2930 for(int i = 1; i < THREAD_MAX; i++)
2931 SetEvent(SitIdleEvent[i]);
2937 // init_thread() is the function which is called when a new thread is
2938 // launched. It simply calls the idle_loop() function with the supplied
2939 // threadID. There are two versions of this function; one for POSIX threads
2940 // and one for Windows threads.
2942 #if !defined(_MSC_VER)
2944 void *init_thread(void *threadID) {
2945 idle_loop(*(int *)threadID, NULL);
2951 DWORD WINAPI init_thread(LPVOID threadID) {
2952 idle_loop(*(int *)threadID, NULL);