Introduction - If you have any usage issues, please Google them yourself
The eight queens problem is an cient and famous, is a typical example of the backtracking algorithm. The problem is that the nineteenth century, the famous mathematician Gauss in 1850, eight Queen: placed on a 8X8 grid chess, so that it can not attack each other, that is, any two of the Queen s not in the same line, same column or diagonal, and asked how many kinds of pendulum method. Gaussian think there are 76 kinds of programs. Different authors in the Berlin Chess magazine published in 1854 in 40 different solutions, then 92 kinds of graph theory solution. The computer was invented, there are several ways to resolve this issue.