Suharsh Sivakumar December 11, 2010.  A grid of cells where all the cells are governed by a common set of rules based on the number of adjacent neighbors.

Slides:



Advertisements
Similar presentations
Reversible Cellular Automata CS240 Kwnaghyun Paek.
Advertisements

Simulating the Predator-Prey Interaction Lab Introduction.
QUICK MATH REVIEW & TIPS 2
An Introduction to Algebra
Game of Life Rules and Games Linh Tran ECE 573. What is Life? Life is just one example of a cellular automaton, which is any system in which rules are.
1 The Game of Life Supplement 2. 2 Background The Game of Life was devised by the British mathematician John Horton Conway in More sophisticated.
Cellular Automata (Reading: Chapter 10, Complexity: A Guided Tour)
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
CELLULAR AUTOMATON Presented by Rajini Singh.
CELLULAR AUTOMATA Derek Karssenberg, Utrecht University, the Netherlands LIFE (Conway)
Joanne Turner 15 Nov 2005 Introduction to Cellular Automata.
Downloading eBooks to your iPhone, iPad, and iPod Touch from Overdrive.
Choose the right picture
Survey of Mathematical Ideas Math 100 Chapter 1 John Rosson Tuesday January 23, 2007.
Cellular Automata Avi Swartz 2015 UNC Awards Ceremony.
Does not Compute 3: Awesomer Cellular Automata In which we consider how to upgrade our cellular automata A few key choices are considered, but eventually.
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
Solving a System of Equations by ELIMINATION. Elimination Solving systems by Elimination: 1.Line up like terms in standard form x + y = # (you may have.
Parallelization: Conway’s Game of Life. Cellular automata: Important for science Biology – Mapping brain tumor growth Ecology – Interactions of species.
Bottom-Up Coordination in the El Farol Game: an agent-based model Shu-Heng Chen, Umberto Gostoli.
Chapter 11 – Introduction to Algebra (Part II)
Computer Viruses, Artificial Life & the Origin of Life Robert C Newman Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org.
GENE FREQUENCY VS. NATURAL SELECTION PRESENTED BY: TEAM GETTING BY CHRIS VICTORIA(303887) LEEANN PHAM (282117) PATRICK HANSEN(323893) JOZ-LYNN CASE(316524)
1 Data Structures CSCI 132, Spring 2014 Lecture 3 Programming Principles and Life Read Ch. 1.
Population and Natural Selection. Food Chain.
1 Cellular Automata and Applications Ajith Abraham Telephone Number: (918) WWW:
The Game of Life A simulation of "life". From simple rules, complex behavior arises Rules –A cell that is alive and has fewer than two live neighbors dies.
Cellular Automata. The Game The Game of Life is not your typical computer game. It is a 'cellular automation', and was invented by the Cambridge mathematician.
Aftificial Life: Celular Automata Dr. Shazzad Hosain Department of EECS North South Universtiy
Cellular Automata Spatio-Temporal Information for Society Münster, 2014.
Trust Propagation using Cellular Automata for UbiComp 28 th May 2004 —————— Dr. David Llewellyn-Jones, Prof. Madjid Merabti, Dr. Qi Shi, Dr. Bob Askwith.
1 Data Structures CSCI 132, Spring 2014 Lecture 4 Implementing Life.
The Game of Life Erik Amelia Amy. What is the “Game of Life?” The “Game of Life” (often referred to as Life) is not your typical game. There are no actual.
Model Iteration Iteration means to repeat a process and is sometimes referred to as looping. In ModelBuilder, you can use iteration to cause the entire.
Cellular Automata. John von Neumann 1903 – 1957 “a Hungarian-American mathematician and polymath who made major contributions to a vast number of fields,
A Variation on Conway’s Game of Life Winston Lee EPS 109.
Cellular Automata Introduction  Cellular Automata originally devised in the late 1940s by Stan Ulam (a mathematician) and John von Neumann.  Originally.
Elimination Method: Solve the linear system. -8x + 3y=12 8x - 9y=12.
An Introduction to Algebra
Pedro R. Andrade Münster, 2013
Lesson 1-8 Solving Addition and Subtraction Equations.
Which of the following pictures of m & m’s is easier to count?
Ionut Trestian Northwestern University
Conway’s Game of Life Jess Barak Game Theory. History Invented by John Conway in 1970 Wanted to simplify problem from 1940s presented by John von Neumann.
What does Hobo want to do in picture2 ? He want to share the delicious food with Eddie. “ Hi baby! Share the food with your young brother. ”
A-CED Create equations that describe numbers or relationships. 1. Create equations and inequalities in one variable and use them to solve problems. Include.
7.5 Solving square root and other radical equations.
Skip Counting Counting by 2’s, 3’s, 5’s, and 10’s Standard 2.1 Numbers, Number Systems and Number Relationships A. Count using whole numbers to 100 by.
11.3 Solving Radical Equations Definitions & Rules Simplifying Radicals Practice Problems.
Self-organization in Forest Evolution J. C. Sprott Department of Physics University of Wisconsin - Madison Presented at the US-Japan Workshop on Complexity.
Elementary cellular automata
Spatio-Temporal Information for Society Münster, 2014
Cellular Automata Pedro R. Andrade Tiago Garcia de Senna Carneiro
Pedro Ribeiro de Andrade Münster, 2013
Computational Models.
Prime Numbers.
Solving Systems of Equations
Pedro R. Andrade Münster, 2013
Illustrations of Simple Cellular Automata
In the absence of wolves, the rabbit population is always 5000
Pedro R. Andrade Münster, 2013
Spatio-temporal information in society: cellular automata
Ionut Trestian Northwestern University
Integers.
Notes Solving a System by Elimination
Notes Solving a System by Elimination
Answer Grid – 3 & 4 Step Equations
Modeling Pattern Formation in Skin Diseases by a Cellular Automaton
Counting by 2’s, 3’s, 5’s, and 10’s
Solve the linear system.
Presentation transcript:

Suharsh Sivakumar December 11, 2010

 A grid of cells where all the cells are governed by a common set of rules based on the number of adjacent neighbors.  As generations go by, the rules work together to show very interesting phenomena in the big picture.

 There were two ways I could define neighborhoods:  Von Neumann- only four  Moore – all eight  I chose Moore, because it had “Moore” flexibility in the rules. Von Neumann and Moore neighborhoods.

 There are three possible equilibriums:  Prey go extinct and predators quickly follow.  Both extinct Both extinct  Only predators go extinct.  Predators extinct Predators extinct  Both prey and predators fluctuate around an equilibrium point.  Both live Both live

 Want to choose rules that will make the sinusoidal solution to the Lotka-Volterra Equations.Lotka-Volterra Equations  To find this values I just guessed and checked until I found values that caused the program to maintained itself.

 Each cell has the same set of rules for each of the three cases: where it is a predator, or prey, or empty square.  The rules for each square are dependent only on it immediate neighbors, but the Lotka Volterra Equations say nothing about immediate neighbors--- it only talks about the total number.

 A predator cell lives (stays red) if there is prey around it.  A predator cell dies (becomes black) if there is no prey around it.  To model this I created a function that counts the number of prey around a cell.  Then I used this to say:  If prey > 0 then predator lives.  Else predator dies.

 A prey cell lives (stay green) if there aren’t enough predators to eat it.  A prey cell dies (becomes black) if there are enough predators to eat it.  If there are too many predators around a prey cell, then the predators eat and reproduce into the cell. (becomes red)  If 0 < predators < 5 then prey remain alive.  If predators > 4 then prey “becomes” predator.  Else prey remains alive.  To add overpopulation I counted the amount of prey around a cell and said if prey > 7 then the cell dies.

 An empty cell becomes prey (becomes green) if there are more prey than predators.  An empty cell becomes predator (becomes red) if there are more predators than prey.  If no majority, the cell stays empty (stays black).  If prey > predator then prey.  If predator > prey – 1 then predator.  Else empty.

 This is the interesting one.  Without overpopulation Without overpopulation  Looks like the ratio of prey to predators fluctuates around 3.0.  With overpopulation for prey With overpopulation  Looks like the ratio of prey to predators fluctuates around 2.2.  If you look at the numbers you can see that they fluctuate in a somewhat sinusoidal way.

 If anyone want to make a cellular automaton of your own:  Cellular Automaton Skeleton Cellular Automaton Skeleton  You can edit it to have as many states you want, you will just have to also edit the rules.  But the framework and definition of cells has already been done.