# Best Small Program
Oscar Toledo
Av. Santa Cruz del Monte 9-304
Ciudad Satelite. Edo. de Mexico
CP. 53110
Mexico
## Judges' remarks:
### To build:
make toledo1
### Try:
./toledo1 00
./toledo1 30
./toledo1 99
For most of the arguments (e.g. those above) the resulting path
is not circular, but at least one starting point yields a circular path.
Why do some of the "illegal" starting points work more or less as could
be expected, and some dump core?
## Author's comments:
Can you place a knight on a chess board and make it
to visit the 64 squares without repeating them?
If not, this program does it, just run it with an argument
giving initial position.
./toledo1 11 (start is A8)
./toledo1 18 (start is H8)
./toledo1 81 (start is A1)
./toledo1 88 (start is H1)
./toledo1 44 (start is D5)
It will print move order. The algorithm is so simple that you can read
it on the source code, at the first glance it can appear checkered :-)
but don't dismail, jar, jar.