void play (int board[][BOARD_HEIGHT]) {
/*
(copied this from some web page, hence the English spellings...)
1.STASIS : If, for a given cell, the number of on neighbours is
exactly two, the cell maintains its status quo into the next
generation. If the cell is on, it stays on, if it is off, it stays off.
2.GROWTH : If the number of on neighbours is exactly three, the cell
will be on in the next generation. This is regardless of the cell's current state.
3.DEATH : If the number of on neighbours is 0, 1, 4-8, the cell will
be off in the next generation.
*/
int i, j, a, newboard[BOARD_WIDTH][BOARD_HEIGHT];
/* for each cell, apply the rules of Life */
for (i=0; i<BOARD_WIDTH; i++) for (j=0; j<BOARD_HEIGHT; j++) {
a = adjacent_to (board, i, j);
if (a == 2) newboard[i][j] = board[i][j];
if (a == 3) newboard[i][j] = 1;
if (a < 2) newboard[i][j] = 0;
if (a > 3) newboard[i][j] = 0;
}
/* copy the new board back into the old board */
for (i=0; i<BOARD_WIDTH; i++) for (j=0; j<BOARD_HEIGHT; j++) {
board[i][j] = newboard[i][j];
}
}
void play (int *board, int *newboard, int N) {
/*
(copied this from some web page, hence the English spellings...)
1.STASIS : If, for a given cell, the number of on neighbours is
exactly two, the cell maintains its status quo into the next
generation. If the cell is on, it stays on, if it is off, it stays off.
2.GROWTH : If the number of on neighbours is exactly three, the cell
will be on in the next generation. This is regardless of the cell's
current state.
3.DEATH : If the number of on neighbours is 0, 1, 4-8, the cell will
be off in the next generation.
*/
int i, j, a;
/* for each cell, apply the rules of Life */
for (i=0; i<N; i++)
for (j=0; j<N; j++) {
a = adjacent_to (board, i, j, N);
if (a == 2) NewBoard(i,j) = Board(i,j);
if (a == 3) NewBoard(i,j) = 1;
if (a < 2) NewBoard(i,j) = 0;
if (a > 3) NewBoard(i,j) = 0;
}
/* copy the new board back into the old board */
for (i=0; i<N; i++)
for (j=0; j<N; j++) {
Board(i,j) = NewBoard(i,j);
}
}
