CS206 Project 1
Assign 2018-11-07 Due 2018-11-26
N queen problem
Problem description: The N Queen is the problem of placing N chess queens on an
N×N chessboard so that no two queens attack each other. The queen on chessboard
can attack any square in any of the eight directions (left, right, up, down, and the four
diagonals).
For example, following is a solution for the 4 Queen problem.
0 0 1 0
1 0 0 0
0 0 0 1
0 1 0 0
Solution algorithm :
1. Initialize a blank chessboard as N*N matrix. The matrix must be allocated
dynamically .
2. Write a function to solve the N queen problem.
3. Write a function to judge whether all N queens are safe on the chessboard. If all N
queens are safe, then return true or 1. Otherwise, return false or 0;
4. Print the solutions.
Submit:
1. Files to submit: CS206_studentID_name(CN).h and
CS206_studentID_name(CN).cpp
2. The following class definition is included in your header file. You should
complete the methods of the class in the .cpp file.
1. class NQueens{
2. private:
3. int **chessboard;
4. int N;
5. public:
6. NQueens(int n);
7. int check_chessboard(int **board,const int n);