搜索资源列表
quene
- 这是一个关于八皇后的代码-This is one of the eight Queen's code
“八皇后”动态图形的VC实现
- 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法-eight Queen's problem is an ancient and well-known problems, backtracking algorithm is a typical example.18508X8
home1work
- 微软桌着色问题a【问题】 组合问题 【问题】 填字游戏 【问题】 n皇后问题 -Microsoft tables coloring problem -- a problem [[composition problems -- crossword puzzles [n Queen's problem -- the problem
EinghtQueen
- 八皇后问题的求解 本程序是在java平台上开发完成 -8 Queen of the procedure is to solve the java platform developed
a星算发
- 人工智能的经典八皇后问题,这个算法是a*算法.利用这个算法可以解决八数码,八皇后问题等 -artificial intelligence Queen's classic 8, the algorithm is a * algorithm. Use of this algorithm can solve eight digital, 8 Queen's problems
面向对象n皇后
- 思路清晰的n皇后问题求解，采用面向对象思路编写，封装类可在其他程序中灵活调用-lucid n Queen's problem solving, object-oriented ideas to prepare, Packaging category in other proceedings flexible call
我是谁呢!!!!!!!!!!!
- 八皇后问题八哈哈大家 安放发疯安放发安放-eight Queen's 8 ha ha planted crazy we placed the installation
C语言实现的皇后问题
- n皇后问题，可以显示所有的合适路径，典型的回溯算法-n Queen's, will show you all the appropriate path, the typical backtracking algorithm
r8q
- 八皇后问题的C版本的解决方案 包括如何处理两个皇后不能在同一列、同一行以及同以斜行的判断问题-eight of the Queen's version of the C solutions, including how to deal with two Queen's not in the same series, and with the same line oblique to the question of judgment
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
shh
- 人工智能学习中常见的四皇后问题的求解程序 ，此程序通过运用穷举法进行了求解-Artificial Intelligence Learning common four Queen's problem solving process, this procedure through the use of exhaustive method of solving
eight queens
- 一种新的八皇后问题解决方案，用矩阵来表示皇后们的位置-a new eight Queens solutions matrix to express their position at Queen's
Rand_Nqueen
- 这是一个八皇后的问题，可以设置皇后数量。很经典的一个程序-This is one of the eight Queen's, Queen's volume can be set. A classic procedures
李森数据结构作业
- 文件夹中包括常用的数据结构的算法，包括二叉树的三种递归和非递归算法，染色问题，八皇后问题，深度广度遍历，约瑟夫环，数值转换，树的高度和叶子节点数，最小生成树 ，两点之间的所有路径-folder include common data structure of the algorithm, including the three binary tree recursive and non - recursive algorithm, Dyeing, 8 Queen, depth and bread
八皇后游戏源码
- 图形界面实现八皇后游戏，皇后数最大为60。-graphical interface to achieve Queen's eight games, the largest number of Queen's 60.
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.
qweewq
- 上再一个n皇后问题的说明 上再一个n皇后问题的说明-again a n Queen's on the statement of an n Queen's again the statement n a further statement of the Queen n again a statement of the Queen's again a problem n Queen's Note
c_and_java
- 演示win32的socket 通讯 八皇后的改进算法 并发Concurrency的JAVA实现 applet演示鼠标的点击时间和显示图象 手机J2ME的多线程演示-demonstration of the socket 8 Queen's communications improved algorithm with Concurrency JAVA applet demonstration mouse clicks and the time to display ima
N_Queen
- N皇后问题的优化版本，对于N＝ 13的情况可以在1秒内出结果-N Queen of the optimized version for the N = 13 can be in a give results within seconds
eightqueendisplay
- 一个用于演示8皇后的手机程序,功能简单,但是算法经典-a demonstration for the Queen's eight phone procedures, functions simple, but classic algorithm