四皇后问题回溯求解

#include <iostream>
#include <list>
using namespace std;

/*
 fourQueen problem
 xasmall
*/

#define N 4
int count=0;
list<int> row;
list<int> column;

bool isright(int i,int j,int (*num)[4]){
    int s,t;
    for(s=i,t=0;t<4;t++)
        if(num[s][t]==1&&t!=j)
            return false;
    for(s=0,t=j;s<4;s++)
        if(num[s][t]==1&&s!=i)
            return false;
    for(s=i-1,t=j-1; s>=0&&t>=0; s--,t--)
        if(num[s][t]==1)
            return false;
    for(s=i+1,t=j+1; s<4&&t<4;s++,t++)
        if(num[s][t]==1)
            return false;
    for(s=i-1,t=j+1; s>=0&&t<4; s--,t++)
        if(num[s][t]==1)
            return false;
    for(s=i+1,t=j-1; s<4&&t>=0; s++,t--)
        if(num[s][t]==1)
            return false;
    return true;
}


void backtrack(int number,int (*num)[4]){
    int j=number;
    if(j==N){   //backtrack end
        list<int>::iterator it1;
        list<int>::iterator it2;
        cout<<"answer "<<++count<<" :"<<endl;
        for(it1=row.begin(),it2=column.begin();it1!=row.end()&&it2!=column.end();it1++,it2++){
            cout<<(*it1)<<","<<(*it2)<<" ";
        }
        cout<<endl;
    }
    else{
        for(int i=0;i<4;i++){
            if(isright(i,j,num)){
                num[i][j]=1;
                row.push_front(i);
                column.push_front(j);
                backtrack(number+1,num);    //make backtrack

                row.pop_front();    //backtrack up one
                column.pop_front();
                num[i][j]=0;    
            }
        }
    }
}
int main(){
    int Queen[4][4];
    int i,j;
    for(int i=0;i<4;i++)
        for(int j=0;j<4;j++){
            Queen[i][j]=0;
        }
    cout<<"the answers of this problem:"<<endl;
    backtrack(0,Queen);
    return 0;
}

执行结果：