Open aslakjohansen opened 8 months ago
Torben Hoffmann has an Erlang implementation that keeps per-cell history in order to support recalculation of restarted cells. A consequence of this is the need to bound the number of generations. He also has a presentation about it here.
While this solves a different set of requirements than what I usually think of in Game of Life, it is a very good example of how state can sometimes be regenerated after the crash of a statefull supervised server (i.e., a cell in this case). Perhaps both should be illustrated ...
Inspiration: