You are viewing the course site for a past offering of this course. The current offering may be found here.
Lecture 12: Integration (63)
randyfan

Celullar automata is a discrete model where cells are created/removed based on a set of rules. To give a specific example, the Game of Life, devised by John Conway, is a cellular automaton that forms various patterns throughout the lattice given the following rules:

  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. These simple rules create many interesting patterns depending on the initial state of living cells.The Game of Life wikipedia page (https://en.wikipedia.org/wiki/Conway's_Game_of_Life) contains some of the frequently occurring patterns . Also, here is my implementation of Game of Life with an added rule of a block shooting out a glider every few seconds (https://www.openprocessing.org/sketch/653992)
You must be enrolled in the course to comment