标签:column div containe https pack 结果 问题 strong ogr
N-皇后问题(N Queens):
https://www.jianshu.com/p/bb123944d3e5
八皇后问题,是一个古老而著名的问题.该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出:在8×8格的国际象棋上摆放八个皇后,
那么,我们将8皇后问题推广一下,就可以得到我们的N皇后问题了。N皇后问题是一个经典的问题,在一个NxN的棋盘上放置N个皇后,
使其不能互相攻击 (同一行、同一列、同一斜线上的皇后都会自动攻击) 那么问,有多少种摆法?
#include<iostream> #define N 4 using namespace std; void printSolution(int board[N][N]) { cout << "\n"; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) cout << "" << board[i][j]; cout << "\n"; } } bool isSafe(int board[N][N], int row, int col) { int i, j; /* Check this row on left side */ for (i = 0; i < col; i++) if (board[row][i]) return false; /* Check upper diagonal on left side */ for (i = row, j = col; i >= 0 && j >= 0; i--, j--) if (board[i][j]) return false; /* Check lower diagonal on left side */ for (i = row, j = col; j >= 0 && i<N; i++, j--) if (board[i][j]) return false; return true; } void solveNQ(int board[N][N], int col) { if (col >= N){ printSolution(board); return; } /* Consider this column and try placing this queen in all rows one by one */ for (int i = 0; i < N; i++) { /* Check if queen can be placed on board[i][col] */ if (isSafe(board, i, col)) { /* Place this queen in board[i][col] */ // cout<<"\n"<<col<<"can place"<<i; board[i][col] = 1; /* recur to place rest of the queens */ solveNQ(board, col + 1); board[i][col] = 0; // BACKTRACK } } } int main() { int board[N][N] = { { 0, 0, 0, 0 }, { 0, 0, 0, 0 }, { 0, 0, 0, 0 }, { 0, 0, 0, 0 } }; solveNQ(board, 0); system("pause"); return 0; }
运行结果:
标签:column div containe https pack 结果 问题 strong ogr
原文地址:https://www.cnblogs.com/277223178dudu/p/10806817.html