#include<iostream>
#include"Mountain.h"
#include"GA.h"
#include<ctime>
using namespace std;
int main()
{
while (1)
{
cout << "请选择算法：" << endl;
cout << "1.爬山法" << endl;
cout << "2.遗传算法" << endl;
int n;
int num;
cin >> num;
switch (num)
{
case 1:
{
cout << "请输入皇后的数量：" << endl;
cin >> n;
map = new int*[n]; //指针初始化
temp_map = new int *[n];
for (int i = 0; i<n; i++)
{
map[i] = new int[n];
temp_map[i] = new int[n];
}
clock_t time1 = clock();
bool find = false;
while (!find)
{
start(n); //初始化棋盘
find = climb(n);
}
clock_t time2 = clock();
show(n);
cout << "时间开销为：" << '\t' << (double)(time2 - time1) << "ms" << endl;
break;
}
case 2:
{
cout << "请输入皇后的数量：" << endl;
cin >> n;
clock_t time2 = clock();
Genetic queens(n, n * 4); //初始化皇后数和种群中的状态数
queens.GeneticAlgorithm(); //入口函数
cout << "\n 花费了" << (double)(clock() - time2) << "ms" << endl;
break;
}
default:
{
cout << "输入错误，请重新输入！" << endl;
break;
}
}
}
}
n皇后.rar （24个子文件） 
n皇后 人工智能2_2 
rgzn2_2.cpp 1KB Mountain.h 3KB 人工智能2_2.vcxproj.filters 1KB GA.h 4KB Mountain1.h 0B Debug 人工智能2_2.log 3KB vc120.pdb 460KB 人工智能2_2.tlog CL.write.1.tlog 782B CL.read.1.tlog 12KB 人工智能2_2.lastbuildstate 201B cl.command.1.tlog 1KB link.write.1.tlog 726B link.command.1.tlog 2KB link.read.1.tlog 5KB 人工智能2_2.Build.CppClean.log 934B vc120.idb 491KB rgzn2_2.obj 461KB 人工智能2_2.vcxproj 4KB 人工智能2_2.sdf 7.69MB 人工智能2_2.sln 991B Debug 
人工智能2_2.exe 123KB 人工智能2_2.ilk 500KB 人工智能2_2.pdb 1.32MB 人工智能2_2.v12.suo 23KB资源评论
