Description: Eight queens problem is an cient and well-known problem, backtracking algorithm is a typical example. The problem is well-known nineteenth-century mathematician Gauss 1850: Under the 8X8 grid placed on the eight chess Queen, so that it can not attack each other, that any two Queens are not in the same line, same column or the same slash and asked how many kinds of pendulum method. Gaussian that 76 kinds of programs. 1854 in Berlin Chess magazine published by different authors on the 40 different solutions, and later was used graph theory methods to solve the 92 kinds of results. After the invention of the computer, there are several ways to solve this problem.
To Search:
File list (Check if you may need any files):
problem1.cpp
Download