Scribd Logo
Upload

Welcome to Scribd!

  • H1 Time

    Uploaded by

    Gordochu
    8 views2 pages
    This document defines two functions, H1 and H2, that solve the 8 puzzle problem using different heuristics. H1 uses a basic breadth-first search with Manhattan distance as the heuristic. It returns the sequence of moves to solve the puzzle from the initial to final state. H2 also uses breadth-first search but with a heuristic that considers both Manhattan distance and accumulated cost at each node. Both functions return the sequence of moves, track time taken and nodes explored to solve the problem.

    Original Description:

    Original Title

    codigologicapuzzleheuristica

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document defines two functions, H1 and H2, that solve the 8 puzzle problem using different heuristics. H1 uses a basic breadth-first search with Manhattan distance as the heuristic. It returns the sequence of moves to solve the puzzle from the initial to final state. H2 also uses breadth-first search but with a heuristic that considers both Manhattan distance and accumulated cost at each node. Both functions return the sequence of moves, track time taken and nodes explored to solve the problem.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    8 views2 pages

    H1 Time

    Uploaded by

    Gordochu
    This document defines two functions, H1 and H2, that solve the 8 puzzle problem using different heuristics. H1 uses a basic breadth-first search with Manhattan distance as the heuristic. It returns the sequence of moves to solve the puzzle from the initial to final state. H2 also uses breadth-first search but with a heuristic that considers both Manhattan distance and accumulated cost at each node. Both functions return the sequence of moves, track time taken and nodes explored to solve the problem.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    def H1(self):

    inicio = time.time()
    node = self.matrix
    Mfinal = Matrix(3,3)
    Mfinal.buildMatrix(self.final_state)
    final = Mfinal.getMatrix()
    queue = PriorityQueue()
    queue.put(node)
    visitedNodes = []
    n = 1

    while(not node.isEqual(final) and not queue.empty()):


    node = queue.get()
    visitedNodes.append(node)
    moves = []
    childNodes = node.getPossibleNodes(moves)
    for i in range(len(childNodes)):
    if not
    self.existsIn(childNodes[i].getMatrix(),visitedNodes):
    childNodes[i].move = moves[i]
    childNodes[i].manhattanDist()
    childNodes[i].setPrevious(node)
    queue._put(childNodes[i])
    n += 1
    moves = []
    self.cost = n
    if(node.isEqual(final)):
    moves.append(node.move)
    nd = node.previous
    while nd != None:
    if nd.move != '':
    moves.append(nd.move)
    nd = nd.previous
    fin = time.time()
    self.lastSolveTime = fin-inicio
    print("H1\n")
    print("Tiempo de solucion {temp: .5f}:".format(temp = fin-inicio))
    print("Nodos recorridos :",n,"\n")
    return moves[::-1]

    def H2(self):

    inicio = time.time()
    node = self.matrix
    Mfinal = Matrix(3,3)
    Mfinal.buildMatrix(self.final_state) #1,2,3,4,5,6,7,8,0
    final = Mfinal.getMatrix()
    queue = PriorityQueue()
    queue.put(node)
    visitedNodes = []
    indexSelected = 0
    n = 1
    while (not node.isEqual(final) and not queue.empty()):
    node = queue.get()
    visitedNodes.append(node)
    moves = []
    childNodes = node.getPossibleNodes(moves)
    for i in range(len(childNodes)):
    if not self.existsIn(childNodes[i].getMatrix(),
    visitedNodes):
    childNodes[i].move = moves[i]
    childNodes[i].manhattanDist()
    childNodes[i].setPrevious(node)

    childNodes[i].cost = node.cost +
    node.manhattanDistCost(childNodes[i])
    childNodes[i].dist += childNodes[i].cost
    queue._put(childNodes[i])
    n += 1
    auxCost = 0

    moves = []
    self.cost = n
    if(node.isEqual(final)):
    moves.append(node.move)
    nd = node.previous
    while nd != None:
    if nd.move != '':
    moves.append(nd.move)
    nd = nd.previous

    fin = time.time()
    self.lastSolveTime = fin-inicio
    print("## H2 ##\n")
    print("Tiempo de solucion {temp: .5f}:".format(temp = fin-inicio))
    print("Nodos recorridos:",n,"\n")

    return moves[::-1]

    You might also like