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) 2015-2018 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
explicit Thread(size_t);
virtual ~Thread();
virtual void search();
+ void clear();
void idle_loop();
void start_searching();
void wait_for_search_finished();
Pawns::Table pawnsTable;
Material::Table materialTable;
Endgames endgames;
- size_t PVIdx;
- int selDepth;
+ size_t pvIdx, pvLast;
+ int selDepth, nmpMinPly;
+ Color nmpColor;
std::atomic<uint64_t> nodes, tbHits;
Position rootPos;
Depth rootDepth, completedDepth;
CounterMoveHistory counterMoves;
ButterflyHistory mainHistory;
+ CapturePieceToHistory captureHistory;
ContinuationHistory contHistory;
+ Score contempt;
};
using Thread::Thread;
- virtual void search();
+ void search() override;
void check_time();
- bool easyMovePlayed, failedLow;
- double bestMoveChanges;
+ bool failedLow;
+ double bestMoveChanges, previousTimeReduction;
Value previousScore;
int callsCnt;
};
struct ThreadPool : public std::vector<Thread*> {
- void init(size_t); // No constructor and destructor, threads rely on globals that should
- void exit(); // be initialized and valid during the whole thread lifetime.
void start_thinking(Position&, StateListPtr&, const Search::LimitsType&, bool = false);
+ void clear();
void set(size_t);
MainThread* main() const { return static_cast<MainThread*>(front()); }