八皇后

1. //============================================================================
   
2. 
   
3. // Name : EightQueen.cpp
   
4. 
   
5. // Author : Rick
   
6. 
   
7. // Version :
   
8. 
   
9. // Copyright : Just for test ^_^
   
10. 
    
11. // Description : Hello World in C++, Ansi-style
    
12. 
    
13. //============================================================================
    
14. 
    
15. 
    
16. #include <blitz/array.h>
    
17. #include <stdio.h>
    
18. #include <time.h>
    
19. #include <iostream>
    
20. #include <iomanip>
    
21. 
    
22. using namespace blitz;
    
23. 
    
24. void
    
25.         SetFlag(Array<int, 2>& A, int xpos, int ypos, int xboundary,
    
26.                 int yboundary);
    
27. void UnSetFlag(Array<int, 2>& A, int xpos, int ypos, int xboundary,
    
28.         int yboundary);
    
29. void PlaceQueen(int cx, int cy);
    
30. 
    
31. int main() {
    
32. 
    
33.     long t1, t2, t;
    
34.     time(&t1);
    
35. 
    
36.     PlaceQueen(12, 12);
    
37. 
    
38.     time(&t2);
    
39. 
    
40.     t = t2 - t1;
    
41.     cout << "Time consume: "<<t<<" Seconds"<<endl;
    
42. }
    
43. 
    
44. void SetFlag(Array<int, 2>& A, int xpos, int ypos, int xboundary, int yboundary) {
    
45. 
    
46.     for (int i = 0; i < xboundary; ++i) //水平方向
    
47. 
    
48.         A(i, ypos) += 1;
    
49.     for (int i = 0; i < yboundary; ++i) //垂直方向
    
50. 
    
51.         A(xpos, i) += 1;
    
52.     for (int i = 1; ypos + i < yboundary; ++i) { //y+ x+ x-
    
53. 
    
54.         if ((xpos + i) < xboundary) {
    
55.             A(xpos + i, ypos + i) += 1;
    
56.         }
    
57.         if ((xpos - i) >= 0) {
    
58.             A(xpos - i, ypos + i) += 1;
    
59.         }
    
60.     }
    
61.     for (int i = -1; ypos + i >= 0; --i) { //y- x+ x-
    
62. 
    
63.         if ((xpos + i) >= 0) {
    
64.             A(xpos + i, ypos + i) += 1;
    
65.         }
    
66.         if ((xpos - i) < xboundary) {
    
67.             A(xpos - i, ypos + i) += 1;
    
68.         }
    
69.     }
    
70. }
    
71. void UnSetFlag(Array<int, 2>& A, int xpos, int ypos, int xboundary,
    
72.         int yboundary) {
    
73. 
    
74.     for (int i = 0; i < xboundary; ++i) //水平方向
    
75. 
    
76.         A(i, ypos) -= 1;
    
77.     for (int i = 0; i < yboundary; ++i) //垂直方向
    
78. 
    
79.         A(xpos, i) -= 1;
    
80.     for (int i = 1; ypos + i < yboundary; ++i) { //y+ x+ x-
    
81. 
    
82.         if ((xpos + i) < xboundary) {
    
83.             A(xpos + i, ypos + i) -= 1;
    
84.         }
    
85.         if ((xpos - i) >= 0) {
    
86.             A(xpos - i, ypos + i) -= 1;
    
87.         }
    
88.     }
    
89.     for (int i = -1; ypos + i >= 0; --i) { //y- x+ x-
    
90. 
    
91.         if ((xpos + i) >= 0) {
    
92.             A(xpos + i, ypos + i) -= 1;
    
93.         }
    
94.         if ((xpos - i) < xboundary) {
    
95.             A(xpos - i, ypos + i) -= 1;
    
96.         }
    
97.     }
    
98. }
    
99. void PlaceQueen(int cx, int cy) {
    
100.     Array<int, 2> A(cx, cy);
     
101.     A = 0;
     
102.     int count = 0;
     
103.     int *loop;
     
104.     loop = new int[cx];
     
105.     for (int i = 0; i < cx; i++)
     
106.         loop[i] = 0;
     
107.     //bool thislevel=true;
     
108. 
     
109.     bool solve = true;
     
110.     int level = 0;
     
111. 
     
112.     while (solve) {
     
113.         while (true/*thislevel*/) {
     
114.             if (loop[level] >= cx) { //发现已经是最后一个位置
     
115. 
     
116.                 if (level == 0) {
     
117.                     solve = false; //已经找完了,结束大循环
     
118. 
     
119.                     break;
     
120.                 }
     
121.                 loop[level] = 0; //设置到开始位置
     
122. 
     
123.                 --level; //返回上一层
     
124. 
     
125.                 A(level, loop[level]) -= '*'; //清除上一层的标记
     
126. 
     
127.                 UnSetFlag(A, level, loop[level], cx, cy);
     
128. 
     
129.                 ++loop[level];
     
130.                 //本次循环结束
     
131. 
     
132.                 break;
     
133.             }
     
134.             if (A(level, loop[level]) > 0) //不能放置，查看下一个位置
     
135. 
     
136.                 ++loop[level];
     
137.             else { //能够放置
     
138. 
     
139.                 if (level == cx - 1) { //是不是最后一层
     
140. 
     
141.                     A(level, loop[level]) += '*'; //设置标记
     
142. 
     
143.                     SetFlag(A, level, loop[level], cx, cy);
     
144.                     count++;
     
145. 
     
146.                     A(level, loop[level]) -= '*';
     
147.                     UnSetFlag(A, level, loop[level], cx, cy); //取消标记找下一个
     
148. 
     
149.                     loop[level] = cx;
     
150.                 } else {
     
151.                     A(level, loop[level]) += '*'; //设置标记
     
152. 
     
153. 
     
154.                     SetFlag(A, level, loop[level], cx, cy);
     
155.                     ++level; //进入下一层
     
156. 
     
157.                 }
     
158.             }
     
159.         }
     
160.     }
     
161. 
     
162.     delete[] loop;
     
163.     cout <<"The Solution: "<< count << endl;
     
164. }

<script>window._bd_share_config={"common":{"bdSnsKey":{},"bdText":"","bdMini":"2","bdMiniList":false,"bdPic":"","bdStyle":"0","bdSize":"16"},"share":{}};with(document)0[(getElementsByTagName('head')[0]||body).appendChild(createElement('script')).src='http://bdimg.share.baidu.com/static/api/js/share.js?v=89860593.js?cdnversion='+~(-new Date()/36e5)];</script>

阅读(91) | 评论(0) | 转发(0) |

0

上一篇：[解题报告]POJ-2698-八皇后问题

下一篇：八皇后及n皇后问题

相关热门文章

• 五十年代初大馬老粵語歌歌書考...
• 欢迎八路城管希在ChinaUnix博...
• 欢迎一锤八十在ChinaUnix博客...
• 欢迎一梦八百年在ChinaUnix博...
• 欢迎初八2000在ChinaUnix博客...

• A sample .exrc file for vi e...
• IBM System p5 服务器 HACMP ...
• 游标的特征
• busybox的httpd使用CGI脚本(Bu...
• Solaris PowerTOP 1.0 发布

给主人留下些什么吧！~~

评论热议