八皇后_爬山法(待优化)
#include <iostream>#include <vector>#include<string>#include<math.h>using namespace std;int queen[8] = { 0,1,2,3,4,5,6,7 };//存储皇后布局//获得当前存在冲突的对数int get_num_of_conflict(int queen[8]) { int num_of_conflict = 0; for (int i = 0
原创
2020-11-11 19:26:13 ·
241 阅读 ·
0 评论