Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First impression solution in Clear category for Moore Neighbourhood by nakanohito_piyo
def count_neighbours(grid, row, col):
neighbours = [(row-1, col-1), (row-1, col), (row-1, col+1),\
(row, col-1), (row, col+1),\
(row+1, col-1), (row+1, col), (row+1, col+1)]
count = 0
for i,j in neighbours:
if i<0 or j<0:
pass #pass: i=-1 or j=-1
else:
try:
count = count + grid[i][j]
except IndexError: #pass: out of bounds
pass
return 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"
June 23, 2015
Comments:
