使用回溯的方法实现跳马问题，同时，还使用了递归的思想。跳马问题描述：在N*N格的棋盘上，从（1,1）点出发，按日字跳马，要求不重复地跳经所有方格。求出符合要求的所有跳马方案-The method used to achieve vault back problem, while also using the recursive thinking. Horse Problem Descr iption: In the N* N grid of the board, from (1,1) point of departure, daily word vault, asked not to be repeated to jump through all the boxes. Find the program meets the requirements of all Vault