Consider an infinite integer grid, where the states are pairs of integers, the start is (0, 0), and the goal is (10, 10). The neighbours of (i, j) are (i + 1, j) and (i, j + 1). Consider the heuristic function h((i, j)) = |10 i| + |10 j|.

Question compare how many paths are expanded with the minus and without the minus.what the minus does and why it is there.

def add(self, path, value): """add a path to the priority queue value is the value to be minimized""" self.frontier_index += 1 # get a new unique index heapq.heappush(self.frontierpq,(value, -self.frontier_index, path))