搜索资源列表
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 .
REINAS-NUEVO
- Solution to the 8 queen problem using genetic algorithms in c-Solution to the 8 queen problem using genetic algorithms in c++
Eight-Queen
- 8皇后问题的C＋＋算法-8 empress question C++ algorithm -8 queens problem C++ algorithms-8 empress question C++ algorithm
queen
- 输出8皇后问题所有结果。每个结果第一行是No n：的形式，n表示输出的是第几个结果；下面8行，每行8个字符，‘A’表示皇后，‘.’表示空格。不同的结果中，先输出第一个皇后位置靠前的结果；第一个皇后位置相同，先输出第二个皇后位置靠前的结果；依次类推。 -Output all the results of the 8-queens problem. The first line of each result in the form of a No n: n output is several r
8-queen
- 八皇后的问题的C++简单算法 大学课程作业-Eight queens problem C++ simple algorithm college course work
8queen
- 在标准国际象棋的棋盘上（8*8格）准备放置8只皇后-Ready to be placed in the standard chess board (8* 8 squares) 8 Queen
8vazzir
- 8 queen code with c-8 queen code with c++
StrongChess
- 8 queen problem with java
8_queen
- this sorce code is the code of 8-queen which is written with java language. I hope it will be good.
di-gui-qiujie-8-Queen
- 递归求解八皇后问题。C语言程序，数据结构课程作业，注释完全，简单易懂，亲测可用。-Recursively solving the eight queens problem. C language programs, data structures course work, notes completely, easy to understand, pro-test is available.
algorithm
- 1、Bellman-FordJ解决单源最短路径问题 c++实现 2、所有点之间最短路径问题 3、8皇后问题回溯法 4、0-1背包问题 回溯法 -Bellman-Ford algorithm All-pairs shortest path (choose one from the three algorithms) 8-queen problem (back backing) 0-1 knapsack problem (back tracking)
Chess
- Solving Classic 8 queens dilemma in matlab, In chess, a queen can move as far as she pleases, horizontally, vertically, or diagonally. A chess board has 8 rows and 8 columns. The standard 8 by 8 Queen s problem asks how to place 8 queens on an ordina
queen
- 在一个8×8国际象棋盘上，有8个皇后，每个皇后占一格；要求皇后间不会出现相互“攻击”的现象，即不能有两个皇后处在同一行、同一列或同一对角线上。问共有多少种不同的方法。-On an 8 × 8 chessboard, there are eight queens, each representing one cell Queens requirement does not appear among mutual Queen "attack" phenomenon, which can not h
eightqueen
- 经典问题 8皇后,使用深度优先搜索算法。-8 Queen classic problem, using a depth-first search algorithm.
genetic
- 8 queen program solution , using genetic algorithm,by matlab
programming-8
- 八皇后的回溯法实现，在控制台程序下输出所有可能的结果-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
8queen
- 8皇后问题，用回溯法来解决问题，内容包含cpp源代码，用c++编写-8 queen problem.
MyEightQueen
- 8皇后的演算法 練習遞迴寫法,每個棋子的橫列、直行都不能相遇-8 Queen recursive algorithms written exercises, each piece of course, can not be met straight