八皇后问题(n皇后问题):递归和非递归的解法(C++)

 八皇后问题:在8*8格的棋盘上,放8个皇后,任意两个皇后不能在同一行,同一列,同一斜线上,求有几种摆法

 n皇后问题:在n*n格的棋盘上,放n个皇后,任意两个皇后不能在同一行,同一列,同一斜线上,求有几种摆法

 

1. #include "stdafx.h"
2. #include <iostream>
3. #include <fstream>
4. using namespace std;
7. //非递归
8. void queen(int n)
9. {
10.     int *c=new int [n];//记录列状态
11.     int *d1=new int[2*n-1];//记录正对角线状态
12.     int *d2=new int[2*n-1];//记录负对角线状态
13.     int *lc=new int[n];//记录皇后在第n放的列数
14.     
15.     int **Queen=new int *[n];//棋盘
16.     for(int i=0;i<n;i++)//初始化
17.     {
18.         Queen[i]=new int[n];
19.         for(int j=0;j<n;j++)
20.         {
21.             Queen[i][j]=0;
22.         }
23.         c[i]=0;
24.         d1[i]=0;
25.         d1[2*n-i-2]=0;
26.         d2[i]=0;
27.         d2[2*n-i-2]=0;
29.     }
30.     
31.     
33.     int line=0;//行
34.     int column=0;//列
36.     __int64 num=0;//可以摆放的数量
37.     __int64  count=0;//循环次数
38.     
40.     while(line>=0)
41.     {
42.         while(column<n)
43.         {
44.             
45.             count++;
46.             if(c[column]==0&&d1[line-column+n-1]==0&&d2[line+column]==0)//如果列,正负对角线都没有放,则为真
47.             {
48.                 
49.             
50.                     
51.                     if(line==n-1)//如果到最后一行,则为真
52.                     {
53.                         Queen[line][column]=1;
54.                         num++;//摆放数量加1
55.                         Queen[line][column]=0;
56.                         
57.                         
58.                         break;
59.                         
60.                     }
61.                     else
62.                     {
63.                         //记录摆放状态
64.                         Queen[line][column]=1;
65.                         c[column]=1;
66.                         d1[line-column+n-1]=1;
67.                         d2[line+column]=1;
68.                         lc[line]=column;
69.                     
70.                         line++;//进入下一行,从第0列开始
71.                         column=0;
72.                     }
73.             }
74.             else
75.                 column++;
76.         }
78.         count++;
79.         //如果这一行,所有格都不能放,则退一行,则从上一行上次摆放的下一列开始遍历
80.         line--;
82.         if(line>=0)
83.         {
84.             
85.             column=lc[line];
86.             Queen[line][column]=0;
87.             c[column]=0;
88.             d1[line-column+n-1]=0;
89.             d2[line+column]=0;
90.             column++;
91.             
92.         
93.             
94.             
95.         }
96.         
97.         
101.     }
102.     cout<<num<<'/t'<<count<<endl;;
104.         
105.     
106. }
108. //递归
109. void queen1(int i,int**Queen,int *a,int *d1,int *d2,int& n,int &QueenNumber,__int64&count)
110. {
111.     
112.     int iColumn;
113.     for(iColumn=0;iColumn<n;iColumn++)
114.     {
115.         count++;
116.         if(a[iColumn]==0&&d1[i-iColumn+n-1]==0&&d2[i+iColumn]==0)
117.         {
118.             Queen[i][iColumn]=1;
119.             a[iColumn]=1;
120.             d1[i-iColumn+n-1]=1;
121.             d2[i+iColumn]=1;
122.             if(i<n-1)
123.                 queen1(i+1,Queen,a,d1,d2,n,QueenNumber,count);
124.             else
125.             {
126.                 QueenNumber++;
127.                 /*
128.                 fstream outstuf;
129.                 outstuf.open("out.txt",ios::out|ios::app);
130.                 for(int i=0;i<8;i++)
131.                 {
132.                     for(int j=0;j<8;j++)
133.                     {
134.                         outstuf<<Queen[i][j]<<" ";
135.                     }
136.                     outstuf<<"/r/n";
137.                 }
138.                 outstuf<<"/r/n";
139.                 outstuf.close();*/
140.             }
141.             
142.             Queen[i][iColumn]=0;
143.             a[iColumn]=0;
144.             d1[i-iColumn+n-1]=0;
145.             d2[i+iColumn]=0;
147.         }
148.     }
150. }
151. void queendg(int n)
152. {
154.     int *c=new int [n];
155.     int *d1=new int[2*n-1];
156.     int *d2=new int[2*n-1];
157.     
158.     int **Queen=new int *[n];
159.     for(int i=0;i<n;i++)
160.     {
161.         Queen[i]=new int[n];
162.         for(int j=0;j<n;j++)
163.         {
164.             Queen[i][j]=0;
165.         }
166.         c[i]=0;
167.         d1[i]=0;
168.         d1[2*n-i-2]=0;
169.         d2[i]=0;
170.         d2[2*n-i-2]=0;
172.     }
173.     int QueenNumber=0;
174.     __int64 count=0;
175.     queen1(0,Queen,c,d1,d2,n,QueenNumber,count);
176.     cout<<QueenNumber<<'/t'<<count<<endl;;
177. }
179. int _tmain(int argc, _TCHAR* argv[])
180. {
181.     
182.     queendg(8);
183.     queen(8);
184.     
185.     return 0;
186. }

经测试

queen(16)共14772512种放法,用时206秒

queendg(16)共14772512种放法,用时248秒