To build suitable test functions that are truly difficult for EA a set
of these functions must be placed together in a single
chromosome; Goldberg proposed gathering ten fully deceptive 3-
bit functions, creating a problem with a huge number of local
optima. The problem is really hard when the bits of each function
are uniformly and maximally distributed in the chromosome. Thus
each bit of one function is located in the position i, i+10 and i+20.
These functions are really hard because the problem is not
separable and the formation of BB is not possible with a naïve
strategy.