搜索资源列表
bahuanghouwent
- 此源码是用C++语言编写的八皇后问题小程序。-this source is the C language 8 Queens small programs.
14230829
- 解决如何用vc实现八皇后问题，但不能实现n皇后的问题。-address how to achieve eight vc Queen's, but can not be achieved n Queen's problem.
Queens_loyo
- 一个使用Java语言编写的图形界面八皇后问题的小程序。使用eclipse开发环境。-a Java language prepared by the Queen's graphical interface of eight small programs. Use eclipse development environment.
huanghou2
- 八皇后问题的一个小程序，可以实现选择皇后数量，有友好的界面。 -8 Queen of a small program, can achieve a number of Queen's choice, a friendly interface.
Nhuanghou
- 皇后问题的求解,你可以求3个或4个或5个,六个-Queen problem solving, you can help three or four or five, six, etc.
8皇后问题
- 解决8皇后问题的小程序-solve the problem of the small Queen's procedures
8皇后
- 能够实现8皇后问题，其算法比较好-to achieve eight Queen's, the algorithm is better
bahuanghouwtdejavashixian
- n皇后问题算法。 * 把棋盘看成一个坐标系，以左下角为原点（0,0)。坐标系的每个点为一个Point类。 * 每个皇后为一个皇后对象Queen。 * 判断一个点的坐标是否在，一个皇后控制的范围的函数为Queen.isUnderControl(point)。 -n Queen's Algorithm. * Chessboard as a coordinate system to lower left-hand corner of the origin (0,0). T
2003011273project5
- Java小程序两个： 1.输入五个同学的成绩，并将这五个数保存到文件“data.txt”中。然后再编写一个程序：从“data.txt”中读取这五个成绩，计算他们的平均数，然后从小到大排序并输出这五个人的成绩。 2.将八皇后问题的所有界保存到文件“Queen.txt”中。-Java applet 2 : 1. Importation of five students achievements, This number will be five to preserve documents &
mpi
- 《并行算法实践》附带的mpi源程序，包括求解八皇后问题、货郎问题等的38个mpi并行程序-"parallel algorithm practice," incidental mpi source, including eight for Queen's, Peddlers issue of 38 mpi Parallel Programming
8_queens
- 8皇后问题的圆满解决 应该算一个比错的算法了 原创的！-eight of the Queen should be resolved satisfactorily than the wrong one count of the original algorithm!
8QUEENS-BEST
- 8皇后问题最好的算法,请登陆本站才能下载哦!这是最优的解法哦!-8 Queens best algorithm, please log onto the site can download! This is the best solution!
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
bhh1
- 八皇后问题源代码，简单易懂，适合经验较浅者使用-8 Queens source code is simple to understand and suitable for inexperienced users
N皇后问题的回溯法,非递归实现
- 这是N皇后问题的回溯法,非递归实现.此算法对初学者有难度,最好去参考书.这个问题也是回溯法的经典例题,推荐自己去实践.还有,我贴的程序在TC3.0下调试通过.-This the Queen's retroactive law, non - recursive. This algorithm is difficult for beginners, to the best reference books. This issue is also back classic example of
并行N皇后问题
- 利用OPENMP的方法解决N皇后问题！
n后问题
- n皇后问题
Eight_Queens
- 使用MIPS指令实现八皇后问题的求解，代码较精简(Solve the Eight Queens Problem with MIPS)
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