Use score and value consistently

[stockfish] / src / pawns.h

diff --git a/src/pawns.h b/src/pawns.h
index f24fb75ad3b8d9c2511492c72698e8de59562c2a..04aced772a814bd48d67a332779c27443a960a05 100644 (file)
--- a/src/pawns.h
+++ b/src/pawns.h
@@ -32,7 +32,7 @@ namespace Pawns {
 
 struct Entry {
 
 
 struct Entry {
 

-  Score pawns_value() const { return value; }
+  Score pawns_score() const { return score; }

   Bitboard pawn_attacks(Color c) const { return pawnAttacks[c]; }
   Bitboard passed_pawns(Color c) const { return passedPawns[c]; }
 
   Bitboard pawn_attacks(Color c) const { return pawnAttacks[c]; }
   Bitboard passed_pawns(Color c) const { return passedPawns[c]; }
 


@@ -65,12 +65,12 @@ struct Entry {
   Value shelter_storm(const Position& pos, Square ksq);
 
   Key key;
   Value shelter_storm(const Position& pos, Square ksq);
 
   Key key;

-  Score value;
+  Score score;

   Bitboard passedPawns[COLOR_NB];
   Bitboard pawnAttacks[COLOR_NB];
   Square kingSquares[COLOR_NB];
   Score kingSafety[COLOR_NB];
   Bitboard passedPawns[COLOR_NB];
   Bitboard pawnAttacks[COLOR_NB];
   Square kingSquares[COLOR_NB];
   Score kingSafety[COLOR_NB];

-  int minKPdistance[COLOR_NB];
+  int minKingPawnDistance[COLOR_NB];

   int castlingRights[COLOR_NB];
   int semiopenFiles[COLOR_NB];
   int pawnSpan[COLOR_NB];
   int castlingRights[COLOR_NB];
   int semiopenFiles[COLOR_NB];
   int pawnSpan[COLOR_NB];


@@ -79,6 +79,7 @@ struct Entry {
 
 typedef HashTable<Entry, 16384> Table;
 
 
 typedef HashTable<Entry, 16384> Table;
 

+void init();

 Entry* probe(const Position& pos, Table& entries);
 
 } // namespace Pawns
 Entry* probe(const Position& pos, Table& entries);
 
 } // namespace Pawns