搜索资源列表
Eight Queen.rar
- 8皇后问题的C++算法
QUEEN.rar
- N皇后游戏。
quene
- 这是一个关于八皇后的代码-This is one of the eight Queen's code
八皇后游戏源码
- 图形界面实现八皇后游戏,皇后数最大为60。-graphical interface to achieve Queen's eight games, the largest number of Queen's 60.
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
8queen2
- 国际象棋中8皇后问题算法-Algorithm of Eight queen question in chess
QUEEN
- N皇后游戏。-N empress plays.
N-QUEEN
- 在一个N×N的国际象棋棋盘中摆N个皇后,使这N个皇后不能互相被对方吃掉。 N皇后算法源码-N × N in a chess board in N months before Queen s, so that the N-Queen s was the other side can not eat each other. N Queen s algorithm source code
Queen
- 可以用于解算国际象棋中的八皇后问题,即如何排列8个皇后使之之间不能互相吃-Solver can be used for chess in the eight Queen s question, that is, how to order 8 so that between the Queen s can not eat each other
Queen
- 在一个8×8国际象棋盘上,有8个皇后,每个皇后占一格;要求皇后间不会出现相互“攻击”的现象,即不能有两个皇后处在同一行、同一列或同一对角线上。问共有多少种不同的方法-8 × 8 in a chess set, there are 8 Queen' s, Queen' s share of each cell between Queen will not be asked each other " attack" phenomenon, that is, can n
Nqueens
- N queen problem in c++ coding
n-queen
- n-queen solution finder in perl. Works for n<20 fine, after this is starting to be a little slow.
eight-queen
- 八皇后是个古老而有趣的游戏,是由高斯于1850年首先提出的。 要求在国际象棋的棋盘上放置八个皇后,使其不能相互攻击,即任意两个皇后不能处于 棋盘的同一行、同一列和同一条对角线上。试问有多少种放法?-Eight Queens is an old and interesting game, by Gauss in 1850 first proposed. Requirements in place on the chess board eight queen, it can not atta
8-Queen
- VC++课程设计的八皇后问题 在一个8*8的棋盘上放置彼此不受攻击的8个皇后。 按照国际象棋的规则,皇后可以攻击与之处在同一行或同一列或同一斜线上的棋子。8皇后问题就等价于在8*8格的棋盘上放置8个皇后,任何两个皇后不放在同一行或同一列或同一斜线上。 -VC++ curriculum design the eight queens problem in an 8* 8 chessboard placed 8 Queen not to attack each other. In acc
eight-queen-problem
- 八皇后问题是一个古老而著名的问题,是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出:在8X8格的国际象棋上摆放八个皇后,使其不能互相攻击,即任意两个皇后都不能处于同一行、同一列或同一斜线上,问有多少种摆法。-Eight queens problem is an old and well-known problems, backtracking algorithm is a typical example. The problem is that the famous 19th
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.
eight-queen
- 八皇后是个古老而有趣的游戏,是由高斯于1850年首先提出的。要求在国际象棋的棋盘上放置八个皇后,使其不能相互攻击,即任意两个皇后不能处于棋盘的同一行、同一列和同一条对角线上。试问有多少种放法?-Eight Queens is an old and interesting game, by Gauss in 1850 first proposed. Requirements in place on the chess board eight queen, it can not attack eac
eight-queen
- 八皇后是个古老而有趣的游戏,是由高斯于1850年首先提出的。要求在国际象棋的棋盘上放置八个皇后,使其不能相互攻击,即任意两个皇后不能处于棋盘的同一行、同一列和同一条对角线上。试问有多少种放法?-Eight Queens is an old and interesting game, by Gauss in 1850 first proposed. Requirements in place on the chess board eight queen, it can not attack eac
N-QUEEN
- 在一个N×N的国际象棋棋盘中摆N个皇后,使这N个皇后不能互相被对方吃掉。N皇后算法源码-N × N in a chess board in N months before Queen s, so that the N-Queen s was the other side can not eat each other. N Queen s algorithm source code
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