这是一个古老的具有代表性的问题，用计算机求解时的算法也很多，这里仅介绍一种。

采用一维数组来进行处理。数组的下标i表示棋盘上的第i列，a[i]的值表示皇后在第i列所放的位置。如：a[1]=5，表示在棋盘的第一例的第五行放一个皇后。

程序中首先假定a[1]=1，表示第一个皇后放在棋盘的第一列的第一行的位置上，然后试探第二列中皇后可能的位置，找到合适的位置后，再处理后续的各列，这样通过各列的反复试探，可以最终找出皇后的全部摆放方法。

程序采用回溯法，算法的细节参看程序。-This is representative of an old problem, the computer algorithm solving a lot only introduce a The one-dimensional array to be processed. The array subscr ipt i represents the i th column on the board, a [i] of the value indicates the location of release of the Queen in the i th column. : A [1] = 5, put a queen in the fifth line of the first example of the checkerboard. The program first assumed that a [1] = 1, the first Queen on the board of the first row of the first column position, and then testing the Queen' s position in the second column, find a suitable location, and then processing subsequent columns, so columns repeatedly test could eventually find the queen placed method. The program uses a backtracking algorithm detail.