Description: To solve the N queens problem, in fact, is to solve how to place the n queens, each in front of the Queen and the Queen is not all on the same line, same column, the same diagonal, where we can line a priority, that the Queen The line number increment sequentially, considering only the i-th place in Queens which i-th row of columns, so in the first place when i queens can be judged from the first one since, if one can be placed in the first position, Jump to the next line to place the next queen. If not, skip to the next column ... until the last one, the last one if it can not be placed, then the wrong placement method at this time, then back to a queen to be placed before the next column repositioning. Namely, is the essence of backtracking. After the success of the n-queens place that gets a feasible solution, then go back to a queen relocate to find the next feasible solution ... so, you are ready to find an n-queens problem for all feasible solutions.
To Search:
File list (Check if you may need any files):
1.10皇后问题
............\check.cpp
............\input.txt
............\main.cpp
............\output.txt
............\queen.cbp
............\queen.h
............\queen.layout
............\思想.txt
Download