搜索资源列表
Queen
- 分别用面向过程、面向对象和函数式程序设计的方法解决八皇后问题。 附报告-Were process-oriented, object-oriented programming and function of the eight Queen' s problem to solve. The attached report
Queen
- 八皇后的c++实现怎么能写出20个字的描述呢-Eight queen c implementation
N-queen_linear_time
- N-皇后问题线性时间算法 O(n)复杂度，非O(n^2)的，使用的是构造法。-N-Queen problem of linear time algorithm
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
- 西洋棋皇后程式,有完整介面,輸入即可查詢各數-Queen
queen
- N皇后问题 输入N 可以得到问题的解-N QUEEN
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
- 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
8-Queen
- 8-Queen problem, that is one of the most famous algorithm problem.
8queen
- 数据结果中的很有名的8皇后问题，该程序实现了8皇后的动态演示，图形界面友好，易用，对于学习C++编程和数据结构很有帮助-Data results in the well-known 8-queens problem, the program achieved an 8-Queen' s dynamic presentations, graphical user-friendly, easy to use, for learning C++ programming and data stru
queen
- 八皇后问题的具体实现，用递归来寻找每个皇后的位置，有注释！-Concrete realization of the eight queens problem, using recursion to find the location of each of the Queen, there are comments!
n_queen
- N-Queen implementation in Matlab
queen
- 用回溯法解决8皇后问题，用的是vc递归。一个92种解法，希望对大家有用。
queen
- 实现八皇后再棋盘上安全的摆放,每一个QUEEN不能和前面所摆的再一个行或列或对角线-complete the question how to place the queen on the chess safely
queen
- ｎ个皇后问题 在 n 行 n 列的国际象棋棋盘上，最多可布n个皇后。若两个皇后位于同一行、同一列、同一对角线上，则称为它们为互相攻击。 n皇后问题是指找到这 n 个皇后的互不攻击的布局。-n-Queens problem in n rows n columns of the chess board, up to n-Queens cloth. If the two Queens in the same row, same column, the same diagonal, then c
queen
- 八皇后问题串行算法,可递推n皇后问题 C代码-eight queen question code
queen
- 对N皇后问题进行优化，可以在较短时间内计算出皇后排列方法的个数-Optimized for N queens problem, you can calculate the Queen in a relatively short period of time means the number of ordered