-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmyWorld.py
113 lines (107 loc) · 3.27 KB
/
myWorld.py
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#myWorld=[['A','B','C'],['D','E','F'],['H','I','J']]
n=5
myWorld=[]
myWorld=[[0 for j in range(n)] for i in range(n)]
print myWorld
def neighborhood(myWorld,i,j):
n=len(myWorld)
cells=[]
if i==0 and j==0 or i==n-1 and j==(n-1):
cells.append(myWorld[n-2][n-2])
cells.append(myWorld[n-2][n-1])
cells.append(myWorld[0][1])
cells.append(myWorld[1][1])
cells.append(myWorld[1][0])
cells.append(myWorld[n-1][n-2])
elif i==0 and j==(n-1):
cells.append(myWorld[n-1][j-1])
cells.append(myWorld[n-1][j])
cells.append(myWorld[i][0])
cells.append(myWorld[i+1][0])
cells.append(myWorld[i+1][j])
cells.append(myWorld[i][j-1])
elif i==0:
cells.append(myWorld[n-1][j-1])
cells.append(myWorld[n-1][j])
cells.append(myWorld[i][j+1])
cells.append(myWorld[i+1][j+1])
cells.append(myWorld[i+1][j])
cells.append(myWorld[i][j-1])
elif i==(n-1):
cells.append(myWorld[i-1][j-1])
cells.append(myWorld[i-1][j])
cells.append(myWorld[i][j+1])
cells.append(myWorld[0][j+1])
cells.append(myWorld[0][j])
cells.append(myWorld[i][j-1])
elif j==0 and i==(n-1):
cells.append(myWorld[i-1][n-1])
cells.append(myWorld[i-1][j])
cells.append(myWorld[i][j+1])
cells.append(myWorld[0][j+1])
cells.append(myWorld[0][j])
cells.append(myWorld[i][n-1])
elif j==0:
cells.append(myWorld[i-1][n-1])
cells.append(myWorld[i-1][j])
cells.append(myWorld[i][j+1])
cells.append(myWorld[i+1][j+1])
cells.append(myWorld[i+1][j])
cells.append(myWorld[i][n-1])
elif j==(n-1):
cells.append(myWorld[i-1][j-1])
cells.append(myWorld[i-1][j])
cells.append(myWorld[i][0])
cells.append(myWorld[i+1][0])
cells.append(myWorld[i+1][j])
cells.append(myWorld[i][j-1])
else:
cells.append(myWorld[i-1][j-1])
cells.append(myWorld[i-1][j])
cells.append(myWorld[i][j+1])
cells.append(myWorld[i+1][j+1])
cells.append(myWorld[i+1][j])
cells.append(myWorld[i][j-1])
return cells
#for i in range(n):
# for j in range(n):
# print i,j
# print neighborhood(i,j)
#i=2
#j=2
#myWorld[i-1][j-2]='F1A1'
#myWorld[i-2][j-2]='A1'
#myWorld[i-2][j-1]='A1B1'
#myWorld[i-2][j]='B1'
#myWorld[i-1][j+1]='B1C1'
#myWorld[i][j+2]='C1'
#myWorld[i+1][j+2]='C1D1'
#myWorld[i+2][j+2]='D1'
#myWorld[i+2][j+1]='D1E1'
#myWorld[i+2][j]='E1'
#myWorld[i+1][j-1]='E1F1'
#myWorld[i][j-2]='F1'
#print myWorld
#def neighborhood(i,j):
# cells=[]
# if i>=n-1 and j!=0 and j!=n-1:
# cells.append(myWorld[0][j-1])
# cells.append(myWorld[0][j-1])
# elif i==0 and j!=0 and j!=n-1:
# cells.append(myWorld[n-1][j-1])
# cells.append(myWorld[n-1][j])
# elif j==0:
# cells.append(myWorld[i+1][n-1])
# cells.append(myWorld[i-1][n-1])
# elif j==n-1:
# cells.append(myWorld[i][0])
# cells.append(myWorld[i-1][0])
# else:
# print 'Error bad indexing'
#
# cells.append(myWorld[i][j+1])
# cells.append(myWorld[i-1][j-1])
# cells.append(myWorld[i-1][j])
# cells.append(myWorld[i][j-1])
# return cells
#print neighborhood(1,1)