Introduction - If you have any usage issues, please Google them yourself
Eight queens problem is an old and well-known problems, is a typical case of backtracking algorithms. The problem is that the international chess players Spey Mark Searle made in 1848: eight queen placed on a 8X8 grid chess, it can not attack each other, that any two Queen can not in the same line, same column or on the same diagonal, and asked how many pendulum method. There are 76 kinds of programs Gauss considered. 1854 in Berlin chess magazine published by 40 different authors of different solutions, and later was used graph theory methods to the 92 kinds of results. After the invention of the computer, there are several ways to solve this problem.