ConwayLife.com

I need a script where you type in the number of generations and it runs the current pattern that number of generations, so that we can stay AFK when running time is too big

After 2^17 generations:

x = 231, y = 231, rule = TopSand
95.41A$89.2A2BCDA2C35D2CADC2B2A$85.2ABDADADADCADAC31DCADACDADADADB2A$
82.ABDAD4CDCDC4DCAC27DCAC4DCDCD4CDADBA$79.ABD4CDCADCADADADAC3DB25DB3D
CADADADACDACD4CDBA$76.ABD2CD2CA2DACDA2CDCDCDCADACAC21DCACADACDCDCD2CA
DCA2DA2CD2CDBA$74 ...

Rule:

@RULE TopSand

@TABLE

n_states:10
neighborhood:vonNeumann
symmetries:permute

#List of "Topplers"
#State 9 is infinite source
var T1={5,6,7,8,9}
var T2=T1
var T3=T2
var T4=T3

#List of "non-topplers"
var N1={0,1,2,3,4}
var N2=N1
var N3=N2
var N4=N3

#Non-topplers

0,T1,N1,N2,N3,1
0,T1,T2,N1 ...

Also, something that could be handy: how about a script that converts an applicable ruletable into outer-totalistic 3-state notation? There's quite a few such rules.


This python script names an outer-totalistic rule. Just set the current rule in golly to the rule you're inspecting, run the ...

Currently in the process of developing a notation for isotropic non-totalistic 3-state rules:

https://media.discordapp.net/attachments/370571046971244545/668594545600102420/image0.png

I've also noticed that the BSFKL rulespace also seems to be a subset of the 3-state outer-totalistic rulespace ...

Using a python script as the transition function

Currently we have to compile the transition funcrtion into a ruletree which gets very slow, and totally impractical, even with as few as 7 states.

name = "BA02050810131621243235404351627008_BB010407121520232631344250536180_TA010407121520232631344250536180_TB02050810131621243235404351627008_SA02050810131621243235404351627008_SB010407121520232631344250536180"

n_states = 3
n_neighbors = 8

transitions = sorted(name.split("_"))

BA = transitions ...

name = "BA010407101316_BB0205081114_TA0205081114_TB010407101316_SA010407101316_SB0205081114"
n_states = 3
n_neighbors = 8

transitions = sorted(name.split("_"))

BA = transitions[0][2:]
BB = transitions[1][2:]
SA = transitions[2][2:]
SB = transitions[3][2:]
TA = transitions[4][2:]
TB = transitions ...

Nice! I always thought we needed to explore more 3-state rules

I'm gonna try and make a python script that generates ruletrees for this kind of automaton

I think most transitions in are unnecessary since there is no way the outer sum of the cell is greater than 16 (8 state-2 cells)

Edit ...

We are used to the fixed points of deterministic automata: Patterns that reproduce themselves exactly in a fixed number of generations. If we transport a Life pattern to a probabilistic automaton it will likely not work for long.

But what if a probabilistic mechanism opens up pathways for ...

In Stephen Wolfram's A New Kind of Science, it is explained that most automata appear to be classifiable in four broad categories:

- Class 1 automata settle down into a homogenous state independently of the initial conditions

- Class 2 automata rapidly settle down into predictable patterns, either ...