X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.cpp;h=eea091d4bcf33d0b9f789a493ff8200d77c9e808;hp=ed18936f760eb71cb7450daa8c12279f7d3f1ef0;hb=80dd90f9722ecedb48605a6cd59e2d59a1bb2495;hpb=63a04134d0841bb362f42d600faf614038fff494 diff --git a/src/search.cpp b/src/search.cpp index ed18936f..eea091d4 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,7 +286,7 @@ 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)) @@ -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) @@ -534,10 +534,8 @@ namespace { Rml.bestMoveChanges = 0; - // MultiPV iteration loop. At depth 1 perform at least 2 iterations to - // get a score of the second best move for easy move detection. - int e = Min(Max(MultiPV, 2 * int(depth == 1)), (int)Rml.size()); - for (MultiPVIteration = 0; MultiPVIteration < e; MultiPVIteration++) + // MultiPV iteration loop + for (MultiPVIteration = 0; MultiPVIteration < Min(MultiPV, (int)Rml.size()); MultiPVIteration++) { // Calculate dynamic aspiration window based on previous iterations if (depth >= 5 && abs(Rml[MultiPVIteration].prevScore) < VALUE_KNOWN_WIN) @@ -1012,7 +1010,8 @@ split_point_start: // At split points actual search starts from here << " currmovenumber " << moveCount + MultiPVIteration << endl; } - isPvMove = (PvNode && moveCount == 1); + // 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); @@ -1494,7 +1493,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); @@ -1510,7 +1509,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; @@ -1645,7 +1644,7 @@ split_point_start: // At split points actual search starts from here // value of the threatening piece, don't prune moves which defend it. if ( pos.move_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;