Description: 算法设计:著名的n后问题:在nXn的棋盘上放彼此不受攻击的n个皇后,按国际象棋的规则,任何2个皇后不在同一行或同一列或同一斜线上.
本算法才用回朔法来解决.-algorithm design : n after the famous question : In nXn put on the chessboard of each other against attack n empress, according to the international rules of chess, any two Queen's not the same line, or in the same series or slash on the same. the algorithm used the method to solve the Schomburg. Platform: |
Size: 5617 |
Author:王涛 |
Hits:
Description: 解国际象棋的N皇后问题的C++源代码，可用于大学计算机技术课程《算法分析》上机联系-Solutions International Chess Queen of the N C source code, University computer can be used for technical courses "algorithm analysis" on the plane link Platform: |
Size: 3834021 |
Author:吴俊杰 |
Hits:
Description: 这是计算机算法中的回溯法中的一个经典的问题－－Ｎ皇后问题！希望对学计算机算法的同学有用！-This is a computer algorithm, the retroactive law on the issue of a classic -- N Queen! Want to learn how to use computer algorithms useful to the students! Platform: |
Size: 2187 |
Author:中国 |
Hits:
Description: 这是计算机算法中的回溯法中的一个经典的问题－－Ｎ皇后问题！希望对学计算机算法的同学有用！-This is a computer algorithm, the retroactive law on the issue of a classic-- N Queen! Want to learn how to use computer algorithms useful to the students! Platform: |
Size: 2048 |
Author:中国 |
Hits:
Description: 在毕业设计期间由多人开发的一个算法演示系统，它包n皇后问题、拉维斯加算法等-This is a algorithm demo system developed by some persons, which including n queen problem, Laplac algorithm,etc. Platform: |
Size: 3955712 |
Author:吴义军 |
Hits:
Description: 算法设计:著名的n后问题:在nXn的棋盘上放彼此不受攻击的n个皇后,按国际象棋的规则,任何2个皇后不在同一行或同一列或同一斜线上.
本算法才用回朔法来解决.-algorithm design : n after the famous question : In nXn put on the chessboard of each other against attack n empress, according to the international rules of chess, any two Queen's not the same line, or in the same series or slash on the same. the algorithm used the method to solve the Schomburg. Platform: |
Size: 251904 |
Author:王涛 |
Hits:
Description: 解国际象棋的N皇后问题的C++源代码，可用于大学计算机技术课程《算法分析》上机联系-Solutions International Chess Queen of the N C source code, University computer can be used for technical courses "algorithm analysis" on the plane link Platform: |
Size: 3833856 |
Author:吴俊杰 |
Hits:
Description: 局部搜索法求解N皇后问题。这个算法的特点是引入随机因素，每次运行并不能保证求得问题的最优解，但经过运行之后，一般总能得到一个与最优解相差不大的满意解。-Local Search Method for Solving N Queens problem. The algorithm is characterized by the introduction of random factors, each running and can not guarantee to achieve the optimal solution of the problem, but after running, the general always be an optimal solution is no less than satisfactory solution. Platform: |
Size: 1024 |
Author:清和信平 |
Hits:
Description: 在一个Ｎ×Ｎ的国际象棋棋盘中摆Ｎ个皇后，使这Ｎ个皇后不能互相被对方吃掉。
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 Platform: |
Size: 2048 |
Author:张晓 |
Hits:
Description: n皇后问题，迷宫问题，递归实现皇后寻找迷宫出路，经典算法之一-n queen problem, the maze problem, the recursive realization of the maze to find a way out of Queen' s, one of the classic algorithm Platform: |
Size: 1024 |
Author:luo |
Hits:
Description: 用c++语言提供了N皇后问题的算法描述，大家可以参考。-C++ language with the N-queens algorithm description, we can reference. Platform: |
Size: 2048 |
Author:caicai |
Hits:
Description: 在一个Ｎ×Ｎ的国际象棋棋盘中摆Ｎ个皇后，使这Ｎ个皇后不能互相被对方吃掉。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 Platform: |
Size: 3072 |
Author:colsinc |
Hits:
Description: 在一个Ｎ×Ｎ的国际象棋棋盘中摆Ｎ个皇后，使这Ｎ个皇后不能互相被对方吃掉。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 Platform: |
Size: 3072 |
Author:cj7936bura |
Hits:
Description: BFS算法实现N皇后问题，12个皇后是速度还行，超过了就有点慢。(BFS algorithm to achieve N queen problem, 12 queens is the speed is OK, more than a little slow.) Platform: |
Size: 9216 |
Author:loganic
|
Hits:
Description: 运用爬山法和遗传算法解决n皇后问题，vs2013编译通过(Using mountain climbing and genetic algorithm to solve the problem of N Queen, vs2013 compiled and passed) Platform: |
Size: 2110464 |
Author:staub
|
Hits:
Search - n queen algorithm