Game Of Life Conway Patterns

Neighbors of a cell are cells that touch that cell either horizontal vertical or diagonal from that cell.

Game of life conway patterns. It can simulate the largest known patterns including the tetris processor 0 1mb 29201m cells caterpillar 2 5mb 11m cells gemini 1 4mb 846k cells turing machine 0 1mb 252k cells and large metapixel patterns 0 1mb 100m cells. A c 4 period 4 spaceship. This is an implementation of conway s game of life or more precisely the super fast hashlife algorithm written in javascript using the canvas tag. It is turing complete and can simulate a universal constructor or any other turing machine.

Each cell can be either alive or dead. An exact duplicate of the initial pattern can be seen at the right end of the above picture displaced 400 cell units from where it started near the left end of the picture. The term puffer train was coined to describe just this pattern. The game of life an example of a cellular automaton is played on an infinite two dimensional rectangular grid of cells.

It is a zero player game meaning that its evolution is determined by its initial state requiring no further input. One interacts with the game of life by creating an initial configuration and observing how it evolves. The status of each cell changes each turn of the game also called a generation depending on the statuses of that cell s 8 neighbors.