X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fsearch.h;h=afa12b3a4ee6b56104918178aeee4bdd50e6845a;hb=4739037f967ac3c818907e89cc88c7b97021d027;hp=2fd160b68a6d9ab5a58f45e8321880c9ab3d9b98;hpb=bcbab1937670ca39ddb0a216ff9a787e56b79b3a;p=stockfish

diff --git a/src/search.h b/src/search.h
index 2fd160b6..afa12b3a 100644
--- a/src/search.h
+++ b/src/search.h
@@ -32,12 +32,26 @@ struct SplitPoint;
 
 namespace Search {
 
+struct PVEntry {
+  Move pv[MAX_PLY+1];
+
+  void update(Move move, PVEntry* child) {
+      pv[0] = move;
+
+      int i = 1;
+      for (; child && i < MAX_PLY && child->pv[i - 1] != MOVE_NONE; ++i)
+          pv[i] = child->pv[i - 1];
+      pv[i] = MOVE_NONE;
+  } 
+};
+
 /// The Stack struct keeps track of the information we need to remember from
 /// nodes shallower and deeper in the tree during the search. Each search thread
 /// has its own array of Stack objects, indexed by the current ply.
 
 struct Stack {
   SplitPoint* splitPoint;
+  PVEntry* pv;
   int ply;
   Move currentMove;
   Move ttMove;
@@ -62,7 +76,6 @@ struct RootMove {
   bool operator<(const RootMove& m) const { return score > m.score; } // Ascending sort
   bool operator==(const Move& m) const { return pv[0] == m; }
 
-  void extract_pv_from_tt(Position& pos);
   void insert_pv_in_tt(Position& pos);
 
   Value score;
@@ -105,8 +118,8 @@ extern Position RootPos;
 extern Time::point SearchTime;
 extern StateStackPtr SetupStates;
 
-extern void init();
-extern void think();
+void init();
+void think();
 template<bool Root> uint64_t perft(Position& pos, Depth depth);
 
 } // namespace Search