mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 16:26:47 +08:00
b13b12e88c
* Remove QuickSelect doctest There are more Jest test cases already. * Remove AverageMedian doctest Already migrated to jest * Migrate doctest for BinaryExponentiationRecursive.js (also remove inline "main" test method) * Migrate doctest for EulersTotient.js (also remove inline "main" test method) * Migrate doctest for PrimeFactors.js (also remove inline "main" test method) * Migrate doctest for BogoSort.js Re-write prototype-polluting helper methods, too. (also remove inline test driver code) * Migrate doctest for BeadSort.js (also remove inline test driver code) * Migrate doctest for BucketSort.js (also remove inline test driver code) * Migrate doctest for CocktailShakerSort.js (also remove inline test driver code) * Migrate doctest for MergeSort.js (also remove inline test driver code) * Migrate doctest for QuickSort.js (also remove inline test driver code) * Migrate doctest for ReverseString.js (also remove inline test driver code) * Migrate doctest for ReverseString.js * Migrate doctest for ValidateEmail.js * Migrate doctest for ConwaysGameOfLife.js (remove the animate code, too) * Remove TernarySearch doctest Already migrated to jest * Migrate doctest for BubbleSort.js (also remove inline test driver code) * Remove doctest from CI and from dependencies relates to #742 fixes #586 * Migrate doctest for RgbHsvConversion.js * Add --fix option to "standard" npm script * Migrate doctest for BreadthFirstSearch.js (also remove inline test driver code) * Migrate doctest for BreadthFirstShortestPath.js (also remove inline test driver code) * Migrate doctest for EulerMethod.js (also remove inline test driver code) Move manual test-code for plotting stuff in the browser in a distinct file, too. Those "*.manual-test.js" files are excluded from the UpdateDirectory.mjs script, as well. * Migrate doctest for Mandelbrot.js (also remove inline test driver code & moved manual drawing test into a *.manual-test.js) * Migrate doctest for FloodFill.js * Migrate doctest for KochSnowflake.js (also move manual drawing test into a *.manual-test.js) * Update npm lockfile * Update README and COMMITTING with a few bits & bobs regarding testing & code quality
42 lines
2.2 KiB
JavaScript
42 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
|
|
if ((alive && neighbourCount >= 2 && neighbourCount <= 3) || (!alive && neighbourCount === 3)) {
|
|
nextGenerationRow.push(1)
|
|
} else {
|
|
nextGenerationRow.push(0)
|
|
}
|
|
}
|
|
nextGeneration.push(nextGenerationRow)
|
|
}
|
|
return nextGeneration
|
|
}
|