N Queen Problem

We have discussed Knight’s tour and Rat in a Maze problems in Set 1 and Set 2 respectively. Let us discuss N Queen as another example problem that can be solved using backtracking. 

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. For example, following is a solution for 4 Queen problem.

N Queen Problem : https://www.geeksforgeeks.org/n-queen-problem-backtracking-3/