回溯算法&八皇后

#include<iostream>
using namespace std;
#define N 8
static int num=0;

//判断条件
bool check(int row, int j,int(*mark2)[N])
{
int i, k;
//左上
for (i = row, k = j; i >= 0 && k >= 0; i--, k--)
{
if (mark2[i][k] == 1)
return false;
}
//左下
for (i = row, k = j; i<N && k>=0; i++, k--)
{
if (mark2[i][k] == 1)
return false;
}
//右上
for (int i = row, k = j; i >= 0 && k < N; i--, k++)
{
if (mark2[i][k] == 1)
return false;;
}
//右下
for (int i = row, k = j; i<N && k < N; i++, k++)
{
if (mark2[i][k] == 1)
return false;
}
//判断行和列
for (k = 0; k < N; k++)
{
if (mark2[k][j] == 1)
return false;
if (mark2[row][k] == 1)
return false;
}
return true;
}
void flash(int(*mark)[N])
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
cout << mark[i][j] << " ";
}
cout << endl;
}
cout << "**********" << endl;
}
void queen(int row, int col,int(*mark)[N])
{
int mark2[N][N];//重新定义一个数组，每次更新过之后重新赋值
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
mark2[i][j] = mark[i][j];
}
}
if (row == N)
{
flash(mark2);
num++;
cout << num << endl;
}
else
{
for (int j = 0; j < N;j++)
{
if (check(row,j,mark2))//判断是否危险，如果危险的话，向右走一位，即j++并且再次判断
{
mark2[row][j] = 1;
queen(row + 1,j,mark2);//移向下一行，从当前列开始
mark2[row][j] = 0;
}
}

}

}
int main()
{
int mark[N][N] = { 0 };
queen(0, 0,mark);
cout << num << endl;
return 0;
}