搜索资源列表
monicuihuosuanfa
- 不同算法求解经典八皇后问题。经典问题求解算法之模拟淬火算法。-Different algorithms to solve the classic problem of eight queens. Classic problem-solving algorithm of simulated quenching algorithms.
eight_queues_prolems
- 这个程序是一个有关八皇后问题。程序主要用于实现和演示8皇后问题。-This program is an eight-queens problem on. Program is mainly used to achieve and demonstrate eight queens problem.
eightqueens
- 求解八皇后问题。可以求出规定大小的棋盘下所有的解以及解的总数。-Solving the eight queens problem. You can find the size of the board under the provisions of all solutions, as well as the total number of solutions.
EightQueensProblem
- 人工智能解决八皇后问题，上传此代码为了下载资源-Artificial intelligence to solve the eight queens problem, upload the code in order to download resources
AIRelated
- 搜索算法的示例 采用广度优先搜索算法 代码示例 八皇后问题-Examples of search algorithm using breadth-first search algorithm code sample eight queens problem
8-queens
- 用C语言简单实现八皇后，人工智能，遗传算法-Simple implementation using C language eight queens, artificial intelligence, genetic algorithms
the-problem-of-eight-queens
- 用遗传算法解决8皇后问题，并在VC++环境下调试通过，得出了正确结果，word文档说明和C源代码-With a genetic algorithm to solve 8 queens problem, and in the VC++ debugging environment through, come to the right result, word and the C source code documentation
Using-GA-to-solve-eight-queens
- 用遗传算法完美解决八皇后问题！ 有详细的注释-Using genetic algorithms to solve the eight queens problem perfectly! Detailed notes
diguisuanfa
- 不同算法求解经典八皇后问题。经典问题求解算法之深度有限递归算法。-Different algorithms to solve the classic problem of eight queens. Classic problem-solving algorithm of the limited depth of recursive algorithms.
genetic
- c++实现的遗传算法解决八皇后问题，有时候会陷于局部收敛，导致进化代数很多-c++ implementation of genetic algorithm to solve the eight queens problem, and sometimes caught up in the local convergence, resulting in a lot of evolution algebra
GA_queen
- 在matlab上用传统遗传算法解决八皇后问题。 成功率有60 吧。-matlab、GA、eight queens.
eight-huanghouwenti-yichuansuanfa
- 这是一个很经典的八皇后问题，利用C++，遗传算法计算的-This is a classic eight queens problem C++, genetic algorithm
Queen
- 八皇后问题的求解，使用人工智能中的最优路径方法-Eight Queens Problem, the use of artificial intelligence methods in optimal path
queue
- 八皇后问题的求解，输出八皇后的九十二种解法-Solving the eight queens problem, the output of the eight Queen' s ninety-two kinds Solution
queen
- 八皇后问题，利用回溯法找到互不攻击的八个皇后的位置，给出所有的情况，可以选择皇后的个数。-Eight queens problem using backtracking to find and do not attack the eight Queen' s position, given all the circumstances, you can choose the number of queen.