super-fast-cell-automata

C++, Cellular Automata 2011-12-29 Review of project. To do, port it out of vc c++ code, into gcc with opengl. Remove all vc related files and code. Overview This is fast lightweight library for 2D cellular automata generation (for example, Conway"s game of life). It"s meant to use a very small memory footprint and to be faster than any other engine I could find. Also standardizes the definition of a CA set of rules (there are 2^512 possible 2D CA, of which Conway"s game of life is only one. Implementations for windowsXP, 95-2000, Visual C++ (.net) 2-dimensional, k=3 (adjacent cells are colored differently), square grid, Moore Neighborhood of range 1. Rules are coded over 512 bits, 000000... - 11111... In order to write a fast CA engine, I needed to squeeze every bits out of every bytes. See the demo repo for win32 executable samples. If you don"t