https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life

1. Any live cell with fewer than two live neighbours dies, as if by underpopulation.
2. Any live cell with two or three live neighbours lives on to the next generation.
3. Any live cell with more than three live neighbours dies, as if by overpopulation.
4. Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.

Not optimized for speed or memory usage.

I get it, NumPy is cool, amazing even, but why? This is a toy program, computers are fucking fast, and are always idle, by using NumPy you're basically hiding the most interesting part of the implementation behind the array calculations that it provides.

The grid is a 2D array of integers. 0 means dead, 1 means alive.

The grid is initialized with a few live cells.

The grid is printed on the console.

The grid is updated according to the rules of Conway's Game of Life.

The grid is printed to the console again.

The grid is updated again.

The grid is printed to the console again.

The grid is updated again.

The grid is printed to the console again.

I think you get the idea.

There's a simple visual implementation using pygame on game_of_life_pygame.py