X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.cpp;h=4bb701a216b0c907b7ae94c990a695868b6b2f47;hp=c4e354e4b73d6bf15de78d610aadec8fb17e9fc2;hb=a3bf09c5c959352d50e1b5042e15a6c654bd3081;hpb=dafd5b58642e70c3746fc90e467c35465eb65a00 diff --git a/src/search.cpp b/src/search.cpp index c4e354e4..4bb701a2 100644 --- a/src/search.cpp +++ b/src/search.cpp @@ -270,7 +270,7 @@ namespace { if (moveIsCheck && pos.see_sign(m) >= 0) result += CheckExtension[PvNode]; - if (piece_type(pos.piece_on(move_from(m))) == PAWN) + if (type_of(pos.piece_on(move_from(m))) == PAWN) { Color c = pos.side_to_move(); if (relative_rank(c, move_to(m)) == RANK_7) @@ -286,10 +286,10 @@ namespace { } if ( captureOrPromotion - && piece_type(pos.piece_on(move_to(m))) != PAWN + && type_of(pos.piece_on(move_to(m))) != PAWN && ( pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK) - piece_value_midgame(pos.piece_on(move_to(m))) == VALUE_ZERO) - && !move_is_special(m)) + && !is_special(m)) { result += PawnEndgameExtension[PvNode]; *dangerous = true; @@ -363,7 +363,7 @@ int64_t perft(Position& pos, Depth depth) { bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]) { - static Book book; + static Book book; // Define static to initialize the PRNG only once // Initialize global search-related variables StopOnPonderhit = StopRequest = QuitRequest = AspirationFailLow = false; @@ -391,7 +391,7 @@ bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]) { if (Options["Book File"].value() != book.name()) book.open(Options["Book File"].value()); - Move bookMove = book.get_move(pos, Options["Best Book Move"].value()); + Move bookMove = book.probe(pos, Options["Best Book Move"].value()); if (bookMove != MOVE_NONE) { if (Limits.ponder) @@ -409,9 +409,7 @@ bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]) { read_evaluation_uci_options(pos.side_to_move()); Threads.read_uci_options(); - // Allocate pawn and material hash tables if number of active threads - // increased and set a new TT size if changed. - Threads.init_hash_tables(); + // Set a new TT size if changed TT.set_size(Options["Hash"].value()); if (Options["Clear Hash"].value()) @@ -586,16 +584,27 @@ namespace { break; // Send full PV info to GUI if we are going to leave the loop or - // if we have a fail high/low and we are deep in the search. - if ((value > alpha && value < beta) || current_search_time() > 2000) - for (int i = 0; i < Min(UCIMultiPV, MultiPVIteration + 1); i++) + // if we have a fail high/low and we are deep in the search. Note + // that UCI protol requires to send all the PV lines also if are + // still to be searched and so refer to the previous search's score. + if ((value > alpha && value < beta) || current_search_time() > 5000) + for (int i = 0; i < Min(UCIMultiPV, (int)Rml.size()); i++) + { + bool updated = (i <= MultiPVIteration); + + if (depth == 1 && !updated) + continue; + + Depth d = (updated ? depth : depth - 1) * ONE_PLY; + Value s = (updated ? Rml[i].score : Rml[i].prevScore); + cout << "info" - << depth_to_uci(depth * ONE_PLY) - << (i == MultiPVIteration ? score_to_uci(Rml[i].score, alpha, beta) : - score_to_uci(Rml[i].score)) + << depth_to_uci(d) + << (i == MultiPVIteration ? score_to_uci(s, alpha, beta) : score_to_uci(s)) << speed_to_uci(pos.nodes_searched()) << pv_to_uci(&Rml[i].pv[0], i + 1, pos.is_chess960()) << endl; + } // In case of failing high/low increase aspiration window and research, // otherwise exit the fail high/low loop. @@ -780,8 +789,18 @@ namespace { : can_return_tt(tte, depth, beta, ss->ply))) { TT.refresh(tte); - ss->bestMove = ttMove; // Can be MOVE_NONE - return value_from_tt(tte->value(), ss->ply); + ss->bestMove = move = ttMove; // Can be MOVE_NONE + value = value_from_tt(tte->value(), ss->ply); + + if ( value >= beta + && move + && !pos.is_capture_or_promotion(move) + && move != ss->killers[0]) + { + ss->killers[1] = ss->killers[0]; + ss->killers[0] = move; + } + return value; } // Step 5. Evaluate the position statically and update parent's gain statistics @@ -964,7 +983,7 @@ split_point_start: // At split points actual search starts from here && (move = mp.get_next_move()) != MOVE_NONE && !thread.cutoff_occurred()) { - assert(move_is_ok(move)); + assert(is_ok(move)); if (move == excludedMove) continue; @@ -1005,7 +1024,7 @@ split_point_start: // At split points actual search starts from here // At Root and at first iteration do a PV search on all the moves to score root moves isPvMove = (PvNode && moveCount <= (RootNode && depth <= ONE_PLY ? MAX_MOVES : 1)); givesCheck = pos.move_gives_check(move, ci); - captureOrPromotion = pos.move_is_capture_or_promotion(move); + captureOrPromotion = pos.is_capture_or_promotion(move); // Step 12. Decide the new search depth ext = extension(pos, move, captureOrPromotion, givesCheck, &dangerous); @@ -1045,7 +1064,7 @@ split_point_start: // At split points actual search starts from here && !inCheck && !dangerous && move != ttMove - && !move_is_castle(move)) + && !is_castle(move)) { // Move count based pruning if ( moveCount >= futility_move_count(depth) @@ -1119,7 +1138,7 @@ split_point_start: // At split points actual search starts from here if ( depth > 3 * ONE_PLY && !captureOrPromotion && !dangerous - && !move_is_castle(move) + && !is_castle(move) && ss->killers[0] != move && ss->killers[1] != move && (ss->reduction = reduction(depth, moveCount)) != DEPTH_ZERO) @@ -1244,7 +1263,7 @@ split_point_start: // At split points actual search starts from here // Update killers and history only for non capture moves that fails high if ( bestValue >= beta - && !pos.move_is_capture_or_promotion(move)) + && !pos.is_capture_or_promotion(move)) { if (move != ss->killers[0]) { @@ -1364,7 +1383,7 @@ split_point_start: // At split points actual search starts from here while ( bestValue < beta && (move = mp.get_next_move()) != MOVE_NONE) { - assert(move_is_ok(move)); + assert(is_ok(move)); givesCheck = pos.move_gives_check(move, ci); @@ -1374,12 +1393,12 @@ split_point_start: // At split points actual search starts from here && !givesCheck && move != ttMove && enoughMaterial - && !move_is_promotion(move) - && !pos.move_is_passed_pawn_push(move)) + && !is_promotion(move) + && !pos.is_passed_pawn_push(move)) { futilityValue = futilityBase + piece_value_endgame(pos.piece_on(move_to(move))) - + (move_is_ep(move) ? PawnValueEndgame : VALUE_ZERO); + + (is_enpassant(move) ? PawnValueEndgame : VALUE_ZERO); if (futilityValue < beta) { @@ -1400,14 +1419,14 @@ split_point_start: // At split points actual search starts from here evasionPrunable = !PvNode && inCheck && bestValue > VALUE_MATED_IN_PLY_MAX - && !pos.move_is_capture(move) + && !pos.is_capture(move) && !pos.can_castle(pos.side_to_move()); // Don't search moves with negative SEE values if ( !PvNode && (!inCheck || evasionPrunable) && move != ttMove - && !move_is_promotion(move) + && !is_promotion(move) && pos.see_sign(move) < 0) continue; @@ -1416,7 +1435,7 @@ split_point_start: // At split points actual search starts from here && !inCheck && givesCheck && move != ttMove - && !pos.move_is_capture_or_promotion(move) + && !pos.is_capture_or_promotion(move) && ss->eval + PawnValueMidgame / 4 < beta && !check_is_dangerous(pos, move, futilityBase, beta, &bestValue)) { @@ -1485,7 +1504,7 @@ split_point_start: // At split points actual search starts from here from = move_from(move); to = move_to(move); - them = opposite_color(pos.side_to_move()); + them = flip(pos.side_to_move()); ksq = pos.king_square(them); kingAtt = pos.attacks_from(ksq); pc = pos.piece_on(from); @@ -1501,7 +1520,7 @@ split_point_start: // At split points actual search starts from here return true; // Rule 2. Queen contact check is very dangerous - if ( piece_type(pc) == QUEEN + if ( type_of(pc) == QUEEN && bit_is_set(kingAtt, to)) return true; @@ -1540,8 +1559,8 @@ split_point_start: // At split points actual search starts from here Piece p1, p2; Square ksq; - assert(m1 && move_is_ok(m1)); - assert(m2 && move_is_ok(m2)); + assert(is_ok(m1)); + assert(is_ok(m2)); // Case 1: The moving piece is the same in both moves f2 = move_from(m2); @@ -1616,10 +1635,10 @@ split_point_start: // At split points actual search starts from here bool connected_threat(const Position& pos, Move m, Move threat) { - assert(move_is_ok(m)); - assert(threat && move_is_ok(threat)); - assert(!pos.move_is_capture_or_promotion(m)); - assert(!pos.move_is_passed_pawn_push(m)); + assert(is_ok(m)); + assert(is_ok(threat)); + assert(!pos.is_capture_or_promotion(m)); + assert(!pos.is_passed_pawn_push(m)); Square mfrom, mto, tfrom, tto; @@ -1634,9 +1653,9 @@ split_point_start: // At split points actual search starts from here // Case 2: If the threatened piece has value less than or equal to the // value of the threatening piece, don't prune moves which defend it. - if ( pos.move_is_capture(threat) + if ( pos.is_capture(threat) && ( piece_value_midgame(pos.piece_on(tfrom)) >= piece_value_midgame(pos.piece_on(tto)) - || piece_type(pos.piece_on(tfrom)) == KING) + || type_of(pos.piece_on(tfrom)) == KING) && pos.move_attacks_square(m, tto)) return true; @@ -1714,7 +1733,7 @@ split_point_start: // At split points actual search starts from here && before != VALUE_NONE && after != VALUE_NONE && pos.captured_piece_type() == PIECE_TYPE_NONE - && !move_is_special(m)) + && !is_special(m)) H.update_gain(pos.piece_on(move_to(m)), move_to(m), -(before + after)); } @@ -2075,7 +2094,7 @@ split_point_start: // At split points actual search starts from here int ply = 1; Move m = pv[0]; - assert(m != MOVE_NONE && pos.move_is_pl(m)); + assert(m != MOVE_NONE && pos.is_pseudo_legal(m)); pv.clear(); pv.push_back(m); @@ -2083,7 +2102,7 @@ split_point_start: // At split points actual search starts from here while ( (tte = TT.probe(pos.get_key())) != NULL && tte->move() != MOVE_NONE - && pos.move_is_pl(tte->move()) + && pos.is_pseudo_legal(tte->move()) && pos.pl_move_is_legal(tte->move(), pos.pinned_pieces()) && ply < PLY_MAX && (!pos.is_draw() || ply < 2)) @@ -2109,7 +2128,7 @@ split_point_start: // At split points actual search starts from here Value v, m = VALUE_NONE; int ply = 0; - assert(pv[0] != MOVE_NONE && pos.move_is_pl(pv[0])); + assert(pv[0] != MOVE_NONE && pos.is_pseudo_legal(pv[0])); do { k = pos.get_key(); @@ -2130,50 +2149,49 @@ split_point_start: // At split points actual search starts from here } // namespace -// ThreadsManager::idle_loop() is where the threads are parked when they have no work -// to do. The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint -// object for which the current thread is the master. +// Little helper used by idle_loop() to check that all the slave threads of a +// split point have finished searching. + +static bool all_slaves_finished(SplitPoint* sp) { + + for (int i = 0; i < Threads.size(); i++) + if (sp->is_slave[i]) + return false; + + return true; +} -void ThreadsManager::idle_loop(int threadID, SplitPoint* sp) { - assert(threadID >= 0 && threadID < MAX_THREADS); +// Thread::idle_loop() is where the thread is parked when it has no work to do. +// The parameter 'sp', if non-NULL, is a pointer to an active SplitPoint object +// for which the thread is the master. - int i; - bool allFinished; +void Thread::idle_loop(SplitPoint* sp) { while (true) { - // Slave threads can exit as soon as allThreadsShouldExit flag raises, - // master should exit as last one. - if (allThreadsShouldExit) - { - assert(!sp); - threads[threadID].state = Thread::TERMINATED; - return; - } - // If we are not searching, wait for a condition to be signaled // instead of wasting CPU time polling for work. - while ( threadID >= activeThreads - || threads[threadID].state == Thread::INITIALIZING - || (useSleepingThreads && threads[threadID].state == Thread::AVAILABLE)) + while ( do_sleep + || do_terminate + || (Threads.use_sleeping_threads() && !is_searching)) { - assert(!sp || useSleepingThreads); - assert(threadID != 0 || useSleepingThreads); + assert((!sp && threadID) || Threads.use_sleeping_threads()); - if (threads[threadID].state == Thread::INITIALIZING) - threads[threadID].state = Thread::AVAILABLE; + // Slave thread should exit as soon as do_terminate flag raises + if (do_terminate) + { + assert(!sp); + return; + } // Grab the lock to avoid races with Thread::wake_up() - lock_grab(&threads[threadID].sleepLock); + lock_grab(&sleepLock); // If we are master and all slaves have finished don't go to sleep - for (i = 0; sp && i < activeThreads && !sp->is_slave[i]; i++) {} - allFinished = (i == activeThreads); - - if (allFinished || allThreadsShouldExit) + if (sp && all_slaves_finished(sp)) { - lock_release(&threads[threadID].sleepLock); + lock_release(&sleepLock); break; } @@ -2181,22 +2199,20 @@ void ThreadsManager::idle_loop(int threadID, SplitPoint* sp) { // particular we need to avoid a deadlock in case a master thread has, // in the meanwhile, allocated us and sent the wake_up() call before we // had the chance to grab the lock. - if (threadID >= activeThreads || threads[threadID].state == Thread::AVAILABLE) - cond_wait(&threads[threadID].sleepCond, &threads[threadID].sleepLock); + if (do_sleep || !is_searching) + cond_wait(&sleepCond, &sleepLock); - lock_release(&threads[threadID].sleepLock); + lock_release(&sleepLock); } // If this thread has been assigned work, launch a search - if (threads[threadID].state == Thread::WORKISWAITING) + if (is_searching) { - assert(!allThreadsShouldExit); - - threads[threadID].state = Thread::SEARCHING; + assert(!do_terminate); // Copy split point position and search stack and call search() SearchStack ss[PLY_MAX_PLUS_2]; - SplitPoint* tsp = threads[threadID].splitPoint; + SplitPoint* tsp = splitPoint; Position pos(*tsp->pos, threadID); memcpy(ss, tsp->ss - 1, 4 * sizeof(SearchStack)); @@ -2211,24 +2227,21 @@ void ThreadsManager::idle_loop(int threadID, SplitPoint* sp) { else assert(false); - assert(threads[threadID].state == Thread::SEARCHING); + assert(is_searching); - threads[threadID].state = Thread::AVAILABLE; + is_searching = false; // Wake up master thread so to allow it to return from the idle loop in // case we are the last slave of the split point. - if ( useSleepingThreads + if ( Threads.use_sleeping_threads() && threadID != tsp->master - && threads[tsp->master].state == Thread::AVAILABLE) - threads[tsp->master].wake_up(); + && !Threads[tsp->master].is_searching) + Threads[tsp->master].wake_up(); } // If this thread is the master of a split point and all slaves have // finished their work at this split point, return from the idle loop. - for (i = 0; sp && i < activeThreads && !sp->is_slave[i]; i++) {} - allFinished = (i == activeThreads); - - if (allFinished) + if (sp && all_slaves_finished(sp)) { // Because sp->is_slave[] is reset under lock protection, // be sure sp->lock has been released before to return.