This is the problem of placing N queens on an NxN chessboard so that no queens are attacking each other. The most common form of this problem is the 8 Queen Problem.
The aim of this solution is to allow the user to decide on the starting position of the first queen. The program will then attempt to find all of the possible solutions.