Description: 用VC编写的N皇后摆法动态演示程序，已经较为完美！欢迎下载指导！-A N queen game dynamic demonstration program write in VC, already perfect. please come and download! Platform: |
Size: 31682 |
Author:王哲 |
Hits:
Description: 用VC编写的N皇后摆法动态演示程序，已经较为完美！欢迎下载指导！-A N queen game dynamic demonstration program write in VC, already perfect. please come and download! Platform: |
Size: 31744 |
Author:王哲 |
Hits:
Description: n皇后问题求解(8<=n<=1000)
a) 皇后个数的设定
在指定文本框内输入皇后个数即可,注意: 皇后个数在8和1000 之间(包括8和1000)
b) 求解
点击<Solve>按钮即可进行求解.
c) 求解过程显示
在标有Total Collision的静态文本框中将输出当前棋盘上的皇后总冲突数.
当冲突数降到0时,求解完毕.
d) 求解结果显示
程序可以图形化显示8<=n<=50的皇后求解结果.
e) 退出程序,点击<Exit>即可退出程序.-n Queens Problem Solving (8 <= n <= 1000) a) Queen number of settings in the designated text box to enter the Queen s Number, Note: Queen s number in between 8 and 1000 (including 8 and 1000) b) Solving <Solve> Click button to solve. c) the solution process displayed in the Total Collision marked the static text box will output the current Queen s chessboard the total number of conflicts. When the conflict reduced the number of 0:00, finished solving. d) The results showed that the procedure can solve the graphical display 8 <= n <= 50 to solve the results of the Queen. e) withdraw from the program, click <Exit> to withdraw from the program. Platform: |
Size: 128000 |
Author:jiangtao |
Hits:
Description: n皇后问题的C语言实现,有图形界面的,非常之经典的程序,用的是回溯法-n s C language issues, there are graphical interface, and very classic procedure, using a backtracking Platform: |
Size: 27648 |
Author:wen |
Hits:
Description: N皇后可视化演示程序，动态演示N皇后回溯过程，用MFC编的，直观、简单。-N Queen visual demonstration program, the dynamic presentation N Queen back in the process of using MFC code, intuitive and simple. Platform: |
Size: 1989632 |
Author:chenlong |
Hits:
Description: 八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。计算机发明后，有多种方法可以解决此问题。
可以通过更改程序中define 的n 的值将其改为任意个数的皇后问题
-Eight queens problem is an ancient and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss 1850: Under the 8X8 grid placed on the eight chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same slash and asked how many kinds of pendulum method. That there are 76 kinds of the Gaussian program. 1854 in Berlin of the chess magazine published in 40 different kinds of solutions, and later was used graph theory methods for solving the 92 kinds of results. After the invention of the computer, there are several ways to solve this problem. Can define the program by changing the value of n changed it to an arbitrary number of queens Platform: |
Size: 240640 |
Author:kyle |
Hits:
Description: N皇后的C#实现，可以自定义输入皇后数，并智能显示出皇后的N中方案。-N-Queens of the C# implementation, you can customize the number of input Queen, and the N-smart show in Queen s program. Platform: |
Size: 2082816 |
Author:xiam |
Hits:
Description: N皇后的C++实现，可以自定义输入皇后数，并智能显示出皇后的N中方案。-N-Queens of the C++ implementation, you can customize the number of input Queen, and the N-smart show in Queen s program. Platform: |
Size: 3672064 |
Author:xiam |
Hits:
Description: 8皇后的C#实现，可以自定义输入皇后数，并智能显示出皇后的N中方案。-N-Queens of the C# implementation, you can customize the number of input Queen, and the N-smart show in Queen s program.-8 Queen' s C# implementation, you can customize the number of input Queen, and the N-smart show in Queen' s program.-N-Queens of the C# implementation, you can customize the number of input Queen, and the N-smart show in Queen s program. Platform: |
Size: 8192 |
Author:hanlu xiao |
Hits:
Description: 河内塔
费式数列
巴斯卡三角形
三色棋
老鼠走迷官（一）
老鼠走迷官（二）
骑士走棋盘
八个皇后
八枚银币
生命游戏
字串核对
双色、三色河内塔
背包问题（Knapsack Problem）
数、运算
蒙地卡罗法求 PI
Eratosthenes筛选求质数
超长整数运算（大数运算）
长 PI
最大公因数、最小公倍数、因式分解
完美数
阿姆斯壮数
最大访客数
中序式转后序式（前序式）
后序式的运算
关于赌博
洗扑克牌（乱数排列）
Craps赌博游戏
约瑟夫问题（Josephus Problem）
集合问题
排列组合
格雷码（Gray Code）
产生可能的集合
m元素集合的n个元素子集
数字拆解
排序
得分排行
选择、插入、气泡排序
Shell 排序法 - 改良的插入排序
Shaker 排序法 - 改良的气泡排序
Heap 排序法 - 改良的选择排序
快速排序法（一）
快速排序法（二）
快速排序法（三）
合并排序法
基数排序法
搜寻
循序搜寻法（使用卫兵）
二分搜寻法（搜寻原则的代表）
插补搜寻法
费氏搜寻法
矩阵
稀疏矩阵
多维矩阵转一维矩阵
上三角、下三角、对称矩阵
奇数魔方阵
4N 魔方阵
2(2N+1) 魔方阵
对C语言的学习非常有用。-Tower of Hanoi
Fibonacci row
Pascal triangle
Three-color chess
Mice have gone astray Officer (a)
Mice have gone astray Officer (2)
Knights go board
Eight Queen
Eight of silver
Game of Life
String to check
Color, tri-color Towers of Hanoi
Knapsack problem (Knapsack Problem)
The number of operator
Monte Carlo method for PI
Eratosthenes screening and quality
Long integer arithmetic (large numbers operation)
Long PI
The greatest common divisor, least common multiple, factoring
Perfect number
Armstrong number
The maximum number of visitors
Sequence type (pre-order type) in sequence rotary
After the order type of computing
On gambling
Wash cards (random number order)
Craps gambling game
The problem of Joseph (Josephus Problem)
Collection of problems
Permutations and combinations
Gray code (Gray Code)
Produce may be the collection of
m elements of a collection of n elements in a subset of
Digital dismantling
Sort
Score Ranking
Select, insert, bubble sort
S Platform: |
Size: 64512 |
Author:李艳文 |
Hits:
Description: Background
This a classical problem. N Queens are placed on a N x N checkerboard. There should not be more than one "Queen" on the same horizontal line, nor on the same vertical, nor on the same diagonal line.
Given the size of a checkerboard N, write a program to generate all possible solutions of placing N "Queens" on the board in ascending order.
eg. Given the size of the checkerboard is 4, the possible solutions of placing "Queens" is as follow:
2413
3142
The first solution of the example above is:
Place a "Queen" at 1st column 2nd row
Place a "Queen" at 2nd column 4th row
Place a "Queen" at 3rd column 1st row
Place a "Queen" at 4th column 3rd row
Since 2413 < 3142, the ouput is sorted in ascending order.
Input
Input contains an integer N (1 <= N <= 10), the size of the checkerboard.
Output
Output all possible solutions of the given checkerboard size in ascending order. If there is no solution for the given size of the checkerboard, output NIL.-Background
This is a classical problem. N Queens are placed on a N x N checkerboard. There should not be more than one "Queen" on the same horizontal line, nor on the same vertical, nor on the same diagonal line.
Given the size of a checkerboard N, write a program to generate all possible solutions of placing N "Queens" on the board in ascending order.
eg. Given the size of the checkerboard is 4, the possible solutions of placing "Queens" is as follow:
2413
3142
The first solution of the example above is:
Place a "Queen" at 1st column 2nd row
Place a "Queen" at 2nd column 4th row
Place a "Queen" at 3rd column 1st row
Place a "Queen" at 4th column 3rd row
Since 2413 < 3142, the ouput is sorted in ascending order.
Input
Input contains an integer N (1 <= N <= 10), the size of the checkerboard.
Output
Output all possible solutions of the given checkerboard size in ascending order. If there is no solution for the given size of the checkerboard, output NIL. Platform: |
Size: 1024 |
Author:norman |
Hits:
Description: 1）编程实现n皇后算法，要求求出8皇后问题的所有解。
2）编程实现0-1背包问题的最优解。测试数据采用贪心算法一章的实验数据。
3）用图形输出中间过程。
4）在程序中添加统计扩展节点数，估计算法的复杂性。
-1) programming to achieve the queen n algorithm, the problem of all solutions to the 8 queens.
2) programming to realize the optimal solution of 0-1 knapsack problem. Test data using the greedy algorithm of the experimental data.
3) in the process of the middle process of graphic output.
4) the complexity of the algorithm is added to the program. Platform: |
Size: 10240 |
Author:陈倩 |
Hits:
Description: N皇后问题
题目描述：
在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。
你的任务是，对于给定的N，求出有多少种合法的放置方法。
输入：
共有若干测试用例，每个测试用例对应一行一个正整数N≤10，表示棋盘和皇后的数量；如果N=0，表示输入结束。
输出：
对每个测试用例输出一行一个正整数，表示对应棋盘的皇后的可行放置方案总数。-N queens problem
Subject description:
In the N* N of checkerboard placed N queens so that they do not attack each other (that is, any two Queens are not allowed in the same row, the same column, are not allowed on the board at a 45 angle diagonal border .
Your task is, for a given N, determine how many legitimate way of placing.
enter:
There are a number of test cases, each test case corresponds to a row of a positive integer N≤10, represents the board number and queens if N = 0, indicates the end of input.
Output:
For each test case output a line a positive integer representing the total number of viable placement program corresponding to the board of the Queen. Platform: |
Size: 1024 |
Author:兰志新 |
Hits:
Description: 在N*N的棋盘上放置N个皇后（n<=10）而彼此不受攻击（即在棋盘的任一行，任一列和任一对角线上不能放置2个皇后），编程求解所有的摆放方法。
【输入格式】
输入：n
【输出格式】
每行输出一种方案，每种方案顺序输出皇后所在的列号，各个数之间有空格隔开。若无方案，则输出no solute!
【输入样例】Queen.in
4
【输出样例】Queen.out
2 4 1 3
3 1 4 2
-Placed on the board of N* N N queens (n <= 10) and another against attack (ie any row of the board, and any one of any of a diagonal line can not be placed on the two queens), programmed to solve all display methods.
[Input Format
Input: n
[Output format]
Each line of output a scheme where each program sequentially output Queen column number, there are separated by a space between each number. Without the program, the output no solute!
[Sample input] Queen.in
4
Sample [output] Queen.out
2413
3142 Platform: |
Size: 1024 |
Author:qzh |
Hits:
Search - N-Queen Program In