Snake-Automation-Using-AI/bfs.py at master · Hmnt39/Snake-Automation-Using-AI · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
from collections import defaultdict

grid = [[(y,x) for y in range(10)] for x in range(10)]
class Graph:

    def __init__(self):
        self.graph = defaultdict(list)

    def addEdge(self,u,v):
        self.graph[u].append(v)

    def shortest_distance(self, src, dest):
        pred, dist = {}, {}
        adj = self.graph
        if (self.bfs(adj, src, dest, pred, dist) == False):
            return

        path = []
        crawl = dest
        path.append(crawl)
        while (pred[crawl] != -1):
            path.append(pred[crawl]);
            crawl = pred[crawl];
        path.reverse()
        return path

    def bfs(self, adj, src, dest, pred, dist):
        visited, queue = {}, []

        for i in range(10):
            for j in range(10):
                visited[(j, i)] = False
                dist[(j, i)] = 999;
                pred[(j, i)] = -1;

        visited[src] = True
        dist[src] = 0
        queue.append(src)

        while len(queue) > 0:
            u = queue.pop(0)
            for i in range(len(adj[u])):
                if (visited[adj[u][i]] == False):
                    visited[adj[u][i]] = True
                    dist[adj[u][i]] = dist[u] + 1
                    pred[adj[u][i]] = u;
                    queue.append(adj[u][i])

                    if (adj[u][i] == dest):
                        return True

        return False


def create():
    g = Graph()

    for x in range(1, 9):
        for y in range(1, 9):
            g.addEdge(grid[x][y], grid[x-1][y])
            g.addEdge(grid[x][y], grid[x+1][y])
            g.addEdge(grid[x][y], grid[x][y-1])
            g.addEdge(grid[x][y], grid[x][y+1])

    for x in range(1, 9):
        g.addEdge(grid[x][0], grid[x-1][0])
        g.addEdge(grid[x][0], grid[x+1][0])
        g.addEdge(grid[x][0], grid[x][1])
        g.addEdge(grid[x][9], grid[x-1][9])
        g.addEdge(grid[x][9], grid[x+1][9])
        g.addEdge(grid[x][9], grid[x][8])

    for y in range(1, 9):
        g.addEdge(grid[0][y], grid[0][y-1])
        g.addEdge(grid[0][y], grid[0][y+1])
        g.addEdge(grid[0][y], grid[1][y])
        g.addEdge(grid[9][y], grid[9][y-1])
        g.addEdge(grid[9][y], grid[9][y+1])
        g.addEdge(grid[9][y], grid[8][y])

    g.addEdge(grid[0][0], grid[1][0])
    g.addEdge(grid[0][0], grid[0][1])

    g.addEdge(grid[9][9], grid[9][8])
    g.addEdge(grid[9][9], grid[8][9])

    g.addEdge(grid[0][9], grid[0][8])
    g.addEdge(grid[0][9], grid[1][9])

    g.addEdge(grid[9][0], grid[8][0])
    g.addEdge(grid[9][0], grid[9][1])

    return g