Difference between revisions of "Hexagonal neighbourhood"

The hexagonal neighbourhood is the set of all cells that are adjacent to the region of interest in a grid tiled with hexagons (the region of interest itself may or may not be considered part of the hexagonal neighbourhood, depending on context). Currently, these rules are partially supported by both Golly and apgsearch. These rules are typically notated using the H suffix (e.g. B2/S34H).

Software support

LifeViewer supports outer-totalistic hexagonal rules and uses a hexagonal grid. LifeViewer also supports isotropic non-totalistic hexagonal rulestrings from build 313,[1] and supports hexagonal Higher-range outer-totalistic (including Larger than Life) rules.

Golly simulates hex rules using a variant of the Moore neighbourhood which ignores the bottom-left and top-right cells in the neighbourhood and includes special cell icons shaped like slanted hexagons which resemble a hexagonal grid when placed together.[2] They both also have the ability to support Generations variants of hexagonal rules. In addition, hexagonal Higher-range outer-totalistic (including Larger than Life) rules are supported from v4.0 onwards.

apgsearch and Catagolue also support the hexagonal neighbourhood. They support hexagonal Generations rules, but they also support isotropic non-totalistic rules (see Generalizations below). As of version 4.71, all possible symmetries are available for searching except for C3_3 and D6_3 (see Symmetries below).[3][4]

Generalizations

Main article: Isotropic non-totalistic Life-like cellular automaton

Like in the Moore neighborhood, isotropic cellular automata using the hexagonal neighbourhood can be defined using a notation devised by Paul Callahan which represent the relative permutations of the cells using the letters o, m, and p. These stand for ortho, meta, and para respectively and were chosen in analogy to arene substitution patterns in aromatic chemistry.[5][6]

As mentioned above, Golly also has the ability to support outer-totalistic Generations rules using the hexagonal grid. Larger than Life and BSFKL rules are also possible, but they are not currently supported by apgsearch as of November 2020. However, LifeViewer and Golly support Larger than Life rules in this neighbourhood.

A subset of the hexagonal range 1 neighbourhood known as the tripod neighbourhood has also been investigated.[7]

Higher ranges

The hexagonal neighbourhood can be defined with a higher range; that is, so that it captures cells that are further than one cell away from the region of interest. The higher range hexagonal neighbourhood take the shape of a symmetric honeycomb[8] and the number of cells in a range n hexagonal neighbourhood has the formula 3n(n+1).

Symmetries

Main article: Symmetry

The hexagonal neighbourhood relies on a different grid than the Moore and von Neumann neighborhoods and thus features a different set of inherent symmetries when dealing with isotropic rules:

• Asymmetric (C1, 8x32, 4x64, 2x128, 1x256)
• C2_1
• C2_4
• C3_1
• C3_3 (unsupported by apgsearch)
• C6
• D2_xo
• D2_x
• D4_x1
• D4_x4
• D6_1
• D6_1o
• D6_3 (unsupported by apgsearch)
• D12

All of these are currently supported by both lifelib and apgsearch, except for D6_3 and C3_3. Catagolue's /hashsoup endpoint currently does not understand any of the C3, C6, D6 or D12 symmetries, but the samples soups can nonetheless be correctly retrieved using lifelib's pattern.download_samples() function.

Hexagonal rules can also support gutter symmetry,[9] however apgsearch does not support searching with these.

Image Gallery

 The range 2 hexagonal neighbourhood of a single cell The range 3 hexagonal neighbourhood of a single cell