八皇后问题：设8皇后问题的解为 (x1, x2, x3, …,x8), 约束条件为：在8x8的棋盘上，其中任意两个xi 和xj不能位于棋盘的同行、同列及同对角线。要求用一位数组进行存储，输出所有可能的排列。-Eight queens problem: Let eight queens problem solution is (x1, x2, x3, ..., x8), constraints are: 8x8 chessboard on which any two xi and xj can not be in the board of peers, and the same for the same column moldings. Requirements for storage with an array of output for all possible permutations.