Reverse Game of Life
This project leverages Rust to simulate Conway's Game of Life in reverse
by transforming it into a Boolean satisfiability (SAT) problem. By encoding
cellular states and rules into logical constraints, it uses a SAT solver to
infer previous generations from a given pattern.
This remains a challenging and ongoing effort, exploring computational limits,
optimization techniques, and advanced logical modeling. The game and it's
functionality are embedded in the project page using WASM.