This is yet another program to answer a problem in a book called algorithms.Here's the problem: 18.A Corner-to-Corner Journey Is there a way for a chess knight to start at the lower left corner of a standard 8 x 8 chessboard, visit all the squares pf the board exactly once, and end at the top right corner?(The knight's moves are L shaped jumps:two squares horizontally or vertically followed by one square in the perpendicular direction.)
