Landon Curt Noll
81b4f460b7
The `display_as` field in an `.entry_json` file must match the regex `^[a-z][0-9a-z]*$` now. This is needed to reduce errors during the final round while converting a potential submission to entry form. Modify `1992/buzzard.2/.entry.json` and `1993/rince/.entry.json` to change `display_as` field to use lower case. Correct `2012/omoikane/.entry.json` to correctly reflect changes made by commit2955e5d07eand commit2955e5d07e. Change `bin/cvt-submission.sh` to verify that the `display_as` matches the above regex. Changed `bin/cvt-submission.sh` VERSION from "2.2.2 2025-06-30" to "2.3.0 2025-07-02". Rebuild all tarballs, both at the entry and the year level due recent changes to `var.mk`, `1337.mk`, and `ioccc.css`. Rebuild sitemap due to the changes above. Ran `make update` to test and perform the above.
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. :-)