X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fmovepick.cpp;h=9411b5a701d34ef4070b64d14213016b45766426;hb=158864270a055fe20dca4a87f4b7a8aa9cedfeb9;hp=b5727f109fbcfd8aec263245a9cf944e3f9310a9;hpb=234344500f4d6e35c6992a07e0b1adb59aea209e;p=stockfish

diff --git a/src/movepick.cpp b/src/movepick.cpp
index b5727f10..9411b5a7 100644
--- a/src/movepick.cpp
+++ b/src/movepick.cpp
@@ -51,7 +51,7 @@ namespace {
 
   // Unary predicate used by std::partition to split positive values from remaining
   // ones so as to sort the two sets separately, with the second sort delayed.
-  inline bool has_positive_value(const ExtMove& ms) { return ms.value > 0; }
+  inline bool has_positive_value(const ExtMove& move) { return move.value > 0; }
 
   // Picks the best move in the range (begin, end) and moves it to the front.
   // It's faster than sorting all the moves in advance when there are few