Python implementation of Conway's Game of Life
Project description
Conway's Game_of_Life
Python implementation of Conway's Game of Life
Conway's Game of Life is an automaton simulation with rather simple rules and a so called zero-player game. After marking the status (alive/dead) of the cells, the programm simulates the life according to the following rules:
- Any live cell with fewer than two live neighbours dies, as if by underpopulation.
- Any live cell with two or three live neighbours lives on to the next generation.
- Any live cell with more than three live neighbours dies, as if by overpopulation.
- Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Close
Hashes for menkeyshow.conway-0.0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 5c64976427939dc6d1b288ee90407ceb6bf7280aab9fe5c5343ebaebe46eb8e4 |
|
MD5 | 955e66267fd7d55863e86fd4f2b8e108 |
|
BLAKE2b-256 | 140d32eaab24bd62fa41d8b57a66ccec6bbc7c2189b7b750f47db9bf561bb730 |