Hi HN, when learning Golang (and topology), I ported a simple GOL in C (
https://github.com/Jeadie/GoL) into Go. I then added a bunch of features
- Playing on other fundamental polygons (
https://en.wikipedia.org/wiki/Fundamental_polygon#Examples_o...)
- Considering all possible update rules (of which, there are many).
Looking to get back to this project soon. Would love some feedback + ideas.
In an 3x3 neighborhood there are 2^9, not 2^5 states. So we should get 2^512 possible update rules, not 2^32.
I think something similar is described in https://conwaylife.com/wiki/Rule_integer.
I'm not sure that all of those rules are valid. We must have translational invariance. One way to do that is to only update the state of the central cell in each considered neighborhood. In that case 2^9 rules are enough. Are there other ways to define consistent rules for a CA?