Hey all, the schema theorem shows that in all probability a genetic algorithm will converge to a solution. much like the second law of thermodynamics for optimization. Although, it is taught with the genes being $$ \in (0,1, *), * \in (0,1) $$ is there a proof for non binary genes? example ASCII characters? and if you want to modify it yourself do you need t do proof the whole way through or just show that each element in your set of genes can be respresnted in binary? Any help appreciated.