Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
count_neighbors solution in Clear category for Moore Neighbourhood by DJO3
def count_neighbours(grid, row, col):
point = grid[row][col]
neighbors = 0
if row == 0:
rows = [grid[row], grid[row+1]]
elif row == len(grid)-1:
rows = [grid[row-1], grid[row]]
else:
rows = [grid[row-1], grid[row], grid[row+1]]
if col == 0:
cols = [col, col+1]
elif col == len(rows[0])-1:
cols = [col-1, col]
else:
cols = [col-1, col, col+1]
for x in rows:
for y in cols:
neighbors += x[y]
neighbors = neighbors - point
return neighbors
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"
April 20, 2015
Comments: