In the n-n chessboard (for example, n = 5), assuming a knight (in chess in the " horse to go on" walk method) from the initial coordinates (x1, y1) starting to visited (Parade) Each board in the first place. Please compile a program to solve for the Knight Parade " road map" (or tell the knight, starting from a position, you can not visited the board- problem has no solution.)

骑士巡游2.cpp
骑士巡游2.dsp
骑士巡游2.dsw
骑士巡游2.exe
骑士巡游2.ncb
骑士巡游2.opt
骑士巡游2.plg

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．