ivan_astar_v2_man.py

import copy
import sys
import time

from random import shuffle
import heapq


class Node:
    def __eq__(self, other):
        return self.init_state == other.init_state

    def __lt__(self, other):
        return self.cost < other.cost

    def __hash__(self):
        hashable = tuple(map(tuple, self.init_state))
        return hash(hashable)

    def __init__(self, init_state, goal_state):
        self.init_state = init_state
        self.goal_state = goal_state
        self.zero_x_coord = -1
        self.zero_y_coord = -1
        self.parentPuzzle = None
        self.action = None
        self.cost = 0

    def setParentPuzzle(self, parPuzzle):
        self.parentPuzzle = parPuzzle

    def isGoalState(self):
        return self.init_state == self.goal_state

    def setParams(self, blank_x, blank_y, action_done, parent_puzzle, new_cost):
        self.zero_x_coord = blank_x
        self.zero_y_coord = blank_y
        self.parentPuzzle = parent_puzzle
        self.action = action_done
        self.cost = new_cost


class Puzzle(object):
    actions = []
    goalActions = []
    visited = 0
    added_to_frontier = 0
    popped = 0

    def __init__(self, init_state, goal_state):
        self.init_state = init_state
        self.goal_state = goal_state
        self.actions = list()
        self.parentPuzzle = None
        self.action = None
        self.cost = 0

    def solve(self):
        VISITED = set()
        FRONTIER = []

        source_node = Node(init_state, goal_state)
        zero_x, zero_y = Puzzle.findZeroDimension(source_node)
        source_node.setParams(zero_x, zero_y, None, None, 0)

        if Puzzle.isSolvable(source_node):
            heapq.heappush(FRONTIER, (0, source_node))

            while len(FRONTIER) != 0:
                curr = heapq.heappop(FRONTIER)
                currentNode = curr[1]
                Puzzle.popped = Puzzle.popped + 1
                VISITED.add(currentNode)

                if currentNode.isGoalState():
                    return recursiveBacktrack(currentNode)

                else:
                    possible_actions = self.findPossibleActions(
                        currentNode.zero_x_coord, currentNode.zero_y_coord)
                    shuffle(possible_actions)

                    for next_action in possible_actions:
                        child_state, child_x, child_y = self.apply_action_to_state(
                            currentNode.init_state, next_action, currentNode.zero_x_coord, currentNode.zero_y_coord)
                        child_node = Node(child_state, goal_state)

                        if child_node not in VISITED:
                            child_node.setParams(
                                child_x, child_y, next_action, currentNode, currentNode.cost+1)

                            # IMPLEMENT UR HEURISTIC AND PUT IT HERE
                            # MUST BE A NEGATIVE NUM SINCE HEAPQ IS A MIN HEAP

                            hcost = Puzzle.f_score(child_node)
                            heapq.heappush(FRONTIER, (hcost, child_node))
                            Puzzle.added_to_frontier = Puzzle.added_to_frontier + 1
        else:
            return ['UNSOLVABLE']

    @staticmethod
    def countHorizontalConflict(inputNode):
        n = len(inputNode.init_state)
        totalCount = 0

        for row in range(0, n):
            # Returns the entire row array
            rowArr = inputNode.init_state[row]

            for i in range(0, n):
                conflictCount = 0
                currValue = rowArr[i]

                for j in range(i + 1, n):
                    nextValue = rowArr[j]

                    if currValue != 0 and nextValue != 0:
                        currTargetRow = int((currValue - 1) / n)
                        nextTargetRow = int((nextValue - 1) / n)

                        # Both current and next values are in correct row
                        if row == currTargetRow and row == nextTargetRow:
                            if currValue > nextValue:
                                conflictCount += 1

                if conflictCount > 0:
                    totalCount += 1

        return totalCount

    @staticmethod
    def countVerticalConflict(inputNode):
        n = len(inputNode.init_state)
        totalCount = 0

        for col in range(0, n):
            # Returns the entire column arr
            colArr = [item[col] for item in inputNode.init_state]

            for i in range(0, n):
                conflictCount = 0
                currValue = colArr[i]

                for j in range(i + 1, n):
                    nextValue = colArr[j]

                    if currValue != 0 and nextValue != 0:
                        currTargetCol = (currValue - 1) % n
                        nextTargetCol = (nextValue - 1) % n

                        # Both curr and next values are in correct column
                        if col == currTargetCol and col == nextTargetCol:
                            if currValue > nextValue:
                                conflictCount += 1

                if conflictCount > 0:
                    totalCount += 1

        return totalCount

    @staticmethod
    def manhattanDistance(inputNode):
        n = len(goal_state)
        distSum = 0
        for x in range(0, n):
            for y in range(0, n):
                currentValue = inputNode.init_state[x][y]

                if currentValue != 0:
                    targetX = int((currentValue - 1) / n)
                    targetY = (currentValue - 1) % n
                    distX = x - targetX
                    distY = y - targetY
                    distSum += abs(distX) + abs(distY)

        return distSum

    @staticmethod
    def f_score(inputNode):
        return inputNode.cost + Puzzle.manhattanDistance(inputNode)

    def findPossibleActions(self, x, y):
        max_y_row = len(self.goal_state) - 1
        max_x_col = len(self.goal_state[0]) - 1
        output = []

        if y + 1 <= max_y_row:
            output.append("DOWN")
        if x + 1 <= max_x_col:
            output.append("RIGHT")
        if y - 1 >= 0:
            output.append("UP")
        if x - 1 >= 0:
            output.append("LEFT")
        return output

    @staticmethod
    def apply_action_to_state(prev_state, action, col, row):
        if action is None:
            return prev_state, col, row
        else:
            new_arr = [x[:] for x in prev_state]
            new_col = col
            new_row = row

            # Defines the possible movements and returns an array representing the movement
            if action == "RIGHT":
                new_arr[row][col] = new_arr[row][col + 1]
                new_arr[row][col + 1] = 0
                new_col = col + 1

            elif action == "LEFT":
                new_arr[row][col] = new_arr[row][col - 1]
                new_arr[row][col - 1] = 0
                new_col = col - 1

            elif action == "UP":
                new_arr[row][col] = new_arr[row - 1][col]
                new_arr[row - 1][col] = 0
                new_row = row - 1

            elif action == "DOWN":
                new_arr[row][col] = new_arr[row + 1][col]
                new_arr[row + 1][col] = 0
                new_row = row + 1
            return new_arr, new_col, new_row

    # Helper method to calculate the permutation inversions in initial state
    @staticmethod
    def calculateInversions(inputNode):
        # Flatten array for easier computation
        flat_arr = []
        for i in range(0, len(inputNode.init_state)):
            for j in range(0, len(inputNode.init_state)):
                flat_arr.append(inputNode.init_state[i][j])

        inversion_count = 0

        # Loop through flat array and compare numbers in pairs
        for i in range(0, len(flat_arr)):
            for j in range(i + 1, len(flat_arr)):
                if flat_arr[i] == 0 or flat_arr[j] == 0:
                    continue
                elif flat_arr[i] > flat_arr[j]:
                    inversion_count += 1

        return inversion_count

    @staticmethod
    def findZeroPos(nodeInput):
        for row in range(0, len(nodeInput.init_state)):
            for col in range(0, len(nodeInput.init_state)):
                if nodeInput.init_state[row][col] == 0:
                    return len(nodeInput.init_state) - row

    @staticmethod
    def findZeroDimension(nodeInput):
        for row in range(0, len(nodeInput.init_state)):
            for col in range(0, len(nodeInput.init_state)):
                if nodeInput.init_state[row][col] == 0:
                    return col, row

    @staticmethod
    def isSolvable(inputNode):
        selfLen = len(inputNode.init_state)
        inversion_number = Puzzle.calculateInversions(inputNode)

        if selfLen % 2 != 0:
            if inversion_number % 2 == 0:
                return True
            else:
                return False
        else:
            zeroPos = Puzzle.findZeroPos(inputNode)
            if zeroPos % 2 == 0 and inversion_number % 2 != 0:
                return True
            elif zeroPos % 2 != 0 and inversion_number % 2 == 0:
                return True
            else:
                return False


def recursiveBacktrack(goalNode):
    currPuzzle = goalNode
    output = []
    while currPuzzle.parentPuzzle is not None:
        action = ""
        if currPuzzle.action == "UP":
            action = "DOWN"
        elif currPuzzle.action == "DOWN":
            action = "UP"
        elif currPuzzle.action == "LEFT":
            action = "RIGHT"
        else:
            action = "LEFT"

        output.append(action)
        currPuzzle = currPuzzle.parentPuzzle
    output.reverse()
    return output


if __name__ == "__main__":
    # do NOT modify below

    # argv[0] represents the name of the file that is being executed
    # argv[1] represents name of input file
    # argv[2] represents name of destination output file
    if len(sys.argv) != 3:
        raise ValueError("Wrong number of arguments!")

    try:
        f = open(sys.argv[1], 'r')
    except IOError:
        raise IOError("Input file not found!")

    lines = f.readlines()

    # n = num rows in input file
    n = len(lines)
    # max_num = n to the power of 2 - 1
    max_num = n ** 2 - 1

    # Instantiate a 2D list of size n x n
    init_state = [[0 for i in range(n)] for j in range(n)]
    goal_state = [[0 for i in range(n)] for j in range(n)]

    i, j = 0, 0
    for line in lines:
        for number in line.split(" "):
            if number == '':
                continue
            value = int(number, base=10)
            if 0 <= value <= max_num:
                init_state[i][j] = value
                j += 1
                if j == n:
                    i += 1
                    j = 0

    for i in range(1, max_num + 1):
        goal_state[(i - 1) // n][(i - 1) % n] = i
    goal_state[n - 1][n - 1] = 0

    puzzle = Puzzle(init_state, goal_state)
    tic = time.time()
    ans = puzzle.solve()
    toc = time.time()
    print("Found solution in " + str(toc - tic) + " seconds")

    with open(sys.argv[2], 'a') as f:
        for answer in ans:
            f.write(answer + '\n')