Come up with concretely specified examples of the eight queens problem (i.e., sp
ID: 3564026 • Letter: C
Question
Come up with concretely specified examples of the eight queens problem (i.e., specific boards and descriptions of how the algorithms would operate on those boards) which satisfy some criteria. For the first problem I want you to come up with an example of a board in which beam search with two starting points is will not give the same result as hill climbing with a single restart. For the second problem, I want you to come up with a schedule for use in our simulated annealing algorithm that could be used to solve the eight queens problem. For your schedule I want you to give an example of a situation where rather than going in the direction of a solution the algorithm goes from a better state to a less fit one.
Explanation / Answer
The eight queens puzzle is the problem of placing eight chessqueens on an 8