Consider 8 x 8 chess board on a horse to a location, it may only take 63 steps, just walk away than from the other 63 positions each time? If you have such a walk method, claimed by walking the route as a Ma Siwei travel routes. Divide and Conquer Algorithm to design a test to find a horse' s travel route.

1.txt

• 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．