The game of life, imagined by the British mathematician John H. Conway, is a Solitaire type game analogous to the rise, fall and alternations of a society of living organisms. In this article, I will introduce you to the implementation of Game of Life with Python.
The game of life was one of the earliest examples of a problem in modern mathematics called cellular automata.
Also, Read – 100+ Machine Learning Projects Solved and Explained.
- The Game of Life
- game of life
- The game uses a rectangular grid of cells of infinite size in which each cell is empty or occupied by an organism. It is said that occupied cells are alive, while empty ones are dead. The game is played over a specific period, with each turn creating a new “generation” based on the arrangement of living organisms in the current configuration.
The status of a cell in the next generation is determined by applying the following four basic rules to each cell of the current configuration:
- If a cell is alive and has two or three living neighbours, the cell stays alive in the next generation.
- A living cell that has no living neighbours or only one living neighbour dies of isolation in the next generation.
- A living cell that has four or more living neighbours dies from overpopulation in the next generation.
- A dead cell with exactly three living neighbours results in birth and becomes alive in the next generation.
- Implementing The Game of Life with Python
- The Game of Life begins with an initial setup provided by the user. Successive generations are created by applying the set of rules simultaneously to each cell in the grid. Interesting patterns can develop as the population of organisms changes, increases, or eventually disappears. Now let’s see how to implement the game of life with Python:
class game_of_life: def gameOfLife(self, board: List[List[int]]) -> None: """ Do not return anything, modify board in-place instead. """ # Neighbors array to find 8 neighboring cells for a given cell neighbors = [(1,0), (1,-1), (0,-1), (-1,-1), (-1,0), (-1,1), (0,1), (1,1)] rows = len(board) cols = len(board) # Create a copy of the original board copy_board = [[board[row][col] for col in range(cols)] for row in range(rows)] # Iterate through board cell by cell. for row in range(rows): for col in range(cols): # For each cell count the number of live neighbors. live_neighbors = 0 for neighbor in neighbors: r = (row + neighbor) c = (col + neighbor) # Check the validity of the neighboring cell and if it was originally a live cell. # The evaluation is done against the copy, since that is never updated. if (r < rows and r >= 0) and (c < cols and c >= 0) and (copy_board[r][c] == 1): live_neighbors += 1 # Rule 1 or Rule 3 if copy_board[row][col] == 1 and (live_neighbors < 2 or live_neighbors > 3): board[row][col] = 0 # Rule 4 if copy_board[row][col] == 0 and live_neighbors == 3: board[row][col] = 1
NOTE – In order to run the project of Python, you have to download Python IDLE or Pycharam. In the video I have explained how to download and install it.
- SEO Practices Everyone Should Follow SEO Rules
- Complete Top SEO Checklist
- Yoast Seo Premium 15.2 Nulled – WordPress SEO Plugin
- Top 50+ SEO Interview Questions
- What is a Backlink? How to Get More Backlinks
- TOP 20+ ANDROID PROJECT WITH SOURCE CODE
- Top 20+ interview Programs
If you found this post useful, don’t forget to share this with your friends, and if you have any query feel free to comment it in the comment section.
Thank you 🙂 Keep Learning !