文件名称:Knight
介绍说明－－下载内容均来自于网络，请自行研究使用
1.实验目的:通过实验理解算法的概念、算法的表示、算法的时间复杂度和空间复杂度分析；运用熟悉的编程工具对骑士周游列国问题进行求解，初步学会分析算法的时间复杂度和空间复杂度；
2.在一张国际象棋棋盘上（8*8方格），骑士（knight，马）位于任意一个位置。问如何才能让骑士不重不漏的经过棋盘上的每个格？本问题中已知骑士位置(m,n)，其中0=<m,n<=8，要求给出骑士行走路径，路径可用8*8矩阵输出，其中值表示骑士到达此位置行走的步数（初始为1）
-1. Experiment: The experiment to understand the concept of the algorithm, the algorithm that the algorithm' s time complexity and space complexity analysis the use of familiar programming tools to solve the problem knights travel the world, initially learn to analyze the time complexity and space complexity 2. in a chess board (8* 8 squares), Knight (knight, MA) at any one location. Knight did not ask how to get weight not leak through the board on each cell? Knights of the known location of the problem (m, n), where 0 = <m,n<=8，要求给出骑士行走路径，路径可用8*8矩阵输出，其中值表示骑士到达此位置行走的步数（初始为1）
2.在一张国际象棋棋盘上（8*8方格），骑士（knight，马）位于任意一个位置。问如何才能让骑士不重不漏的经过棋盘上的每个格？本问题中已知骑士位置(m,n)，其中0=<m,n<=8，要求给出骑士行走路径，路径可用8*8矩阵输出，其中值表示骑士到达此位置行走的步数（初始为1）
-1. Experiment: The experiment to understand the concept of the algorithm, the algorithm that the algorithm' s time complexity and space complexity analysis the use of familiar programming tools to solve the problem knights travel the world, initially learn to analyze the time complexity and space complexity 2. in a chess board (8* 8 squares), Knight (knight, MA) at any one location. Knight did not ask how to get weight not leak through the board on each cell? Knights of the known location of the problem (m, n), where 0 = <m,n<=8，要求给出骑士行走路径，路径可用8*8矩阵输出，其中值表示骑士到达此位置行走的步数（初始为1）
(系统自动生成,下载前可以参看下载内容)
下载文件列表
骑士周游列国.cpp