搜索资源列表
8-queen
- 通过遗传算法实现八皇后的求解问题，用MFC实现可视化操作，界面很漂亮，算法是改良的遗传算法-Through the genetic algorithm for solving the eight queens problem
eight
- 八皇后 在8X8格的国际象棋上摆放八个皇后,使其不能互相攻击 即任意两个皇后都不能处于同一行 同一列或同一斜线上,问有多少种摆法-Eight Queen s in the 8x8 grid of the International Chess Queen placed eight, making it unable to attack each other or any two Queen s in the same line are not the same row or on th
queen-problem
- 八皇后问题,递归和分治算法的初步结合,可在VC6.0环境下调试,可修改其中注释部分以观察运行步骤-Eight queen problem, the recursive division algorithm and the initial integration of environment in the VC6.0 debugger to modify one part of the Notes in order to observe the operation of steps
queen.tar
- 八皇后问题的代码，有详细的注释，运行后可以给出八皇后问题的所有92个解。-Eight queen problem code has detailed notes, running eight queen problem can give all the 92 solutions.
queen
- 八皇后C++递归实现 以及AKM的C++实现-Eight Queen' s C++ recursive implementation as well as the AKM' s C++ implementation
eight-queen
- 在plt schenme 下用scheme函数式程序语言所写的八皇后问题，基于一个特殊的框架-At scheme using plt schenme Functional programming language written by the Queen' s eight questions, based on a special framework
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
eight-queens
- 另一种八皇后算法，根据数字标记，得出最佳的答案-An eight-Queen algorithm
eight-queen
- 八皇后的源代码，自己写的，可以运行，结果正确，而且一切正常，代码简洁-Eight queens of the source code, write your own, you can run, the results are correct and everything is normal, simple code
queen
- 用枚举法解八皇后问题， 在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-Use enumeration method solution eight queen, in 8 x8 lattice chess put on eight queen, to make it can t attack each other, i.e., any two queen cannot in the same column with
eight-queen-problem
- 以一个很巧妙的递归算法实现8皇后问题，该递归算法思路很独特，是初学者一个很好的借鉴-To a very clever recursive algorithm resolve eight queen problem .
eight-queens-problem
- 解决八皇后问题：即在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-Solve the eight queens problem: that is placed on a 8X8 grid chess eight Queen, so that it can not attack each other, that is, any two Queens are not in the same line, same column
eight-queen
- VC++6.0实现八皇后问题 包含说明文档-VC++6.0 eight queens problem contains documentation
eight-queen
- 用回溯法，实现八皇后问题的程序，通过矩阵符号显示每种布局-Procedures to achieve the eight queens problem
eight-queen
- 这是关于八皇后问题的求解代码，运用数据结构中的堆栈思想，逐一分析可能的情况，求出最后的答案-the code of eight queen ,it s about data struct
QUEEN
- EIGHT QUEEN EIGHT QUEEN
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
eight-queen
- 八皇后的算法问题。算法简单，易于理解，且问题能够得到有效解决。-eight queen
eight-queen
- 八皇后的数据结构实现问题，内含详细注释，便于理解-The data structure of eight queen, containing detailed notes, easy to understand