Ejemplo n.º 1
0
            'boards/board-1-4.txt']

boards2 = [ 'boards/board-2-1.txt',
            'boards/board-2-2.txt',
            'boards/board-2-3.txt',
            'boards/board-2-4.txt']


Astar       = Solver('Astar',   lambda s,t: abs(t[0]-s[0])+abs(t[1]-s[1]),  Heap,   Queue)
Dijkstra    = Solver('Dijkstra',lambda s,t: 0,                              Heap,   Queue)
BFS         = Solver('BFS',     lambda s,t: 0,                              Queue,  Queue)

grid = Parser(lambda line: list(line.strip()))
for board in boards1:

    grid.open(board)
    grid.parse()

    nodes = Grapher(Node, grid.parsed(), costmap, 'A', 'B')
    nodes.graph()
    root = nodes.Root
    goal = nodes.Goal

    Astar.solve(board[7:16], root, goal)
    world = Drawer(grid.parsed(), (30,30), colormap)
    Astar.visualize(world, Astar.path, 'black')
    Astar.save()

for board in boards2:
    grid.open(board)
    grid.parse()