搜索资源列表
queen
- 所谓八皇后问题（eight queens Problem），是在8*8格的棋盘上，放置8个皇后。要求每行每列放一个皇后,而且每一条对角线和每一条反对角线上最多只能有一个皇后，这是一个典型并行算法，C语言实现。
Queen
- 多线程计算、并行计算。使用MPI计算八皇后问题。主从线程结构-Calculate the problem of eight queens with MPI.
queen
- 一个用汇编写的八皇后程序，可以打印所的解，一行一个-You can print 92 Solutions to the eight queens program
queen8
- 汇编程序实现： 程序功能:用深度优先搜索法解决八皇后问题并打印结果. 列数行数分别用1-8标记.所以八皇后的位置申请了9个 调试感慨:汇编调试实在麻烦,不像C中在任何地方加个printf就可以知道 哪错了.跳来跳去的,不知哪里死循环了,实在不好调试. -Assembler to achieve: program features: Using depth-first search method to solve the eight queens prob
queen
- 汇编语言的八皇后 masm5或6.11 输出92行结果-eight queens masm5 assembly language output of 92 lines, or 6.11 the results of
eightQueen
- vc6.0，重新以图像化的方式实现经典的“八皇后”算法。-vc6.0, back to the image of the realization of the classic " eight queens" algorithm.
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
bahuanhouwenti
- 通过一个简单的程序来解决八皇后的问题，是一个比较经典的程序设计例子-Through a simple program to solve the eight queens problem is a more classic example of program design. . .
156
- 八皇后问题是一个古老而著名的问题。该问题是十九世纪著名的数学家高斯1850年提出：在8×8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-eight queens problem is an ancient and well-known problem. The problem is that the nineteenth century the famous mathematician Gauss 1850: Under th
eightPqueensPproblem
- 八皇后问题。输入第一个皇后所在的行和列，给出所有符合条件的解。输出使用0和1画棋盘-eight queens problem. Enter the first row and column where the Queen gives all eligible solution. Output board with 0 and 1 draw
queens
- 一个求解八皇后问题（任意数目皇后问题）的方法，MIPS汇编程序-A method to solve the problem of eight queens(as well as any numbers of queens),with MIPS
eightQueen
- 八皇后的老算法,特别适合c的初学者探究其算法，希望对你有帮助！-eight queens of the old algorithm, particularly suitable for beginners of c to explore the algorithm, and hope to help you!
mips_queen
- 汇编语言，实现八皇后问题，机器语言的实现-Assembly language to achieve the eight queens problem, machine language implementations
bahuanghou
- 利用栈操作实现八皇后问题求解 数据结构作业 C语言-The data structure of the C language editing eight queens problem
cPPchengxubailian
- c+程序练习，包括八皇后、杨辉三角、汉诺塔、智者生存、二分法、学生管理系统等几十个基本程序。-c+ program exercises, including eight queens, Pascal' s Triangle, Tower of Hanoi, Wise survival, dichotomy, student management system, such as dozens of basic procedures.
eightQueen
- 八皇后问题的概率算法实现，采用预先随机放若干皇后的策略，可计算超过20个皇后的情形。-The probability of the eight queens problem algorithm, using pre-random put a certain Queen strategies be calculated over the case of the 20 queens.
bahuanghou
- matlab解决八皇后，利用深度优先算法解决，广度优先，A算法-matlab to solve the eight queens, the use of depth-first algorithm to solve, breadth-first, A algorithm
bahuanghou
- 本代码主要是利用迭代和for循环来实现八皇后问题-Use a for loop iterations and achieve the eight queens
EgihtQueen
- 八皇后问题，可以顺顺利利的实现书籍上所谓的八皇后。-eight queens problem, you can smoothly books on the realization of the so-called eight queens.
8-queens
- 8皇后问题 在一个８×８的棋盘里放置８个皇后，要求这8个皇后两两之间互相都不“冲突”。-eight queens