搜索资源列表
queen
- 对N皇后问题进行优化，可以在较短时间内计算出皇后排列方法的个数-Optimized for N queens problem, you can calculate the Queen in a relatively short period of time means the number of ordered
NQueenSubset
- N皇后的排列树与子集数算法！里面是Cpp的源代码 带注释-N Queen subset of the arrangement of trees and the number of algorithms!
NQueen
- n皇后问题可以表示成n-元组(x1,…,xn),其中xi是放在第i行的皇后所在的列号。于是，解空间由nn个n-元组组成。 显示约束条件为Si={1,2,…….,n},1 i n。 隐式约束条件之一为没有两个xi相同(即任意两个皇后不在同一列上)。将其加入到显式条件中，于是解空间的大小由nn个元组减少到n！个元组。 -n queens problem can be expressed as n-tuple (x1, ..., xn), where xi i
OUT
- this a simple solution of n queen problem of AI-this is a simple solution of n queen problem of AI
Queen
- 使用递归算法解决n皇后问题，可供初学递归者参考-The use of a recursive algorithm to solve the n queens problem, for beginners who refer to the recursive
acmmoban
- acm 模板，数论，图论，各种模板，最大字段和，N皇后模板，欧拉函数-acm templates, number theory, graph theory, a variety of templates, the largest field and, N Queen template, the Euler function
nqueensquestion
- 可以对n皇后问题进行全面的实现，求出n皇后有多少种解法-N queens problem can be to achieve a comprehensive, calculate how many kinds of solution n Queen
Queen
- Queen，用回溯法递归方法实现n皇后问题-Queen, with backtracking recursive method to achieve n queens problem
queue
- n皇后问题，解决n皇后的排列问题，仅限于较小的数值情况下-n queens problem, to solve the arrangement of n queen problem, limited to a smaller value cases
bahuanghou
- 经典八皇后实现 N皇后游戏C++编程，这是C++入门必学的编程案例-8 N Queen Queen classic games to achieve C++ programming, this is C++ Programming Introduction to case study will
Queen
- JAVA实现，动态规划算法解N皇后问题。
Nqueen
- n queen puzzle as you can s-n queen puzzle as you can see
1234
- 经典数据结构 N皇后 矩阵算术等~一些注视-Classical data structures such as ~ N Queen matrices some attention
NQeen
- N-Queen Problem solution
queue
- 皇后问题 在n×n格的国际象棋上摆放n个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-N × n queen problem in grid placing n chess queens on, so that it can not attack each other, that any two Queens can not in the same row, same column or on the same diagonal, asked
nqueen
- N皇后可视化演示程序，动态演示N皇后回溯过程，用MFC编的，直观、简单。-N Queen visual demonstration program, the dynamic presentation N Queen back in the process of using MFC code, intuitive and simple.
Nqueensproblem
- 题目说明： 在一个Ｎ×Ｎ的国际象棋棋盘中摆Ｎ个皇后，使这Ｎ个皇后不能互相被对方吃掉。 题目要求： （１）依次输出各种成功的放置方法。 （２）最好能画出棋盘的图形形式，并动态的演示试探过程。 （３）程序能方便的移植到其它规格的棋盘上。 -Title Descr iption: In an N × N chess board in place N queens, so that the N-Queen can not eat each other to be each
NQueensProblemBitComputingVersion
- 这个是我的作业报告，写的是UVA167题目的位运算方法，效率很高，这种N皇后的方法用到USACO上面，提交也很高效，朋友测试了一下，0.3秒-This is my job report, written by subject-bit computing is UVA167 method, very efficient, this method uses USACO N Queen above, the author Ye is efficient, friends, test it, 0.3 s
queen
- 本程序应用c++语言，很好地实现了n皇后问题。-The program application c++ language, it is very well n queens problem.
queen
- 实现N皇后的问题，主要是利用回朔算法，觉得挺好，和大家分享-N Queens problem to achieve, mainly using retrospective method, I feel very good, and share