搜索资源列表
求解Knight Tour Problem
- 求解Knight Tour Problem，马的走法是“日”字形路线，例如当马在位置15的时候，它可以到达2、4、7、11、19、23、26和28。但是规定马是不能跳出棋盘外的，例如从位置1只能到达9和14
串口接收和发送的电脑软件
- 串口助手, 串口接收和发送的电脑软件，delphi7+SPComm源代码 作者：knight,Serial Debug
qishi
- 递归算法的实例--以骑士巡游为例做的控制台程序。主要设计到了递归回溯算法-Examples of recursive algorithms- to Knight-tour of the console to do the procedure as an example. The main design to a recursive backtracking algorithm
Knight
- 黑白棋问题 计算机博弈是一种对策性游戏,是人工智能的主要研究领域之一,它涉及人工智能中的搜索方法、推理技术和决策规划等.目前广泛研究的是确定的、二人、零和、完备信息的博弈搜索.-Reversi game is a problem of computer games countermeasures is artificial intelligence, one of the main areas of research, which involves artificial intelligen
mystver
- Knight Online Login Exe mystver.exe-Knight Online Login Exemystver.exe
GGHack
- this knight online trainer source code-this is knight online trainer source code
knight
- 这是一个用c++编写的骑士漫游也叫做骑士漫游世界问题。-This is a c++ to prepare with the Knight Rider, also known as roaming roaming the world' s problems.
Billing
- knight online billing v1298 .net
KnightTourCPP
- it is the famous Knight tour algorithm. written in c++. enjoy it.
knight
- 骑士巡游问题的源代码，做算法课作业必备资料。-Knight tour problem' s source code, doing class work necessary information algorithm.
Knight
- knight algorithm source code
knight
- 在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。这样的跳马步骤称为1 个成功的骑士征途。例如，当n=5 时的1 个成功的骑士征途如下图所示。 1 2 3 4 5 1 25 14 1 8 19 2 4 9 18 13 2 3 15 24 3 20 7 4 10 5 22 17 12 5 23 16 11 6 21 算法设计： 对于给定的n和n*n方格的起始位
knight
- Chessboard exploring. Euristic algorithm to find a Knight path visiting all squares on Chessboard.
knight
- 在一个n*n的棋盘上跳马的方式走遍所有格子，用分支限界法解决。-Branch and bound method to solve the knight journey
knight-move
- knight move的双向搜索版，比单向速度快-bi-directional search version of the knight move faster than the one-way speed
KNIGHT
- 本程序是骑士巡游的游戏程序代码，供Java初学者使用。-This program is a knight' s tour game program code for Java beginners.
CSharp--Knight-flight-chess
- 控制台版骑士飞行棋...非原创,但代码是自己写的.-The console version of the knight the flight chess ... non-original, but the code is written.
Knight-Tours
- 骑士旅游问题是经典的问题，本代码用简单的C实现这一问题。-Knight Tour problem is a classic problem, the code with a simple C implementation of this problem.
knight
- 骑士旅游（Knight tour）在十八世纪初倍受数学家与拼图迷的注意，它什么时候被提出已不可考，骑士的走法为西洋棋的走法，骑士可以由任一个位置出发，它要如何走完所有的位置？-Knight Tours (Knight tour) in the early eighteenth century mathematician and puzzle fans much attention when it was proposed not be traced, chess knight moves to
Knight
- C++实现骑士巡游、N皇后和搬山游戏的代码，包括详细算法说明文档，经典好用。-C++/C realization Knight Parade, N Queens and move mountains of the game code, including detailed algorithm documentation, classic easy to use.