Refer to https://en.wikipedia.org/wiki/Conway's_Game_of_Life

given a set of cells (the initial state) represented by 1(live) and 0(dead) , u need to find - within the next 'n' stage - in which one, maximum number of cells were alive.

Some assumptions -

• the set can not expand. it'll maintain it's initial size. so generation of new cells outside the initial set is barred.
• the board can be wrapped around (toroidal).

for example -

• a=[1 0 0 0; 0 1 0 0; 0 0 1 0; 1 0 0 1]
• after 1 stage, it becomes

a1=[1 1 0 1; 0 1 0 0; 1 1 1 1; 1 1 0 1]