This is a customizable game of life implementation in Minecraft.

The game of life is basically a cell automator with these rules:

The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, live or dead (or populated and unpopulated, respectively). Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:

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

These rules, which compare the behavior of the automaton to real life, can be condensed into the following:

Any live cell with two or three live neighbours survives.
Any dead cell with three live neighbours becomes a live cell.
All other live cells die in the next generation. Similarly, all other dead cells stay dead.

This pack implements this game into minecraft as a datapack.

By default, the rule is set to Conway's game of life(B3/S23), but you can edit born/survive rules in the datapack by editing corresponding sections in data/gol/functions/step.mcfunction.

Video demo: https://www.bilibili.com/video/BV1US4y1375y/