Fix compile on icc

Error is:

  a value of type "int" cannot be assigned to an entity of type "Value"

Also retire the now unused squares_of_color() function.

No functional change.

diff --git a/src/bitboard.h b/src/bitboard.h
index f6f1eba681e6d0030d0e8dccba75565bf9c82070..4aecf418a67b85db7510086cb39be5d47a28f2d1 100644 (file)
--- a/src/bitboard.h
+++ b/src/bitboard.h
@@ -200,14 +200,6 @@ inline Bitboard passed_pawn_mask(Color c, Square s) {
 }
 
 
 }
 
 

-/// squares_of_color() returns a bitboard representing all the squares of the
-/// same color of the given one.
-
-inline Bitboard squares_of_color(Square s) {
-  return DarkSquares & s ? DarkSquares : ~DarkSquares;
-}
-
-

 /// aligned() returns true if the squares s1, s2 and s3 are aligned either on a
 /// straight or on a diagonal line.
 
 /// aligned() returns true if the squares s1, s2 and s3 are aligned either on a
 /// straight or on a diagonal line.
 

diff --git a/src/evaluate.cpp b/src/evaluate.cpp
index 2f9cec5cb2891ef48f043c79ff0ed4886f6a387c..5c1f7496d0b208da4984cb2302aaac9b0412ee48 100644 (file)
--- a/src/evaluate.cpp
+++ b/src/evaluate.cpp
@@ -124,7 +124,8 @@ namespace {
       S( 94, 99), S( 96,100), S(99,111), S(99,112) }
   };
 
       S( 94, 99), S( 96,100), S(99,111), S(99,112) }
   };
 

-  // Outpost[knight/bishop][supported by pawn]
+  // Outpost[knight/bishop][supported by pawn] contains bonuses for knights and bishops
+  // outposts, bigger if outpost piece is supported by a pawn.

   const Score Outpost[][2] = {
     { S(28, 7), S(42,11) }, // Knights
     { S(12, 3), S(18, 5) }  // Bishops
   const Score Outpost[][2] = {
     { S(28, 7), S(42,11) }, // Knights
     { S(12, 3), S(18, 5) }  // Bishops

diff --git a/src/movepick.cpp b/src/movepick.cpp
index 94ceedbfd4cf4a37cca4e4db6104a982ce60576f..a69a4c1b5bb899741acac76440d4f6cae8596a91 100644 (file)
--- a/src/movepick.cpp
+++ b/src/movepick.cpp
@@ -149,7 +149,7 @@ void MovePicker::score<CAPTURES>() {
   // calls in case we get a cutoff.
   for (auto& m : *this)
       m.value =  PieceValue[MG][pos.piece_on(to_sq(m))]
   // calls in case we get a cutoff.
   for (auto& m : *this)
       m.value =  PieceValue[MG][pos.piece_on(to_sq(m))]

-               - 200 * relative_rank(pos.side_to_move(), to_sq(m));
+               - Value(200 * relative_rank(pos.side_to_move(), to_sq(m)));

 }
 
 template<>
 }
 
 template<>

diff --git a/src/search.cpp b/src/search.cpp
index 4aecad1cca7981096828d15b3217d6564330f611..cbc5038ab901889e3e875c901f07309481501349 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -902,7 +902,7 @@ moves_loop: // When in check and at SpNode search starts from here
           // Futility pruning: parent node
           if (predictedDepth < 7 * ONE_PLY)
           {
           // Futility pruning: parent node
           if (predictedDepth < 7 * ONE_PLY)
           {

-              futilityValue =  ss->staticEval + futility_margin(predictedDepth) + 256;
+              futilityValue = ss->staticEval + futility_margin(predictedDepth) + 256;

 
               if (futilityValue <= alpha)
               {
 
               if (futilityValue <= alpha)
               {