Conway's Game of Life Flashcards

1
Q

It is a cellular automaton that is played on a 2D square grid and was created by John Conway.

A

Conway’s Game of Life

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Conway’s Game of Life is a cellular automaton that is played on a 2D square grid and was created by _.

A

John Conway

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

The mind behind this bizarre game was _, a brilliant British Mathematician fascinated by the exploration of Mathematics in its purest form.

A

John Horton Conway

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

The mind behind this bizarre game was John Horton Conway, a brilliant _ fascinated by the exploration of Mathematics in its purest form.

A

British Mathematician

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

This game was created with _ in mind but has been applied in various fields such as Graphics, terrain generation, etc.

A

Biology

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

This game was created with Biology in mind but has been applied in various fields such as _, _, etc.

A

graphics, terrain generation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

It is a _ game with no winners or losers, which result is fully determined by the initial configuration of the pieces on the board.

A

zero-player

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

It is a zero-player game with no _ or _, which result is fully determined by the initial configuration of the pieces on the board.

A

winners, losers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

It is a zero-player game with no winners or losers, which result is fully determined by the _ of the pieces on the board.

A

initial configuration

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

A player is only needed to advance the state of the game to the next turn- a _ -following three simple rules.

A

generation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Conway’s Game of Life Rules

SURVIVAL: Every piece surrounded by two or three other pieces survives for the next turn.

DEATH: Each piece surrounded by four or more pieces dies from overpopulation.
Likewise, every piece next to one or no pieces at all dies from isolation.

BIRTH: Each square adjacent to exactly three pieces gives birth to a new piece.

A

Noted

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

In Conway’s Game of Life Rules, every piece surrounded by _ or _ other pieces survives for the next turn.

A

two, three

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

In Conway’s Game of Life Rules, each piece surrounded by _ or more pieces dies from overpopulation. Likewise, every piece next to _ or no pieces at all dies from isolation.

A

four, one

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

In Conway’s Game of Life Rules, each square adjacent to exactly _ pieces gives birth to a new piece.

A

three

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Conway’s Game of Life Rules

For a space that is populated:
Each cell with one or no neighbors dies, as if by _.
Each cell with four or more neighbors dies, as if by _.
Each cell with two or three neighbors _.

For a space that is empty or unpopulated:
Each cell with three neighbors becomes _.

A

solitude,
overpopulation,
survives,
populated

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

It is in there that its editor, _ published a system to classify the many objects-patterns, as they’re called -that he saw appearing in the game.

A

Robert Wainwright

17
Q

Conway’s Game of Life: Classification

Stable, inactive

A

Class I (Still Lifes)

Example: block, loaf

18
Q

Conway’s Game of Life: Classification

Stable, active, stationary

A

Class II (Oscillators)

Example: blinker

19
Q

Conway’s Game of Life: Classification

Stable, moving, constant cells

A

Class III (Spaceships)

Example: glider

20
Q

Conway’s Game of Life: Classification

Stable, moving, increasing cells

A

Class IV (Guns)

Example: glider gun

21
Q

Conway’s Game of Life: Classification

Unstable, Predictable

A

Class V (N-ominoes)

22
Q

Conway’s Game of Life: Classification

Unstable, unpredictable

A

Class VI (?)

23
Q

These are the so-called “still lifes”; patterns that do not change over time.

A

Class I

24
Q

These are called “oscillators,” and they repeat over a certain number of generations. They are classified based on their period.

A

Class II

25
Q

Some of the most studied patterns: spaceships. Those are oscillators that, at the end of their cycle, somehow find themselves in a different position. They effectively move!

A

Class III

The most well known and loved is the glider.

26
Q

It is an oscillator that, every 30 generations, spawns a new glider. Also known as Gosper Glider Gun.

A

Class IV

27
Q

Class IV is an oscillator that, every 30 generations, spawns a new glider. Also known as _.

A

Gosper Glider Gun

28
Q

_ patterns behave seemingly erratically chaotic until they eventually collapse to one of the classes above.

A

Class V

29
Q

_ patterns are doomed to a different fate: remaining in a perpetual state of chaos-forever evolving, yet never stabilizing onto something predictable.

A

Class VI

30
Q

Because the Game of Life is built on a grid of nine squares, every cell has _ neighboring cells.

A

eight

31
Q

A given cell (i, j) in the simulation is accessed on a grid, where i and j are the _ and _ indices, respectively.

A

row, column

32
Q

The value of a given cell at a given instant of time depends on the _ of its neighbors at the _ time step.

A

state, previous

33
Q

CONCLUSION

Conway’s Game of Life is a powerful example of how complex systems can emerge from simple rules. It continues to fascinate mathematicians, computer scientists, and anyone interested like complexity and emergent behavior.

Conway’s Game of Life is Turing-complete, meaning it can simulate any computer program. This implies that even with a simple set of rules, the game can exhibit the full range of computational capabilities.

A

Noted

34
Q

Conway’s Game of Life is _, meaning it can simulate any computer program. This implies that even with a simple set of rules, the game can exhibit the full range of computational capabilities.

A

Turing-complete