Highlife (cellular automaton)
Highlife is a cellular automaton similar to Conway's Game of Life. It was devised in 1994 by Nathan Thompson. It is a two-dimensional, two-state cellular automaton in the "Life family" and is described by the rule B36/S23; that is, a cell is born if it has 3 or 6 neighbors and survives if it has 2 or 3 neighbors. Because the rules of HighLife and Conway's Life (rule B3/S23) are similar, many simple patterns in Conway's Life function identically in HighLife. More complicated engineered patterns for one rule, though, typically do not work in the other rule.
Wikipage redirect
primaryTopic
Highlife (cellular automaton)
Highlife is a cellular automaton similar to Conway's Game of Life. It was devised in 1994 by Nathan Thompson. It is a two-dimensional, two-state cellular automaton in the "Life family" and is described by the rule B36/S23; that is, a cell is born if it has 3 or 6 neighbors and survives if it has 2 or 3 neighbors. Because the rules of HighLife and Conway's Life (rule B3/S23) are similar, many simple patterns in Conway's Life function identically in HighLife. More complicated engineered patterns for one rule, though, typically do not work in the other rule.
has abstract
HighLife est un automate cellu ...... é en 1994 par Nathan Thompson.
@fr
Highlife is a cellular automat ...... do not work in the other rule.
@en
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
667,324,871
subject
hypernym
comment
HighLife est un automate cellu ...... é en 1994 par Nathan Thompson.
@fr
Highlife is a cellular automat ...... do not work in the other rule.
@en
label
HighLife (automate cellulaire)
@fr
Highlife (cellular automaton)
@en
