I am trying to write a genetic algorithm for a program. Most examples for genetic algorithms use something like this as the input:
and mutate/crossover until they get
or similar. This requires however that you start with something of length N, but my search space doesn't have a fixed length. How should I alter the mutation/crossover steps to allow for changes in unit size?