搜索资源列表
qishizhouyou
- 骑士周游是一个经典的问题，它需要回唆的办法来解决-Knight s tour is a classic problem, it needs to return to instigate solutions to
qishixunyou.rar
- 骑士巡游算法（可以向八个方向移动,搜索所有可行路径. 用二维链表存储结果）,Cavalier Parade algorithm (moving to eight, search all possible paths. With two-dimensional chain store results)
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
qishi
- 一种使用c++，利用回溯算法解决基于棋盘的骑士游历问题的源码，主要用于c++和数据结构教学。-C++ based on shortest path to do the source method. Mainly used in c++, or teaching the use of data structures.
kingOnLine
- 骑士OnLine服务端源代码 内涵全部服务端代码以及注释-Knight OnLine server source code connotation service side code and comment
cpp
- 大二算法设计实验源码，内容包括线性时间选择，01背包，骑士巡游，最小生成树-Experimental Algorithm Design sophomore source, including choice of linear time, 01 backpacks, Cavalier Parade, minimum spanning tree
knight
- 2、 写出6×6方阵的骑士周游的解。要求骑士的起跳位置是任意指定的。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字依次填入6×6的方阵中，并输出。 （骑士周游：从起始位置出发，按国际象棋马的走法，不重复地将所有区域恰好走一遍。） -2, write a 6 × 6 square Cavalier travel solution. Requirements of the take-off position Cavalier arbitrary specified. The p
knight
- 骑士周游世界问题 ， 一个称为骑士的棋子，能否在64个放个的棋盘上都走一次且只走一次？在国际象棋中骑士的移动路线是L型的（在一个方向上走两格，在垂直方向上走一格）-Cavalier travel around the world is an issue known as the Cavalier pawn can take 64 months left of the chessboard once and only go once? Cavalier in the international c
83390050Knight
- 骑士巡游置乱的程序，很有用，寻找马步～有需要的可以下了看看～-Cavalier Parade scrambling procedure, very useful, there is a need to find a horse ~ can be a look at ~
16
- 骑士巡游问题 -Knight-tour problem
vbtrn
- 骑士KnightOnline杀国外挂-Cavalier KnightOnline to kill the country plug
qishi
- 8×8的棋盘上分布着n个骑士，他们想约在某一格中聚会。骑士每天可以像国际象棋中的马那样移动一次，如图所示，可以从中间向8个方向移动，请你计算n个骑士的最早聚会地点和要走多少天。要求尽早聚会，且n个人走的总步数最少，先到聚会地点的骑士可以不再移动等待其他骑士。 -8 × 8 chessboard on distributed n-Cavalier, they want to about gathering in a cell. Cavalier day like chess in the hors
2008121513115415410
- java小游戏骑士飞行棋源码,java小游戏骑士飞行棋源码-java game Cavalier flight chess source, java game Cavalier flight chess source
qishi
- 算法骑士问题程序，用于解决国际象棋的骑士问题。-Cavalier problems algorithm procedures used to address the issue of chess knight.
KnightsTour
- 骑士旅行问题的一种解可能有点紧张第一次发-Cavalier travel A solution may be a bit nervous the first time issued
1
- 在一个标准8×8的国际象棋棋盘上，棋盘中有些格子是可能有障碍物的。已知骑士的初始位置和目标位置，你的任务是计算出骑士最少需要多少步可以从初始位置到达目标位置。有障碍物的格子当然不可能到达。 -At a standard 8 × 8 on the international chessboard, checkerboard lattice, some are likely to have obstructions. Cavalier known initial position and ta
48qqqq
- 主要用栈和树求解骑士问题，用C++语言编写的-The main stack and tree Cavalier Problem Solving with C++ languages
cavalier
- 骑士游历,骑士经过每一个点，且每个点只经过一次-Cavalier traveled, Cavalier, after each point, and each point after only one
qishiwenti
- 输入骑士个数，开始数的位置，每次数的人数，骑士离开的顺序为-Knight enter the number, the number of start position, the number of each number, leaving the order of Knight
C_Program_Daquan
- 用c实现数据结构、Winsock2编程、鼠标编程、asm嵌入式编程、汉诺塔问题、效验算法、N皇后问题回溯算法、骑士遍历、文件加密、万年历的算法，很好很强大-Data structure using c implementation, Winsock2 programming, mouse programming, asm embedded programming, Tower of Hanoi problem, well-tested algorithm, N Queen' s probl