Golly: An Open Source Application For Exploring Conway’s Game of Life

Find It Here: Golly

Golly’s key features:

  • Supports bounded and unbounded universes, with cells of up to 256 states.
  • Supports multiple algorithms, including Bill Gosper‘s super fast hashlife algorithm.
  • Many different types of CA are included: John von Neumann‘s 29-state CA, Wolfram’s 1D rules, WireWorld, Generations, Langton’s Loops, Paterson’s Worms, etc.
  • The RuleTable and RuleTree algorithms let you plug in new rules.
  • Responsive even while generating or garbage collecting.
  • Reads RLE, macrocell, Life 1.05/1.06, dblife, and MCell files.
  • Can also read common graphic formats: BMP, PNG, GIF, TIFF.
  • Can extract patterns, rules and scripts from zip files.
  • Can download patterns, rules and scripts from online archives.
  • Includes a state-of-the-art pattern collection.
  • Can paste in patterns from the clipboard.
  • Unlimited undo/redo.
  • Configurable keyboard shortcuts.
  • Auto fit option keeps patterns sized to the window.
  • Full screen option (no menu/status/tool/scroll bars).
  • Supports multiple layers, including cloned layers.
  • HTML-based help with an integrated Life Lexicon.
  • Scriptable via Perl or Python.
  • Runs on Windows (2000+), Mac OS X (10.4+) and Linux (with GTK+ 2.x).




Cellular Automata On-Line And StandAlone Application (Win)

Press Here To Enter The Site: Cellular Automata

Mirek’s Java Cellebration (MJCell) is a Java applet that allows playing 300+ Cellular Automata rules and 1400+ patterns. It can play rules from 13 CA rules families: GenerationsLifeVoteWeighted LifeRule tablesCyclic CA1D totalistic1D binaryNeumann binaryGeneral binaryMargolus neighborhoodLarger than Life, and some of the User DLLs. It allows also to experiment with own rules. The applet is a simplified version of MCell. It does not offer extended features of MCell, but has one advantage over it: its usage is not restricted to MS WindowsFull source code of the applet is available here. You can also download the full off-line version equipped with a rich library of patterns. You should also download this version if you plan to put the MJCell applet on your own Web page.


ULAMIZER II : Cellular Automata Music Module

Press Here To Enter Ulamizer II

Great information about research into Cellular Automata

“A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics, physics, theoretical biology and microstructure modeling. It consists of a regular grid of cells, each in one of a finite number of states, such as “On” and “Off”. The grid can be in any finite number of dimensions. For each cell, a set of cells called its neighborhood (usually including the cell itself) is defined relative to the specified cell. For example, the neighborhood of a cell might be defined as the set of cells a distance of 2 or less from the cell. An initial state (time t=0) is selected by assigning a state for each cell. A new generation is created (advancing t by 1), according to some fixed rule (generally, a mathematical function) that determines the new state of each cell in terms of the current state of the cell and the states of the cells in its neighborhood. For example, the rule might be that the cell is “On” in the next generation if exactly two of the cells in the neighborhood are “On” in the current generation, otherwise the cell is “Off” in the next generation. Typically, the rule for updating the state of cells is the same for each cell and does not change over time, and is applied to the whole grid simultaneously, though exceptions are known.”