12 template<
typename this_t,
typename HYP>
17 using data_t =
typename HYP::data_t;
20 if(
DEBUG_MCTS)
DEBUG(
"PartialMCTSNode SEARCH ONE ",
this,
"\t["+current.string()+
"] ", (
unsigned long)this->
nvisits);
27 if(current.is_evaluable()) {
28 c->process_evaluable(current);
33 c->add_children(current);
34 auto idx = c->sample_child_index(current);
35 current.expand_to_neighbor(idx);
36 for(
auto& h : c->child(idx).playout(current)) {
48 if(current.is_evaluable()) {
unsigned long inner_runtime
Definition: FleetArgs.h:26
#define DEBUG_MCTS
Definition: MCTSBase.h:3
typename HYP::data_t data_t
Definition: MCTSBase.h:46
virtual void process_evaluable(HYP ¤t)
If we can evaluate this current node (usually: compute a posterior and add_sample) ...
Definition: MCTSBase.h:193
Definition: generator.hpp:21
virtual this_t * descend_to_childless(HYP ¤t)
This goes down the tree to a node with no children (OR evaluable)
Definition: MCTSBase.h:300
unsigned long inner_restart
Definition: FleetArgs.h:27
Definition: PartialMCTSNode.h:13
Definition: MCTSBase.h:41
void add_sample(const float v)
Definition: MCTSBase.h:163
void DEBUG(FIRST f, ARGS... args)
Print to std:ccout with debugging info.
Definition: IO.h:73
Definition: PriorInference.h:17
unsigned long inner_steps
Definition: FleetArgs.h:13
std::atomic< unsigned int > nvisits
Definition: MCTSBase.h:59
static data_t * data
Definition: MCTSBase.h:57