muzik wrote: ↑September 4th, 2025, 4:43 pm
I assume B3/S23 on an 8-high cylinder or torus can be represented using a 256-state one-dimensional rule, assuming you can
somehow define how each of those 256 states interacts with each other correctly?
Probably. It should be fairly simple with a script - I think it would be easy to write a Golly Python script which:
- For every value 0-255 for the three cells in the neighbourhood, converts that into a set of cells in a 3x8 bounding box.
- Puts the cells onto the torus/cylinder, runs it for one generation, and then takes the eight cells in the middle 1x8 ‘strip’.
- Converts that back into a state from 0-255.
- Saves the data in a machine readable format (I imagine it would be a text document, each line containing four numbers representing the initial states and the resultant state. This would take up several hundred megabytes in size, since you need to store ~16.8 million transitions, and each can take up 8-16 bytes).
Then a separate script could be used to convert that into a ruletable, but would Golly even accept a ruletable that is hundreds of megabytes?