Description: 8 Queen s problem is an old and well-known problem is a typical example of backtracking algorithms. The problem is that the nineteenth century, the famous mathematician Gauss in 1850: Under the 8X8 grid on the display of the chess Queen eight, making it unable to attack each other, that is, any two can not be Queen s in the same line, the same row or the same slash on how many kinds of facing law.
Gaussian 76 program that. In Berlin in 1854 different chess magazines published author of 40 different types of solution, then using graph theory was the method to solve the 92 kinds of results.
8 Queen s problem for the realization, if the combination of dynamic graphics presentation, you can make the image description algorithm, more vivid, so that teaching can have a very positive impact.
To Search:
File list (Check if you may need any files):
八皇后问题
..........\Debug
..........\.....\vc60.idb
..........\.....\vc60.pdb
..........\.....\八皇后问题.exe
..........\.....\八皇后问题.ilk
..........\.....\八皇后问题.obj
..........\.....\八皇后问题.pch
..........\.....\八皇后问题.pdb
..........\.....\八皇后问题1.exe
..........\.....\八皇后问题1.ilk
..........\.....\八皇后问题1.obj
..........\.....\八皇后问题1.pch
..........\.....\八皇后问题1.pdb
..........\八皇后问题.cpp
..........\八皇后问题.cpp.bak
..........\八皇后问题.dsp
..........\八皇后问题.dsw
..........\八皇后问题.ncb
..........\八皇后问题.opt
..........\八皇后问题.plg
..........\八皇后问题1.cpp
..........\八皇后问题1.dsp
..........\八皇后问题1.dsw
..........\八皇后问题1.ncb
..........\八皇后问题1.opt
..........\八皇后问题1.plg
Download