Recursive solution to the NQueens problem.
Given a N by N Chessboard and the starting position of the first queen, determine if it is possible for N Queens to be placed on given chessboard such that no two Queens attack each other.
Program takes in parameters for the size of chessboard, row, and column of the starting queen. Program prints coordinates of the remaining queens to solution.txt. If no solution is possible, prints "No solution" to solution.txt.
Usage
java NQueens N col row
ex: java NQueens 4 1 2
Will return the solution for a 4 x 4 chessboard with the first queen placed at row 2 and column 1.