This document discusses cellular automata modeling and provides examples of its applications. It includes examples of cell states and configurations, such as grids representing black and white cells. It also discusses neighbor relations and how cells can be influenced by and move between neighboring cells. Rules are presented for how cellular automata systems change and evolve over time.

1. CONTENT
• cellular automata
modelling
• tech examples

2. 0 0 0 0 0
0 0 0 0 0
0 0 1 0 0
0 0 0 0 0
0 0 0 0 0
SPACE

3. THIS A SPACE TOO

4. OR MAYBE

5. 1 = black
0 = white
1 1 1 1 1
1 1 1 1 1
1 1 0 1 1
1 0 0 0 1
1 0 0 0 0
STATE

6. 0 0 0 0 0
0 0 0 0 0
0 0 9 0 0
0 0 0 0 0
0 0 0 0 0
STATE ALSO …

7. OR …
{
state: neutral,
attack: 900,
defence: 1200,
…
}

8. NEIGHBOUR

9. RELATIONS: INFLUENCE
0 0 0 0 0
0 0 1 0 0
0 1 0 1 0
0 0 1 0 0
0 0 0 0 0
0 0 0 0 0
0 0 1 0 0
0 1 1 1 0
0 0 1 0 0
0 0 0 0 0

10. RELATIONS: MOVE
0 0 0 0 0
0 0 1 0 0
0 0 1 0 0
0 0 1 0 0
0 0 0 0 0
0 0 0 0 0
0 0 1 0 0
0 1 0 0 0
0 0 1 0 0
0 0 0 0 0

11. HOW TO

12. MUST WATCH
• cellular automata modelling : https://
www.youtube.com/watch?v=EyrwOf239M4
• dungeon generator unity3d : http://unity3d.com/
learn/tutorials/projects/procedural-cave-
generation-tutorial