搜索资源列表
Queen
- 八皇后的c++实现怎么能写出20个字的描述呢-Eight queen c implementation
Queen
- java八皇后没有版权争议的内容和木马病毒代码-copyright Queen' s eight java controversial virus and Trojan code
N-queen_linear_time
- N-皇后问题线性时间算法 O(n)复杂度，非O(n^2)的，使用的是构造法。-N-Queen problem of linear time algorithm
queen
- 用scheme实现的八皇后，可以格式化输出，带有详细注释。-A eight-queen done in scheme
queen
- 在vs2008的环境下实现的八皇后的C++代码，带有格式化输出-Vs2008 environment in the realization of the eight Queen of C++ code, with formatted output
8-queenProblem
- The famous 8-queen problem in java
n-queen
- 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
Queen
- 解决八皇后问题的算法，能够用非递归的方法解决八皇后问题-8 Queen' s problem solution algorithm
Queen
- 西洋棋皇后程式,有完整介面,輸入即可查詢各數-Queen
queen
- N皇后问题 输入N 可以得到问题的解-N QUEEN
sschubu
- 搜索初步介绍，包括深度搜索和广大搜索，有n皇后代码及其他题目代码。-The initial search, including the majority of the depth of search and search, there are n Queen' s source code and other topics.
artificial_intelligence_demo_programs
- 光盘中的演示实例是人工智能原理和方法的演示程序.包括基于归结原理的推理系统,合一算法,等式归结,归类算法,野人与传教士过河问题,八数码问题,八皇后问题,一字棋,博弈算法,遗传算法和蚁群算法等的演示。-CD-ROM presentation of a number of examples of the hard work of graduate and undergraduate results. Including reasoning based on the principle of the
queen
- 实验时编写的八皇后源码，可以完成基本的八皇后问题-queen
QUEEN
- Delphi做的八皇后问题，界面很好看~-Delphi to do the eight Queen' s problems, interface look very good ~
Queen
- n皇后 在一定范围内，可以输出n皇后问题的所有解。-solve the "n queen" problem.
queen
- 超牛的8皇后程序，整个程序只有短短的10行，而且是按标准格式，控制台上输出的格式也是符合美观条件的-8, Queen' s super-cow program, the whole process is only a short span of 10 lines, and is based on a standard format, the format of the console output is also in line with the conditions of appeara
Queen
- 算法分析中的皇后问题，采用分枝限界法进行求解-Algorithm analysis of Queen' s question, the use of Branch and Bound method for solving
Queen
- scheme写的一个关于求解8皇后问题的源码，同时还有C和java的-written in a scheme to solve the issue of 8 Queen' s source code, along with the C and java
Queen
- 在一个8×8国际象棋盘上，有8个皇后，每个皇后占一格；要求皇后间不会出现相互“攻击”的现象，即不能有两个皇后处在同一行、同一列或同一对角线上。问共有多少种不同的方法-8 × 8 in a chess set, there are 8 Queen' s, Queen' s share of each cell between Queen will not be asked each other " attack" phenomenon, that is, can n
8-Queen
- 8-Queen problem, that is one of the most famous algorithm problem.