Go to the documentation of this file.
22 class RepetitionCounter;
55 return findProof(node_limit, state, key, path, best_move, last_move)
70 bool isWinningStateParallel(
int node_limit,
const NumEffectState& state,
73 bool isWinningStateParallel(
int node_limit,
const NumEffectState& state,
85 void runGC(
bool verbose=
false,
size_t memory_use_ratio_1000=0);
void setVerbose(int level=1)
bool isCheckmateSuccess() const
static const Move INVALID()
std::shared_ptr< Shared > shared
bool isLosingState(int node_limit, const NumEffectState &state, const HashKey &key, const PathEncoding &path, Move last_move=Move::INVALID())
int max(Player p, int v1, int v2)
size_t mainNodeCount() const
bool isWinningState(int node_limit, const NumEffectState &state, const HashKey &key, const PathEncoding &path, Move &best_move, Move last_move=Move::INVALID())
詰みを発見.
Dfpn & prepareDfpnSmall(Player attack)
const DfpnTable & table(Player) const
std::unique_ptr< Local > local
証明数(proof number)と反証数(disproof number).
void runGC(bool verbose=false, size_t memory_use_ratio_1000=0)
void setRootPlayer(Player)
void writeRootHistory(const RepetitionCounter &counter, const MoveStack &moves, const SimpleState &state, Player attack)
DualDfpn(uint64_t ignored=std::numeric_limits< uint64_t >::max())
ProofDisproof findProof(int node_limit, const NumEffectState &state, const HashKey &key, const PathEncoding &path, Move &best_move, Move last_move=Move::INVALID())
size_t totalNodeCount() const
int distance(Player attack, const HashKey &key)
Dfpn & prepareDfpn(Player attack)