C game of life

Sign up or log in Sign up using Google. Sign up using Facebook. Sign up using Email and Password. Post as a guest Name. Email Required, but never shown. The Overflow Blog. Podcast Making Agile work for data science. Stack Gives Back Featured on Meta. New post summary designs on greatest hits now, everywhere else eventually. Related Hot Network Questions. The state of the cells depens in some well defined rules, this allows the user to create some known initial patterns that reproduces the same behaviour everytime.

One of the most famous patterns is the Glider:. The rules that decide if a cell lives on the next cicle are very simple copy paste from wikipedia :. The game main loop basically calculates the next board state and then updates the currentBoard with the futureBoard values. I will start with a very simple C implementation. This file is self explanained. First, it ask the user for the type of board to initialize, then, it starts the game main loop, where the screen is cleaned, the current board is printed and the next board is generated.

The functions in board. When DetermineNextLiveState is called, the neighbors are inspected to determine how many are alive, then Life rules are used to determine if this cell will be alive or not after advancement. The Board holds a 2D array of Cell objects and advances the board whenever the Advance method is called. I separated this method because it's easier to assess in isolation. It's in charge of populating the Neighbors property of each Cell. Every cell should have 8 neighbors.

This design wraps neighbors around the edge of the board.