Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Moore Neighbourhood by mehdi.yedes
def count_neighbours(grid, row, col):
NEIGHBOURS = ((0,1), (1,0), (1,1), (0,-1), (-1,0), (-1,-1), (1,-1), (-1,1))
n = 0
for diff in NEIGHBOURS:
n_row = row + diff[0]
n_col = col + diff[1]
if n_row < 0 or n_row >= len(grid): continue
if n_col < 0 or n_col >= len(grid[0]): continue
if grid[n_row][n_col] == 1:
n += 1
return n
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"
Dec. 30, 2015
