I believe GoL is easily solvable by ML if the task was to find parameters of the update rules with the constraint that the rules are simple. For example, if we

I believe GoL is easily solvable by ML if the task was to find parameters of the update rules with the constraint that the rules are simple. For example, if we were presented a highly sophisticated repetitive pattern and were tasked to figure the underlying tesselation rules that generate it, we would enumerate rulesets that we know already and then try to find parameters for them with the assumption that those parameters are simple. Again, my point is that to solve GoL, the ML model needs to be given two things: 1) a few rulesets to choose from; 2) an upper limit on complexity of ruleset parameters.