def get_action(self, state): legal_actions = self.get_legal_actions(state) action = None utilities.raise_not_defined() return action
def get_successors(self, state): """ For a given state, this should return a list of triples, made up of (successor, action, step_cost). 'successor' is a successor to the current state 'action' is the action required to get to the successor 'step_cost' is the incremental cost of expanding to that successor """ utilities.raise_not_defined()
def find_path_to_closest_dot(self, game_state): """ Returns a path, composed of a list of actions, to the closest dot, starting from the current game state. """ start_position = game_state.get_pacman_position() food = game_state.get_food() walls = game_state.get_walls() problem = AnyFoodSearchProblem(game_state) "*** YOUR CODE HERE ***" utilities.raise_not_defined()
def get_q_value(self, state, action): utilities.raise_not_defined()
def is_goal_state(self, state): x, y = state "*** YOUR CODE HERE ***" utilities.raise_not_defined()
def get_policy(self, state): utilities.raise_not_defined()
def compute_q_value_from_values(self, state, action): utilities.raise_not_defined()
def depth_first_search(problem): utilities.raise_not_defined()
def uniform_cost_search(problem): utilities.raise_not_defined()
def is_goal_state(self, state): """ Returns true if and only if the state is a valid goal state. """ utilities.raise_not_defined()
def get_start_state(self): """ Returns the start state for the search problem. """ utilities.raise_not_defined()
def better_evaluation_function(current_game_state): utilities.raise_not_defined()
def get_action(self, state): raise_not_defined()
def get_distribution(self, state): """ Returns a Counter encoding a distribution over actions from the provided state. """ utilities.raise_not_defined()
def update(self, state, action, next_state, reward): utilities.raise_not_defined()
def get_features(self, state, action): """ Returns a dictionary from features to counts. Usually, the count will just be 1.0 for indicator functions. """ utilities.raise_not_defined()
def get_cost_of_actions(self, actions): """ Returns the total cost of a particular sequence of actions. The sequence must be composed of legal moves. """ utilities.raise_not_defined()
def astar_search(problem, heuristic=null_heuristic): utilities.raise_not_defined()
def get_start_state(self): utilities.raise_not_defined()
def get_action(self, game_state): utilities.raise_not_defined()
def is_goal_state(self, state): utilities.raise_not_defined()
def compute_action_from_values(self, state): utilities.raise_not_defined()
def get_value(self, state): utilities.raise_not_defined()