mirror of
https://github.com/HChaZZY/Stockfish.git
synced 2025-12-25 03:26:24 +08:00
5c936572e9
# Conflicts: # src/Makefile # src/position.cpp # src/position.h # src/search.cpp # src/types.h # src/uci.cpp
115 lines
3.3 KiB
C++
115 lines
3.3 KiB
C++
/*
|
||
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-2020 Marco Costalba, Joona Kiiski, Gary Linscott, 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/>.
|
||
*/
|
||
|
||
#ifndef SEARCH_H_INCLUDED
|
||
#define SEARCH_H_INCLUDED
|
||
|
||
#include <vector>
|
||
|
||
#include "misc.h"
|
||
#include "movepick.h"
|
||
#include "types.h"
|
||
|
||
class Position;
|
||
|
||
namespace Search {
|
||
|
||
/// Threshold used for countermoves based pruning
|
||
constexpr int CounterMovePruneThreshold = 0;
|
||
|
||
|
||
/// 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 excludedMove;
|
||
Move killers[2];
|
||
Value staticEval;
|
||
int statScore;
|
||
int moveCount;
|
||
bool inCheck;
|
||
};
|
||
|
||
|
||
/// 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<Move> pv;
|
||
};
|
||
|
||
typedef std::vector<RootMove> 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;
|
||
silent = false;
|
||
}
|
||
|
||
bool use_time_management() const {
|
||
return !(mate | movetime | depth | nodes | perft | infinite);
|
||
}
|
||
|
||
std::vector<Move> searchmoves;
|
||
TimePoint time[COLOR_NB], inc[COLOR_NB], npmsec, movetime, startTime;
|
||
int movestogo, depth, mate, perft, infinite;
|
||
int64_t nodes;
|
||
// <20><><EFBFBD>ʂɏo<C98F>͂<EFBFBD><CD82>Ȃ<EFBFBD><C882>T<EFBFBD>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>g<EFBFBD><67><EFBFBD>[<5B>h(<28>v<EFBFBD><76><EFBFBD>Z<EFBFBD>X<EFBFBD><58><EFBFBD>ł̘A<CC98><41><EFBFBD><EFBFBD><EFBFBD>ȑΐ<C891><CE90>̂Ƃ<CC82><C682>p)
|
||
// <20><><EFBFBD>̂Ƃ<CC82>PV<50><56><EFBFBD>o<EFBFBD>͂<EFBFBD><CD82>Ȃ<EFBFBD><C882>B
|
||
bool silent;
|
||
};
|
||
|
||
extern LimitsType Limits;
|
||
|
||
void init();
|
||
void clear();
|
||
|
||
} // namespace Search
|
||
|
||
#endif // #ifndef SEARCH_H_INCLUDED
|