X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Fsearch.cpp;h=8021f0f57ed7e333fd213939ca12134756bef7bf;hb=3e0753bef36e5efeed700d7277187f6fbd7275f5;hp=ba5ad365af2f1caffb95fa56caa9004ec1520dc5;hpb=a75aa6035b1ac27a6a2a44f523ec2ffd011485d8;p=stockfish diff --git a/src/search.cpp b/src/search.cpp index ba5ad365..8021f0f5 100644 --- a/src/search.cpp +++ b/src/search.cpp @@ -128,17 +128,13 @@ namespace { }; - /// Constants and variables initialized from UCI options + /// Constants - // Minimum number of full depth (i.e. non-reduced) moves at PV and non-PV - // nodes - int LMRPVMoves, LMRNonPVMoves; - - // Depth limit for use of dynamic threat detection - Depth ThreatDepth; + // Search depth at iteration 1 + const Depth InitialDepth = OnePly /*+ OnePly/2*/; // Depth limit for selective search - const Depth SelectiveDepth = 7*OnePly; + const Depth SelectiveDepth = 7 * OnePly; // Use internal iterative deepening? const bool UseIIDAtPVNodes = true; @@ -174,25 +170,31 @@ namespace { const bool PruneDefendingMoves = false; const bool PruneBlockingMoves = false; - // Use futility pruning? - bool UseQSearchFutilityPruning, UseFutilityPruning; - // Margins for futility pruning in the quiescence search, and at frontier // and near frontier nodes const Value FutilityMarginQS = Value(0x80); - // Remaining depth: 1 ply 1.5 ply 2 ply 2.5 ply 3 ply 3.5 ply - const Value FutilityMargins[12] = { Value(0x100), Value(0x120), Value(0x200), Value(0x220), Value(0x250), Value(0x270), + // Remaining depth: 1 ply 1.5 ply 2 ply 2.5 ply 3 ply 3.5 ply + const Value FutilityMargins[12] = { Value(0x100), Value(0x120), Value(0x200), Value(0x220), Value(0x250), Value(0x270), // 4 ply 4.5 ply 5 ply 5.5 ply 6 ply 6.5 ply Value(0x2A0), Value(0x2C0), Value(0x340), Value(0x360), Value(0x3A0), Value(0x3C0) }; - // Razoring - const Depth RazorDepth = 4*OnePly; + // Razoring + const Depth RazorDepth = 4*OnePly; // Remaining depth: 1 ply 1.5 ply 2 ply 2.5 ply 3 ply 3.5 ply const Value RazorMargins[6] = { Value(0x180), Value(0x300), Value(0x300), Value(0x3C0), Value(0x3C0), Value(0x3C0) }; // Remaining depth: 1 ply 1.5 ply 2 ply 2.5 ply 3 ply 3.5 ply - const Value RazorApprMargins[6] = { Value(0x520), Value(0x300), Value(0x300), Value(0x300), Value(0x300), Value(0x300) }; + const Value RazorApprMargins[6] = { Value(0x520), Value(0x300), Value(0x300), Value(0x300), Value(0x300), Value(0x300) }; + + + /// Variables initialized from UCI options + + // Minimum number of full depth (i.e. non-reduced) moves at PV and non-PV nodes + int LMRPVMoves, LMRNonPVMoves; // heavy SMP read access for the latter + + // Depth limit for use of dynamic threat detection + Depth ThreatDepth; // heavy SMP read access // Last seconds noise filtering (LSN) bool UseLSNFiltering; @@ -201,21 +203,15 @@ namespace { Value LSNValue; // Extensions. Array index 0 is used at non-PV nodes, index 1 at PV nodes. + // There is heavy SMP read access on these arrays Depth CheckExtension[2], SingleReplyExtension[2], PawnPushTo7thExtension[2]; Depth PassedPawnExtension[2], PawnEndgameExtension[2], MateThreatExtension[2]; - // Search depth at iteration 1 - const Depth InitialDepth = OnePly /*+ OnePly/2*/; - - // Node counters - int NodesSincePoll; - int NodesBetweenPolls = 30000; - // Iteration counters int Iteration; - BetaCounterType BetaCounter; + BetaCounterType BetaCounter; // has per-thread internal data - // Scores and number of times the best move changed for each iteration: + // Scores and number of times the best move changed for each iteration IterationInfoType IterationInfo[PLY_MAX_PLUS_2]; int BestMoveChangesByIteration[PLY_MAX_PLUS_2]; @@ -231,7 +227,7 @@ namespace { bool InfiniteSearch; bool PonderSearch; bool StopOnPonderhit; - bool AbortSearch; + bool AbortSearch; // heavy SMP read access bool Quit; bool FailHigh; bool FailLow; @@ -263,6 +259,11 @@ namespace { HANDLE SitIdleEvent[THREAD_MAX]; #endif + // Node counters, used only by thread[0] but try to keep in different + // cache lines (64 bytes each) from the heavy SMP read accessed variables. + int NodesSincePoll; + int NodesBetweenPolls = 30000; + /// Functions @@ -281,10 +282,10 @@ namespace { bool move_is_killer(Move m, const SearchStack& ss); Depth extension(const Position &pos, Move m, bool pvNode, bool capture, bool check, bool singleReply, bool mateThreat, bool* dangerous); bool ok_to_do_nullmove(const Position &pos); - bool ok_to_prune(const Position &pos, Move m, Move threat, Depth d); + bool ok_to_prune(const Position &pos, Move m, Move threat, Depth d, const History& H); bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply); bool ok_to_history(const Position &pos, Move m); - void update_history(const Position& pos, Move m, Depth depth, Move movesSearched[], int moveCount); + void update_history(const Position& pos, Move m, Depth depth, History& H, Move movesSearched[], int moveCount); void update_killers(Move m, SearchStack& ss); bool fail_high_ply_1(); @@ -330,11 +331,6 @@ int ActiveThreads = 1; // but it could turn out to be useful for debugging. Lock IOLock; -History H; // Should be made local? - -// The empty search stack -SearchStack EmptySearchStack; - // SearchStack::init() initializes a search stack. Used at the beginning of a // new search from the root. @@ -437,9 +433,6 @@ bool think(const Position &pos, bool infinite, bool ponder, int side_to_move, if (UseLogFile) LogFile.open(get_option_value_string("Search Log Filename").c_str(), std::ios::out | std::ios::app); - UseQSearchFutilityPruning = get_option_value_bool("Futility Pruning (Quiescence Search)"); - UseFutilityPruning = get_option_value_bool("Futility Pruning (Main Search)"); - UseLSNFiltering = get_option_value_bool("LSN filtering"); LSNTime = get_option_value_int("LSN Time Margin (sec)") * 1000; LSNValue = value_from_centipawns(get_option_value_int("LSN Value Margin")); @@ -597,10 +590,6 @@ void init_threads() { // Wait until the thread has finished launching: while (!Threads[i].running); } - - // Init also the empty search stack - EmptySearchStack.init(0); - EmptySearchStack.initKillers(); } @@ -651,7 +640,9 @@ namespace { // Initialize TT.new_search(); - H.clear(); + for (int i = 0; i < THREAD_MAX; i++) + Threads[i].H.clear(); + for (int i = 0; i < 3; i++) { ss[i].init(i); @@ -1063,7 +1054,7 @@ namespace { // Initialize a MovePicker object for the current position, and prepare // to search all moves - MovePicker mp = MovePicker(pos, true, ttMove, ss[ply], depth); + MovePicker mp = MovePicker(pos, ttMove, depth, Threads[threadID].H, &ss[ply]); Move move, movesSearched[256]; int moveCount = 0; @@ -1192,7 +1183,7 @@ namespace { Move m = ss[ply].pv[ply]; if (ok_to_history(pos, m)) // Only non capture moves are considered { - update_history(pos, m, depth, movesSearched, moveCount); + update_history(pos, m, depth, Threads[threadID].H, movesSearched, moveCount); update_killers(m, ss[ply]); } TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, m); @@ -1324,15 +1315,14 @@ namespace { // Initialize a MovePicker object for the current position, and prepare // to search all moves: - MovePicker mp = MovePicker(pos, false, ttMove, ss[ply], depth); + MovePicker mp = MovePicker(pos, ttMove, depth, Threads[threadID].H, &ss[ply]); Move move, movesSearched[256]; int moveCount = 0; Value value, bestValue = -VALUE_INFINITE; Bitboard dcCandidates = mp.discovered_check_candidates(); Value futilityValue = VALUE_NONE; - bool useFutilityPruning = UseFutilityPruning - && depth < SelectiveDepth + bool useFutilityPruning = depth < SelectiveDepth && !isCheck; // Loop through all legal moves until no moves remain or a beta cutoff @@ -1362,7 +1352,7 @@ namespace { { // History pruning. See ok_to_prune() definition if ( moveCount >= 2 + int(depth) - && ok_to_prune(pos, move, ss[ply].threatMove, depth)) + && ok_to_prune(pos, move, ss[ply].threatMove, depth, Threads[threadID].H)) continue; // Value based pruning @@ -1452,7 +1442,7 @@ namespace { Move m = ss[ply].pv[ply]; if (ok_to_history(pos, m)) // Only non capture moves are considered { - update_history(pos, m, depth, movesSearched, moveCount); + update_history(pos, m, depth, Threads[threadID].H, movesSearched, moveCount); update_killers(m, ss[ply]); } TT.store(pos.get_key(), value_to_tt(bestValue, ply), VALUE_TYPE_LOWER, depth, m); @@ -1545,7 +1535,7 @@ namespace { // Initialize a MovePicker object for the current position, and prepare // to search the moves. Because the depth is <= 0 here, only captures, // queen promotions and checks (only if depth == 0) will be generated. - MovePicker mp = MovePicker(pos, pvNode, ttMove, EmptySearchStack, depth); + MovePicker mp = MovePicker(pos, ttMove, depth, Threads[threadID].H); Move move; int moveCount = 0; Bitboard dcCandidates = mp.discovered_check_candidates(); @@ -1563,8 +1553,7 @@ namespace { ss[ply].currentMove = move; // Futility pruning - if ( UseQSearchFutilityPruning - && enoughMaterial + if ( enoughMaterial && !isCheck && !pvNode && !move_promotion(move) @@ -1658,8 +1647,7 @@ namespace { Value value; Move move; bool isCheck = pos.is_check(); - bool useFutilityPruning = UseFutilityPruning - && sp->depth < SelectiveDepth + bool useFutilityPruning = sp->depth < SelectiveDepth && !isCheck; while ( sp->bestValue < sp->beta @@ -1688,7 +1676,7 @@ namespace { && !moveIsCapture && !move_promotion(move) && moveCount >= 2 + int(sp->depth) - && ok_to_prune(pos, move, ss[sp->ply].threatMove, sp->depth)) + && ok_to_prune(pos, move, ss[sp->ply].threatMove, sp->depth, Threads[threadID].H)) continue; // Make and search the move. @@ -2296,7 +2284,7 @@ namespace { // non-tactical moves late in the move list close to the leaves are // candidates for pruning. - bool ok_to_prune(const Position &pos, Move m, Move threat, Depth d) { + bool ok_to_prune(const Position &pos, Move m, Move threat, Depth d, const History& H) { Square mfrom, mto, tfrom, tto; assert(move_is_ok(m)); @@ -2375,7 +2363,7 @@ namespace { // update_history() registers a good move that produced a beta-cutoff // in history and marks as failures all the other moves of that ply. - void update_history(const Position& pos, Move m, Depth depth, + void update_history(const Position& pos, Move m, Depth depth, History& H, Move movesSearched[], int moveCount) { H.success(pos.piece_on(move_from(m)), move_to(m), depth);