Mirek's Cellebration

Mirek's Cellebration
Mirek's Cellebration
Screenshot of Mirek's Cellebration
Original author(s) Mirek Wojtowicz
Initial release April 17, 1999 (1999-04-17)
Written in Borland Delphi
Operating system Windows, ?
Available in English, Polish, ?
Website www.mirekw.com/ca

Mirek's Cellebration (abbreviated MCell) is a 32-bit Windows freeware program designed by Polish computer programmer Mirek Wójtowicz for running one-dimensional and two-dimensional cellular automata (CA).[1]

The program, currently in Version 4.20, supports more than 300 CA rules and over 1,000 pattern files in 14 different families including "Life," "Large than Life," "Vote for Life," "Weighted Life"," "1-D binary CA," "1-D totalistic CA" and “Generations."[2] A Java-based version, Mirek’s Java Cellebration, is an applet that plays more than 300 CA rules and more than 1,400 patterns.

Features[3]

  • 1-D and 2-D Cellular Automata.
  • 14 different CA families: Life, Generations, Weighted Life, Vote for Life, Rules tables, Cyclic CA, 1-D totalistic CA, 1-D binary CA, General binary, Neumann binary, Larger than Life, Margolus, User DLLs, and Special rules. Many predefined rules for each family.
  • Support for different neighborhoods (Moore 8 and 9, von Neumann 4 and 5, Margolus, Hexagonal, neighborhood ranges).
  • Comfortable user interface: dockable toolbars, active status bar, built-in File Manager, interactive zooming/panning using the mouse, the keyboard or the mouse wheel, subzooms, scroll-bars, auto-fitting and centering patterns, keyboard shortcuts to virtually all MCell functions.
  • Comprehensive Help, Tool tips, full program customization, configurable colors, sound.
  • Complete file saving and loading abilities. Supported file formats include Life 1.05, Life 1.06, RLE, dbLife, ProLife, Xlife, MCLife, MCell and variations of the above. Files can be loaded both from UNIX and DOS formats.
  • Externally programmable rules (DLLs), support for most 32-bit compilers.
  • (OLE) Automation interface.
  • Comfortable rules explorer; own rules can be saved and reused.
  • Different color modes, up to 256 states of cells.
  • A rich library of selected standard Life patterns and new patterns showing properties of other Cellular Automata rules.
  • Advanced editing features: draw dots, lines, rectangles, filled rectangles; cut and paste, drag and drop, etc. Cut and paste to and from text editors; one can even interactively draw in the live cells without pausing the simulation.
  • Mirroring, rotating, inverting, randomizing, colorizing, ...
  • Fully configurable seeding and randomizing. Sophisticated area/coloring/density/mode selections. Statistical (Bernoulli) and exact seeding.
  • All or selected Life file types can be automatically associated with MCell for easy opening directly from the Windows Explorer.
  • Configurable, unlimited, event-driven Undo and Redo.
  • Various analysis: statistics, transitions, correlations, population logs, period checkers.

References

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Conway's Game of Life — Conway game , which redirects to here, can also refer to games as defined by surreal numbers, which John Conway also developed …   Wikipedia

  • Life-like cellular automaton — A cellular automaton (CA) is Life like (in the sense of being similar to Conway s Game of Life) if it meets the following criteria: The array of cells of the automaton has two dimensions. Each cell of the automaton has two states (conventionally… …   Wikipedia

  • Seeds (cellular automaton) — Seeds is a cellular automaton in the same family as the Game of Life, initially investigated by Brian Silverman and named by Mirek Wójtowicz. It consists of infinite two dimensional grid of cells, each of which may be in one of two states: on or… …   Wikipedia

  • Automate Cellulaire — À gauche, une règle locale simple : une cellule passe d un état (i) au suivant (i+1) dans le cycle d états dès que i+1 est présent dans au moins 3 cellules voisines. À droite, le résultat (complexe !) de l application répétée de cette… …   Wikipédia en Français

  • Automate cellulaire — À gauche, une règle locale simple : une cellule passe d un état (i) au suivant (i+1) dans le cycle d états dès que i+1 est présent dans au moins 3 cellules voisines. À droite, le résultat (complexe) de l application répétée de cette règle… …   Wikipédia en Français

  • Automates cellulaires — Automate cellulaire À gauche, une règle locale simple : une cellule passe d un état (i) au suivant (i+1) dans le cycle d états dès que i+1 est présent dans au moins 3 cellules voisines. À droite, le résultat (complexe !) de l… …   Wikipédia en Français

  • Циклический клеточный автомат — Циклический клеточный автомат  Класс клеточных автоматов. Система правил, определяющая волнообразное порождение клеток в циклическом клеточном автомате (Cyclic Cellular Automata, CCA), может определять генерацию паттернов, имитирующих… …   Википедия

  • Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states …   Wikipedia

  • Oscillator (cellular automaton) — In a cellular automaton, an oscillator is a pattern that returns to its original state, in the same orientation and position, after a finite number of generations. Thus the evolution of such a pattern repeats itself indefinitely. Depending on… …   Wikipedia

  • Day & Night — This article is about a cellular automaton rule. For other uses, see Day Night (disambiguation). Gun and antigun demonstrating the symmetric nature of Day Night. Day Night is a cellular automaton rule in the same family as Game of Life. It is… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”