Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
iterate through itertools.product solution in Clear category for Moore Neighbourhood by kudinov.feodor
from itertools import product
def count_neighbours(grid, row, col):
return sum(grid[row + y][col + x] for (x, y) in product((1, -1, 0), repeat=2)
if 0 <= row + y < len(grid) and 0 <= col + x < len(grid[0]) and (x,y) != (0,0))
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"
Oct. 12, 2019
