Cellular Automata with Anticipation: Examples and Presumable Applications

One of the most prospective new methodologies for modelling is the so‐called cellular automata (CA) approach. According to this paradigm, the models are built from simple elements connected into regular structures with local interaction between neighbours. The patterns of connections usually have a simple geometry (lattices). As one of the classical examples of CA we mention the game ‘Life’ by J. Conway.This paper presents two examples of CA with anticipation property. These examples include a modification of the game ‘Life’ and a cellular model of crowd movement.