When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Conway's Game of Life - Wikipedia

    en.wikipedia.org/wiki/Conway's_Game_of_Life

    The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. [1] It is a zero-player game, [2][3] meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and ...

  3. Cellular automaton - Wikipedia

    en.wikipedia.org/wiki/Cellular_automaton

    Conway's Game of Life is an example of an outer totalistic cellular automaton with cell values 0 and 1; outer totalistic cellular automata with the same Moore neighborhood structure as Life are sometimes called life-like cellular automata. [52] [53]

  4. Life-like cellular automaton - Wikipedia

    en.wikipedia.org/wiki/Life-like_cellular_automaton

    A cellular automaton (CA) is Life-like (in the sense of being similar to Conway's Game of Life) if it meets the following criteria: The array of cells of the automaton has two dimensions. The neighborhood of each cell is the Moore neighborhood; it consists of the eight adjacent cells to the one under consideration and (possibly) the cell itself.

  5. 3D Life - Wikipedia

    en.wikipedia.org/wiki/3D_Life

    3D Life. 3D Life is a cellular automaton. It is a three-dimensional extension of Game of Life, investigated by Carter Bays. A number of different semitotalistic rules for the 3D rectangular Moore neighborhood were investigated. It was popularized by A. K. Dewdney in his "Computer Recreations" column in Scientific American magazine.

  6. Moore neighborhood - Wikipedia

    en.wikipedia.org/wiki/Moore_neighborhood

    It is similar to the notion of 8-connected pixels in computer graphics. The Moore neighbourhood of a cell is the cell itself and the cells at a Chebyshev distance of 1. The concept can be extended to higher dimensions, for example forming a 26-cell cubic neighborhood for a cellular automaton in three dimensions, as used by 3D Life.

  7. Lenia - Wikipedia

    en.wikipedia.org/wiki/Lenia

    Lenia is a family of cellular automata created by Bert Wang-Chak Chan. [1][2][3] It is intended to be a continuous generalization of Conway's Game of Life, with continuous states, space and time. As a consequence of its continuous, high-resolution domain, the complex autonomous patterns ("lifeforms" or "spaceships") generated in Lenia are ...

  8. Glider (Conway's Game of Life) - Wikipedia

    en.wikipedia.org/wiki/Glider_(Conway's_Game_of_Life)

    The glider is a pattern that travels across the board in Conway's Game of Life. It was first discovered by Richard K. Guy in 1969, while John Conway's group was attempting to track the evolution of the R- pentomino. Gliders are the smallest spaceships, and they travel diagonally at a speed of one cell every four generations, or .

  9. Methuselah (cellular automaton) - Wikipedia

    en.wikipedia.org/wiki/Methuselah_(cellular...

    In Conway's Game of Life R-pentomino to stability in 1103 generations In Conway's Game of Life , one of the smallest methuselahs is the R- pentomino , [2] a pattern of five cells first considered by Conway himself, [3] that takes 1103 generations before stabilizing with 116 cells.