Embedded Files
Input: Matrix size n
Input: Matrix size n
Output: A legal knight tour in an n*n matrix
Output: A legal knight tour in an n*n matrix
Refer to the J. C. Warnsdorff's algorithm (1823) to find the Knight Tour (using the knight moves) in an n*n array
Refer to the J. C. Warnsdorff's algorithm (1823) to find the Knight Tour (using the knight moves) in an n*n array
Annotate "O"/"X" to a legal tour/illegal moves with respect to a certain starting position
KnightTour_01.mp4KnightTour_03.mp4Google Sites
Report abuse