Ha. Sorry this is confusing! There’s already been a lot written about this, and if you’re interested you should definitely read some more about it, but I’ll give a shot at a brief explanation:
Conway was a mathematician (who recently passed away). He invented this “game” but it’s not really one that has score or points.
The “game” takes place on a grid (think of a piece of graph paper). You can fill in any cells (squares on the graph paper) you want.
The next step is to figure out the next generation. For each cell, you look at its 8 neighbors.
If the cell you’re starting at is “alive” (filled in), it stays alive in the next generation if it has exactly two or three live neighbors (fewer than two and it dies from loneliness; more than three it dies from over crowding).
If the cell you’re starting from is “dead”, it comes to life in the next generation if it has exactly three live neighbors.
Once you’ve done this for every cell, you’re done. You’ve computed a new generation. You can repeatedly produce new generations as many times as you want.
As you can imagine, computers are pretty good at playing this game…
People have found some very interesting patterns (some of which I included in the Menu): some that are stable, or oscillate, or move across the grid, or produce new children… there are even some self-replicating patterns (though this grid is too small to showcase those).
In this version, you’re free to draw around on the grid (A button will draw while the game isn’t running). You can play around with seeing how your own patterns evolve. Or you can load up one of the preconfigured ones and tweak it. There’s even one preset that will just randomly fill the grid with 30% live cells. The reset button will reset to whatever pattern you last selected (though it will lose any customizations you made).
If you find it fun, or interesting, or want to see some more examples of patterns, the wikipedia page is probably a good start: https://en.wikipedia.org/wiki/Conway's_Game_of_Life