搜索资源列表
home1work
- 微软桌着色问题a【问题】 组合问题 【问题】 填字游戏 【问题】 n皇后问题 -Microsoft tables coloring problem -- a problem [[composition problems -- crossword puzzles [n Queen's problem -- the problem
面向对象n皇后
- 思路清晰的n皇后问题求解，采用面向对象思路编写，封装类可在其他程序中灵活调用-lucid n Queen's problem solving, object-oriented ideas to prepare, Packaging category in other proceedings flexible call
我是谁呢!!!!!!!!!!!
- 八皇后问题八哈哈大家 安放发疯安放发安放-eight Queen's 8 ha ha planted crazy we placed the installation
vc62445261344
- 关于8皇后问题的源代码，希望大家多多交流-8 on the Queen's source code, I hope Members can exchange
8q
- 8皇后的c#的实现，实现了图形界面的可视化方式，采用了高效的算法来实现。-8 Queen of c #, has implemented a graphical interface visualization, is an efficient algorithm to achieve.
8queenc
- 1） 【八皇后问题】设在初始状态下在国际象棋棋盘上没有任何棋子(皇后)。然后顺序在第1行，第2行，…。第8行上布放棋子。在每一行中有8个可选择位置，但在任一时刻，棋盘的合法布局都必须满足3个限制条件，即任何两个棋子不得放在棋盘上的同一行、或者同一列、或者同一斜线上。试编写一个递归算法，求解并输出此问题的所有合法布局。-1) [8 Queen's problems -- in the initial state in the international chess pieces on no
bahouwenti
- 八后问题，也就是如何在棋盘上放置8个互不向吃的皇后-after eight issues, and that was how on the chessboard placed eight in each other not to eat the Queen
bahuanghou23423423423
- 八皇后问题 八皇后问题 八皇后问题 八皇后问题-8 8 8 Queen's Queen's 8 8 8 Queen's Queen's 8 8 Queen's 8 8 8 Queen's Queen's problems
N_queue
- 根据回朔法思想来求解Ｎ皇后问题，用递归来实现回朔．-Thought to solve N Queen's problems, and use recursion to achieve back Schomburg.
eight
- 八皇后 在8X8格的国际象棋上摆放八个皇后,使其不能互相攻击 即任意两个皇后都不能处于同一行 同一列或同一斜线上,问有多少种摆法-Eight Queen s in the 8x8 grid of the International Chess Queen placed eight, making it unable to attack each other or any two Queen s in the same line are not the same row or on th
qu
- 对八皇后的实现 很经典的问题，很简单的实现-The realization of the eight Queen s classic problem, very simple to achieve
chess
- 八皇后源代码 运行过 成功 一定没有错误-8 Queen' s source code have been successfully running and will not be wrong
N_Queens
- The N queens puzzle is the problem of putting N chess queens on an n×n chessboard such that none of them is able to capture any other using the standard chess queen s moves. The queens must be placed in such a way that no queens would be
8queensproblem
- 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 -Eight queens problem is an old and well-known problem is a typical Example backtracking algorithms. The problem is that the nineteent
Hill_Climbing_Searching
- solving 8-Queen problem by using hill climbing.
Queen
- 回溯算法解决皇后问题 回溯算法解决皇后问题-the solution of n queen
eight-queen-problem
- 以一个很巧妙的递归算法实现8皇后问题，该递归算法思路很独特，是初学者一个很好的借鉴-To a very clever recursive algorithm resolve eight queen problem .
295---N-Queen-Problem-via-Hopfield-Tank-Neural-Ne
- N-Queen Problem via Hopfield-Tank Neural Network v1.0
Queen
- 八皇后代码，自己写的，希望下载后提供宝贵意见，-queen eight queens code, write their own who want to download can be more valuable advice, thank you!
queen
- 求解N皇后问题，解决棋盘上皇后不能在同一横向竖向斜向的问题-Solving the N- Queens problem, not solve the queen on the board in the same vertical transverse oblique problem