搜索资源列表
n后问题
- 在 n 行 n 列的国际象棋棋盘上，最多可布n个皇后。 若两个皇后位于同一行、同一列、同一对角线上，则称为它们为互相攻击。 n皇后问题是指找到这 n 个皇后的互不攻击的布局。 n 行 n 列的棋盘上，主次对角线各有2n-1条。-n n trip out of the international chess board, the maximum n Queen's cloth. If two at the same Queen's visit, the same s
eight queens
- 一种新的八皇后问题解决方案，用矩阵来表示皇后们的位置-a new eight Queens solutions matrix to express their position at Queen's
pb91b6
- Queen and King 問題 : does some checking related to the movement of the queen. -Queen and King : does some checking related to the movement of th e queen.
8Queens
- 八皇后经典问题 输出任一种解-eight Queen's classic output as a Solution
nqueenlvb
- 这个是八皇后问题的回溯加las vegas算法，为了测试两种算法结合在一起的效率。-This is the Queen's eight retroactive increase in las vegas algorithm, To test two algorithms combined efficiency.
c++eight
- c++八皇后问题 给出了解决八皇后问题的c++代码，可以供大家学习用-c eight of the Queen's problem is to solve the problem of the Queen's eight c code can be used for all to learn
ado.netTest
- 风格 搞活感叹号皇太后活动发挥活动发挥-style enlivened Exclamation mark Queen Mother activities play activities play
皇后问题2
- 皇后问题解法任意皇后可解-Solutions arbitrary Queen's Queen's solvable
n皇后问题
- n皇后问题的C++实现-n Queen's realization of C
pascal_bahuanghou
- 八皇后问题——pascal实现 及回朔思想-eight Queen's problems -- and to achieve pascal thinking Schomburg
eight_queue
- 用c++处理把皇后问题-with issues to address, Queen's
queenn(N皇后问题)
- 在一个Ｎ×Ｎ的国际象棋棋盘中摆Ｎ个皇后，使这Ｎ个皇后不能互相被对方吃掉。-in an N N chess board wavers N Queen so that the N-Queens that can be eaten by the other side.
QUEues皇后问题
- 此程序完成N皇后问题。大家可以互相讨论学习。-N Queen's problem. We can learn from each other discussions.
queen
- 实现八皇后的可视化，皇后数量要小于12，皇后太大运行会太慢。-xgdf sdfsf sdf sdfsdfs sdf
qqq
- 很常见的N皇后问题，用矩阵的形式画除图， 1表示皇后的位置-Very common N-Queens problem, a matrix in the form of paintings, inter diagram 1 that the location of the Queen
Naueen
- 实现N皇后的搜索界面化设计，可以看到各个步-Queen of the search interface to achieve N Design
N-Queen
- N皇后问题的演示程序，清晰的图形界面显示-N Queens problem demo, clear graphical display
queen
- 用枚举法解八皇后问题， 在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-Use enumeration method solution eight queen, in 8 x8 lattice chess put on eight queen, to make it can t attack each other, i.e., any two queen cannot in the same column with
queen
- java图形界面，程序清晰的演示了八皇后的找到途径，让初学者明白八皇后的算法。-java graphical interface, the program clearly demonstrates the eight Queen' s find ways for beginners to understand the eight queens algorithm.
Gnnkral-Philadelphia
- N queen problem, the classic solution in Philadelphia, written in General - Search method