Remove int to int conversion, unused include.

[stockfish] / src / movepick.h

diff --git a/src/movepick.h b/src/movepick.h
index ef3be6c240f8d553b42c68756e48fa512b5bdf3d..97b1b3abb7f1aaeded105cb068e47b6ceab15c69 100644 (file)
--- a/src/movepick.h
+++ b/src/movepick.h
@@ -21,7 +21,6 @@
 #ifndef MOVEPICK_H_INCLUDED
 #define MOVEPICK_H_INCLUDED
 
-#include <algorithm> // For std::max
 #include <cstring>   // For std::memset
 
 #include "movegen.h"
@@ -33,25 +32,25 @@
 /// during the current search, and is used for reduction and move ordering decisions.
 struct HistoryStats {
 
-  static const Value Max = Value(1 << 28);
+  static const int Max = 1 << 28;
 
-  Value get(Color c, Move m) const { return table[c][from_sq(m)][to_sq(m)]; }
+  int get(Color c, Move m) const { return table[c][from_sq(m)][to_sq(m)]; }
   void clear() { std::memset(table, 0, sizeof(table)); }
-  void update(Color c, Move m, Value v) {
+  void update(Color c, Move m, int v) {
 
     Square from = from_sq(m);
     Square to = to_sq(m);
 
-    const int denom = 324;
+    const int D = 324;
 
-    assert(abs(int(v)) <= denom); // Needed for stability.
+    assert(abs(v) <= D); // Consistency check for below formula
 
-    table[c][from][to] -= table[c][from][to] * abs(int(v)) / denom;
-    table[c][from][to] += int(v) * 32;
+    table[c][from][to] -= table[c][from][to] * abs(v) / D;
+    table[c][from][to] += v * 32;
   }
 
 private:
-  Value table[COLOR_NB][SQUARE_NB][SQUARE_NB];
+  int table[COLOR_NB][SQUARE_NB][SQUARE_NB];
 };
 
 
@@ -66,16 +65,15 @@ struct Stats {
   const T* operator[](Piece pc) const { return table[pc]; }
   T* operator[](Piece pc) { return table[pc]; }
   void clear() { std::memset(table, 0, sizeof(table)); }
-  void fill(const Value& v) { std::fill(&table[0][0], &table[PIECE_NB-1][SQUARE_NB-1]+1, v); };
   void update(Piece pc, Square to, Move m) { table[pc][to] = m; }
-  void update(Piece pc, Square to, Value v) {
+  void update(Piece pc, Square to, int v) {
 
-    const int denom = 936;
+    const int D = 936;
 
-    assert(abs(int(v)) <= denom); // Needed for stability.
+    assert(abs(v) <= D); // Consistency check for below formula
 
-    table[pc][to] -= table[pc][to] * abs(int(v)) / denom;
-    table[pc][to] += int(v) * 32;
+    table[pc][to] -= table[pc][to] * abs(v) / D;
+    table[pc][to] += v * 32;
   }
 
 private:
@@ -83,7 +81,7 @@ private:
 };
 
 typedef Stats<Move> MoveStats;
-typedef Stats<Value> CounterMoveStats;
+typedef Stats<int> CounterMoveStats;
 typedef Stats<CounterMoveStats> CounterMoveHistoryStats;
 
 
@@ -113,6 +111,7 @@ private:
 
   const Position& pos;
   const Search::Stack* ss;
+  Move killers[2];
   Move countermove;
   Depth depth;
   Move ttMove;