X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.cpp;h=09d272e56983361fe813032c0051adf011169aac;hp=b45679560e701c487fd4e63164363df35d6c0d11;hb=55bd27b8f08a151128d7065fa2819aa3e9605299;hpb=3aa2d6db18debdc619b4e53809a9bd0eb5faa155

diff --git a/src/search.cpp b/src/search.cpp
index b4567956..09d272e5 100644
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -136,7 +136,7 @@ void Search::init() {
 
   // Init futility move count array
   for (d = 0; d < 32; d++)
-      FutilityMoveCounts[d] = int(3.001 + 0.25 * pow(d, 2.0));
+      FutilityMoveCounts[d] = int(3.001 + 0.25 * pow(double(d), 2.0));
 }
 
 
@@ -1023,7 +1023,8 @@ split_point_start: // At split points actual search starts from here
     // If we are in a singular extension search then return a fail low score.
     // A split node has at least one move, the one tried before to be splitted.
     if (!moveCount)
-        return excludedMove ? alpha : inCheck ? mated_in(ss->ply) : VALUE_DRAW;
+        return  excludedMove ? alpha
+              : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
 
     // If we have pruned all the moves without searching return a fail-low score
     if (bestValue == -VALUE_INFINITE)