Discussion Assignment

For your discussion post, explain your process for each of the following steps:

Consider the N$-$Queen Problem $($N number of queens should be placed in an N X N matrix such that no queen shares the same row, column, or diagonal$).$ Convert this problem to CSP by creating a variable set, domain set, and constraint set.

Construct a search space in the form of a graph from which the search strategy can be used from the above information. Feel free to upload any hand diagram or graph.

Finally identify the search strategy$/$algorithm that you would recommend to solve this problem and explain why you selected the strategy?