Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
"Clear" they said. solution in Clear category for Moore Neighbourhood by quadrupleslap
# migrated from python 2.7
def count_neighbours(grid, row, col):
neighbours = \
[grid[x[0]][x[1]] for x in [x for x in [(x[0] + row, x[1] + col) for x in [(1, 1),(1,0),(1,-1),(0,1),(0,-1),(-1,1),(-1,0),(-1,-1)]] if 0 <= x[0] < len(grid) and 0 <= x[1] < len(grid[0])]]
return neighbours.count(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"
June 10, 2015
