Problem
In this question, we will analyze the game chess. Consider the problem of placing m bishops on an n ×n chessboard, where m is known and m ≤n2, such that no two bishops are attacking each other.
1. Formulate this problem as a constraint satisfaction problem (CSP). What are the variables in your formulation?
2. What are the values of each variable in your CSP?
3. What sets of variables in your CSP are constrained? How are they constrained?
4. Consider the problem of placing as many bishops as possible on the board without any attacks. Using your knowledge of search algorithms, formulate and describe a reasonable successor function.
5. Using the same scenario described in (d), formulate and describe a reasonable heuristic function.