X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Fsearch.h;h=2554f3fbd8a122bfefb7e5abbd833fe71eba955d;hb=651ec3b31ee68db50f38ccd8fcdedbd6673cd9ed;hp=9d3fb4ca355899bb7bcc100aa28b9ce5872c868c;hpb=0fcda095df1caa860e8e3f3a714d5545ec9dc122;p=stockfish
diff --git a/src/search.h b/src/search.h
index 9d3fb4ca..2554f3fb 100644
--- a/src/search.h
+++ b/src/search.h
@@ -1,7 +1,6 @@
/*
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
+ Copyright (C) 2004-2020 The Stockfish developers (see AUTHORS file)
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
@@ -17,42 +16,93 @@
along with this program. If not, see .
*/
-#if !defined(SEARCH_H_INCLUDED)
+#ifndef SEARCH_H_INCLUDED
#define SEARCH_H_INCLUDED
-#include "move.h"
+#include
+
+#include "misc.h"
+#include "movepick.h"
#include "types.h"
-const int PLY_MAX = 100;
-const int PLY_MAX_PLUS_2 = PLY_MAX + 2;
+class Position;
+
+namespace Search {
-/// 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 EvalInfo;
-struct SplitPoint;
+/// Threshold used for countermoves based pruning
+constexpr int CounterMovePruneThreshold = 0;
-struct SearchStack {
+
+/// Stack 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 Stack objects, indexed by the current ply.
+
+struct Stack {
+ Move* pv;
+ PieceToHistory* continuationHistory;
+ int ply;
Move currentMove;
- Move mateKiller;
Move excludedMove;
- Move bestMove;
Move killers[2];
- Depth reduction;
- Value eval;
- Value evalMargin;
- bool skipNullMove;
- SplitPoint* sp;
+ Value staticEval;
+ int statScore;
+ int moveCount;
+ bool inCheck;
};
-class Position;
-extern void init_search();
-extern void init_threads();
-extern void exit_threads();
-extern int64_t 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[]);
+/// RootMove struct is used for moves at the root of the tree. For each root move
+/// we store a score and a PV (really a refutation in the case of moves which
+/// fail low). Score is normally set at -VALUE_INFINITE for all non-pv moves.
+
+struct RootMove {
+
+ explicit RootMove(Move m) : pv(1, m) {}
+ bool extract_ponder_from_tt(Position& pos);
+ bool operator==(const Move& m) const { return pv[0] == m; }
+ bool operator<(const RootMove& m) const { // Sort in descending order
+ return m.score != score ? m.score < score
+ : m.previousScore < previousScore;
+ }
+
+ Value score = -VALUE_INFINITE;
+ Value previousScore = -VALUE_INFINITE;
+ int selDepth = 0;
+ int tbRank = 0;
+ int bestMoveCount = 0;
+ Value tbScore;
+ std::vector pv;
+};
+
+typedef std::vector RootMoves;
+
+
+/// LimitsType struct stores information sent by GUI about available time to
+/// search the current move, maximum depth/time, or if we are in analysis mode.
+
+struct LimitsType {
+
+ LimitsType() { // Init explicitly due to broken value-initialization of non POD in MSVC
+ time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = npmsec = movetime = TimePoint(0);
+ movestogo = depth = mate = perft = infinite = 0;
+ nodes = 0;
+ }
+
+ bool use_time_management() const {
+ return time[WHITE] || time[BLACK];
+ }
+
+ std::vector searchmoves;
+ TimePoint time[COLOR_NB], inc[COLOR_NB], npmsec, movetime, startTime;
+ int movestogo, depth, mate, perft, infinite;
+ int64_t nodes;
+};
+
+extern LimitsType Limits;
+
+void init();
+void clear();
+
+} // namespace Search
-#endif // !defined(SEARCH_H_INCLUDED)
+#endif // #ifndef SEARCH_H_INCLUDED