搜索资源列表
Queen
- 八皇后代码，自己写的，希望下载后提供宝贵意见，-queen eight queens code, write their own who want to download can be more valuable advice, thank you!
queen
- N皇后问题(含八皇后问题的扩展，规则同八皇后)：在N*N的棋盘上，放置N个皇后，要求每一横行每一列，每一对角线上均只能放置一个皇后，问可能的方案及方案数。-queen question
8-queen
- 8 queen problem in data structure
N-Queen-
- 算法的问题，解决N皇后在棋盘上互不攻击，并且使用了回溯的方法解答此问题-the solution to slove the N Queen
eight-queen
- 这是关于八皇后问题的求解代码，运用数据结构中的堆栈思想，逐一分析可能的情况，求出最后的答案-the code of eight queen ,it s about data struct
N-Queen-recall
- 回溯法实现N-Queen问题。源码使用c++实现，希望采纳啊-Achieve N-Queen problems backtracking. Using c++ implementation source code, hope to adopt ah
n-Queen
- 在n*n格的棋盘上放置彼此不受攻击的n皇后。按照国际想起的规则，皇后可以攻击与之处在同一行或同一列或同一斜线上的棋子。n后问题等价于在n*n格的棋盘上放置n个皇后，任何2个皇后不放在同一行或同一列或同一斜线了。-Place each n is not an attack on the queen n* n chessboard grid. Think of in accordance with international rules, the Queen can attack at a pawn
queen
- queen.cpp 八皇后问题的经典算法-queen.cpp Eight queens problem classical algorithm
QUEEN
- 经典的八王后改进算法，算法的速度达到快很都的地步，利用一种对称的思想,这个压缩包里有几个代码，可以运行进行比较-The classic eight-speed queen improved algorithm, the algorithm can achieve very fast to the point where the idea of using a symmetric
queen
- 在一个8×8国际象棋盘上，有8个皇后，每个皇后占一格；要求皇后间不会出现相互“攻击”的现象，即不能有两个皇后处在同一行、同一列或同一对角线上。问共有多少种不同的方法。-On an 8 × 8 chessboard, there are eight queens, each representing one cell Queens requirement does not appear among mutual Queen "attack" phenomenon, which can not h
n-queen
- 在n×n的棋盘上摆放n个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上。-Placed on board nn n queens, it can not attack each other, that any two queen can not be on the same line, same column or diagonal.
queen
- 基本算法当中皇后问题的C语言实现，对初学者有利。-The C language implement of the problem of queen. It is good for the freshmen.Come on!!
QUEEN
- EIGHT QUEEN EIGHT QUEEN
eight-queen
- 八皇后是个古老而有趣的游戏，是由高斯于1850年首先提出的。要求在国际象棋的棋盘上放置八个皇后，使其不能相互攻击，即任意两个皇后不能处于棋盘的同一行、同一列和同一条对角线上。试问有多少种放法？-Eight Queens is an old and interesting game, by Gauss in 1850 first proposed. Requirements in place on the chess board eight queen, it can not attack eac
eight-queen
- 八皇后是个古老而有趣的游戏，是由高斯于1850年首先提出的。要求在国际象棋的棋盘上放置八个皇后，使其不能相互攻击，即任意两个皇后不能处于棋盘的同一行、同一列和同一条对角线上。试问有多少种放法？-Eight Queens is an old and interesting game, by Gauss in 1850 first proposed. Requirements in place on the chess board eight queen, it can not attack eac
N-QUEEN
- 在一个Ｎ×Ｎ的国际象棋棋盘中摆Ｎ个皇后，使这Ｎ个皇后不能互相被对方吃掉。N皇后算法源码-N × N in a chess board in N months before Queen s, so that the N-Queen s was the other side can not eat each other. N Queen s algorithm source code
Queen
- n*n的棋盘上放置彼此不受攻击的n个皇后，按国际象棋规则可知：皇后可以攻击同行同列同斜线的棋子-n* n chessboard placed on each other from attack of the n-Queens, according to chess rules we can see: Queen can attack the peer-pawn with the column with a slash
eight-queen
- 该算法为一经典算法案例，八皇后算法，利用C++进行实现，大家可以参考利用-The algorithm is a classical algorithm case, eight Queen s algorithm, using C++ be achieved, we can refer to the use of
n-Queen-using-ICA
- SOlved program n-Queen BY ICA
queen
- 简单的八皇后问题解法，适用于Dos,适合初学者了解八皇后问题。-The easy solution of eight queen problem.