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