N皇后问题：基于局部搜索策略的高效算法

#include<iostream>
#include<string.h>
#include<time.h>
using namespace std;

#define TIMES 10  //测试轮数
#define MAX_SIZE 10000  //最大可求解的皇后数量

int n;  //待输入的皇后数量
int board[MAX_SIZE];  //记录棋盘状况的数组
int label[MAX_SIZE];  //标记数组
//记录冲突的数组（使用暴力循环方法检测冲突时可以不需要定义这两个数组）
int ru[MAX_SIZE * 2];  //右上
int rd[MAX_SIZE * 2];  //右下

//生成x个不重复的随机数，并放入board数组
void RandArray(int x) {
    int i, temp;
    memset(label, 0, sizeof(int) * (n + 1));
    for (i = 0; i < n; i++) {
        do {
            temp = rand() % x;
        } while (label[temp] == 1);
        board[i] = temp;
        label[temp] = 1;
    }
}

/*************************************************/
/*int Conflict() {  //使用暴力循环方法计算冲突
    int i, j, r = 0;
    for (i = 0; i < n - 1; i++)
        for (j = i + 1; j < n; j++) {
            if (j - i == abs(board[j] - board[i]))
                r++;
        }
    return r;
}*/
int Conflict() {  //使用数组方法计算冲突
    int i, r = 0;
    memset(ru, 0, sizeof(ru));
    memset(rd, 0, sizeof(rd));
    for (i = 0; i < n; i++) {
        ru[board[i] - i + n]++;
        rd[board[i] + i]++;
    }
    for (i = 0; i < 2 * n; i++) {
        if (ru[i] > 1) r += ru[i] - 1;
        if (rd[i] > 1) r += rd[i] - 1;
    }
    return r;
}
/*************************************************/

int main() {
    srand((unsigned) time(NULL));
    int i, j, temp, now, t1, t2, fnow, sumtime = 0, avet;
    cout << "\n输入棋盘大小(皇后个数)：";
    cin >> n;
    cout << endl;
    for (avet = 0; avet < TIMES; avet++) {  //测试TIMES轮
        t1 = clock();
        while (1) {  //局部搜索部分
            RandArray(n);
            now = Conflict();
            next:
            if (now == 0) goto over;
            for (i = 0; i < n - 1; i++) {
                for (j = i + 1; j < n; j++) {  //可以通过改变j的步长来实现部分交换，但经过测试发现，效率都不如单步长方法
                    temp = board[i];
                    board[i] = board[j];
                    board[j] = temp;
                    fnow = Conflict();
                    if (fnow < now) {
                        now = fnow;
                        goto next;
                    }
                    temp = board[i];
                    board[i] = board[j];
                    board[j] = temp;
                }
            }
        }
        over:
        t2 = clock();
        /*for (i = 0; i < n; i++) {  //打印皇后在棋盘中的分布
            for (j = 0; j < n; j++) {
                if (board[i] == j) cout << " X";
                else cout << " +";
            }
            cout << endl;
        }*/
        sumtime += (t2 - t1);
        cout << "第 " << avet + 1 << " 轮耗费时间：" << (t2 - t1) << " ms\n";
    }
    cout << "\n" << avet << " 轮平均耗费时间为：" << sumtime / avet << " ms\n";
    return 0;
}

打印棋盘：

算法效率：