Author:

• Name: Oscar Toledo G.
  Location: MX - United Mexican States (Mexico)

To build:

    make

To use:

    ./toledo1 [0-9][0-9]

where [0-9][0-9] is a two digit number.

Try:

    ./try.sh

Judges’ remarks:

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 remarks:

Can you place a knight on a chess board and make it 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 in the source code. At the first glance it can appear checkered. Nevertheless, don’t be dismayed, jar, jar. :-)

Primary files

• toledo1.c - entry source code
• Makefile - entry Makefile
• toledo1.orig.c - original source code
• try.sh - script to try entry

Secondary files

• 2006_toledo1.tar.bz2 - download entry tarball
• README.md - markdown source for this web page
• .entry.json - entry summary and manifest in JSON
• .gitignore - list of files that should not be committed under git
• .path - directory path from top level directory
• index.html - this web page

Jump to: top