1 The Game of Life Supplement 2. 2 Background The Game of Life was devised by the British mathematician John Horton Conway in 1970. More sophisticated.

Slides:



Advertisements
Similar presentations
Lecture 20 – Boolean Operators Dr. Patricia J. Riddle.
Advertisements

{ John Conway’s Game of Life.  John von Neumann  Wanted to find/create a machine that could replicate itself  Found an answer, but it was very complex.
Game of Life in 21 st Century ECE817 Presentation By Kyusik Chung
Cellular Automata COMP308 Unconventional models and paradigms.
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.
Slides for Parallel Programming Techniques & Applications Using Networked Workstations & Parallel Computers 2nd ed., by B. Wilkinson & M
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)
CS Summer 2005 Final class - July 1st Assorted fun topics in computability and complexity.
Cellular Automata MATH 800 Fall “Cellular Automata” 588,000 results in 94,600 results in 61,500 results in 2.
Game of Life Changhyo Yu Game of Life2 Introduction Conway’s Game of Life  Rule Dies if # of alive neighbor cells =< 2 (loneliness) Dies.
Joanne Turner 15 Nov 2005 Introduction to Cellular Automata.
Conway’s Game of Life Andrew Williams
CS305j Introduction to Computing Two Dimensional Arrays 1 Topic 22 Two Dimensional Arrays "Computer Science is a science of abstraction -creating the right.
Project 1CS-4513, D-Term Programming Project #1 Concurrent Game of Life Due Friday, March 20.
Cellular Automata Orit Moskovich
Cellular Automata Avi Swartz 2015 UNC Awards Ceremony.
Introduction At the heart of the growth of a multi-cellular organism is the process of cellular division… … aka (in computing) self-replication.
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
General Purpose 3D Cellular Automata Modeller. A Regular Lattice of Cells, each obeying the same set of rules Simple rules for individual cells can produce.
Variations of Conway’s Game of Life Eswar Kondapavuluri.
Introduction Computational Challenges Serial Solutions Distributed Memory Solution Shared Memory Solution Parallel Analysis Conclusion Introduction: 
Discrete Time and Discrete Event Modeling Formalisms and Their Simulators Dr. Feng Gu.
7 th International Conference on Numerical Methods and Applications, August 20-24, 2010, Borovets, Bulgaria Intuitionistic Fuzzy Interpretations of Conway's.
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
More Accurate Rate Estimation CS 170: Computing for the Sciences and Mathematics.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
Scatology. Scatology Study of output Study of output Also called coprology Also called coprology From what comes out you get a pretty good idea of what.
1 Data Structures CSCI 132, Spring 2014 Lecture 3 Programming Principles and Life Read Ch. 1.
Course material – G. Tempesti Course material will generally be available the day before the lecture Includes.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
GPU Architectural Considerations for Cellular Automata Programming A comparison of performance between a x86 CPU and nVidia Graphics Card Stephen Orchowski,
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.
Tracking using Cellular Automaton Algorithm for CBM experiment Arkadiusz Bubak University of Silesia, Katowice, Poland.
Activity 2-1: The Game of Life
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
Topic 26 Two Dimensional Arrays "Computer Science is a science of abstraction -creating the right model for a problem and devising the appropriate mechanizable.
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.
Fractals. In colloquial usage, a fractal is "a rough or fragmented geometric shape that can be subdivided in parts, each of which is (at least approximately)
Cellular Automata Spatio-Temporal Information for Society Münster, 2014.
Parallel Programming 0024 Spring Semester 2010 May 6, 2010.
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.
Programming Principles Chapter 1. Objectives Discuss the program design process. Introduce the Game of Life. Discuss object oriented design. – Information.
עקרונות תכנות מונחה עצמים תרגול 6 - GUI. סיכום ביניים GUI:  Swing  Basic components  Event handling  Containers  Layouts.
Review Recursion Call Stack. Two-dimensional Arrays Visualized as a grid int[][] grays = {{0, 20, 40}, {60, 80, 100}, {120, 140, 160}, {180, 200, 220}};
HW5: Parallelization. – 2 – Conway’s Game of Life Simple 2D universe with simple rules, complex results! 1. Any live cell with fewer than two live neighbors.
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.
The Northern Lights: Demonstrations. Programmability Overview A major aspect of our project is programmability- it is an interactive display medium, the.
Intro to Life32. 1)Zoom to 10 That will allow you to see the grid and individual cells.
A few of the people involved and what they’ve done.
TRU-COMP3710 Artificial Life and Emergent Behavior1 Course Outline Part I – Introduction to Artificial Intelligence Part II – Classical Artificial Intelligence.
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.
EECS 110: Lec 12: Mutable Data Aleksandar Kuzmanovic Northwestern University
1 1 2 What is a Cellular Automaton? A one-dimensional cellular automaton (CA) consists of two things: a row of "cells" and a set of "rules". Each of.
Chaotic Behavior - Cellular automata
Introduction Abstract
Illustrations of Simple Cellular Automata
Cellular Automata.
Two-Dimensional Arrays
Spatio-temporal information in society: cellular automata
More 2 D Array.
Modeling Pattern Formation in Skin Diseases by a Cellular Automaton
Continue with Life, Magic and Catch -up
AP Java Learning Objectives
Activity 2-1: The Game of Life
Modeling Rainfall using a Cellular Automata
Presentation transcript:

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 programs now exist, but are generally more complex. The Game of Life uses simple rules to show how complex “artificial life” can evolve or extinguish over generations. The user interacts with the game by creating an initial configuration of “cellular automata.” The game has no further user interaction since changes are determined by the initial configuration. The universe of the Game of Life is a two-dimensional orthogonal grid of square cells Each cell can be in one of two possible states in each generation, either alive or dead. The cells interact with their eight neighbors that are directly horizontally, vertically, or diagonally adjacent.

3 Rules Four basic rules simultaneously apply at each step or generation: –Any live cell with fewer than two live neighbors dies by loneliness. –Any live cell with more than three live neighbors dies by overcrowding. –Any live cell with two or three live neighbors survives unchanged to the next generation. –Any dead cell with exactly three live neighbors comes to life. The version of the Game of Life we are using is known as “Golly.” Taken verbatim (with some editing) from: Versions of the Game of Life and other cellular automata programs can be found on the web including via links from the above website address.