Skip to content

Latest commit

 

History

36 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

=Griffeath's cellulare automaton implementation

Author:: Michel Belleville <mailto:michel.belleville@gmail.com>

Rules :
* cells may evolve cycling through (n) states (4 by default).
* first state (0) is a "null" state by convention.
* a cell evolve to the next state when at least 3 of its neighbors are already
  on said next state.
* a cell that doesn't evolve remains on the same state.

About

An implementation of Griffieath's cellular automaton.

Resources

Stars

2 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages