The n$-$queens problem $($also known as the peaceful queens problem$)$ is the problem

of determining the number of ways that n queens can be placed on an n x n chess

board so that no queen threatens any other. Device a backtracking algorithm that

solves the n$-$queens problemn.