Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Moore Neighbourhood - First solution in Clear category for Moore Neighbourhood by erik.white.2014
def count_neighbours(grid, row, col):
neighbours_count = 0
for i in range(max([0, row - 1]), min(row + 2, len(grid))):
for j in range(max([0, col - 1]), min(col + 2, len(grid[0]))):
if ((grid[i][j] == 1) and ((i != row) or (j != col))):
neighbours_count += 1
return neighbours_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"
Oct. 2, 2014
