骑士游历问题算法的研究  

Research on knight travel problem algorithm

作　　者：惠燕[1] 潘煜[1] 

机构地区：[1]西安工业大学计算机学院

出　　处：《电子设计工程》2011年第11期112-114,共3页Electronic Design Engineering

摘　　要：骑士游历问题是一个经典的数学问题。其思想在电路图的设计及图像加密等方面都有帮助,如果能将骑士游历问题算法通过计算机语言程序化将对其在其他领域中的应用有极大帮助。通过研究骑士游历的规则对问题进行数学模型抽象,通过研究骑士游历的方向与可到达情况,将骑士的空间移动抽象成数学表达式,进而映射到程序中所需对应的数据结构形式,最后通过利用JAVA语言得以实现骑士游历问题中骑士游历过程的动态图形演示。Knight travel problem is a classical mathematical problem.Its thought contributes to the circuit diagram design and image encryption.If it can be programmed which will have great help in other application fields,it made mathematical model abstraction through the study on the rules of knight travel problems,researched on the direction and the reached conditions of knight travel,knight＇s moving was abstracted into mathematical expressions,then mapped to the corresponding data structures required in the program,and at last,using JAVA language realized knight travelled graphic demonstration of dynamic processes.

关 键 词：骑士 游历 欧拉 方向 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]