What algorithm can be implemented to speed up the simulation of cellular automata?

Question

I am writing a ncurses CA-based simulator for (almost) any type of CA that uses Moore or Neumann neighborhoods.

With the current (hard-coded and most obvious [current state of state]) simulation works very well; until the screen is filled with 'on' cells (or any active ones).

So my question is: Are there effective algorithms for processing at least the rules of life? or generations, balanced life / generations ...

Thanks.

Answer 1

, . " ?" "on" .

Answer 2

, - , , " ". , , , /.

http://www.state-machine.com///< - , http://www.boost.org/doc/libs/1_40_0/libs/statechart/doc/index.html

whit stackless python http://stackless.com/. . http://members.verizon.net/olsongt/stackless/why_stackless.html#the-factory factory

Answer 3

You can study the HashLife algorithm and try to adapt its concept to the authors you are working on.