搜索资源列表
N-Queen
- ： N皇后问题，在一个N×N国际象棋盘 上，有N个皇后，每个皇后占一格；要求皇后间不会出现 相互“攻击”的现象，即不能有两个皇后处在同一行、同一 列或同一对角线上。问共有多少种不同的方法。下图以4 个皇后为例，说明一个正确的解（ N是一个大于等于2并 且小于等于100的整数）-: N queens problem, a NN chess disk, N-Queen, Queen of the grid requirements between each other &quo
hetmany
- rotation, queens on the chess. size n x n algorytm: Las Vegas
queens
- 一个使用greedy search算法实现的N个queen排列的程序。用星号代表国际象棋中的queen。随机生成布局后，显示每次移动，最后使queen不能互相攻击。即都不在相同的行，列和对角线。-A greedy search algorithm using the N-a queen arranged procedure. Behalf of the international chess with an asterisk in the queen. Randomly generated la
NQueen
- N皇后问题的人工求解和自动求解实现，有详细的课件。-N Queens Problem Solving manual and automatic solving to achieve, detailed courseware.
QueenN
- 国际象棋棋盘中的N皇后问题，不少朋友请知道吧？在一个NXN的国际象棋棋盘中摆n个皇后，使这Ｎ个皇后不能互相被对方吃掉，你知道应该怎么做么？怎么个摆法？要想知道答案，就解读一下本代码吧。-Chess board in the N queens problem, many friends you know? In a NXN chess board in the place n queens, so that the N queens can not eat each other by the ot
EightQueen_bcb6
- (This is Borland C++Builder version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including
EightQueen_java
- (This is Java version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have wo
EightQueen_vb
- (This is Visual Basic 6 version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gaus
EightQueen_vs2008
- (This is VS2008 version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have
DrawingBoard
- 能实现基本图形的绘制功能，能对图形的基本属性进行编辑，如颜色设置或填充文本字体字号等 -n queens problem N queens problem is a classical problem in a NXN get on the board to place N queens, one per line, and it can not attack each other (in the same column, on the same line, the same oblique Q
N-Queens
- PHP implementation of the N-Queens problem
Desktop
- 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 checkerboa
Knight
- VC++实现骑士巡游、N皇后和搬山游戏的代码，包括详细算法说明文档，经典好用。-VC++ implementation Knight Parade, N Queens and move mountains of the game code, including detailed algorithm documentation, classic easy to use.
n-queen
- 在n×n的棋盘上摆放n个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上。-Placed on board nn n queens, it can not attack each other, that any two queen can not be on the same line, same column or diagonal.
QT_N_queen
- N皇后问题求解工具。能够求解出4—9皇后的所有解，类封装的。图形界面-N Queens problem solving tools. Be able to solve all the solutions of 4-9 Queen of the class package. Graphical interface
Queen
- n*n的棋盘上放置彼此不受攻击的n个皇后，按国际象棋规则可知：皇后可以攻击同行同列同斜线的棋子-n* n chessboard placed on each other from attack of the n-Queens, according to chess rules we can see: Queen can attack the peer-pawn with the column with a slash
N_queen
- 本代码可以实现n皇后的处理，输出总共的方案个数和具体的皇后布局-This code can achieve n-queens of processing, the output total number of programs and specific layout of the Queen
N_QUEENS
- N皇后问题，暴力搜索的解法，效率一般，欢迎交流-N queens problem, solution, violent searching efficiency in general, welcomed the exchange of
N_QUEENR.C
- This a game about N Queens problem on the chess board with some tricks in C programming.-This is a game about N Queens problem on the chess board with some tricks in C programming.
N huanghou
- 国际象棋中皇后可以在横、竖、斜线上不限步数地吃掉其他棋子。如何将N个皇后放在一个国际象棋的棋盘上（有8 * 8个方格），使它们谁也不能被吃掉！这就是著名的八皇后问题。我们现在扩展一下，对于某个满足要求的N皇后的摆放方法，定义一个皇后序列与之对应，即{(x1,y1),(x2,y2)…(xN,yN)}，其中(xi∈[1,N]，yi∈[1,N],N∈[4,16]),其中(xi,yi)为相应摆法中第i个皇后所处的坐标（行数和列数）。那么需要针对这个序列进行检测，检测序列给定的皇后们是否存在可以相互吃掉的