Landon Curt Noll
4f88c4214b
Fixed an incorrect author win for "1989_jar.2" in `author_wins.numbers` and `author_wins.csv`. Changed winner_JSON_format_version to "0.5 2023-11-04". Added `gen_dot_winner.sh` tool to generate .winner.json and .inventory.html for a winner. This tool uses [pandoc](https://pandoc.org) to convert markdown to HTML. Used this command to generate `.winner.json` and `.inventory.html` for all winners: ```sh ./run_all.sh -v 1 -D 1 ./gen_dot_winner.sh ``` Updated `tmp/README.md` to reflect the above. Retired "fake.gen_inventory.sh" to `tmp/OLD_manifest/fake.gen_inventory.sh`. Added `-D level` flag to `run_all.sh` to specify the `-v level` for the tool that is being run.
To build:
make
To use:
./toledo1 [0-9][0-9]
where [0-9][0-9] is a two digit number.
Try:
./toledo1 00
./toledo1 30
./toledo1 99
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 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. Nevertheless, don't be dismayed, jar, jar. :-)
Copyright and CC BY-SA 4.0 License:
This file is Copyright (c) 2023 by Landon Curt Noll. All Rights Reserved. You are free to share and adapt this file under the terms of this license:
Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)
For more information, see: https://creativecommons.org/licenses/by-sa/4.0/