Description: Eight queens problem eight queens problem is an ancient and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss 1850: Under the 8X8 grid placed on the eight chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same slash and asked how many kinds of pendulum method. That there are 76 kinds of the Gaussian program. 1854 in Berlin of the chess magazine published in 40 different kinds of solutions, and later was used graph theory methods to solve the 92 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):
八皇后问题.txt
Download