8 Queens Chess Problem

题目描述

In chess it is possible to place eight queens on the board so that no one queen can be taken by any other. Write a program that will determine all such possible arrangements for eight queens given the initial position of one of the queens.

Do not attempt to write a program which evaluates every possible 8 configuration of 8 queens placed on the board. This would require 88 evaluations and would bring the system to its knees. There will be a reasonable run time constraint placed on your program.

输入

Input to your program will be two numbers separated by a blank. The numbers represent the square on which one of the eight queens must be positioned. A valid square will be represented; it will not be necessary to validate the input.

To standardize our notation, assume that the upper left-most corner of the board is position (1,1). Rows run horizontally and the top row is row 1. Columns are vertical and column 1 is the left-most column. Any reference to a square is by row then column; thus square (4,6) means row 4, column 6.

输出

Output from your program will consist of a one-line-per-solution representation.

Each solution will be sequentially numbered . Each solution will consist of 8 numbers. Each of the 8 numbers will be the ROW coordinate for that solution. The column coordinate will be indicated by the order in which the 8 numbers are printed. That is, the first number represents the ROW in which the queen is positioned in column 1; the second number represents the ROW in which the queen is positioned in column 2, and so on.

The sample input below produces 4 solutions. The full 8*8 representation of each solution is shown below.

DO NOT SUBMIT THE BOARD MATRICES AS PART OF YOUR SOLUTION!

   SOLUTION 1           SOLUTION 2           SOLUTION 3           SOLUTION 4

1 0 0 0 0 0 0 0      1 0 0 0 0 0 0 0      1 0 0 0 0 0 0 0      1 0 0 0 0 0 0 0
0 0 0 0 0 0 1 0      0 0 0 0 0 0 1 0      0 0 0 0 0 1 0 0      0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0      0 0 0 1 0 0 0 0      0 0 0 0 0 0 0 1      0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 1      0 0 0 0 0 1 0 0      0 0 1 0 0 0 0 0      0 0 0 0 0 1 0 0
0 1 0 0 0 0 0 0      0 0 0 0 0 0 0 1      0 0 0 0 0 0 1 0      0 0 1 0 0 0 0 0
0 0 0 1 0 0 0 0      0 1 0 0 0 0 0 0      0 0 0 1 0 0 0 0      0 0 0 0 0 0 1 0
0 0 0 0 0 1 0 0      0 0 0 0 1 0 0 0      0 1 0 0 0 0 0 0      0 1 0 0 0 0 0 0
0 0 1 0 0 0 0 0      0 0 1 0 0 0 0 0      0 0 0 0 1 0 0 0      0 0 0 1 0 0 0 0

Submit only the one-line, 8 digit representation of each solution as described earlier. Solution #1 below indicates that there is a queen at Row 1, Column 1; Row 5, Column 2; Row 8, Column 3; Row 6, Column 4; Row 3,Column 5; ... Row 4, Column 8.

Include the two lines of column headings as shown below in the sample output and print the solutions in lexicographical order.

样例输入

1 1

样例输出

SOLN       COLUMN
 #      1 2 3 4 5 6 7 8

 1      1 5 8 6 3 7 2 4
 2      1 6 8 3 7 4 2 5
 3      1 7 4 6 8 2 5 3
 4      1 7 5 8 2 4 6 3

算法实现：

#include<iostream>
#include<cstdio>
using namespace std;
int n;
void backtracking( int, int*, int*, int*, int*, int* );
int main()
{
    int row, col, array[8];
    bool blank_line;
    blank_line = 0;
    scanf( "%d%d", &row, &col );
    row--, col--;
    if( blank_line ) printf( "\n" );
    printf( "SOLN       COLUMN\n" );
    printf( " #      1 2 3 4 5 6 7 8\n" );
    printf( "\n" );
    blank_line = 1;
    int rowput[8] = {0}, colput[8] = {0}, leftslash[15] = {0}, rightslash[15] = {0};
    rowput[row] = 1;
    colput[col] = 1;
    leftslash[row+col] = 1;
    rightslash[row-col+7] = 1;
    n = 0;
    array[col] = row;
    backtracking( 0, array, rowput, colput, leftslash, rightslash );
    return 0;
}
void backtracking( int i, int array[], int rowput[], int colput[], int leftslash[] , int rightslash[] )
{
    if( i == 8 )
    {
        printf( "%2d      ", ++n );
        for( int j = 0 ; j < 8 ; j++ )
        {
            if( j ) printf( " " );
            printf( "%d", array[j]+1 );
        }
        printf( "\n" );
        return;
    }
    if( colput[i] )
    {
        backtracking( i+1, array, rowput, colput, leftslash, rightslash );
        return;
    }
    for( int j = 0 ; j < 8 ; j++ )
    {
        if( rowput[j] || leftslash[j+i] || rightslash[j-i+7] )
            continue;
        rowput[j] = 1;
        leftslash[i+j] = 1;
        rightslash[j-i+7] = 1;
        array[i] = j;
        backtracking( i+1, array, rowput, colput, leftslash, rightslash );
        rowput[j] = 0;
        leftslash[i+j] = 0;
        rightslash[j-i+7] = 0;
    }
}

来源：http://www.xuebuyuan.com/927926.html