X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=a399beba9a6069ebedeccc619a82f8fbc8457fed;hp=afa12b3a4ee6b56104918178aeee4bdd50e6845a;hb=4aca11ae2a37df653b54f554a3d8b3005c063447;hpb=1a939cd8c8679e74e9a27ae72d9963247d647890

diff --git a/src/search.h b/src/search.h
index afa12b3a..a399beba 100644
--- a/src/search.h
+++ b/src/search.h
@@ -32,26 +32,13 @@ 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;
+  Move* pv;
   int ply;
   Move currentMove;
   Move ttMove;