Introduce bestMove to store PV move

[stockfish] / src / search.h

diff --git a/src/search.h b/src/search.h
index 4a6d3da583dab2f629527248c6dc8b46ec757bf0..a3bef714e090cb7970cdc88766006b8f8f2b7c69 100644 (file)
--- a/src/search.h
+++ b/src/search.h
@@ -1,7 +1,7 @@
 /*
   Stockfish, a UCI chess playing engine derived from Glaurung 2.1
   Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
-  Copyright (C) 2008-2009 Marco Costalba
+  Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
 
   Stockfish is free software: you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
@@ -54,12 +54,14 @@ struct SearchStack {
   Move currentMove;
   Move mateKiller;
   Move threatMove;
+  Move excludedMove;
+  Move bestMove;
   Move killers[KILLER_MAX];
   Depth reduction;
   Value eval;
-  EvalInfo* evalInfo;
+  bool skipNullMove;
 
-  void init(int ply);
+  void init();
   void initKillers();
 };
 
@@ -70,7 +72,7 @@ struct SearchStack {
 
 extern void init_search();
 extern void init_threads();
-extern void stop_threads();
+extern void exit_threads();
 extern bool think(const Position &pos, bool infinite, bool ponder, int side_to_move,
                   int time[], int increment[], int movesToGo, int maxDepth,
                   int maxNodes, int maxTime, Move searchMoves[]);