In this Building Conway's Game of Life in Python project, you get to implement a simulation of the Game of Life, invented by mathematician John Horton Conway. It’s an excellent opportunity to apply your programming skills in Python while exploring fascinating concepts in cellular automata, emergence, and complexity theory.

Conway’s Game of Life is a zero-player game requiring only an initial state and no further input. In its original setting, the game takes place on an infinite grid of square cells, each in one of two possible states: live or dead. Every cell interacts with its eight neighbors (horizontally, vertically, or diagonally adjacent cells). Starting at the initial state, the game evolves according to the following rules:

• Any live cell with two or three live neighbors survives. Otherwise, a cell dies due to loneliness (with no or only one neighbor) or overpopulation (with four or more neighbors).
• Any dead cell with (exactly) three live neighbors becomes a live cell. A dead cell with any other number of neighbors remains dead.

In this project, we restrict the infinite grid to one with finite pre-defined dimensions.

Despite its simplicity, the Game of Life has the power to create complex behaviors, which have implications for all fields—from physics and mathematics to philosophy and art.

For this Conway's Game of Life project, you’ll work with Python 3 or newer and an IDE of your choice (Jupyter Notebook, Spyder, PyCharm, Visual Studio, etc.) Still, note that the file attached to this project is a Jupyter Notebook.