Simple C Program to solve n queens problem

This can be solved using using backtracking algorithm . It is almost same like sudoku solving . Every row in NxN matrix should be filled with queen and it should satisfy the following condition .One Queen should not interfere another queen in the matrix . 

Code: (in C)

	//initially i is 0
	void n_queens(int** array, int i,int n)
	{
	if(i=>n)
	{
	print_array(array);
	return;
	}
	for(int j=0;j<n;j++)
	{
	if(checkColumn(array,j) && checkDiagaonal(array,i,j))
	{
	array[i][j]=1;
	n_queens(array,i+1,n);
	array[i][j]=0;
	}
	}
	}

view raw gistfile1.c hosted with ❤ by GitHub

In the above code checkColumn checks the column to find whether the column already has a queen or not and checkDiagonal is used to check the diagonal elements and it is not implemented here.

Please let me know if u have any questions ..