Description: 八皇后VC图形演示，算法思想：回溯法，先在第1行放上一个皇后，然后在第2行合适的位置放上一个皇后，依次类推，如果8行都放满了，说明找到了一个解，如果第好第i行的皇后后，第i+1行找不到合适的位置，这时就回到第i行，把第i行的皇后放到下一个位置，继续尝试下一行。如此反复，知道找到所有的解。注意，这种算法找的解可能有等价的，某些解可由别的解经过旋转棋盘得到。-visual demostration in vc of eight queens problem.
algorithm: backtracking.
First, put a queen on first line then find a suitable position on 2nd line for next queen, and so on. When all eight lines have queens, it means we have find a solution. If we put the i-th queen, but can find a suitable position on the (i+1)th line, then back to the ith line and move the queen on the ith line to next suitable position and move on to the next line. Repeat this until we have found all the solutions. Note:By this mean, some solutions maybe equivalent to others, some can be acquired by the rotation of other solutions. Platform: |
Size: 52224 |
Author:huwu |
Hits:
Description: 数据结构算法：回溯法编程寻找八皇后问题的所有解，使用语言C/C-algorithm data structure : backtracking programming for the Queen's eight all solutions, the use of language C/C Platform: |
Size: 6144 |
Author:王卫国 |
Hits:
Description: 所谓八皇后问题（Eight Queens Problem），是在8*8格的棋盘上，放置8个皇后。要求每行每列放一个皇后,而且每一条对角线和每一条反对角线上最多只能有一个皇后，这是一个典型并行算法，C语言实现。-The so-called Queen s the issue of eight (Eight Queens Problem), in the 8* 8 grid of the chessboard, 8 Queen s place. Requirements of each line of each column, one Queen, and a diagonal line of each and every anti-diagonal can only have a Queen, this is a typical parallel algorithm, C language. Platform: |
Size: 4096 |
Author:chj |
Hits:
Description: 该程序用模拟退火算法实现了对八皇后不相冲突的位置算法。-The program simulated annealing algorithm for the eight queens do not conflict with the location algorithm. Platform: |
Size: 1024 |
Author:张春敏 |
Hits:
Description: 一些很经典的算法！！！包括八皇后问题和背包问题，排列组合问题和数字拆分问题等.-Algorithm for some very classic! ! ! Including the eight queens problem and the knapsack problem, permutation and combination problems and digital split issues. Platform: |
Size: 693248 |
Author: |
Hits:
Description: 通过遗传算法实现八皇后的求解问题，用MFC实现可视化操作，界面很漂亮，算法是改良的遗传算法-Through the genetic algorithm for solving the eight queens problem Platform: |
Size: 1906688 |
Author:Bill Gates |
Hits:
Description: 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-Eight queens problem is an old and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss in 1850: Under 8X8 grid placed eight on the international chess queen, so that it could not attack each other, that any two Queens can not in the same row, same column or the same slash on the question of how many pendulum method. Platform: |
Size: 125952 |
Author:刘超群 |
Hits:
Description: 用c语言在相应环境中实现八皇后算法的演示-Using c language in the appropriate environment to achieve a demonstration of Eight Queens Algorithm Platform: |
Size: 1024 |
Author:朱宁庆 |
Hits:
Description: 八皇后问题，金币阵列问题，马的哈密顿周游，字典序排列，双色汉诺塔等经典算法的简单解决，尤其适合初学者参考。-Eight Queens problem, gold array of issues, horse Hamiltonian tour, arranged in lexicographic order, color and other classic Tower of Hanoi algorithm is simple to solve, especially for beginners reference. Platform: |
Size: 6144 |
Author:jqk |
Hits:
Description: 八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。计算机发明后，有多种方法可以解决此问题。
可以通过更改程序中define 的n 的值将其改为任意个数的皇后问题
-Eight queens problem is an ancient and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss 1850: Under the 8X8 grid placed on the eight chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same slash and asked how many kinds of pendulum method. That there are 76 kinds of the Gaussian program. 1854 in Berlin of the chess magazine published in 40 different kinds of solutions, and later was used graph theory methods for solving the 92 kinds of results. After the invention of the computer, there are several ways to solve this problem. Can define the program by changing the value of n changed it to an arbitrary number of queens Platform: |
Size: 240640 |
Author:kyle |
Hits:
Description: 八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。计算机发明后，有多种方法可以解决此问题。-Eight queens problem is an ancient and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss 1850: Under the 8X8 grid placed on the eight chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same Slash and asked how many kinds of pendulum method. That there are 76 kinds of the Gaussian program. 1854 in Berlin of the chess magazine published in 40 different kinds of solutions, and later was used graph theory methods to solve the 92 results. After the invention of the computer, there are several ways to solve this problem. Platform: |
Size: 343040 |
Author:陈财雄 |
Hits:
Description: 著名的八皇后问题，是回溯算法的典型例题。该问题是19世纪著名的数学家高斯1850年提出：在8*8格的国际象棋上摆放8个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-The famous Eight Queens problem, backtracking algorithm is a typical example. The problem is the famous 19th century mathematician Gauss 1850: Under the 8* 8 grid placed on 8 chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same diagonal, asked how many kinds of pendulum method. Platform: |
Size: 11264 |
Author:毛凯 |
Hits:
Description: 用遗传算法解决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 Platform: |
Size: 20480 |
Author:paradise |
Hits:
Description: 八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。计算机发明后，有多种方法可以解决此问题。
-Eight queens problem is an ancient and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss 1850: Under the 8X8 grid placed on the eight chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same slash and asked how many kinds of pendulum method. That there are 76 kinds of the Gaussian program. 1854 in Berlin of the chess magazine published in 40 different kinds of solutions, and later was used graph theory methods to solve the 92 results. After the invention of the computer, there are several ways to solve this problem. Platform: |
Size: 1024 |
Author:LJJ |
Hits:
Description: 分治法求解八皇后问题，一个简单的分治法应用算法。-Divide and conquer method to solve the eight queens problem, a simple application of divide and conquer algorithm. Platform: |
Size: 13312 |
Author:李俊炜 |
Hits:
Search - Eight Queens Algorithm