def __init__(self, navigation, visited=None, current_pos=None, diagonal=False, heuristics_type=None): # pylint: disable=too-many-arguments self.visited = visited or [navigation.start] self.current_pos = current_pos or navigation.start self.diagonal = diagonal self.heuristics_type = heuristics_type SearchState.__init__(self, navigation)
def __init__(self, nonogram, gac, domains=None, solution_length=0): if domains: self.domains = domains else: self.domains = {} for row in range(nonogram.y): row_id = nonogram.y - row - 1 self.domains['r' + str(row_id)] = NonogramState.init_domain( nonogram.x, nonogram.rows[row] ) for col in range(nonogram.x): self.domains['c' + str(col)] = NonogramState.init_domain( nonogram.y, nonogram.columns[col] ) self.gac = gac self._solution_length = solution_length SearchState.__init__(self, nonogram)
def __init__(self, graph, gac, num_colors, domains=None, solution_length=0): # pylint: disable=too-many-arguments viable_values = [ C.graph_colors.RED, C.graph_colors.GREEN, C.graph_colors.BLUE, C.graph_colors.ORANGE, C.graph_colors.PINK, C.graph_colors.YELLOW, C.graph_colors.PURPLE, C.graph_colors.BROWN, C.graph_colors.CYAN, C.graph_colors.DARK_BROWN ] if domains: self.domains = domains else: self.domains = OrderedDict() for i in range(graph.nv): self.domains['v' + str(i)] = viable_values[:num_colors] self.gac = gac self._solution_length = solution_length self.num_colors = num_colors SearchState.__init__(self, graph)