Question: Suppose that the Boolean satisfiability problem is solved using genetic algorithms, in which the values of the variables are encoded as a string and the
Suppose that the Boolean satisfiability problem is solved using genetic algorithms, in which the values of the variables are encoded as a string and the fitness is equal to the Boolean value of the resulting expression. Discuss why a straightforward use of genetic algorithms is unlikely to work very well.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
