Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- m = [[False, False, False, False],
- [True, False, False, True],
- [False, False, False, True],
- [False, False, False, False],
- [False, False, False, False]]
- def neighbours(m, pos):
- a = []
- for i in range (len(m)):
- for j in range (len(m[i])):
- if pos == (i,j):
- if i > 0 and m[i - 1][j] == True:
- a.append((i-1,j))
- if i < len(m) - 1 and m[i + 1][j] == True:
- a.append((i+1,j))
- if j > 0 and m[i][j - 1] == True:
- a.append((i,j - 1))
- if j < len(m[i]) - 1 and m[i][j + 1] == True:
- a.append((i,j + 1))
- return a
- #print(a)
- b = neighbours(m, (0, 0))
- b
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement