实现骑士游历问题。 骑士游历问题是一个经典的数学问题。其思想在电路图的设计及图像加密等方面都有帮助，如果能将骑士游历问题算法通过计算机语言程序化将对其在其他领域中的应用有极大帮助。通过研究骑士游历的规则对问题进行数学模型抽象，通过研究骑士游历的方向与可到达情况，将骑士的空间移动抽象成数学表达式，进而映射到程序中所需对应的数据结构形式，最后通过利用JAVA语言得以实现骑士游历问题中骑士游历过程的动态图形演示。 -Knight traveled to achieve the problem. Knights tour problem is a classical mathematical problem. Their thoughts on the schematic design and image encryption and other aspects to help, if the knight can travel through a computer algorithm for the problem of the language program in its application in other areas of great help. Knight traveled by studying the rules of abstract mathematical models of problems, Knight traveled by studying the direction and the situation can be reached, the Knights of room to move into the abstract mathematical expressions, and then mapped to the corresponding program data structures required in the form of final adoption can be achieved using JAVA language issues knight knights traveled traveled the process of dynamic graphical presentation.