Game of Life Changhyo Yu 2003. 06. 09. Game of Life2 Introduction Conway’s Game of Life  Rule Dies if # of alive neighbor cells =< 2 (loneliness) Dies.

Slides:



Advertisements
Similar presentations
Tactical Event Resolution Using Software Agents, Crisp Rules, and a Genetic Algorithm John M. D. Hill, Michael S. Miller, John Yen, and Udo W. Pooch Department.
Advertisements

Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Game of Life in 21 st Century ECE817 Presentation By Kyusik Chung
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
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.
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
Valery Frolov.  The algorithm  Fitness function  Crossover  Mutation  Elite individuals  Reverse mutations  Some statistics  Run examples.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Mahmoud S. Hamid, Neal R. Harvey, and Stephen Marshall IEEE Transactions on Circuits and Systems for Video Technology, 2003 Genetic Algorithm Optimization.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Genetic algorithms for neural networks An introduction.
Introduction to Genetic Algorithms Yonatan Shichel.
Learning Behavior using Genetic Algorithms and Fuzzy Logic GROUP #8 Maryam Mustafa Sarah Karim
Two-Dimensional Channel Coding Scheme for MCTF- Based Scalable Video Coding IEEE TRANSACTIONS ON MULTIMEDIA,VOL. 9,NO. 1,JANUARY Yu Wang, Student.
Using a GA to Create Prey Tactics Presented by Tony Morelli on 11/29/04.
Genetic Algorithm for Variable Selection
1 Protocols are programs too The meta-heuristic search for security protocols By John A. Clark.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Research Trends in AI Maze Solving using GA Muhammad Younas Hassan Javaid Danish Hussain
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Variations of Conway’s Game of Life Eswar Kondapavuluri.
Parallel Genetic Algorithms with Distributed-Environment Multiple Population Scheme M.Miki T.Hiroyasu K.Hatanaka Doshisha University,Kyoto,Japan.
Travelling Salesman Problem: Convergence Properties of Optimization Algorithms Group 2 Zachary Estrada Chandini Jain Jonathan Lai.
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
Introduction to Genetic Algorithms and Evolutionary Computation
Improved Gene Expression Programming to Solve the Inverse Problem for Ordinary Differential Equations Kangshun Li Professor, Ph.D Professor, Ph.D College.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Simulation of Plant Growth using Genetic Algorithms Peter Barber Westminster College.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Immune Genetic Algorithms By Jeremy Moreau. References Licheng Jiao, Senior Member, IEEE, and Lei Wang, “A Novel Genetic Algorithm Based on Immunity,”
A Variation on Conway’s Game of Life Winston Lee EPS 109.
A novel approach in CSP with GA by Juhos Istvan, Phillip Tann, Toth Attila, Tezuka Masaru.
Edge Assembly Crossover
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Robot Intelligence Technology Lab. Generalized game of life YongDuk Kim.
Routing and Scheduling in Multistage Networks using Genetic Algorithms Advisor: Dr. Yi Pan Chunyan Ji 3/26/01.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
Minesweeper Solver Marina Maznikova Artificial Intelligence II Fall 2011.
Predicting permit activity with cellular automata calibrated with genetic algorithms Sushil J. LouisGary Raines Department of Computer Science US Geological.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Practical Issues: Selection.
CMSC 202 Lesson 15 Debugging. Warmup  What is the bug in the following code? int* foo(int a) { return &a; }
Othello Artificial Intelligence With Machine Learning Computer Systems TJHSST Nick Sidawy.
Why do GAs work? Symbol alphabet : {0, 1, * } * is a wild card symbol that matches both 0 and 1 A schema is a string with fixed and variable symbols 01*1*
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Developing resource consolidation frameworks for moldable virtual machines in clouds Author: Liang He, Deqing Zou, Zhang Zhang, etc Presenter: Weida Zhong.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Advanced AI – Session 7 Genetic Algorithm By: H.Nematzadeh.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology IEEE EC1 Generating War Game Strategies Using A Genetic.
Genetic Algorithm (Knapsack Problem)
Cellular automata.
Author :Shigeomi HARA Hiroshi DOUZONO Yoshio NOGUCHI
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
An evolutionary approach to solving complex problems

Game of Life Presentation Byung-guk Kim
Genetic algorithms: case study
Presentation transcript:

Game of Life Changhyo Yu

Game of Life2 Introduction Conway’s Game of Life  Rule Dies if # of alive neighbor cells =< 2 (loneliness) Dies if # of alive neighbor cells >= 5 (overcrowding) Lives if # of alive neighbor cells = 3 (procreation) Remains if # of alive neighbor cells = 4 Possible rules to program the Game of Life  3^9 = 19683

Game of Life3 Modified Game of Life New rules  Dies if # of alive neighbor cells = { a, b, c, … }  Lives if # of alive neighbor cells = { a’, b’, c’, … }  Remains if # of alive neighbor cells = { a’’, b’’, c’’, …}  Ex). Rules= { } => same as conway’s Way to find a new rule  To acquire the wanted interestingness, use G.A.

Game of Life4 Modified Game of Life – cont. Interestingness  Actively changing with each generation  The wanted number of live cells The fitness function of interestingness  Fitness1 : The change in the 3x3 window  Fitness2 : The difference between the current live cells and next generation’s live cells

Game of Life5 Genetic Algorithm Main routine while(generation<MAXGENS) { select(); crossover(); mutate(); evaluate(); elitist(); } Population size : 25 Generation number :50 Probability of crossover : 0.25 Probability of mutation : 0.01 Evaluation number : 100 generations

Game of Life6 Genetic Algorithm – cont. Variables  Rules[0] ~ [8] = { };  Rule has any possible choices of 3^9 Fitness  (1) The variation of live cells  Find a interesting variation : 22.5

Game of Life7 Genetic Algorithm – cont. Fitness  (2) The wanted number of live cells Difference =  |Init_num_of_live_cells – current_num_of_live_cells|  Fitness = factor1 x fitness1 + factor2 x fitness2

Game of Life8 Result ( example at 100 generations ) Log files during the simulation Rules Generation Best Average Standard [0] - [8]number value fitness deviation … … Solution from the G.A. Best member of 1-th run : { } Best fitness = for 100 generation

Game of Life9 Conclusion I made a method to find an interesting rule by using G.A. But, I can’t find an interesting examples because of the simulation time is too short to find a interesting result. To find a useful rule, I should extend the generation number in the G.A.