跳马算法的实现：考虑国际象棋棋盘上某个位置的一只马，它是否可能只走步，正好走过除起点外的其他个位置各一次，并且最后能够回到初始点（存在哈密顿回路）？-Vault algorithm implementation: considering a location on the chess board of a horse, it may only be walking, just walk in addition to other locations outside the starting poi