def __init__(self, model): Solver.__init__(self, model) self.tree = None self.simulation_time = None # in seconds self.max_particles = None # maximum number of particles can be supplied by hand for a belief node self.reinvigorated_particles_ratio = None # ratio of max_particles to mutate self.utility_fn = None
def __init__(self, model): Solver.__init__(self, model) self.tree = None self.gamma = None # discount self.cur_state = None # current state for which action is produced self.horizon = None self.width = None self.max_reward = None # upperbound on possible reward for a state self.max_diff = None # max expected difference between optimal and computed self.utility_fn = None
def __init__(self, matches = 10): Solver.__init__(self, matches) self.base = [ x for x in range(matches) ] self.generator = itertools.permutations(self.base) print('Tryhard solver initialized!')
def __init__(self, model): Solver.__init__(self, model) self.belief_points = None self.alpha_vecs = None self.solved = False
def __init__(self, matches=10): Solver.__init__(self, matches) self.matches = matches self.reset() print('Bumblesort solver initialized!')
def __init__(self, matches=10): Solver.__init__(self, matches) self.matches = matches self.base = [x for x in range(self.matches)] print('Random solver initialized!')