![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/b22874f3caeeebf2abfbaa6db89842bb.png)
#include<stdio.h>
#define N 8
char board[N+2][N+2];
int count = 0;
struct Pos{
int yos;
int xos;
};
struct Pos pos[3] = { { -1, -1 }, { -1, 0 }, { -1, 1 } };
void Init(void){
for (int row = 0; row < N + 2; row++){
for (int col = 0; col < N + 2; col++){
board[0][col] = '#';
board[N + 1][col] = '#';
board[row][0] = '#';
board[row][N + 1] = '#';
}
}
for (int i = 1; i <= N; i++){
for (int j = 1; j <= N; j++){
board[i][j] = ' ';
}
}
}
void Show(void){
for (int i = 0; i < N + 2; i++){
for (int j = 0; j < N + 2; j++){
printf("%c", board[i][j]);
}
printf("\n");
}
}
int Check(int row, int col){
int ret = 1;
int nr;
int nc;
for (int i = 0; i < 3 && ret; i++){
nr = row;
nc = col;
while (ret&&board[nr][nc] != '#'){
if (board[nr][nc] == '*'){
ret = 0;
break;
}
nr = nr + pos[i].yos;
nc = nc + pos[i].xos;
}
}
return ret;
}
void Find(int row){
if (row>N){
Show();
count++;
printf("%d\n",count);
}
else{
for (int col = 1; col <= N; col++){
if (Check(row, col)){
board[row][col] = '*';
Find(row + 1);
board[row][col] = ' ';
}
}
}
}
int main(){
Init();
Find(1);
return 0;
}
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/12c4ca1a53e08bc017fcf4de7a60504a.png)