Description: 2, write a 6 × 6 square Cavalier travel solution. Requirements of the take-off position Cavalier arbitrary specified. The preparation of non-recursive procedures, and run routes, and routes are obtained, will be followed by fill in the number of 6 × 6 square, and the output. (Cavalier tour: starting from the initial position, according to the international chess horse walk method, not all regions will be repeated just go again.)
To Search:
File list (Check if you may need any files):
knight.cpp