mirror of
https://github.com/opelly27/Stockfish.git
synced 2026-05-20 10:57:43 +00:00
Marco Costalba
d58176bfea
The timer will be fired asynchronously to handle time management flags, while other threads are searching. This implementation uses a thread waiting on a timed condition variable instead of real timers. This approach allow to reduce platform dependant code to a minimum and also is the most portable given that timers libraries are very different among platforms and also the best ones are not compatible with olds Windows. Also retire the now unused polling code. No functional change. Signed-off-by: Marco Costalba <mcostalba@gmail.com>
74 lines
2.4 KiB
C++
74 lines
2.4 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
|
|
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
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
Stockfish is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#if !defined(SEARCH_H_INCLUDED)
|
|
#define SEARCH_H_INCLUDED
|
|
|
|
#include <cstring>
|
|
|
|
#include "move.h"
|
|
#include "types.h"
|
|
|
|
class Position;
|
|
struct SplitPoint;
|
|
|
|
/// The SearchStack struct keeps track of the information we need to remember
|
|
/// 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 SearchStack {
|
|
SplitPoint* sp;
|
|
int ply;
|
|
Move currentMove;
|
|
Move excludedMove;
|
|
Move bestMove;
|
|
Move killers[2];
|
|
Depth reduction;
|
|
Value eval;
|
|
Value evalMargin;
|
|
int skipNullMove;
|
|
};
|
|
|
|
|
|
/// The SearchLimits struct stores information sent by GUI about available time
|
|
/// to search the current move, maximum depth/time, if we are in analysis mode
|
|
/// or if we have to ponder while is our opponent's side to move.
|
|
|
|
struct SearchLimits {
|
|
|
|
SearchLimits() { memset(this, 0, sizeof(SearchLimits)); }
|
|
|
|
SearchLimits(int t, int i, int mtg, int mt, int md, int mn, bool inf, bool pon)
|
|
: time(t), increment(i), movesToGo(mtg), maxTime(mt), maxDepth(md),
|
|
maxNodes(mn), infinite(inf), ponder(pon) {}
|
|
|
|
bool useTimeManagement() const { return !(maxTime | maxDepth | maxNodes | infinite); }
|
|
|
|
int time, increment, movesToGo, maxTime, maxDepth, maxNodes, infinite, ponder;
|
|
};
|
|
|
|
extern void init_search();
|
|
extern int64_t perft(Position& pos, Depth depth);
|
|
extern bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]);
|
|
extern void do_uci_async_cmd(const std::string& cmd);
|
|
extern void do_timer_event();
|
|
|
|
#endif // !defined(SEARCH_H_INCLUDED)
|