2 Glaurung, a UCI chess playing engine.
3 Copyright (C) 2004-2008 Tord Romstad
5 Glaurung is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
10 Glaurung is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
20 #if !defined(SEARCH_H_INCLUDED)
21 #define SEARCH_H_INCLUDED
41 const int PLY_MAX = 100;
42 const int PLY_MAX_PLUS_2 = 102;
49 /// The SearchStack struct keeps track of the information we need to remember
50 /// from nodes shallower and deeper in the tree during the search. Each
51 /// search thread has its own array of SearchStack objects, indexed by the
57 Value currentMoveCaptureValue;
58 Move mateKiller, killer1, killer2;
68 extern TranspositionTable TT;
70 extern int ActiveThreads;
74 // Perhaps better to make H local, and pass as parameter to MovePicker?
82 extern void init_threads();
83 extern void stop_threads();
84 extern void think(const Position &pos, bool infinite, bool ponder, int side_to_move,
85 int time[], int increment[], int movesToGo, int maxDepth,
86 int maxNodes, int maxTime, Move searchMoves[]);
87 extern int64_t nodes_searched();
90 #endif // !defined(SEARCH_H_INCLUDED)