Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Neighbours - genexp solution in Clear category for Moore Neighbourhood by bassaVox
def count_neighbours(grid, row, col):
m = len(grid)
n = len(grid[0])
return sum(grid[y][x] for y in range(m) for x in range(n)
if (y, x) != (row, col)
and (row - 1) <= y <= (row + 1)
and (col - 1) <= x <= (col + 1)
)
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"
Nov. 28, 2015
