Breadcrumbs

Biology

Biology

2.75 1 1 1 1 1 1 1 1 1 1 Rating 2.75 (2 Votes)

Details: Written by Loo Kang Wee; Parent Category: Interactive Resources; Category: Biology; Published: 13 December 2019; Created: 13 December 2019; Last Updated: 13 December 2019; Hits: 251

2 1 1 1 1 1 1 1 1 1 1 Rating 2.00 (1 Vote)

Details: Written by Loo Kang Wee; Parent Category: Interactive Resources; Category: Biology; Published: 10 April 2019; Created: 10 April 2019; Last Updated: 24 May 2019; Hits: 1010

1 1 1 1 1 1 1 1 1 1 1 Rating 1.00 (1 Vote)

Details: Written by Loo Kang Wee; Parent Category: Interactive Resources; Category: Biology; Published: 08 February 2019; Created: 08 February 2019; Last Updated: 11 February 2019; Hits: 1542

1 1 1 1 1 1 1 1 1 1 Rating 0.00 (0 Votes)

Details: Written by Loo Kang Wee; Parent Category: Interactive Resources; Category: Biology; Published: 05 November 2018; Created: 05 November 2018; Last Updated: 05 November 2018; Hits: 833

Biology

About

Introduction

John Conway’s Game of Life

Description taken from Wikipedia, the free encyclopedia.

The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is the best-known example of a cellular automaton. The "game" is actually a zero-player game, meaning that its evolution is determined by its initial state, needing no input from human players. One interacts with the Game of Life by creating an initial configuration and observing how it evolves. A variant exists where two players compete. Rules: 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, live or dead. Every cell interacts with its eight neighbours, which are the cells that are directly horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:

Any live cell with fewer than two live neighbors dies, as if by loneliness.
Any live cell with more than three live neighbors dies, as if by overcrowding.
Any live cell with two or three live neighbors lives, unchanged, to the next generation.
Any dead cell with exactly three live neighbors comes to life.

The initial pattern constitutes the 'seed' of the system. The next generation is created by applying the above rules simultaneously to every cell in the seed - births and deaths happen 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 one before.) The rules continue to be applied repeatedly to create further generations. John Conway' s Game of Life

Title and author:

John Conway' s Game of Life
$Logo$

$author image$ $author image$ $author image$ Francisco Esquembre; Wolfgang Christian; Tan Wei Chiong; lookang

Released under a $Creative Commons Attribution-NonCommercial-ShareAlike$ license.

Translations

Code	Language		Translator	Run

Software Requirements

SoftwareRequirements

	Android	iOS	Windows	MacOS
with best with	Chrome	Chrome	Chrome	Chrome
support full-screen?	Yes. Chrome/Opera No. Firefox/ Samsung Internet	Not yet	Yes	Yes
cannot work on	some mobile browser that don't understand JavaScript such as.....		cannot work on Internet Explorer 9 and below

Credits

Francisco Esquembre; Wolfgang Christian; Tan Wei Chiong; lookang

end faq

Sample Learning Goals

[text]

For Teachers

This is a simulation of John Conway's Game of Life, a cellular automation in which cells are placed in a grid, and individual cells either live or die according to these rules:

1) Any live cell with fewer than two live neighbours dies, as if caused by under-population.
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 over-population.
4) Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.

This simulation only requires user input for the initial state, as every other state is determined by the iteration before it.

Interestingly, certain cellular constructs can be formed based on these rules. Three of them (gliders, diehards and acorns) are already preset in the simulation for your convenience.

Research

[text]

Video

[text]

Version:

http://weelookang.blogspot.sg/2016/02/vector-addition-b-c-model-with.html improved version with joseph chua's inputs
http://weelookang.blogspot.sg/2014/10/vector-addition-model.html original simulation by lookang

Other Resources

[text]