struct Stack {
SplitPoint* splitPoint;
+ Move* pv;
int ply;
Move currentMove;
Move ttMove;
bool operator<(const RootMove& m) const { return score > m.score; } // Ascending sort
bool operator==(const Move& m) const { return pv[0] == m; }
- void extract_pv_from_tt(Position& pos);
void insert_pv_in_tt(Position& pos);
Value score;
extern Time::point SearchTime;
extern StateStackPtr SetupStates;
-extern void init();
-extern void think();
+void init();
+void think();
template<bool Root> uint64_t perft(Position& pos, Depth depth);
} // namespace Search