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
struct SplitPoint;
struct SearchStack {
+ int ply;
Move currentMove;
Move mateKiller;
Move excludedMove;
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)