/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
- Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
- Copyright (C) 2015-2017 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
+ Copyright (C) 2004-2023 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
#ifndef SEARCH_H_INCLUDED
#define SEARCH_H_INCLUDED
-#include <atomic>
+#include <cstdint>
#include <vector>
#include "misc.h"
#include "movepick.h"
#include "types.h"
+namespace Stockfish {
+
class Position;
namespace Search {
-/// 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.
+// 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;
- CounterMoveStats* counterMoves;
- int ply;
- Move currentMove;
- Move excludedMove;
- Move killers[2];
- Value staticEval;
- int history;
- int moveCount;
+ Move* pv;
+ PieceToHistory* continuationHistory;
+ int ply;
+ Move currentMove;
+ Move excludedMove;
+ Move killers[2];
+ Value staticEval;
+ int statScore;
+ int moveCount;
+ bool inCheck;
+ bool ttPv;
+ bool ttHit;
+ int doubleExtensions;
+ int cutoffCnt;
};
-/// 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.
-
+// 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 operator<(const RootMove& m) const {
- return m.score != score ? m.score < score : m.previousScore < previousScore; } // Descending sort
- bool operator==(const Move& m) const { return pv[0] == m; }
- bool extract_ponder_from_tt(Position& pos);
-
- Value score = -VALUE_INFINITE;
- Value previousScore = -VALUE_INFINITE;
- std::vector<Move> pv;
+ explicit RootMove(Move m) :
+ pv(1, m) {}
+ bool extract_ponder_from_tt(Position& pos);
+ bool operator==(const Move& m) const { return pv[0] == m; }
+ // Sort in descending order
+ bool operator<(const RootMove& m) const {
+ return m.score != score ? m.score < score : m.previousScore < previousScore;
+ }
+
+ Value score = -VALUE_INFINITE;
+ Value previousScore = -VALUE_INFINITE;
+ Value averageScore = -VALUE_INFINITE;
+ Value uciScore = -VALUE_INFINITE;
+ bool scoreLowerbound = false;
+ bool scoreUpperbound = false;
+ int selDepth = 0;
+ int tbRank = 0;
+ Value tbScore;
+ std::vector<Move> pv;
};
-typedef std::vector<RootMove> RootMoves;
+using RootMoves = std::vector<RootMove>;
-/// LimitsType 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 it's our opponent's turn to move.
+// 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
- nodes = time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] =
- npmsec = movestogo = depth = movetime = mate = infinite = ponder = 0;
- }
+ // Init explicitly due to broken value-initialization of non POD in MSVC
+ LimitsType() {
+ 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 !(mate | movetime | depth | nodes | infinite);
- }
+ bool use_time_management() const { return time[WHITE] || time[BLACK]; }
- std::vector<Move> searchmoves;
- int time[COLOR_NB], inc[COLOR_NB], npmsec, movestogo, depth, movetime, mate, infinite, ponder;
- int64_t nodes;
- TimePoint startTime;
+ std::vector<Move> searchmoves;
+ TimePoint time[COLOR_NB], inc[COLOR_NB], npmsec, movetime, startTime;
+ int movestogo, depth, mate, perft, infinite;
+ int64_t nodes;
};
-
-/// SignalsType struct stores atomic flags updated during the search, typically
-/// in an async fashion e.g. to stop the search by the GUI.
-
-struct SignalsType {
- std::atomic_bool stop, stopOnPonderhit;
-};
-
-extern SignalsType Signals;
extern LimitsType Limits;
void init();
void clear();
-template<bool Root = true> uint64_t perft(Position& pos, Depth depth);
-} // namespace Search
+} // namespace Search
+
+} // namespace Stockfish
-#endif // #ifndef SEARCH_H_INCLUDED
+#endif // #ifndef SEARCH_H_INCLUDED
projects / stockfish / blobdiff