搜索资源列表
dossier
- For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics
monicuihuosuanfa
- 不同算法求解经典八皇后问题。经典问题求解算法之模拟淬火算法。-Different algorithms to solve the classic problem of eight queens. Classic problem-solving algorithm of simulated quenching algorithms.
climbling
- 爬山法和遗传算法解决n皇后问题及可视化演示。-Hill-climbing and genetic algorithm to solve n-queens problem and visual presentation.
QUEEN
- C PROGRAM FOR 8 QUEENS PROBLEM USING BACKTRACKING
8huanghou
- 在一个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, c
eight_queues_prolems
- 这个程序是一个有关八皇后问题。程序主要用于实现和演示8皇后问题。-This program is an eight-queens problem on. Program is mainly used to achieve and demonstrate eight queens problem.
Las_vigas
- 用拉斯维加斯算法求解8皇后问题的小程序，有说明。-Las Vegas algorithm with the 8 Queens problem to a little program, has made it clear.
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.
8queens
- 8 queens problem with genetic algorithm
EightQueensProblem
- 人工智能解决八皇后问题，上传此代码为了下载资源-Artificial intelligence to solve the eight queens problem, upload the code in order to download resources
Queens.cpp
- 采用LasVegas算法解决N皇后问题,设置了stepVeags，即前stepVeags步采用随机算法放置皇后，剩下的采用回溯法放置皇后-solve the N Queens problem using LasVegas
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
N_queens
- 求解N皇后问题：把N个皇后放在一个棋盘上，每行和每列只能有一个皇后。另外，一个皇后只能在任一行、列或对角线上。要求皇后数≥100。用了两种方法，回溯法和启发式修补法。-Solve N Queen' s problem: N queens on a chessboard, each row and each column can have only one Queen. Further, only in a queen in any row, column, or diagonal. Que
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
MIT_AI_lec_03
- 麻省理工的人工智能讲义第三章 约束满足问题 介绍了各种类型的约束满足问题-AI lecture-3 of MIT talking about Constraint Satisfaction Problems (CSPs)：N-Queens problem；line labelings；Graph coloring；3-SAT； Model-based recognition etc.
NQueen
- 使用人工智能的方法和思想实现了N皇后问题。-Using artificial intelligence methods and ideas to achieve the N-Queens problem.
N-Queens
- 优化的N皇后算法，输入皇后的个数N，输出三个解，算法的时间复杂度为O（nlgn）-Optimized N queens algorithm, enter the number of the Queen N, output three solutions, the time complexity of the algorithm is O (nlgn)
N-queens-algorithm
- n皇后问题的BFS算法，算法简洁，作为初学者一看就懂，不过先看会BFS算法很重要，这比普通的动态规划速度要快很多-N queens problem BFS algorithm, the algorithm is simple, as a beginner to understand, but first look at the BFS algorithm is very important, which is much faster than the general dynamic planni