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