mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

force use of pandoc version >= 3.1.12.2

Browse Source 
The `bin/pandoc-wrapper.sh` tool will verify that the ssytem
has a recent enough version of `pandoc(1)`.

We explain why we insist on `pandoc(1)`. version >= 3.1.12.2
in comments where the $PANDOC_MIN_VERSION is set.

Added `--wrap=preserve` as a default argument to `pandoc(1)`.
While this change will impact every HTML file generated,
we believe this will improve the ability of someone to look
at the generated HTML and correlate with the original markdown.

Changed `bin/pandoc-wrapper.sh` VERSION from "1.4.2 2024-03-17"
to "1.4.3 2024-03-18".

Performed `make www` to achieve all of the above and to generate
HTML using the new  `--wrap=preserve` `pandoc(1)` mode.
This commit is contained in:
Landon Curt Noll committed 2024-03-18 01:26:39 -07:00
1 parent 9eb7a54e9f
commit b0b212acb1
402 files changed
+37061 -55132
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

1993/leo/index.html
+37 -59
View File
@@ -129,9 +129,9 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#Leonid_A_Broukhis">Leonid A.
Broukhis</a><br> Location: <a href="../../location.html#US">US</a> -
<em>United States of America</em> (<em>United States</em>) <br><br></li>
<li>Name: <a href="../../authors.html#Leonid_A_Broukhis">Leonid A. Broukhis</a><br>
Location: <a href="../../location.html#US">US</a> - <em>United States of America</em> (<em>United States</em>)
<br><br></li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-author.sh -->
@@ -149,40 +149,36 @@ Broukhis</a><br> Location: <a href="../../location.html#US">US</a> -
<p>where:</p>
<p>[colors] is the number of possible colors (1 to 15) (default: 6)</p>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>By default, the number of colors is 6. You may specify a value of
between 1 and 15 colors. See the author’s notes for instructions of how
to play.</p>
<p>By default, the number of colors is 6. You may specify a
value of between 1 and 15 colors. See the author’s notes
for instructions of how to play.</p>
<p>We look forward to more entries from the newer members of the
International Internet community.</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<p>This program plays
[Mastermind](https://en.wikipedia.org/wiki/Mastermind_(board_game), if
you call it by a name ending by ‘d’, otherwise it <em>solves</em>
Mastermind. Call it without parameters to use 6 digits (colors), or
indicate the number of possible digits (you cannot change the number of
positions so easily).</p>
[Mastermind](https://en.wikipedia.org/wiki/Mastermind_(board_game), if you call
it by a name ending by ‘d’, otherwise it <em>solves</em> Mastermind. Call it without
parameters to use 6 digits (colors), or indicate the number of possible digits
(you cannot change the number of positions so easily).</p>
<p>The number in parentheses is the number of possible combinations,
based on previous questions and answers. If you solve the puzzle, “(1)”
indicates that your previous moves are enough to give correct answer. If
the program acts as solver and terminates prematurely, it means that
you’re mistaken in your answers to its question(s). Question marks
indicate the number of digits you have to enter (either 4 when you guess
or 2 when computer guesses).</p>
<p>Note that the program uses the same code for both player and solver,
and the only place where it makes a difference is the interactive part.
Many obfuscations have been made to achieve this. An expression giving
<code>(bulls * 16 + cows)</code> from two numbers is, however, quite
straightforward :-) , as well as the arithmetic of binary coded
colors-base numbers is.</p>
<h3
id="limitations-maximum-number-of-digits-colors-is-14-1..f.">Limitations:
maximum number of digits (colors) is 14 (1..F).</h3>
based on previous questions and answers. If you solve the puzzle,
“(1)” indicates that your previous moves are enough to give correct
answer. If the program acts as solver and terminates prematurely,
it means that you’re mistaken in your answers to its question(s).
Question marks indicate the number of digits you have to enter
(either 4 when you guess or 2 when computer guesses).</p>
<p>Note that the program uses the same code for both player and
solver, and the only place where it makes a difference is the
interactive part. Many obfuscations have been made to achieve
this. An expression giving <code>(bulls * 16 + cows)</code> from two numbers
is, however, quite straightforward :-) , as well as the arithmetic
of binary coded colors-base numbers is.</p>
<h3 id="limitations-maximum-number-of-digits-colors-is-14-1..f.">Limitations: maximum number of digits (colors) is 14 (1..F).</h3>
<p>Suggestions: Use terminal (or emulator) with non-destructive
backspaces. Do “disable scrolling” on cmdtool or similar emulators.</p>
<h4 id="bugs">Bugs</h4>
<p>Please don’t type ^D at the prompt!!</p>
<h5 id="example-suppose-we-think-of-1234">EXAMPLE: Suppose we think of
1234</h5>
<h5 id="example-suppose-we-think-of-1234">EXAMPLE: Suppose we think of 1234</h5>
<pre><code>$ ./leo
(1296): 6433
?? 12 # one 3 is a bull, another is a cow, and 4 is a cow
@@ -194,8 +190,7 @@ backspaces. Do “disable scrolling” on cmdtool or similar emulators.</p>
?? 13 # 3 is a bull; 1, 2 and 4 are cows
(1): 1234
?? 40 # you may enter everything there</code></pre>
<h5 id="example-guess-the-computers-number">EXAMPLE: Guess the
computer’s number</h5>
<h5 id="example-guess-the-computers-number">EXAMPLE: Guess the computer’s number</h5>
<pre><code>$ ./mind
(1296): ???? 1122 # my strategy isn&#39;t the best, just as example
00
@@ -209,50 +204,33 @@ computer’s number</h5>
00
(1): ???? 6444
40 # we have guessed the number</code></pre>
<h2 id="copyright-and-cc-by-sa-4.0-license">Copyright and CC BY-SA 4.0
License:</h2>
<p>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:</p>
<h2 id="copyright-and-cc-by-sa-4.0-license">Copyright and CC BY-SA 4.0 License:</h2>
<p>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:</p>
<pre><code>Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)</code></pre>
<p>For more information, see:
https://creativecommons.org/licenses/by-sa/4.0/</p>
<p>For more information, see: https://creativecommons.org/licenses/by-sa/4.0/</p>
<!-- END: this line ends content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<!-- START: this line starts content for HTML phase 22 by: bin/output-index-inventory.sh via bin/md2html.sh -->
<!-- START: this line starts content generated by: bin/output-index-inventory.sh -->
<h1 id="inventory-for-1993leo"><a name="inventory"></a>Inventory for
1993/leo</h1>
<h1 id="inventory-for-1993leo"><a name="inventory"></a>Inventory for 1993/leo</h1>
<p><a href="#top">Jump to top</a></p>
<h2 id="primary-files">Primary files</h2>
<ul>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/leo.c">leo.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/leo.orig.c">leo.orig.c</a>
- original source</li>
<li><a href="1993_leo.tar.bz2">1993_leo.tar.bz2</a> - download entry
source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/leo.c">leo.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/leo.orig.c">leo.orig.c</a> - original source</li>
<li><a href="1993_leo.tar.bz2">1993_leo.tar.bz2</a> - download entry source</li>
</ul>
<h2 id="secondary-files">Secondary files</h2>
<ul>
<li><a href="index.html">index.html</a> - entry home page</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/.entry.json">.entry.json</a>
- description of entry in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/.gitignore">.gitignore</a>
- list of files that should not be committed under git</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/.entry.json">.entry.json</a> - description of entry in JSON</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/.gitignore">.gitignore</a> - list of files that should not be committed under git</li>
<li><a href=".path">.path</a> - directory path from top directory</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/README.md">README.md</a>
- markdown source for index.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/leo/README.md">README.md</a> - markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->