Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Simple Moore Solution solution in Clear category for Moore Neighbourhood by MagicMantis
def count_neighbours(grid, row, col):
count = 0
w = len(grid[0])
h = len(grid)
for a in range(-1, 2):
for b in range (-1, 2):
if (a == 0 and b == 0) or not 0 <= row+a < h or not 0 <= col+b < w:
continue
if grid[row+a][col+b] == 1:
count += 1
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"
Jan. 2, 2015
Comments:
