We previously discussed the problem of placing k queens in an n x n chessboard. In this problem, you will be considering the problem of placing k knights in a n x n chessboard such that no two knights can attack (it moves to a square that is two squares away horizontally and one square vertically, or two squares vertically and one square horizontally) each other. k is given and k <= n². Formulate this problem as a Constraint Satisfaction Problem.

• What are the variables?
• What is the set of possible values for each variable?
• How are the set of variables constrained