搜索资源列表
8Queendiguisuanfa
- 一个八皇后Java程序代码，改进后的，有需要的请-an eight Queen's Java programming code, the improved, we need to look at
myAlgorithmExamplesAndExplain
- 都是自己编写的常用算法的事例,本人础作. 里面有:哈密尔顿环,皇后问题,图的着色问题,子集和数问题,树和等价问题,栈的各种用发等.-themselves are prepared by the algorithm commonly used examples, I make foundation. There are : Hamilton Central, Queen's, graphs, and several subsets, trees and equivalence, the
bhh
- 八皇后问题的递归求解-eight of the Queen's recursive solution
8queen3555
- 八皇后问题的c语言实现-eight of the Queen's language c
bahuanghou
- 八皇后问题，能过正确解答出八皇后问题的解 共有52个 好像-8 Queen s problem, to have the correct answers to eight the solution s total of 52 seems to
8_Queens
- The program simulate an 8 Queen mathematical problem
q
- 八皇后问题的实现，vc++6.0运行环境-Queen of the achievement of the eight issues, vc++6.0 run environmental
bahuanghou
- 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-Eight queens problem is an old and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth c
Matlab-file
- SA algorithm for solving n-Queen problem
code
- 八皇后问题，改变宏之后可以直接实现任意皇后的，数据结构入门经典题-Eight queens problem, then you can directly implement any changes in the macro queen, data structures portal classic title
N皇后
- 八皇后问题，是一个古老而著名的问题，是回溯算法的典型案例。该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出：在8×8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。(The eight queen problem, an old and famous problem, is a typical case of backtracking algorithms. It is put forward the internationa