Fetching latest commit…
Cannot retrieve the latest commit at this time.
|Failed to load latest commit information.|
Conways Game of Life 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, alive or dead. 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 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 overcrowding. - Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction. The initial pattern constitutes the seed of the system. The first generation is created by applying the above rules simultaneously to every cell in the seed—births and deaths occur simultaneously, and the discrete moment at which this happens is sometimes called a tick (in other words, each generation is a pure function of the preceding one). The rules continue to be applied repeatedly to create further generations. Steps to creating a Ruby project with RSpec and Guard git://gist.github.com/1493494.git Assumption and Implementation approaches/techniques: 1. No board/landscape/plane is assumed 2. If there is a cell, it should be alive. We do not count for dead cells. 3. Ruby's very own Observer library is used in the implementation 4. Ruby kata: Its TDD in practice