Golang Game of Life explorations
While this project originally started out as a way to teach myself some Charm.sh tools, it turned into an algorithm exploration. I am primarily working through Eric Lippert's series on the topic.
Current status: a naive implementation of the algorithm using a 2-d arrayis the winner, followed by Scholes's algorithm, then a naive 1-d array. However, I have not done much optimization on the first two yet.
goos: linux
goarch: amd64
pkg: github.com/makyo/gogol
cpu: Intel(R) Core(TM) i7-10510U CPU @ 1.80GHz
BenchmarkEvolveNaive2d-8 19126 623755 ns/op 530536 B/op 258 allocs/op
BenchmarkEvolveNaive1d-8 1280 9028509 ns/op 525571 B/op 2 allocs/op
BenchmarkEvolveScholes-8 5775 2226668 ns/op 5767509 B/op 12 allocs/op
PASS
ok github.com/makyo/gogol 43.828s