Difference between revisions of "Moore neighbourhood"
m (→Image gallery: typo fix) |
Apple Bottom (talk | contribs) (LinkWikipedia) |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
__NOTOC__{{Glossary}}[[Image:Mooreneighbourhood_1cell.png|framed|right|The Moore neighbourhood (in green) of a single cell]]The '''Moore neighbourhood''' is the set of all [[cell]]s that are orthogonally or diagonally-adjacent to the region of interest (the region of interest itself may or may not be considered part of the Moore neighbourhood, depending on context). For example, the Moore neighbourhood of a single cell consists of the eight cells immediately surrounding it. This neighbourhood is named after Edward F. Moore, one of the pioneers of [[cellular automata]] theory.<ref>{{Cite web|url=http://cell-auto.com/neighbourhood/moore/|title=The Moore neighbourhood|author=Tim Tyler|accessdate=June 13, 2009}}</ref> The Moore neighborhood is the neighbourhood of interest in [[Conway's Game of Life]] and all [[Life-like cellular automata]], though there are cellular automata that use other neighbourhoods such as the 4-cell [[von Neumann neighborhood]]. | __NOTOC__{{Glossary}}[[Image:Mooreneighbourhood_1cell.png|framed|right|The Moore neighbourhood (in green) of a single cell]]The '''Moore neighbourhood''' is the set of all [[cell]]s that are orthogonally or diagonally-adjacent to the region of interest (the region of interest itself may or may not be considered part of the Moore neighbourhood, depending on context). For example, the Moore neighbourhood of a single cell consists of the eight cells immediately surrounding it. This neighbourhood is named after Edward F. Moore, one of the pioneers of [[cellular automata]] theory.<ref>{{Cite web|url=http://cell-auto.com/neighbourhood/moore/|title=The Moore neighbourhood|author=Tim Tyler|accessdate=June 13, 2009}}</ref> The Moore neighborhood is the neighbourhood of interest in [[Conway's Game of Life]] and all [[Life-like cellular automata]], though there are cellular automata that use other neighbourhoods such as the 4-cell [[von Neumann neighborhood]]. | ||
The Moore neighbourhood naturally extends to cellular automata in higher dimensions, for example forming a 26-cell cubic neighborhood for a cellular automaton in three dimensions. The number of cells in the Moore neighbourhood of a single cell in an n-dimensional cellular automaton is 3<sup>n</sup>-1 (Sloane's [ | The Moore neighbourhood naturally extends to cellular automata in higher dimensions, for example forming a 26-cell cubic neighborhood for a cellular automaton in three dimensions. The number of cells in the Moore neighbourhood of a single cell in an n-dimensional cellular automaton is 3<sup>n</sup>-1 (Sloane's [https://oeis.org/A024023 A024023]). | ||
The Moore neighbourhood of a cell can be thought of as the points at a Chebyshev distance of 1 from that cell. | The Moore neighbourhood of a cell can be thought of as the points at a Chebyshev distance of 1 from that cell. | ||
| Line 22: | Line 22: | ||
==External links== | ==External links== | ||
{{LinkWikipedia|Moore_neighborhood}} | |||
*[http://mathworld.wolfram.com/MooreNeighborhood.html Moore neighborhood] at Wolfram Mathworld | *[http://mathworld.wolfram.com/MooreNeighborhood.html Moore neighborhood] at Wolfram Mathworld | ||
Revision as of 19:32, 12 May 2016
The Moore neighbourhood is the set of all cells that are orthogonally or diagonally-adjacent to the region of interest (the region of interest itself may or may not be considered part of the Moore neighbourhood, depending on context). For example, the Moore neighbourhood of a single cell consists of the eight cells immediately surrounding it. This neighbourhood is named after Edward F. Moore, one of the pioneers of cellular automata theory.[1] The Moore neighborhood is the neighbourhood of interest in Conway's Game of Life and all Life-like cellular automata, though there are cellular automata that use other neighbourhoods such as the 4-cell von Neumann neighborhood.
The Moore neighbourhood naturally extends to cellular automata in higher dimensions, for example forming a 26-cell cubic neighborhood for a cellular automaton in three dimensions. The number of cells in the Moore neighbourhood of a single cell in an n-dimensional cellular automaton is 3n-1 (Sloane's A024023).
The Moore neighbourhood of a cell can be thought of as the points at a Chebyshev distance of 1 from that cell.
Higher ranges
The Moore neighbourhood can also 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 standard Moore neighbourhood has range 1. The Moore neighbourhood of range 2 is the set of all cells that are orthogonally or diagonally-adjacent to the Moore neighbourhood itself. The Moore neighbourhood of range n can be defined recursively as the set of all cells that are orthogonally or diagonally-adjacent to the Moore neighbourhood of range n-1. The number of cells in the Moore neighbourhood of range n is given by (2n+1)2-1 (Sloane's A033996).
Image gallery
 The Moore neighbourhood (in green) of an eater 1 |
File:Mooreneighbourhood range2.png The Moore neighbourhood of range 2 of a single cell |
See also
References
- ↑ Tim Tyler. "The Moore neighbourhood". Retrieved on June 13, 2009.
External links
- Moore neighbourhood at Wikipedia
- Moore neighborhood at Wolfram Mathworld