Game Development Reference
In-Depth Information
FIG 5.21 A maze exploring genetic algorithms over 10 generations.
the states of its closest eight neighbors. Each update, the status of the cell is
calculated using four rules. These are:
1.
If the cell is alive but has less than two alive neighbors, it dies
2.
If the cell is alive and has two or three alive neighbors, it remains alive
3.
If the cell is alive but has more than three alive neighbors, it dies
4.
If the cell is dead but has exactly three alive neighbors, it becomes alive
In the same way that the simple flocking rules create complex behaviors, so
too does the Game of Life . An example run of the Game of Life is shown in
Search Nedrilad ::




Custom Search