#include "depth.h"
#include "move.h"
+#include "value.h"
////
/// from nodes shallower and deeper in the tree during the search. Each
/// search thread has its own array of SearchStack objects, indexed by the
/// current ply.
+struct EvalInfo;
struct SearchStack {
Move pv[PLY_MAX_PLUS_2];
Move threatMove;
Move killers[KILLER_MAX];
Depth reduction;
+ Value eval;
void init(int ply);
void initKillers();
//// Prototypes
////
+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[]);