搜索资源列表
Hill_Climbing_Searching
- solving 8-Queen problem by using hill climbing.
Queen
- Queen，用回溯法递归方法实现n皇后问题-Queen, with backtracking recursive method to achieve n queens problem
queen
- 在8*8的国际象棋的棋盘上摆8个皇后，使他们之间不能相互攻击。即任意两个皇后不能位于同一行、同一列或同一对角线上。以下为一种可能，请求出共有多少种可能。-8* 8 chess board put eight queens, so that between them can not attack each other. That any two of the Queen can not in the same row, same column or the same diagonal. The
reinas
- queen problem resolve with Tabu
Genetic
- Genetic algorithms in 8 queen problem
queen
- Linux环境下运行的N皇后C源代码下载-Running under Linux environment N Queen C source code download
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