An implementation in Haskell :)
Uses gloss to show an NxN sized window
I'm mostly doing this to have something to test out profiling, quickcheck, and build something more meaty in Haskell.
The Naive implementation uses 110 - 130% CPU on my 2015 Macbook Pro (2.9 Ghz 2 core i5), and I want to see how far I can optimize this.
stack build && stack run <side length> <steps per second>
- Naive implementation
- Random initial grid state
- CLI option: Steps per second
- CLI option: Side length for grid
- Profile for Naive implementation
- Testing
- CLI option: Initial grid as CSV file
- Performance Pass 1
Feature branches off master