搜索资源列表
nqueens
- 用c编写的N皇后问题-used to prepare N Queens
C-NQueens
- C_NQueens Ask not what your country can do for you Ask what you can do for your country. -C_NQueens Ask not what your country can do f or you Ask what you can do for your country.
Nqueens
- N皇后问题的程序，有界面，Vv++ 6.0制作，有兴趣的可以下来
回溯法，实现nqueens
- 回溯法，实现nqueens
nqueens(localSearch)
- n皇后问题，采用局部搜索算法，普通搜索效率，内含代码。-n queens problem, using a local search algorithm, general search efficiency, containing the code.
Nqueens
- N皇后问题，N由自己输入的值来确定，然后输出所有皇后摆放的方法-N queens problem, N by their own input values to determine, and then display the output all the way to Queen' s
NQueens
- 这是一个八皇后问题的扩展，使用java实现，扩展到了多皇后，只要你输入皇后的个数，能给出所有的解。-This is an expansion of 8 Queen
Nqueens
- This progamram desrible how put N queens on the board have size N*N Using algorithm back tracking
nRainhas3
- NQueens problem. Resolved using QT Framework + c-NQueens problem. Resolved using QT Framework+ c++
NQueens
- N皇后问题的实现，用回溯法实现N皇后问题-N Queen' s problem of the realization method used to achieve N Queen' s back issues
nqueens
- nqueens program in c++ in a simple code
NQueens
- 利用回溯算法求解n皇后问题；并通过本例熟悉回溯算法在程序设计中的应用方法。-The use of backtracking algorithm to solve n queens problem and are familiar with the passage of the cases of backtracking algorithm in the program design should be applied.
Nqueens
- N queen problem in c++ coding
NQueens
- 经典的N皇后问题的实现，使用的算法是回溯法-Classic implementation of N-Queens problem, using the algorithm is backtracking
nqueens.c.tar
- n-queens algorithm source code
nQueens
- 使用C语言解决n皇后问题，包括递归和非递归的实现源码。运行环境：Linux,g-Using the C language to solve n queens problem, including the recursive and non-recursive implementation of source code. Runtime Environment: Linux, gcc
nqueens
- 分支限界法解决皇后问题，在nxn棋盘上放n个棋子，要求两个棋子不能放在同一列上-Queens branch and bound method to solve the problem, put the board in the nxn n-piece, two pieces can not be requested on the same column
NQueens
- Solves the N-Queens problem using hillclimbing.-Solves the N-Queens problem using hillclimbing.
NQueens
- nqueens 问题的QS1实现 N-皇后问题的快速局部搜索算法 1分钟可以找到75000皇后的一个解 参考：Rok Sosic and Jun Gu. A Polynomial Time Algorithm for the N-Queens Problem. SIGART Bulletin, 1(3):7-11, 1990.-Fast Local Search Algorithm QS1 nqueens problem realization // // N- Queens pro