搜索资源列表
n-queen
- n-queen solution finder in perl. Works for n<20 fine, after this is starting to be a little slow.
queen
- 皇后问题，用于c++课程设计，每一个皇后可以吃掉棋盘上横、竖和对角线上的所有棋子，要求在棋盘上放入至少3个棋子-Queens problem, for c++ program design, the Queen can eat each board horizontal, vertical and diagonal all the pieces, called the board into at least three pieces
queen
- 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出： 在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上. -Eight queens problem is an old and well-known problem is a typical example backtracking algorithm. The problem is that the famous mathemati
eightqueen
- N后问题，利用OPENGL实现简单演示。-N queen problem. using opengl for simple display.
n-Queen-PRoblem
- 使用Hopfield人工神经网络解决"N-皇后"问题-A copy of source code about how to resolve N-Queen problem with Hopfield artificial neural network.
Queen
- N皇后问题,hopfield,回溯法，人工智能-N-Queen hopfield，huisu
Queen
- 8*8的国际象棋盘，每行放一个皇后，且每行每列不重复，递归解决八皇后问题-8* 8 chess set, put a queen per row, each column and each row will not repeat, the eight queens problem
Queen
- 8*8的国际象棋盘，每行放一个皇后，保证每行每列只有一个皇后，非递归方法解决八皇后问题-8* 8 chess set, put a queen each line to ensure that each row and each column has only one queen, non-recursive method to solve the eight queens problem
eight-queen
- 著名的八皇后问题，是回溯算法的典型例题。该问题是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: U
tabu
- tabu search for resolving the problem of 8 queen in chess table.
Queen-of-the-board
- 皇后棋盘算法和C++程序实现。横行纵行斜行不能摆两个以上的皇后。-Queen board algorithms and C++ Program. Transverse oblique longitudinal Queen can not put more than two.
8-Queen
- C++8皇后源代码 MFC非常好用的程序哦-C++8 Queen MFC source code is very easy to use program oh
eight-queen
- 八皇后是个古老而有趣的游戏，是由高斯于1850年首先提出的。 要求在国际象棋的棋盘上放置八个皇后，使其不能相互攻击，即任意两个皇后不能处于 棋盘的同一行、同一列和同一条对角线上。试问有多少种放法？-Eight Queens is an old and interesting game, by Gauss in 1850 first proposed. Requirements in place on the chess board eight queen, it can not atta
eight-queen
- 该程序是一个实现查找八皇后的问题求解的程序，在vc 中编写的-this program is write for eight queen
Queen
- N皇后的C#实现，可以自定义输入皇后数，并智能显示出皇后的N中方案。-N-Queens of the C# implementation, you can customize the number of input Queen, and the N-smart show in Queen s program.
8-Queen
- 这是一个关于8皇后的源代码，是用C语言开发，会输出92中结果。-This is a 8 Queen' s source code is written in C language development, will result in the output 92.
eight-queen
- 八皇后问题19世纪著名的数学家高斯于1850年提出的。他的问题是：在8*8的棋盘上放置8个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列、同一斜线上。请设计算法打印所有可能的摆放方法。-8 queens problems in the 19 th century famous mathematician gauss put forward in 1850. His problem is: in 8* 8 board placed eight queen, to make it c
eight-queen
- 八皇后问题及n皇后问题求解,数据结构的经典算法，及课程设计的需要-eight queen problem .data sructment problem
N-queen-problem
- 在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。 你的任务是，对于给定的N，求出有多少种合法的放置方法。 -In N* N checkerboard of placed N a queen, so they don t attack each other (that is, any two queen not allowed in the same row, the same listed, and n
queen
- 用MFC实现八皇后问题，可多皇后，比如四皇后、十六皇后等，可通过输入参数实现-Using MFC to solve eight queens problem, and more Queen, for example four Queens, sixteen Queen, etc., can be achieved through the input parameters