X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.cpp;h=78181748948374394b817025a2c703af2a24acc9;hp=486fec0fbe3177f0e871723f7be8872488ed1b8f;hb=67d91dfd505ce7e2c641c12e5d14b50896874ec7;hpb=662d1859bde420b2cc87891fa23c6702a11dbc11 diff --git a/src/movepick.cpp b/src/movepick.cpp index 486fec0f..78181748 100644 --- a/src/movepick.cpp +++ b/src/movepick.cpp @@ -64,7 +64,7 @@ MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const History& h, captureThreshold = 0; curMove = lastMove = moves; - badCaptures = moves + MAX_MOVES; + lastBadCapture = moves + MAX_MOVES - 1; if (p.in_check()) phase = EVASION; @@ -166,21 +166,19 @@ void MovePicker::score_captures() { cur->score = PieceValueMidgame[pos.piece_on(to_sq(m))] - type_of(pos.piece_moved(m)); - if (is_promotion(m)) - cur->score += PieceValueMidgame[promotion_piece_type(m)]; + if (type_of(m) == PROMOTION) + cur->score += PieceValueMidgame[promotion_type(m)]; } } void MovePicker::score_noncaptures() { Move m; - Square from; for (MoveStack* cur = moves; cur != lastMove; cur++) { m = cur->move; - from = from_sq(m); - cur->score = H.value(pos.piece_on(from), to_sq(m)); + cur->score = H.value(pos.piece_moved(m), to_sq(m)); } } @@ -218,7 +216,7 @@ void MovePicker::generate_next() { switch (++phase) { case CAPTURES_S1: case CAPTURES_S3: case CAPTURES_S4: case CAPTURES_S5: case CAPTURES_S6: - lastMove = generate(pos, moves); + lastMove = generate(pos, moves); score_captures(); return; @@ -228,7 +226,7 @@ void MovePicker::generate_next() { return; case QUIETS_1_S1: - lastQuiet = lastMove = generate(pos, moves); + lastQuiet = lastMove = generate(pos, moves); score_noncaptures(); lastMove = std::partition(curMove, lastMove, has_positive_score); sort(curMove, lastMove); @@ -242,19 +240,18 @@ void MovePicker::generate_next() { return; case BAD_CAPTURES_S1: - // Bad captures SEE value is already calculated so just pick them in order - // to get SEE move ordering. - curMove = badCaptures; - lastMove = moves + MAX_MOVES; + // Just pick them in reverse order to get MVV/LVA ordering + curMove = moves + MAX_MOVES - 1; + lastMove = lastBadCapture; return; case EVASIONS_S2: - lastMove = generate(pos, moves); + lastMove = generate(pos, moves); score_evasions(); return; case QUIET_CHECKS_S3: - lastMove = generate(pos, moves); + lastMove = generate(pos, moves); return; case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT: case RECAPTURE: @@ -297,21 +294,19 @@ Move MovePicker::next_move() { { assert(captureThreshold <= 0); // Otherwise we cannot use see_sign() - int seeScore = pos.see_sign(move); - if (seeScore >= captureThreshold) + if (pos.see_sign(move) >= captureThreshold) return move; // Losing capture, move it to the tail of the array - (--badCaptures)->move = move; - badCaptures->score = seeScore; + (lastBadCapture--)->move = move; } break; case KILLERS_S1: move = (curMove++)->move; - if ( move != MOVE_NONE - && pos.is_pseudo_legal(move) - && move != ttMove + if ( move != MOVE_NONE + && pos.is_pseudo_legal(move) + && move != ttMove && !pos.is_capture(move)) return move; break; @@ -325,8 +320,7 @@ Move MovePicker::next_move() { break; case BAD_CAPTURES_S1: - move = pick_best(curMove++, lastMove)->move; - return move; + return (curMove--)->move; case EVASIONS_S2: case CAPTURES_S3: case CAPTURES_S4: move = pick_best(curMove++, lastMove)->move;