**N Queen’s problem:** The n-queens problem consists of placing n queens on an n x n checker board in such a way that they do not threaten each other, according to the rules of the game of chess. Every queen on a checker square can reach the other squares that are located on the same horizontal, vertical, and diagonal line.

So there can be at most one queen at each horizontal line, at most one queen at each vertical line, and at most one queen at each of the 4n-2 diagonal lines. Furthermore, since we want to place as many queens as possible, namely exactly n queens, there must be exactly one queen at each horizontal line and at each vertical line.

The concept behind backtracking algorithm which is used to solve this problem is to successively place the queens in columns. When it is impossible to place a queen in a column (it is on the same diagonal, row, or column as another token), the algorithm backtracks and adjusts a preceding queen

**Complexity:** The power of the set of all possible solutions of the n queen‟s problem is n! and the bounding function takes a linear amount of time to calculate, therefore the running time of the n queens problem is O (n!).

` ````
```#include
#include
#include
int a[30],count=0;
int place(int pos)
{
int i;
for(i=1;i