Options["Hash"] = ttSize;
Options["Threads"] = threads;
- TT.clear();
+ Search::reset();
if (limitType == "time")
limits.movetime = stoi(limit); // movetime is in ms
#define MOVEPICK_H_INCLUDED
#include <algorithm> // For std::max
+#include <cstring> // For std::memset
#include "movegen.h"
#include "position.h"
const T* operator[](Piece pc) const { return table[pc]; }
T* operator[](Piece pc) { return table[pc]; }
+ void clear() { std::memset(table, 0, sizeof(table)); }
void update(Piece pc, Square to, Move m) {
}
+/// Search::reset() clears all search memory, to restore a deterministic state
+
+void Search::reset () {
+
+ TT.clear();
+ History.clear();
+ CounterMovesHistory.clear();
+ Gains.clear();
+ Countermoves.clear();
+}
+
+
/// Search::perft() is our utility to verify move generation. All the leaf nodes
/// up to the given depth are generated and counted and the sum returned.
template<bool Root>
void init();
void think();
+void reset();
template<bool Root> uint64_t perft(Position& pos, Depth depth);
} // namespace Search
#include "search.h"
#include "thread.h"
#include "timeman.h"
-#include "tt.h"
#include "uci.h"
using namespace std;
else if (token == "ucinewgame")
{
- TT.clear();
+ Search::reset();
Time.availableNodes = 0;
}
else if (token == "isready") sync_cout << "readyok" << sync_endl;
#include <ostream>
#include "misc.h"
+#include "search.h"
#include "thread.h"
#include "tt.h"
#include "uci.h"
namespace UCI {
/// 'On change' actions, triggered by an option's value change
-void on_clear_hash(const Option&) { TT.clear(); }
+void on_clear_hash(const Option&) { Search::reset(); }
void on_hash_size(const Option& o) { TT.resize(o); }
void on_logger(const Option& o) { start_logger(o); }
void on_threads(const Option&) { Threads.read_uci_options(); }