资 源 简 介
骑士遍历问题，在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。-Knight, in an n* n box at the international chess board, Ma (Knight) from the arbitrary designation box and, in accordance with a further horizontal two-step vertical, horizontal or a vertical two-step further vaulting horse rules traveled a checkerboard lattice of each and every one lattice just take time.
