Conway's Game of Life

Since I didn't work much with shaders, I thought that it will be nice challenge for me to learn about specific type of them - Compute Shaders.
Thanks to John Convay who in 1970 invented Cellular Automata known as Conway's Game of Life I had an idea for another project - to make Game of Life that works on GPU.
I decided to run the game's simulation using entirely Compute Shaders. There were some challenges, but surprisingly, it wasn't related to Compute Shaders themselves. They were pretty easy to start with, thanks to the Internet:

Rules of the 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.

If you are interested in much more sophisticated approach then this talk is a must-watch:

The Conway's rules are not the only ones. If you want to explore further this wonderful universe of cellular automatas I must direct you to this wiki:
https://conwaylife.com/wiki/Main_Page
and this application:
http://golly.sourceforge.net/

Warning: at the time of writing this project the compute shaders are not supported by default in web browsers. I would recommend downloading the standalone version of zlevels.

Link to my github page:
https://github.com/Zaimatsu/zlevels

If you like my work leave a comment and share it with your friends!

References:

• https://conwaylife.com/wiki/Main_Page
• http://golly.sourceforge.net/
• https://bitstorm.org/gameoflife/lexicon/