C programming HW, N Queens problem

Given an N ?- N chess board with N queens on it, and the initial placement of a subset of those queens, find a placement for the rest of the queens (if it is possible) such that none of the queens on the board may take any other queen in a single move. For this project, you must write a program to solve the N-Queens problem. note: The program should prompt the user to input board dimension. Also, when we specify the placement of some of queens, they remain static for the rest of the solution. Must read the problem doc. file attached. Program should meet specific requirements. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. The source code should be in .c file format. Compilers to be used visual studio and/or gcc. Read attached Doc. file for details. ## Platform Windows XP, Win 2000, Unix.