X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=b2c876455c7c0c4afcbacdd9d75a43b8bd1c5911;hp=da9e7ff9bee47fea95a76208d9ecd8544703b294;hb=b01e5fc612b401c83580cc6c1ecd0c62c9592179;hpb=5c81602d14539f8259a715477315e28b5de7cb54 diff --git a/src/search.h b/src/search.h index da9e7ff9..b2c87645 100644 --- a/src/search.h +++ b/src/search.h @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2009 Marco Costalba + Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -26,11 +26,7 @@ //// #include "depth.h" -#include "history.h" -#include "lock.h" -#include "movegen.h" -#include "position.h" -#include "tt.h" +#include "move.h" #include "value.h" @@ -39,8 +35,7 @@ //// const int PLY_MAX = 100; -const int PLY_MAX_PLUS_2 = 102; -const int KILLER_MAX = 2; +const int PLY_MAX_PLUS_2 = PLY_MAX + 2; //// @@ -51,43 +46,32 @@ const int KILLER_MAX = 2; /// 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 SplitPoint; struct SearchStack { - Move pv[PLY_MAX]; Move currentMove; Move mateKiller; - Move threatMove; - Move killers[KILLER_MAX]; + Move excludedMove; + Move bestMove; + Move killers[2]; Depth reduction; - - void init(int ply); - void initKillers(); + Value eval; + Value evalMargin; + bool skipNullMove; + SplitPoint* sp; }; -//// -//// Global variables -//// - -extern SearchStack EmptySearchStack; -extern TranspositionTable TT; -extern int ActiveThreads; -extern Lock SMPLock; - -// Perhaps better to make H local, and pass as parameter to MovePicker? -extern History H; - - //// //// Prototypes //// +extern void init_search(); extern void init_threads(); -extern void stop_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[]); -extern int64_t nodes_searched(); - +extern void exit_threads(); +extern int 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)