八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。计算机发明后，有多种方法可以解决此问题。

-Eight queens problem is an ancient 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.