2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
20 #if !defined(SEARCH_H_INCLUDED)
21 #define SEARCH_H_INCLUDED
29 /// The SearchStack struct keeps track of the information we need to remember
30 /// from nodes shallower and deeper in the tree during the search. Each
31 /// search thread has its own array of SearchStack objects, indexed by the
49 /// The SearchLimits struct stores information sent by GUI about available time
50 /// to search the current move, maximum depth/time, if we are in analysis mode
51 /// or if we have to ponder while is our opponent's side to move.
56 SearchLimits(int t, int i, int mtg, int mt, int md, int mn, bool inf, bool pon)
57 : time(t), increment(i), movesToGo(mtg), maxTime(mt), maxDepth(md),
58 maxNodes(mn), infinite(inf), ponder(pon) {}
60 bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | int(infinite)); }
62 int time, increment, movesToGo, maxTime, maxDepth, maxNodes;
63 bool infinite, ponder;
66 extern void init_search();
67 extern int64_t perft(Position& pos, Depth depth);
68 extern bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]);
70 #endif // !defined(SEARCH_H_INCLUDED)