Description: Eight queens problem is an old and well-known problem, is backtracking algorithms classic problem. The problem is that the nineteenth century, the famous mathematician Gauss in 1850: On the chess board 8* 8, placed eight queens, requires no queen can eat any other a queen, that any two Queen can not be in the same row or the same column on the same diagonal, solving many kinds of pendulum method.
There are 76 kinds of programs Gaussian think. 1854 in Berlin, different chess magazine published 40 kinds of different solutions, and later was obtained using graph theory conclusion, there are 92 in the pendulum method.
This experiment extends the N queens problem, namely the number entered by the user Queens.
To Search:
File list (Check if you may need any files):
N皇后问题.cpp
Download