Uploaded October 2012 | Updated September 2026, 2 days ago
My FFT based implementation of Conway's life seemed silly, but the same code can be trivially modified to provide implementations of rules which have more extended neighborhoods. This is an implementation of the "Bugs" rule, which has a radius of 5 and where the cell survives if it has between 34 and 58 (inclusive) neighbors, and is born if it has between 34 and 45 neighbors (the center square is included). Gliders seem rather more prevalent in this world, you can witness some interesting collisions. Neat bonus of the FFT approach: it runs as fast as the simpler Conway's rule.
My FFT based implementation of Conway's life seemed silly, but the same code can be trivially modified to provide implementations of rules which have more extended neighborhoods. This is an implementation of the "Bugs" rule, which has a radius of 5 and where the cell survives if it has between 34 and 58 (inclusive) neighbors, and is born if it has between 34 and 45 neighbors (the center square is included). Gliders seem rather more prevalent in this world, you can witness some interesting collisions. Neat bonus of the FFT approach: it runs as fast as the simpler Conway's rule.
