搜索资源列表
eight queens
- 一种新的八皇后问题解决方案，用矩阵来表示皇后们的位置-a new eight Queens solutions matrix to express their position at Queen's
8-queen
- 通过遗传算法实现八皇后的求解问题，用MFC实现可视化操作，界面很漂亮，算法是改良的遗传算法-Through the genetic algorithm for solving the eight queens problem
eightqueen
- 8皇后问题的算法 改算法可以扩展到N皇后的问题，不过时间会很长的-It s about the eight queens problem
eightqueens
- 用 Scheme 来解决八皇后问题。八皇后问题：在 8*8 的棋盘上放置彼此不受攻击的 8 个皇后。按照国际象棋的规 则皇 后可以攻击与之处在同一行或同一列或同意斜线上的棋子。找出所有合法的 使8 个皇后 彼此不受攻击的放置方法。1 ）除了完成 queens 的定义之外 ， 给出一个打印输出过程 print-queens-Scheme used to solve the problem of the eight Queen' s. 8 Queen' s problem: In the
eightqueens
- 主要用c++来解决八皇后问题，非常有效.-to deal with the problem of eight queens
N_Queens
- The N queens puzzle is the problem of putting N chess queens on an n×n chessboard such that none of them is able to capture any other using the standard chess queen s moves. The queens must be placed in such a way that no queens would be
06413407
- 在10乘10的棋牌上进行八皇后排列,并输出排列情况和种类-10 x 10 8 Queens on a chess arranged and the arrangement of the output and variety of
n_queen_problem
- 在VC6.0环境下实现的n皇后问题，供需要的朋友参考-In the VC6.0 environment to achieve n-queens problem, for a friend in need for reference
10-Queens
- 10 queen s solution puzzle for 10*10 board with 10 Queens. Here you will find all 724 possible solutions and 92 unique solution. Developed in VB.NET
queens.c.tar
- linux平台下利用curse库N 皇后问题解决方案-The famous N-Queens Solver
prolog
- here are some prolog programs like armstrong no. ,tower of hanoi , sorting of different types,monkey-banana problem , Queens problem,etc
EiQueen
- 用C语言实现国际象棋中的八皇后问题，给出第一个皇后所在的位置，程序输出所有的正确解法。-Using C language in the Eight Queens chess problem, given the location of the first queen, the program outputs the correct solution for all.
N-Queens
- 软件架构的N皇后问题，这个算法效率比较高-Software architecture of the N queens problem, this algorithm is more efficient
3
- The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard such that none of them are able to capture any other using the standard chess queen s moves. The queens must be placed in such a way that no two queens attack e
eight-queens-problem
- eight queens problem；e ight queens problem；e ight queens problem；e ight queens problem；e ight queens problem；eight queens problem；-eight queens problem；
Eight-Queens
- 八皇后问题，给出皇后的个数，会得出满足条件的方法，还会显示每种摆法-Eight Queens problem, given the number of Queens, will come to meet the conditions of the method, but also show each pendulum method
Eight-Queens-code
- 介绍了用回溯的方法解决八皇后问题。通过改变参数，还能扩展解决N皇后问题-Back method to solve the eight queens problem. By changing the parameters, but also extended to solve the N queens problem
Eight-queens-problem
- C语言版八皇后问题，里面包含源代码，能运行。-C language version of the eight queens problem, which contains the source code can run.
eight-queens
- c++解决八皇后问题，用数学方法实现,不是枚举法。可以正确找出96组全解和12组无重复解。-c++ solve the eight queens problem using mathematical methods to achieve, not enumeration method. Can correctly identify 96 sets of solutions and 12 without repeating solutions.
eight-queens-problem
- 解决八皇后问题：即在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-Solve the eight queens problem: that is placed on a 8X8 grid chess eight Queen, so that it can not attack each other, that is, any two Queens are not in the same line, same column