
programs, that crossover is quite effective, if not always fast, for finding
good solutions to highly complex problems.
How many schemata are possible for a string length of l and an alpha-
bet of a
o
characters? In the previous example, for a
o
= 2, there can be a 0,
1, or # at each string position, resulting in a total possible number of
schemata of 3 × 3 × 3 × 3 = 81. Generalizing, there are (a
o
+ 1)
l
total
possible schemata for any representation of length l.
Another informative measure is the total possible number of unique
schemata in a population. Consider a specific string of length 8, taken
from the example problem: 01110111. Since each string position ...