搜索资源列表
求解Knight Tour Problem
- 求解Knight Tour Problem，马的走法是“日”字形路线，例如当马在位置15的时候，它可以到达2、4、7、11、19、23、26和28。但是规定马是不能跳出棋盘外的，例如从位置1只能到达9和14
kingOnLine
- 骑士OnLine服务端源代码 内涵全部服务端代码以及注释-Knight OnLine server source code connotation service side code and comment
GGHack
- this knight online trainer source code-this is knight online trainer source code
Knight_Tour
- "Knight s Tour" is a puzzle in which the object is to move a knight, starting from any square on a chessboard, to every other square, landing on each square only once. startFrm.cs initialize The FOrm And some graphical property in C#. Kn
knight
- 在一个n*n的棋盘上跳马的方式走遍所有格子，用分支限界法解决。-Branch and bound method to solve the knight journey
good
- 骑士飞行棋部分功能的代码可以扩展功能和地图-The Knight flying chess part of the function code can be extended functionality and map
CSharp--Knight-flight-chess
- 控制台版骑士飞行棋...非原创,但代码是自己写的.-The console version of the knight the flight chess ... non-original, but the code is written.
feixingqi
- 骑士飞行棋，控制台应用程序，可以实现交换位置、轰炸等功能-Knight flight chess, console application, you can exchange position, bombing and other functions
flying-chess
- 骑士飞行棋，是一个控制台游戏，使用C#编程实现。-Knight FeiHangQi, is a console game, using c# programming
qishifeixingqi
- C# 骑士飞行棋,DOS版,初学者可以看看 小游戏而已-C# knight flight chess, DOS version, beginners can look at the small game only
Tiaomawenti2
- 骑士周游列国问题 在一张国际象棋棋盘上（8*8方格），骑士（knight，马）位于任意一个位置。问如何才能让骑士不重不漏的经过棋盘上的每个格？-Knight tour around the problem in a chess board (8* 8 squares), Knight (knight, horse) in any one location. Q. How can I get the knights do not leak through the chessboard each
knight
- 骑士遍历问题，就是一匹马在国际象棋的棋盘山能不能不重复的遍历完整个棋盘-Knight traversal problem is that a horse in chess Qipanshan can not but repeat complete traversal of a chessboard
qishibianli
- 骑士遍历 在国际象棋棋盘上，任选一个位置，模拟出兵可能走过的路径-Knight traversal
第6次实验_第01小组
- 国际象棋中的骑士巡游问题，利用回溯法求解，output.txt中输出所得到的巡游路径坐标集合((Parade route chess knight parade problems solved by backtracking, output.txt output the resulting set of coordinates))