搜索资源列表
8-queen
- 通过遗传算法实现八皇后的求解问题，用MFC实现可视化操作，界面很漂亮，算法是改良的遗传算法-Through the genetic algorithm for solving the eight queens problem
n_queen
- 还是用分支限界法解N皇后问题，已成功运行过。-Using branch and bound Solving N Queens, which has been run successfully over
climbling
- 爬山法和遗传算法解决n皇后问题及可视化演示。-Hill-climbing and genetic algorithm to solve n-queens problem and visual presentation.
queen
- 运用回溯法解决8皇后问题，进而可以使用本方向推广到N皇后问题。-The use of backtracking to solve 8 queens problem, in turn, can be extended to use the direction of N Queens problem.
nQueen
- n皇后问题，亦是经典算法与分析题目，通过回溯的方法，解决此问题-n queens problem, is also a classical algorithms and analysis of the subject, through the back way to solve this problem
nqueen
- 用c++语言实现n皇后问题，您可以输入N值，程序可为您实现。-With c++ Language n Queens problem, you can enter the N value, the procedure for you.
Nqueens
- This progamram desrible how put N queens on the board have size N*N Using algorithm back tracking
Desktop
- n queens problem which can print the chess board pattern
eightqueen
- 8皇后问题的算法 改算法可以扩展到N皇后的问题，不过时间会很长的-It s about the eight queens problem
queens
- 包含两个文件，一个是n皇后问题的动态搜索演示，一个是程序包，里面有n皇后问题的各种优化解法，对掌握数据结构与算法都很有好处-Consists of two documents, a problem is the dynamics of n Queen' s english presentation, a package, there are a variety of questions n Queen optimization method, the master data structu
queen_n
- 解决N皇后问题的源码及可运行程序，分析各种情况，并输出，直观，有效！-Solve the N Queens problem can be the source and run the program, analyze, and output, intuitive, and effective!
N_Queen
- N-Queens made in SST
jmsnqueens
- n queens backtracking
DancingLinks
- 在计算机科学，舞蹈链接，也被称为的DLx ，是技术建议唐纳德克努特有效地执行其算法十算法X是递归，随意性，深度优先，回溯算法，认为所有的解决方案的确切覆盖问题。一些较为著名的确切涵盖的问题包括瓦工，n皇后问题，数独。-In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. A
nqueen
- 该程序利用C++环境，实现了N皇后问题。当输入的皇后个数是13时，运行速度还相当可以。当个数增加到14的时候，运行速度就相对慢了下来，不过运行出正确的结果是没有问题的。-This process uses the c++ circumstance,and it accomplished the N Queens problem.when the input number is 13,the running speed is at a fairly rapid pace.when the inpu
simulated_annealing
- Population-based Simulated Annealing Implementation for n-Queens (UNIX/ C)-Population-based Simulated Annealing Implementation for n-Queens (UNIX/C)
FourQueen
- N皇后问题的解决方案,利用回归的方法.方法易懂-N Queens solution to the problem, using regression. Methods to understand
NQueens
- 利用回溯算法求解n皇后问题；并通过本例熟悉回溯算法在程序设计中的应用方法。-The use of backtracking algorithm to solve n queens problem and are familiar with the passage of the cases of backtracking algorithm in the program design should be applied.
NQN
- N queens problem solution in C
las
- 使用拉斯维加斯随机算法解决N皇后问题 可以以较快速度解决128皇后 甚至是256皇后问题-Use Las Vegas randomized algorithm to solve the N Queens problem can be resolved more rapid pace of 128 or even 256 Queen Queens Problem