Question: Consider the problem of placing k knights on an nn chessboard such that no two knights are attacking each other, where k is given and
Consider the problem of placing k knights on an n×n chessboard such that no two knights are attacking each other, where k is given and k ≤ n2.
a. Choose a CSP formulation. In your formulation, what are the variables?
b. What are the possible values of each variable?
c. What sets of variables are constrained, and how?
d. Now consider the problem of putting as many knights as possible on the board without any attacks. Explain how to solve this with local search by defining appropriate ACTIONS and RESULT functions and a sensible objective function.
Step by Step Solution
3.44 Rating (160 Votes )
There are 3 Steps involved in it
a Solution A There is a variable corresponding to each of the n 2 positions on the board Solution B ... View full answer
Get step-by-step solutions from verified subject matter experts
