求解Knight Tour Problem，马的走法是“日”字形路线，例如当马在位置15的时候，它可以到达2、4、7、11、19、23、26和28。但是规定马是不能跳出棋盘外的，例如从位置1只能到达9和14

"Knight s Tour" is a puzzle in which the object is to move a knight, starting from any square on a chessboard, to every other square, landing on each square only once. startFrm.cs initialize The FOrm And some graphical property in C#. Kn

骑士周游列国问题 在一张国际象棋棋盘上（8*8方格），骑士（knight，马）位于任意一个位置。问如何才能让骑士不重不漏的经过棋盘上的每个格？-Knight tour around the problem in a chess board (8* 8 squares), Knight (knight, horse) in any one location. Q. How can I get the knights do not leak through the chessboard each