八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-Eight the empress　problems are old but famous a thou problems, is the typical model example that returns to trace calculate way.The problem is a famous mathematician Gauss to put forward in 1850 in 19th century:Put eight empresses on the international Chin chess of 8 X8 spaces, make it not the ability is mutual to attackstone, namely arbitrarily two empresses can not be placed in the same line, the same row or the same oblique line up, ask how much kind put a method.The origin code helps to solve eight an empress problem