This is an implementation of Conway's Game of Life using the p5.js library.
Conway's Game of Life is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves.
The game is played on a grid of cells, each of which can be in one of two possible states: alive or dead. The grid evolves in discrete time steps, with each generation being a function of the previous one according to certain rules:
- Any live cell with fewer than two live neighbors dies, as if by underpopulation.
- Any live cell with two or three live neighbors lives on to the next generation.
- Any live cell with more than three live neighbors dies, as if by overpopulation.
- Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.
To run the Game of Life locally, visit: https://prashant2002pd.github.io/game-of-life/
- p5.js - JavaScript library for creative coding.
Contributions are welcome! Feel free to submit bug reports, feature requests, or pull requests.
- Fork the repository.
- Create your feature branch:
git checkout -b feature-name - Commit your changes:
git commit -am 'Add some feature' - Push to the branch:
git push origin feature-name - Submit a pull request.