On the last snack break, four people finished, and eight people submitted their attempts. Three of the four people who completed the challenge did the advanced challenge. Drakus34 had the simplest solution.
Snack Break #18's Problem
This week's challenge is to re-create
Conway's Game of Life. Conway's Game of Life is a basic computer simulation with very basic rules. With these rules you can create some rather complex simulations. You will have "cells" that will either be alive or dead. You can represent this with colors or some other indicator.
A "neighbor" is any live cell that's around the cell you're currently calculating. This includes diagonal, vertical, or horizontal to the current cell.
These rules can be found on the wiki.
- Any live cell with fewer than two live neighbours dies, as if caused by under-population.
- 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 over-population.
- Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
You can use whatever method to get a practical simulation working. The game should be at least 20x20 cells. If you're still confused on the rules or how the game works, this video should help you.
To submit your attempt, just send me the link to the place/model here along with your SH username. If you're submitting the place, please make the game open source. If you complete the challenge, you will be mentioned on the next snack break.