Square tiling
The square grid, square tiling or square tessellation is one of the three possible proper Euclidean tilings of 2D space, in which four squares are placed at each vertex.
The square grid is the most familiar of all 2D tilings, with cell positions being easily and uniquely defined via Cartesian coordinates, and is the grid on which cellular automata are simulated most frequently.
Neighbourhoods on the square grid
Most of the cellular automata which are investigated are isotropic and use neighbourhoods of range 1. These constraints permit two neighbourhoods of interest; the 4-cell von Neumann neighbourhood, consisting of the four cells orthogonally adjacent to a central cell, and the 8-cell Moore neighbourhood, consisting of the four cells orthogonally adjacent to a central cell as well as the four cells diagonally adjacent to said center cell. (A third neighbourhood, referred to on this wiki as the "saltire" neighbourhood, which consists only of the four cells diagonally adjacent to the central cell, functionally duplicates the von Neumann neighbourhood and is disregarded in this section for the sake of brevity.)
.png) |
.png) |