Description: The problem put forward: 8 queens is an old and interesting game, is by the gaussian in 1850 of the first proposed.
The requirements in the chess board placed on eight queen, to make it can t attack each other, that is not in any two queen
The board with a line, the same column and the same diagonals. Asked how many kind of put method?
The basic idea is: first the queens on (0, 0) position, then put 1 queens on (1, j) position,
Make it meet the requirements. Then put 2 queen, by analogy. The queen met one such as whatever she put in the bank of any
Positions do not satisfy the requirements, the former a queen improper placement, must replace former a queen, such as 8 queens are at will
For place, this is a successful placed a law.
To Search:
File list (Check if you may need any files):
八皇后游戏
..........\3_13.cpp
..........\3_13.dsp
..........\3_13.dsw
..........\3_13.ncb
..........\3_13.opt
..........\3_13.plg
..........\Debug
..........\.....\3_13.exe
..........\.....\3_13.obj
..........\.....\3_13.pdb
..........\.....\vc60.pdb
..........\八皇后游戏说明.txt