数据结构N后问题

1、什么是N后问题

在nn格子上放置n个皇后, 按照国际象棋规矩不可让皇后相互攻击, 即如何两个皇后不放在同一列同一行同一斜线上。
例：44的N后问题

2、算法

1、列冲突, 即(paraSolution[j] == paraSolution[paraT])

2、斜线冲突,即(abs(paraT - j) == abs(paraSolution[j] - paraSolution[paraT]))

int place(int* paraSolution, int paraT){
	int j;
    for (j = 1; j < paraT; j ++){//abs绝对值计算 
        if ((abs(paraT - j) == abs(paraSolution[j] - paraSolution[paraT])) || (paraSolution[j] == paraSolution[paraT]))
            return 0;
    }//Of for
    return 1;
}//Of place

3、分配空间和初始化

void nQueen(int paraN){
	int i;
	int* solution = (int*)malloc((paraN + 1) * sizeof(int));
	for (i = 0; i <= paraN; i ++)
		solution[i] = 0;

    backtracking(solution, paraN, 1);
}//Of nQueen

4、输出

void backtracking(int* paraSolution, int paraN, int paraT){
	int i;
    if (paraT > paraN){
        for (i = 1; i <= paraN; i ++)
            printf("%d ", paraSolution[i]);
		printf("\r\n");
    }else{
        for (i = 1; i <= paraN; i ++){
            paraSolution[paraT] = i;
            if (place(paraSolution, paraT))
                backtracking(paraSolution, paraN, paraT + 1);
        }//Of for i
    }//Of if
}//Of backtracking

5、总代码

#include <stdio.h>
#include <malloc.h>
#include <math.h>

/**
 * Place it there, applicable?
 */
int place(int* paraSolution, int paraT)
{
	int j;
    for (j = 1; j < paraT; j ++)
    {//abs绝对值计算 
        if ((abs(paraT - j) == abs(paraSolution[j] - paraSolution[paraT])) || (paraSolution[j] == paraSolution[paraT]))
            return 0;
    }//Of for
    return 1;
}//Of place

void backtracking(int* paraSolution, int paraN, int paraT){
	int i;
    if (paraT > paraN)
    {
        for (i = 1; i <= paraN; i ++)
            printf("%d ", paraSolution[i]);
		printf("\r\n");
    }
    else
    {
        for (i = 1; i <= paraN; i ++)
        {
            paraSolution[paraT] = i;
            if (place(paraSolution, paraT))
                backtracking(paraSolution, paraN, paraT + 1);
        }//Of for i
    }//Of if
}//Of backtracking

void nQueen(int paraN)
{
	int i;
	int* solution = (int*)malloc((paraN + 1) * sizeof(int));
	for (i = 0; i <= paraN; i ++)
		solution[i] = 0;

    backtracking(solution, paraN, 1);
}//Of nQueen

int main()
{
	nQueen(5);
	return 1;
}//Of main

6、运行结果