骑士游历问题

【问题描述】 给出一块具有n2个格子的n×n棋盘（如图3-14所示），一位骑士从初始位置(x0, y0)开始，按照“马跳日”规则在棋盘上移动。问：能否在n2 1步内遍历棋盘上的所有位置，即每个格子刚好游历一次，如果能，请找出这样的游历方案来

-Knight traveled the problem　gives a descr iption of the problem with n2 a lattice of n × n board (as shown in Figure 3-14), a knight from the initial position (x0, y0) began, in accordance with " horse jumping day"　rule In the board moving. Q: Can n2 　1 traverse the board, within steps of all positions that each lattice traveled just once, if we can, find such a traveling program to