X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.cpp;h=edee8179e2d7d3795446b628df14316925a72ae8;hp=7a7e13fc8d7603af33081836c617975dfa06131e;hb=ec36b8dea91f2a7a9c5914557fa06435e00e67db;hpb=42b48b08e81b55e385e55b3074b7c59d81809a45

diff --git a/src/movepick.cpp b/src/movepick.cpp
index 7a7e13fc..edee8179 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& move) { return move.value > 0; }
+  inline bool has_positive_value(const ExtMove& move) { return move.value > VALUE_ZERO; }
 
   // 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