knignt

  求解骑士游历问题的程序。骑士游历问题是在8X8格的国际象棋棋盘上随意放置一个马，按照马走“日”字的规则对马进行操作，问是否能够不重复的走遍棋盘的每个格。(Cavaliers traveled problem solving process. Cleveland traveled problem is the 8x8 grid of international chess pieces on dumped a horse, according to Ma take "days" to the rules word for horse operations, asked whether not to repeat the chessboard visited each grid.)