X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fsearch.h;h=12f365dc536ede5625bd94b470033cd3a0ec269e;hp=62d3fe9ed9f4055eadd1800679bee69f9f25b274;hb=a04dcce6289c39ea497de67ab43306ca6d47319b;hpb=e1ed67aacbe7fb4b462b9141d3137bed0a3ea70b diff --git a/src/search.h b/src/search.h index 62d3fe9e..12f365dc 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" @@ -51,41 +47,35 @@ 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 SearchStack { - Move pv[PLY_MAX]; + Move pv[PLY_MAX_PLUS_2]; Move currentMove; Move mateKiller; Move threatMove; + Move excludedMove; Move killers[KILLER_MAX]; Depth reduction; + Value eval; + bool skipNullMove; - void init(int ply); + void init(); void initKillers(); }; -//// -//// Global variables -//// - -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 void exit_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 int perft(Position &pos, Depth depth); extern int64_t nodes_searched();