Can anyone solve this question with using Von Neumann Neighborhood cellular automata algorithm and with no boundary (infi
Posted: Sat May 14, 2022 4:25 pm
Can anyone solve this question with using Von Neumann
Neighborhood cellular automata algorithm and with no boundary
(infinite space) conditions of this algorithm please?
7. The following is a two-dimensional totalistic CA model with Von Neumann neighborhood and with no boundary (infinite space) conditions. White means 0, while blue means 1. Each cell switches to round(5/5) in every time step, where S is the local sum of the states within its neighborhood. Complete the time evolution of this CA for t = 1. Either color the cells or put 1 in them. (15 points) t = 0 t = 1 H H
Neighborhood cellular automata algorithm and with no boundary
(infinite space) conditions of this algorithm please?
7. The following is a two-dimensional totalistic CA model with Von Neumann neighborhood and with no boundary (infinite space) conditions. White means 0, while blue means 1. Each cell switches to round(5/5) in every time step, where S is the local sum of the states within its neighborhood. Complete the time evolution of this CA for t = 1. Either color the cells or put 1 in them. (15 points) t = 0 t = 1 H H