A binary search-based algorithm. When a session starts, a random even-sized genome is created, and you have four choices:
Reset: Reset the entire genome with a new initialisation.
Shuffle: Shuffle the genome's contents.
Split: Split the genome in half.
Finish: Finish the session.
If you choose to split, the genome is split, and you "select" the left half. The right half stays static. Your four choices then become:
Reset: Reset the half with a new initialisation.
Shuffle: Shuffle the half's contents.
Split: Split the half in half.
Finish: Finish working on this half and move to the next half.
This continues until you reach a top-level Finish or terminate the session. This lets one play around with the contents of a genome in a slightly more controllable fashion than the genetic algorithm.
A binary search-based algorithm. When a session starts, a random even-sized genome is created, and you have four choices:
If you choose to split, the genome is split, and you "select" the left half. The right half stays static. Your four choices then become:
This continues until you reach a top-level Finish or terminate the session. This lets one play around with the contents of a genome in a slightly more controllable fashion than the genetic algorithm.