No of ways to arrange n-Queens in n*n chessboard

Question

//PLease help me solve this problem
//Complete this function to check placing queen at board[row][col] is safe or not by //checking current row, left diagonal & right diagonal.

totalWays=0;
int isSafe(int board[N][N], int row, int col)
{
int i , j;
for(i=0; i< row-1; i++)
{
if(board[i][col] ==1)

}

// Complete this function to solve the problem and save the answers in sol array as required and put number of solutions in nos variable passed as last argument.

int solveNQUtil(int board[N][N], int col, int sol[][N], int *nos)
{

}

Answer 1

Look up the equation online. Its algebra, the only one thats difficult is the diagnal checks. I also have a queens problem solver in Python, so you can get the equation from there