八皇后问题,再一次加深了一下深搜。
#include <iostream>
#include <cstring>
using namespace std;
int via[3][15],nums = 0;
void eight(int cur)
{
if(cur == 8) nums++;
else for(int m = 0;m < 8;m++)
{
if(!via[0][m] && !via[1][cur+m] && !via[2][7-m+cur])
{
via[0][m] = via[1][cur+m] = via[2][7-m+cur] = 1;
eight(cur+1);
via[0][m] = via[1][cur+m] = via[2][7-m+cur] = 0;
}
else continue;
}
}
int main()
{
memset(via,0,sizeof(via));
eight(0);
cout << nums << endl;
return 0;
}