mirror of
https://github.com/official-stockfish/Stockfish.git
synced 2026-07-22 12:47:08 +00:00
DisservinandJoost VandeVondele
2d0237db3f
This introduces clang-format to enforce a consistent code style for Stockfish. Having a documented and consistent style across the code will make contributing easier for new developers, and will make larger changes to the codebase easier to make. To facilitate formatting, this PR includes a Makefile target (`make format`) to format the code, this requires clang-format (version 17 currently) to be installed locally. Installing clang-format is straightforward on most OS and distros (e.g. with https://apt.llvm.org/, brew install clang-format, etc), as this is part of quite commonly used suite of tools and compilers (llvm / clang). Additionally, a CI action is present that will verify if the code requires formatting, and comment on the PR as needed. Initially, correct formatting is not required, it will be done by maintainers as part of the merge or in later commits, but obviously this is encouraged. fixes https://github.com/official-stockfish/Stockfish/issues/3608 closes https://github.com/official-stockfish/Stockfish/pull/4790 Co-Authored-By: Joost VandeVondele <Joost.VandeVondele@gmail.com>
116 lines
3.6 KiB
C++
116 lines
3.6 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
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
|
|
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 <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.
|
|
|
|
struct Stack {
|
|
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.
|
|
|
|
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;
|
|
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;
|
|
};
|
|
|
|
using RootMoves = std::vector<RootMove>;
|
|
|
|
|
|
// 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<Move> 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
|
|
|
|
} // namespace Stockfish
|
|
|
|
#endif // #ifndef SEARCH_H_INCLUDED
|