八皇后问题：八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-Eight Queen s question: Pat s problem is an ancient and well-known problem is a typical example of backtracking algorithms. The problem is that the nineteenth century, the famous mathematician Gauss in 1850: Under the 8x8 grid of the International Chess Queen placed eight, making it unable to attack each other, that can not be any two Queen s in the same line, the same row or the same slash on, asking how many species facing law.