Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Loopy loop solution in Clear category for Moore Neighbourhood by Telkandore
def count_neighbours(grid, row, col):
count = 0
ll = [(i, j) for i in range(row-1, row+2) for j in range(col-1, col+2)]
for item in ll :
i = item[0]
j = item[1]
if i > -1 and i < len(grid) and j > -1 and j < len(grid[0]) and (row, col) != (i, j) and grid[i][j]:
count = count + 1
return count
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert count_neighbours(((1, 0, 0, 1, 0),
(0, 1, 0, 0, 0),
(0, 0, 1, 0, 1),
(1, 0, 0, 0, 0),
(0, 0, 1, 0, 0),), 1, 2) == 3, "1st example"
assert count_neighbours(((1, 0, 0, 1, 0),
(0, 1, 0, 0, 0),
(0, 0, 1, 0, 1),
(1, 0, 0, 0, 0),
(0, 0, 1, 0, 0),), 0, 0) == 1, "2nd example"
assert count_neighbours(((1, 1, 1),
(1, 1, 1),
(1, 1, 1),), 0, 2) == 3, "Dense corner"
assert count_neighbours(((0, 0, 0),
(0, 1, 0),
(0, 0, 0),), 1, 1) == 0, "Single"
July 17, 2015
Comments:
