mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
45 lines
2.2 KiB
JavaScript
45 lines
2.2 KiB
JavaScript
/*
|
|
Conway's Game of Life
|
|
The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway in 1970. The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, live or dead, (or populated and unpopulated, respectively). Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:
|
|
1. Any live cell with two or three live neighbours survives.
|
|
2. Any dead cell with three live neighbours becomes a live cell.
|
|
3. All other live cells die in the next generation. Similarly, all other dead cells stay dead.
|
|
(description adapted from https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life )
|
|
(example adapted from https://github.com/TheAlgorithms/Python/blob/master/cellular_automata/conways_game_of_life.py )
|
|
*/
|
|
|
|
/**
|
|
* Generates the next generation for a given state of Conway's Game of Life.
|
|
*/
|
|
export function newGeneration(cells) {
|
|
const nextGeneration = []
|
|
for (let i = 0; i < cells.length; i++) {
|
|
const nextGenerationRow = []
|
|
for (let j = 0; j < cells[i].length; j++) {
|
|
// Get the number of living neighbours
|
|
let neighbourCount = 0
|
|
if (i > 0 && j > 0) neighbourCount += cells[i - 1][j - 1]
|
|
if (i > 0) neighbourCount += cells[i - 1][j]
|
|
if (i > 0 && j < cells[i].length - 1)
|
|
neighbourCount += cells[i - 1][j + 1]
|
|
if (j > 0) neighbourCount += cells[i][j - 1]
|
|
if (j < cells[i].length - 1) neighbourCount += cells[i][j + 1]
|
|
if (i < cells.length - 1 && j > 0) neighbourCount += cells[i + 1][j - 1]
|
|
if (i < cells.length - 1) neighbourCount += cells[i + 1][j]
|
|
if (i < cells.length - 1 && j < cells[i].length - 1)
|
|
neighbourCount += cells[i + 1][j + 1]
|
|
|
|
// Decide whether the cell is alive or dead
|
|
const alive = cells[i][j] === 1
|
|
|
|
const cellIsAlive =
|
|
(alive && neighbourCount >= 2 && neighbourCount <= 3) ||
|
|
(!alive && neighbourCount === 3)
|
|
|
|
nextGenerationRow.push(cellIsAlive ? 1 : 0)
|
|
}
|
|
nextGeneration.push(nextGenerationRow)
|
|
}
|
|
return nextGeneration
|
|
}
|