As noted in the previous post, the curren algorithm has specified values for when a rule mutates, is removed, is converged, or can be used to create new modules. These have no current guarantees and will be the first thing to be attacked if presented in a paper.
I need to work on formalising the algorithm and recognising key points where new ruyles can be created. Certainly, every single possible rule could be created, but that isn’t very prudent and will degrade down to nothing more than a search through all possible solutions. Ideally, the agent needs a heuristical search that only expands interesting rules and removes useless rules. When the agent has finished looking at the rules (cannot find any more interesting rules), then it can begin thinking about convergence upon an optimal distribution.