In the first iteration of the genetic algorithm, given the fitness value or the number of non attacking pairs of queens for each board state in the initial population, choose parents according to their fitness score and fill them in the right column, order them by fitness value where the best is on top. What are X,Y, and Z then? A. X=32748552,Y=32752124,Z=24752411 B. X=24752411,Y=32752124,Z=32748552 C. X=32752124,Y=32748552,Z=24752411 D. X=32748552,Y=24752411,Z=32752124 In genetic algorithm, after crossover, in terms of fitness score, what statement about the parents and children is true? A. The children are always better than parents. B. The parents are always better than children. C. The children will not be worse than parents. D. The children can be worse than parents. We want to find the maximum point in the following graph. We can have problems getting stuck in local maxima or on plateaus where there is not enough local information to determine which way to go to improve the answer, or determine if we have reached the maximum. Which one of the following methods can overcome those problem in order to find the global maximum? hods which can be used to 1 find the global maximum IINIMAX with pruning IINIMAX search readth first search 'andom restart A. Minimax with alpha-beta pruning B. Hill-climbing with random restart C. Breadth-first search D. Minimax search We want to find the maximum point in the following graph. We can have problems getting stuck in local maxima or on plateaus where there is not enough local information to determine which way to go to improve the answer, or determine if we have reached the maximum. Which one of the following methods cannot overcome those problem in order to find the global maximum? ods which can be used to find the global maximum netic algorithms form cost search wlated anrealing ne of the above A. Genetic algorithm B. Uniform-cost search C. Simulated annealing D. None of the above What is the number of non-attacking pairs of queens in the following 4-queens problem? The line segments that connect two queens indicate a pair of attacking queens. A. 6 B. 0 C. 5 D. 1 In genetic algorithm, given two parents in the left column, cross over the parents to produce two children using a four-four split. What will be the two chilren in the right column? A. 32742411,24758552 B. 85523274,24112475 C. 24113274,85522475 D. 32748552,24752411 Considering multiple starting points for the hill climbing problem shown below, for each of these particles, find out their value assuming the algorithm has a step size of one and that it stops when no positive gradient is found. What is the missing value for Particle 1? What is the final value of each particle? (assume step size =1 ) Particle 1 starts at x=1 Particle 2 starts at x=8 Particle 3 starts at x=9 Particle 4 starts at x=14 Particle 5 starts at x=20 A. 2 B. 1 Considering the hill climbing problem shown below, for each of these particles, find out their value assuming the algorithm has a step size of two and that it stops when no positive gradient is found. What value would Particles 3 return? What is the final value of each partide? partide starts at x=7 particle (2) starts at x=8 partide starts at x=10 A. 4 B. 5 C. 10 D. Don't know Given the following 5 queens board with the rows numbered, if 5 queens are placed in 5 columns in rows numbered from left to right as 32541 , what is the number of pairs of non-attacking queens? A. 4 B. 5 C. 1 D. 6 Given the board for 8-Queens as follows, give a string that represents the position of each piece on this board. What are the missing numbers for the 3 rd, 5th, and 7 th pieces? 8-Queens Representation For this board, give us the string that represents the position of each piece. 16_5_43 A. 7,2,1 B. 2, 7, 8 C. 1,6,7 D. 8,7,2
