|
1. Description
This interesting example was developed to show the power of cellular automata in solving "real-world" problems.
The idea of this example is to have one cell start out being a mouse (M); and the cellular automata space is consider to be a maze that consists of walls (X). The mouse has to navigate through the maze until it finds food (F). Once the mouse is able to find food, the cell that was the mouse (M),becomes a (V) to signal victory as the program stops.
Note that in the example there is only one mouse and one food. Users can more mice and food in the cellular space, and observe the behavior of these mice.
The tutorial of this model is available here.
2. Download
next example
|
