X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=599d058fa7d018454ea481f30a6448f079a53e87;hp=d722af1e63ab4e1c4dad848695e52230201d1520;hb=1d09ee70f7da1f9aa60c7ff97a35881327f69a03;hpb=7eaea3848c9e8a388c0b79cee6fba6bf3cd32108

diff --git a/src/search.h b/src/search.h
index d722af1e..599d058f 100644
--- a/src/search.h
+++ b/src/search.h
@@ -28,6 +28,9 @@
 #include "position.h"
 #include "types.h"
 
+template<typename T, bool CM> struct Stats;
+typedef Stats<Value, true> CounterMoveStats;
+
 namespace Search {
 
 /// Stack struct keeps track of the information we need to remember from nodes
@@ -43,6 +46,7 @@ struct Stack {
   Value staticEval;
   bool skipEarlyPruning;
   int moveCount;
+  CounterMoveStats* counterMoves;
 };
 
 /// RootMove struct is used for moves at the root of the tree. For each root move
@@ -55,7 +59,6 @@ struct RootMove {
 
   bool operator<(const RootMove& m) const { return m.score < score; } // Descending sort
   bool operator==(const Move& m) const { return pv[0] == m; }
-  void insert_pv_in_tt(Position& pos);
   bool extract_ponder_from_tt(Position& pos);
 
   Value score = -VALUE_INFINITE;