Concept

HighLife (automate cellulaire)

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. The main reason for interest in HighLife comes from the existence of a pattern called the replicator. After running the replicator for twelve generations, the result is two replicators. The replicators will repeatedly reproduce themselves, all on a diagonal line. Whenever two replicators try to expand into each other, the pattern in the middle simply vanishes. The behavior of a row of Replicators interacting with each other in this way simulates the one-dimensional Rule 90 cellular automaton, where a single replicator simulates a nonzero cell of the Rule 90 automaton and a blank space where a replicator could be simulates a zero cell of Rule 90. Replicators can be used to engineer other more complex patterns, such as glider guns and high period oscillators. A simple c/6 diagonal spaceship, found by Nathan Thompson, is known as the bomber. This pattern consists of a replicator and a blinker; after replicating itself into two replicators, one of the two new replicators reacts with the blinker to "pull" it forward to match the new position of the other new replicator. In this way, the whole pattern repeats with period 48. It is also possible to make slower spaceships of much larger size that consist of a sequence of replicators between two ends composed of oscillators or still lifes, with the pattern of the replicators carefully chosen so that they interact with the ends of the pattern in such a way as to push the front end and pull the back end at the same speed.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.