资 源 简 介
在西洋棋中的武士与象棋中的马相似，走的都是L形的路，本程序以一个非递归的程序，输入一个表示棋盘的大小值n，在输入一个起点的坐标，找出一条从第一格起可以让武士棋走完n2格而不重复的路径。-In chess and chess in the samurai s horse is similar to walking are L-shaped path, the procedure to a non-recursive procedures, enter a value that the size of the chessboard of n, in the input the coordinates of a starting point to identify a starting from the first grid allows grid n2 samurai chess through the path without duplication.
