greedy.py

from data_structure import *
from publicFunctions import *

def greedy(self):
    self.num_visitedNodes = -2

    h=heu(self, self.start)
    startNode = Node(state=self.start, parent=None, action=None, heuristic=h, cost=0)

    availableNodes = []
    self.visitedNodes = set()

    availableNodes.append(startNode)

    while True:
        if len(availableNodes) == 0:
            print("No solution")
            break

        currentNode = availableNodes.pop(getMinH(availableNodes))
        self.num_visitedNodes += 1

        # reached the goal ?
        if currentNode.state == self.goal:
                actions = []
                cells = []
                while currentNode.parent is not None:
                    actions.append(currentNode.action)
                    cells.append(currentNode.state)
                    currentNode = currentNode.parent
                actions.reverse()
                cells.reverse()
                self.solution = (actions, cells)
                print ("The Final Cost: ", FinalCost(actions))
                print()
                print("Actions: "+', '.join(actions))
                print()
                print("Number of visited nodes: ", self.num_visitedNodes)
                return

        self.visitedNodes.add(currentNode.state)

        # Add available nodes
        for action, state in self.availableActions(currentNode.state):
                if state not in self.visitedNodes:
                    child = Node(state=state, parent=currentNode, action=action, heuristic=heu(self, currentNode.state), cost=0)
                    availableNodes.append(child)