Typological permutations

permutaciones tipológicas

team_Mónica Lamela
type_University Project
date_May 2014

The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway in 1970.[1]

The “game” is a zero-player game, 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 observing how it evolves.

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, “alive” or “dead”. Every cell interacts with its neighbours. At each step in time, the following transitions occur:

1.Any live cell with fewer than two live neighbours dies (UNDER-POPULATION)
2.Any live cell with two or three live neighbours lives on to the next generation.
3.Any live cell with more than three live neighbours dies (OVERCROWDING).
4.Any dead cell with exactly three live neighbours becomes a live cell (REPRODUCTION).

The Game of Life is here adopted to generate a new dessign system based on aleatory typological permutations.