|
|
Eight Queens Puzzle One of the 12 distinct solutions The eight queens puzzle is the problem of putting eight chess queens on an 8×8 chessboard such that none of them is able to capture any other using the standard chess queen's moves. The colour of the queens is meaningless in this puzzle, and any queen is assumed to be able to attack any other. Thus, a solution requires that no two queens share the same row, column, or diagonal. This is an example of the more general n queens puzzle of placing n queens on an n×n chessboard. History Over the years, many mathematicians, including Gauss have worked on this puzzle, posed as early as 1850 by Franz Nauck. In 1874, S. Gunther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach. This puzzle appeared in the popular early 1990s computer game, The 7th Guest. Constructing a solution There is a simple algorithm yielding a solution to the n queens puzzle for n = 1 or any n ≥ 4: - Divide n by 12. Remember the remainder (it's 8 for the eight queens puzzle).
- Write a list of the even numbers from 2 to n in order.
- If the remainder is 3 or 9, move 2 to the end of the list.
- Write the odd numbers from 1 to n in order, but, if the remainder is 8, switch pairs (i.e. 3, 1, 7, 5, 11, 9, …).
- If the remainder is 2, switch the places of 1 and 3, then move 5 to the end of the list.
- If the remainder is 3 or 9, move 1 and 3 to the end of the list.
- Place the first-row queen in the column of the first number in the list, place the second-row queen in the column of the second number in the list, etc.
For n = 8 this results in the solution shown above. A few more examples follow. - 14 queens (remainder 2): 2, 4, 6, 8, 10, 12, 14, 3, 1, 7, 9, 11, 13, 5.
- 15 queens (remainder 3): 4, 6, 8, 10, 12, 14, 2, 5, 7, 9, 11, 13, 15, 1, 3.
- 20 queens (remainder 8): 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 3, 1, 7, 5, 11, 9, 15, 13, 19, 17.
Counting all solutions The eight queens puzzle has 92 distinct solutions. If solutions that differ only by symmetry operations (rotations and reflections) of the board are counted as one, the puzzle has 12 unique solutions. The following table gives the number of solutions for n queens, both unique and distinct . | n: | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | | unique: | 1 | 0 | 0 | 1 | 2 | 1 | 6 | 12 | 46 | 92 | 341 | 1,787 | 9,233 | 45,752 | 285,053 | | distinct: | 1 | 0 | 0 | 2 | 10 | 4 | 40 | 92 | 352 | 724 | 2,680 | 14,200 | 73,712 | 365,596 | 2,279,184 | Note that the 6 queens puzzle has, paradoxically, fewer solutions than the 5 queens puzzle! Related problems - Using pieces other than queens
-
- For example, on an 8×8 board one can place 32 independent knights, or 14 bishops, or 16 kings. Fairy chess pieces have also been substituted for queens.
- Nonstandard boards
-
- Polya studied the n queens problem on a toroidal ("donut-shaped") board. Other shapes, including three-dimensional boards, have also been studied.
- Domination
-
- Given an n×n board, find the domination number, which is the minimum number of queens (or other pieces) needed to attack or occupy every square. For the 8×8 board, the queen's domination number is 5.
- Nine queens problem
- Place nine queens and one pawn on an 8×8 board in such a way that queens don't attack each other. Further generalization of the problem (solution is currently unknown): given an n×n chess board and m > n queens, find the minimum number of pawns, so that the m queens and the pawns can be set up on the board in such a way that no two queens attack each other.
- Magic square
-
- In 1992, Demirrs, Rafraf, and Tanik published a method for converting some magic squares into n queens solutions, and vice versa.
- Latin square
-
- Chess problem
-
- Chess-type problem
-
The eight queens puzzle as an exercise in algorithm design Finding all solutions to the eight queens puzzle is a good example of a simple but non-trivial problem. For this reason, it is often used as an example problem for various programming techniques, including non-traditional approaches such as constraint programming, logic programming or genetic algorithms. Most often, it is used as an example of a problem which can be solved with a recursive algorithm, by phrasing the n queens problem inductively in terms of adding a single queen to any solution to the n−1 queens problem. The induction bottoms out with the solution to the 0 queens problem, which is an empty chessboard. This technique is much more efficient than the nave brute-force search algorithm, which considers all 648 = 248 = 281,474,976,710,656 possible blind placements of eight queens, and then filters these to remove all placements that place two queens either on the same square (leaving only 64!/56! = 178,462,987,637,760 possible placements) or in mutually attacking positions. This very poor algorithm will, amongst other things, produce the same results over and over again in all the different permutations of the assignments of the eight queens, as well as repeating the same computations over and over again for the different sub-sets of each solution. A slightly better brute-force algorithm places a single queen on each row, leading to only 88 = 224 = 16,777,216 blind placements. It is possible to do much better than this. For example, the breadth-first search program below examines only 15,720 possible queen placements by constructing the search tree by considering one row of the board at a time, eliminating most nonsolution board positions at a very early stage in their construction. Constraint programming is even more effective on this problem. An 'iterative repair' algorithm typically starts with all queens on the board, for example with one queen per column. It then counts the number of conflicts (attacks), and uses an heuristic to determine how to improve the placement of the queens. The 'minimum-conflicts' heuristic—moving the piece with the largest number of conflicts to the square in the same column where the number of conflicts is smallest—is particularly effective: it solves the 1,000,000 queen problem in less than 50 steps on average. This assumes that the initial configuration is 'reasonably good'—if a million queens all start in the same row, it will obviously take at least 999,999 steps to fix it. A 'reasonably good' starting point can for instance be found by putting each queen in its column such that it conflicts with the smallest number of queens already on the board. Note that 'iterative repair', unlike the 'breadth-first' search outlined above, does not guarantee a solution: like all hillclimbing procedures, it may get stuck on a local optimum (in which case the algorithm may be restarted with a different initial configuration). On the other hand, it can solve problem sizes that are several orders of magnitude beyond the scope of a breadth-first search. Implementations Example program in C This program written in C writes all possible solutions to an external file. The algorithm is recursive. It proceeds by rows and searches for a free position. If the first row has a free position, it places a queen and then it calls itself again and starts searching in the next row. If the next row has no free position it backtracks to the previous row, removes the queen and searches for another free position in that row. Otherwise it places another queen and then it calls itself again and starts searching in the next row. If the program has placed a queen in the last row, it outputs the solution and then goes back. Every time it goes back to a previous row it cleans the current position and searches for other free positions in that row in order to find the next solutions. - include
- define MAXN 8
int queen(MAXN-1)+1; int col(MAXN-1)+1; int dp2*(MAXN-1)+1; int dn2*(MAXN-1)+1; int N; int NSol; FILE *fp; void place(int r); void put(int r, int c); void clean(int r, int c); int isfree(int r, int c); void solution(void); void initialize(void); main() { printf("Solutions in file NQ.txt\n"); fp=fopen("NQ.txt", "w"); fprintf(fp,"\nSolution of the N-queen problem with recursion\n"); fprintf(fp,"\n-----------------------------------------------\n"); for(N=2;N<=MAXN;N++) { fprintf(fp,"\nN = %d\n",N); initialize(); place(N-1); fprintf(fp,"\n\n%d possible solutions when N = %d\n",NSol,N); fprintf(fp,"\n-----------------------------------------------\n"); } fclose(fp); scanf("%d", &N); return 0; } void place(int r) { int c; for(c=0;c } void put(int r, int c) { queenr=c; colc=-1; dpr+c=-1; dnr-c+N-1=-1; } void clean(int r, int c) { colc=0; dpr+c=0; dnr-c+N-1=0; } int isfree(int r, int c) { return((!colc) && (!dpr+c) && (!dnr-c+N-1)); } void solution() { int r; int c; NSol++; fprintf(fp,"\n"); for(r=N-1;r>=0;r--) { fprintf(fp,"\n|"); for(c=0;cr==c) fprintf(fp,"X|"); else fprintf(fp," |"); } } void initialize() { int i; NSol=0; for(i=0;ii=0; for(i=0;i<2*N-2;i++) dpi=0, dni=0; } Example program in Python This program written in the Python programming language uses breadth-first search combined with the hard-coded insights that: - no two pieces can share the same row;
- any solution for n queens on an n×m board must contain a solution for n−1 queens on an (n−1)×m board;
- proceeding in this way will always keep the queens in order, and generate each solution only once.
# Return a list of solutions to the n-queens problem on an # n-by-width board. A solved board is expressed as a list of # column positions for queens, indexed by row. # Rows and columns are indexed from zero. def n_queens(n, width): if n == 0: return [[]] # one solution, the empty list else: return add_queen(n-1, width, n_queens(n-1, width)) # Try all ways of adding a queen to a column of row new_row, returning # a list of solutions. previous_solutions must be a list of new_row-queens # solutions. def add_queen(new_row, width, previous_solutions): solutions = [] for sol in previous_solutions: # Try to place a queen on each column on row new_row. for new_col in range(width): # print 'trying', new_col, 'on row', new_row if safe_queen(new_row, new_col, sol): # No interference, so add this solution to the list. solutions.append(sol + new_col) return solutions # Is it safe to add a queen to sol at (new_row, new_col)? Return # true if so. sol must be a solution to the new_row-queens problem. def safe_queen(new_row, new_col, sol): # Check against each piece on each of the new_row existing rows. for row in range(new_row): if (solrow == new_col or # same column clash solrow + row == new_col + new_row or # diagonal clash solrow - row == new_col - new_row): # other diagonal return 0 return 1 for sol in n_queens(8, 8): print sol See also References - Watkins, John J. (2004). Across the Board: The Mathematics of Chess Problems. Princeton: Princeton University Press. ISBN 0-691-11503-6.
External links Links to solutions
|
 |