八皇后问题，是一个古老而著名的问题，是回溯算法的典型案例。该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。计算机发明后，有多种方法可以解决此问题。-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.