/// 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 killers[KILLER_MAX];
Depth reduction;
Value eval;
+ EvalInfo* evalInfo;
void init(int ply);
void initKillers();