X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fmovepick.cpp;h=25cbdefd0b10a1b23e9674a35b09776c6bebe98e;hb=2a461b4b745b2542f6e13bab8c60abdb366bc128;hp=4b08e1b46d35c07e95bd65cf547e459f1bdbe86e;hpb=3e0753bef36e5efeed700d7277187f6fbd7275f5;p=stockfish diff --git a/src/movepick.cpp b/src/movepick.cpp index 4b08e1b4..25cbdefd 100644 --- a/src/movepick.cpp +++ b/src/movepick.cpp @@ -244,10 +244,10 @@ void MovePicker::score_captures() { for (int i = 0; i < numOfMoves; i++) { m = moves[i].move; - seeValue = pos.see(m); + seeValue = pos.see_sign(m); if (seeValue >= 0) { - if (move_promotion(m)) + if (move_is_promotion(m)) moves[i].score = QueenValueMidgame; else moves[i].score = int(pos.midgame_value_of_piece_on(move_to(m))) @@ -268,20 +268,23 @@ void MovePicker::score_noncaptures() { // First score by history, when no history is available then use // piece/square tables values. This seems to be better then a // random choice when we don't have an history for any move. - Move m; + Piece piece; + Square from, to; int hs; for (int i = 0; i < numOfMoves; i++) { - m = moves[i].move; - hs = H.move_ordering_score(pos.piece_on(move_from(m)), move_to(m)); + from = move_from(moves[i].move); + to = move_to(moves[i].move); + piece = pos.piece_on(from); + hs = H.move_ordering_score(piece, to); // Ensure history is always preferred to pst if (hs > 0) hs += 1000; // pst based scoring - moves[i].score = hs + pos.mg_pst_delta(m); + moves[i].score = hs + pos.pst_delta(piece, from, to); } } @@ -307,7 +310,7 @@ void MovePicker::score_qcaptures() { for (int i = 0; i < numOfMoves; i++) { Move m = moves[i].move; - if (move_promotion(m)) + if (move_is_promotion(m)) moves[i].score = QueenValueMidgame; else moves[i].score = int(pos.midgame_value_of_piece_on(move_to(m)))