搜索资源列表
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
N-Queen
- N-Queen Problem Solution
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
Queen
- 用JAVA实现的八皇后问题展示，多线程实现。运行时请自行添加queen.jpg作为资源文件到工程目录下。-In the JAVA implementation of eight queens problem show, multithreading implementation.Runtime please add your own queen. JPG as a resource file to the project directory.
n-queen
- n后问题，残缺的棋盘，迭代算法，算法分析与设计-n queen
n-Queen-using-ICA
- SOlved program n-Queen BY ICA
queen
- 简单的八皇后问题解法，适用于Dos,适合初学者了解八皇后问题。-The easy solution of eight queen problem.
Eight-queen
- 八皇后问题，是一个古老而著名的问题，是回溯算法的典型案例。该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法-Eight queens problem is an old and famous, is a typical case of backtracking algorithm The problem is the international chess player
queen
- java图形界面，程序清晰的演示了八皇后的找到途径，让初学者明白八皇后的算法。-java graphical interface, the program clearly demonstrates the eight Queen' s find ways for beginners to understand the eight queens algorithm.
n-Queen-using-ICA
- Solving n-Queen Problem Using Imperialist Competitive Algorithm(ICA) Matlab Codes
eight-queen-problem
- 题目描述 8X8的国际象棋棋盘上被挖了一些洞，这些洞不能放棋子，求八皇后问题的摆放方案，输出一种方案即可 输入格式 棋盘用.表示正常格子，用#表示被挖掉的洞，一共8行8列 输出格式 输出从上到下的每一行的皇后所在列号（1-8）-Topic describes 8 by 8 chess board was dug holes, these holes can t put chess pieces, put eight queens problem, output
eight-queen
- 八皇后的算法问题。算法简单，易于理解，且问题能够得到有效解决。-eight queen