搜索资源列表
_QUEENS
- 八皇后程序:回溯法寻找N规模的皇后可能分配-8 : backtracking N-scale search for the Queen's possible allocation
QueueExample
- nqueen problem to solve queen
mp_simplesim.rar
- 体系机构仿真,simplescalar的多处理器版本,现在好像在simplescalar上没有下载了 作者是加拿大Queen大学的Manjikian 环境: Architecture SPARC Operating System Solaris 2 Compiler gcc,The multiprocessor extensions were conceived and implemented by Naraig Manjikian at Queen s Unive
n皇后
- n皇后-n Queen
nn
- 皇后源代码+能够实现多种功能的哦,试试吧,看看C++的力量-Queen s source code+ Able to achieve multiple functions Oh, give it a try and see C++ Strength
QiPanNHuangHou
- 由n个方块排成n行n列的正方形称为元棋盘。如果两个皇后位于棋盘上的同一行或同一列或同一对角线上, 则称为他们为互相攻击。 通过这个程序,输出使n元棋盘上的n个皇后互不攻击的所有布局。-Box formed by the n-bar n lines n chessboard square known as metadata. If the two Queen on the chessboard at the same column or row or on the same diagona
queen
- 八皇后问题解法,使用递归实现,简介化输出92组解-queen question solution
ss.awk.tar
- this a chess program processing the possibility of putting the queen the chess board-this is a chess program processing the possibility of putting the queen the chess board
queen
- Linux环境下运行的N皇后C源代码下载-Running under Linux environment N Queen C source code download
queen
- 八皇后问题是一个古老而著名的问题,是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出: 在8X8格的国际象棋上摆放八个皇后,使其不能互相攻击,即任意两个皇后都不能处于同一行、同一列或同一斜线上. -Eight queens problem is an old and well-known problem is a typical example backtracking algorithm. The problem is that the famous mathemati
nqueen.c
- linux下用c语言实现的N皇后问题,其中皇后的个数可以自己随便定义。输出所有可能的解。-n queen
four-queen-c
- 东北大学 人工智能 四皇后问题 C语言 数据结构 实验报告-Northeastern University Artificial Intelligence queens problem C language data structure of experimental reports
NQueens-using-java
- n queeen using java using java to solove n queen proplem
NQueens-using-c
- using c to solve n queen problem
Eight_queens
- 编写一个程序解八皇后问题。八皇后问题是:设法在国际象棋的棋盘上放置八个皇后,使得其中任何一个皇后所处的“行”、“列”以及“对角线”上都不能有其它的皇后-Write a program solution to the eight queens problem. Eight queens problem: trying to place eight Queens on a chess board, makes any Queen which " line" , " colum
Eight-Queen
- 历史遗留下的八皇后问题,简单的递归算法实现。-Historical legacy of the eight queens problem, a simple recursive algorithm.
nQueen101
- n 后问题,用了三种方法解决,希望和大家一起分享-three solutions for N Queen question
eatcn
- In a chess board put N queen, make this N queen cannot be eaten by the other party to each other,
3
- 编写自定义的消息队列 该消息队列不能依赖于已有库的队列,必须是自己设计实现的 该消息队列是线程安全的 该消息队列能接收CLMessage继承体系的消息 该消息队列能融入到本课程所提供的程序库中,能支持线程之间的通信(即需要提供发送消息的通信类,以及消息循环的管理类)(UESTC LINUX LiLin Homework 3)