-
Notifications
You must be signed in to change notification settings - Fork 0
Home
Bastes edited this page Sep 13, 2010
·
6 revisions
This is a learning project, implementing Griffeath’s cyclic cellular automaton on a 2D map.
The rules are simple :
- 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.
(for more information on cyclic cellular automatons visit wikipedia’s page on cellular automatons)