Welcome![Sign In][Sign Up]
Location:
Search - queen

Search list

[Data structsQueen

Description: Queen,用回溯法递归方法实现n皇后问题-Queen, with backtracking recursive method to achieve n queens problem
Platform: | Size: 1464320 | Author: 草人 | Hits:

[Otherqueen

Description: 在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 following is a possible, request the total number of species may be.
Platform: | Size: 129024 | Author: 大为 | Hits:

[Windows Developreinas

Description: queen problem resolve with Tabu
Platform: | Size: 3072 | Author: marcos | Hits:

[matlabGenetic

Description: Genetic algorithms in 8 queen problem
Platform: | Size: 1024 | Author: Feroj | Hits:

[Linux-Unixqueen

Description: Linux环境下运行的N皇后C源代码下载-Running under Linux environment N Queen C source code download
Platform: | Size: 1024 | Author: qq389747955 | Hits:

[Other Gamesn-queen

Description: n-queen solution finder in perl. Works for n<20 fine, after this is starting to be a little slow.
Platform: | Size: 1024 | Author: Heto | Hits:

[Otherqueen

Description: 皇后问题,用于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
Platform: | Size: 336896 | Author: 姚静如 | Hits:

[OS programqueen

Description: 八皇后问题是一个古老而著名的问题,是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出: 在8X8格的国际象棋上摆放八个皇后,使其不能互相攻击,即任意两个皇后都不能处于同一行、同一列或同一斜线上. -Eight queens problem is an old and well-known problem is a typical example backtracking algorithm. The problem is that the famous mathematician Gauss nineteenth century, made in 1850: In the 8X8 grid on the display 8 chess queen, it can not attack each other, that any two Queens can not at the same line, same column or on the same diagonal.
Platform: | Size: 1024 | Author: wu | Hits:

[Data structsQueen

Description: 利用回溯法和栈来实现八皇后问题:在n×n的国际象棋棋盘上,安放n个皇后,要求没有一个皇后能够“吃掉”任何其他一个皇后,即没有两个或两个以上的皇后占据棋盘上的同一行、同一列或同一对角线-Use of backtracking and stack to achieve the eight queens problem: the n × n chess board, place n queens, a queen is not required to " eat" any other a queen, that is, no two or more of the Queen occupy the same row on the board, the same column or the same diagonal
Platform: | Size: 9216 | Author: wazr | Hits:

[OpenGL programeightqueen

Description: N后问题,利用OPENGL实现简单演示。-N queen problem. using opengl for simple display.
Platform: | Size: 10240 | Author: aite | Hits:

[AI-NN-PRn-Queen-PRoblem

Description: 使用Hopfield人工神经网络解决"N-皇后"问题-A copy of source code about how to resolve N-Queen problem with Hopfield artificial neural network.
Platform: | Size: 21504 | Author: bailong | Hits:

[VC/MFCqueen

Description: 求解八皇后问题的一个代码,采用的深度搜索的办法。-Eight queens problem solving a code, the use of the depth of the search approach.
Platform: | Size: 229376 | Author: kp | Hits:

[Data structseight-queen

Description: 通过堆栈结构解决著名的八皇后问题,同时也是数据结构中的典型例题-Codes for the well-known eight-queen problem
Platform: | Size: 1024 | Author: wangfuwei | Hits:

[AI-NN-PRQueen

Description: N皇后问题,hopfield,回溯法,人工智能-N-Queen hopfield,huisu
Platform: | Size: 2278400 | Author: kobe | Hits:

[Data structsQueen

Description: 8*8的国际象棋盘,每行放一个皇后,且每行每列不重复,递归解决八皇后问题-8* 8 chess set, put a queen per row, each column and each row will not repeat, the eight queens problem
Platform: | Size: 1024 | Author: fangjuan | Hits:

[Data structsQueen

Description: 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
Platform: | Size: 1024 | Author: fangjuan | Hits:

[Algorithmeight-queen

Description: 著名的八皇后问题,是回溯算法的典型例题。该问题是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: Under the 8* 8 grid placed on 8 chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same diagonal, asked how many kinds of pendulum method.
Platform: | Size: 11264 | Author: 毛凯 | Hits:

[matlabtabu

Description: tabu search for resolving the problem of 8 queen in chess table.
Platform: | Size: 2048 | Author: opio_001 | Hits:

[Data structsQueen-of-the-board

Description: 皇后棋盘算法和C++程序实现。横行纵行斜行不能摆两个以上的皇后。-Queen board algorithms and C++ Program. Transverse oblique longitudinal Queen can not put more than two.
Platform: | Size: 259072 | Author: vin | Hits:

[Data structs8-Queen

Description: C++8皇后源代码 MFC非常好用的程序哦-C++8 Queen MFC source code is very easy to use program oh
Platform: | Size: 31129600 | Author: hjkhk | Hits:
« 1 2 3 4 5 6 7 89 10 11 12 13 ... 50 »

CodeBus www.codebus.net