A simple Conway's Game of Life written in Go and in Haskell.
- No cycle detection
- Infinite grid
- No GUI
$ go build
$ ./conway$ go test
PASS
ok github.com/yackx/conway 0.171s
$ ghc conway.hs
$ ./conway[(0, 0) (1, 0) (2, 0) (1, 1) (2, 1)]
[(0, 0) (2, 0) (2, 1) (1, -1) (0, 1)]
[(0, 0) (2, 0) (1, -1)]
[(1, -1) (1, 0)]
[]