X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fsearch.h;h=65b3b4a7107d03668032db961be252dbb59a6981;hb=bbfe452f85929a938bda7fce9894f57659987919;hp=4bb8b0ad1d3ae67bd4466a270c9c4004535f1932;hpb=c81bf3743fa7905d551080ca678a356a0d31a9a9;p=stockfish

diff --git a/src/search.h b/src/search.h
index 4bb8b0ad..65b3b4a7 100644
--- a/src/search.h
+++ b/src/search.h
@@ -17,30 +17,12 @@
   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
-
 #if !defined(SEARCH_H_INCLUDED)
 #define SEARCH_H_INCLUDED
 
-////
-//// Includes
-////
-
-#include "depth.h"
 #include "move.h"
-#include "value.h"
-
-
-////
-//// Constants
-////
+#include "types.h"
 
-const int PLY_MAX = 100;
-const int PLY_MAX_PLUS_2 = 102;
-
-
-////
-//// Types
-////
 
 /// The SearchStack struct keeps track of the information we need to remember
 /// from nodes shallower and deeper in the tree during the search.  Each
@@ -50,6 +32,7 @@ struct EvalInfo;
 struct SplitPoint;
 
 struct SearchStack {
+  int ply;
   Move currentMove;
   Move mateKiller;
   Move excludedMove;
@@ -62,17 +45,12 @@ struct SearchStack {
   SplitPoint* sp;
 };
 
+class Position;
 
-////
-//// Prototypes
-////
-
-extern void init_search();
 extern void init_threads();
 extern void exit_threads();
-extern int perft(Position& pos, Depth depth);
-extern int64_t nodes_searched();
-extern bool think(const Position& pos, bool infinite, bool ponder, int time[], int increment[],
+extern int64_t perft(Position& pos, Depth depth);
+extern bool think(Position& pos, bool infinite, bool ponder, int time[], int increment[],
                   int movesToGo, int maxDepth, int maxNodes, int maxTime, Move searchMoves[]);
 
 #endif // !defined(SEARCH_H_INCLUDED)