https://github.com/charlesaverill/conway
https://github.com/charlesaverill/conway
Last synced: about 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/charlesaverill/conway
- Owner: CharlesAverill
- Created: 2020-04-29T18:31:53.000Z (almost 5 years ago)
- Default Branch: master
- Last Pushed: 2020-05-04T03:30:15.000Z (almost 5 years ago)
- Last Synced: 2025-01-14T10:58:54.914Z (3 months ago)
- Language: Python
- Size: 32.1 MB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Conway
Conway is a dataset containing 100,000 instances that of Conway's game of life.
### Data
Inside of the compressed `data` folder, there are folders for each game
instance. Each of these folders contains a `start.npy` and
`end.npy`, which contain NumPy arrays of the game's initial
and ending conditions.
- Each grid is 50x50, and the grid boundaries are concrete
(e.g. left/right top/bottom boundaries do not connect like an
infinite plain).
- The games follow the traditional rules
The compressed `data` folder also contains a `games.csv`, which contains the
following (each row represents 1 game):
- Paths to `start.npy` and `end.npy`
- Number of living cells at the start of the game. This should
average around 10% of the map size, or around 250 cells.
- Number of living cells at the end of the game.
- Steps performed (will be 100,000 unless all cells have died)