文件名称:n后问题
介绍说明－－下载内容均来自于网络，请自行研究使用
在 n 行 n 列的国际象棋棋盘上，最多可布n个皇后。
若两个皇后位于同一行、同一列、同一对角线上，则称为它们为互相攻击。
n皇后问题是指找到这 n 个皇后的互不攻击的布局。
n 行 n 列的棋盘上，主次对角线各有2n-1条。-n n trip out of the international chess board, the maximum n Queen's cloth. If two at the same Queen's visit, the same series on the same diagonal, as they attack each other. N Queen's problem is found n the Queen not to attack each other's layout. N n trip out on the chessboard, and secondary diagonal each 2n-1.
若两个皇后位于同一行、同一列、同一对角线上，则称为它们为互相攻击。
n皇后问题是指找到这 n 个皇后的互不攻击的布局。
n 行 n 列的棋盘上，主次对角线各有2n-1条。-n n trip out of the international chess board, the maximum n Queen's cloth. If two at the same Queen's visit, the same series on the same diagonal, as they attack each other. N Queen's problem is found n the Queen not to attack each other's layout. N n trip out on the chessboard, and secondary diagonal each 2n-1.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 13898375n后问题.rar 列表 n后问题.cpp