Problem
Assume you use a system of Genetic Algorithms to solve a 2-dimensional optimization problem, whose initial solutions consist of (0,2), (2,2), (2,0), and (1,1), population size 4, and your system employs whole arithmetical recombination (also called arithmetical crossover in the lecture) as its only modification operator. What solutions will be searched, and which solutions will not be searched by the described system?