发一个大四(去年这个时候)时候写的N皇后代码实现,大二学过数据结构算法分析 8皇后经典问题,后来大三下学习人工智慧导论学习的N皇后,后来才实现:
#include<iostream>
#define NUM 4
using namespace std;
void Change(long long v, long long determine[][NUM], long long i, long long j)
{
for (long long k = 0; k < NUM; k++)
{
determine[k][j] += v;
determine[i][k] += v;
if (i + k < NUM && j + k < NUM)
determine[i + k][j + k] += v;
if (i - k > -1 && j - k > -1)
determine[i - k][j - k] += v;
if (i + k < NUM && j - k > -1)
determine[i + k][j - k] += v;
if (i - k > -1 && j + k < NUM)
determine[i - k][j + k] += v;
}
}
void Queen(bool checkerboard[][NUM], long long determine[][NUM], long long i, long long j, long long llj[], bool ie, bool iea[])
{
if (determine[i][j] == 0)
{
checkerboard[i][j] = true;
iea[i] = true;
llj[i] = j;
Change(1, determine, i, j);
if (i < NUM - 1)
Queen(checkerboard, determine, i + 1, 0, llj, iea[i + 1], iea);
}
else
{
if (j < NUM - 1 && !iea[i])
Queen(checkerboard, determine, i, j + 1, llj, iea[i], iea);
if (j == NUM - 1 && llj[i - 1] != NUM - 1 && !iea[i])
{
long long ll = llj[i - 1];
checkerboard[i - 1][ll] = false;
iea[i - 1] = false;
Change(-1, determine, i - 1, ll);
llj[i - 1] = -1;
Queen(checkerboard, determine, i - 1, ll + 1, llj, iea[i - 1], iea);
}
if (j == NUM - 1 && llj[i - 1] == NUM - 1 && !iea[i])
if (i > 1 && llj[i - 2] < NUM - 1)
{
long long ll1 = llj[i - 1];
long long ll2 = llj[i - 2];
checkerboard[i - 1][ll1] = false;
checkerboard[i - 2][ll2] = false;
iea[i - 1] = false;
iea[i - 2] = false;
Change(-1, determine, i - 1, ll1);
Change(-1, determine, i - 2, ll2);
llj[i - 1] = -1;
llj[i - 2] = -1;
Queen(checkerboard, determine, i - 2, ll2 + 1, llj, iea[i - 2], iea);
}
}
}
int main()
{
bool checkerboard[NUM][NUM];//定义棋盘
long long determine[NUM][NUM];//判定棋局的位置是否合法
long long llj[NUM];//获得某行棋子的j值
bool isExistence[NUM];//判断某行是否有棋子
bool isAnswer;//判断是否有解
//赋值 初始化
for (long long i = 0; i < NUM; i++)
{
for (long long j = 0; j < NUM; j++)
{
checkerboard[i][j] = false;
determine[i][j] = 0;
}
llj[i] = -1;
isExistence[i] = false;
}
Queen(checkerboard, determine, 0, 0, llj, isExistence[0], isExistence);//调用函数
//判断是否有解
for (long long i = 0; i < NUM; i++)
isAnswer = isExistence[i];
//输出结果
if (isAnswer)
for (long long i = 0; i < NUM; i++)
{
for (long long j = 0; j < NUM; j++)
{
if (checkerboard[i][j])
cout << "■";
else
cout << "□";
}
cout << endl;
}
else
cout << NUM << "皇后问题无解\n";
return 0;
}