⇤ ← Revision 1 as of 2011-01-05 13:12:32
Size: 187
Comment:
|
Size: 342
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
'''Knight Tour''' | = Knight Tour = |
Line 3: | Line 3: |
Problem description | <<TableOfContents>> == Problem Description == |
Line 6: | Line 8: |
== Input format == == Output format == == Example == == Author(s) == Author: Neng-Fa Zhou <<BR>> Affiliation: |
Knight Tour
Problem Description
Find a tour for the knight piece that starts at any square, travels all squares, and comes back to the origin, following the rules of chess.
Input format
Output format
Example
Author(s)
Author: Neng-Fa Zhou
Affiliation: