force use of pandoc version >= 3.1.12.2
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
1 parent
9eb7a54e9f
commit
b0b212acb1
402 files changed
+37061
-55132
No files matched your search
+36
-60
@@ -129,9 +129,9 @@
|
||||
|
||||
<h2 id="author"><a name="author"></a>Author:</h2>
|
||||
<ul>
|
||||
<li>Name: <a href="../../authors.html#Roemer_B_Lievaart">Roemer B.
|
||||
Lievaart</a><br> Location: <a href="../../location.html#NL">NL</a> -
|
||||
<em>Kingdom of the Netherlands</em> (<em>Netherlands</em>) <br><br></li>
|
||||
<li>Name: <a href="../../authors.html#Roemer_B_Lievaart">Roemer B. Lievaart</a><br>
|
||||
Location: <a href="../../location.html#NL">NL</a> - <em>Kingdom of the Netherlands</em> (<em>Netherlands</em>)
|
||||
<br><br></li>
|
||||
</ul>
|
||||
|
||||
<!-- END: next line ends content generated by: bin/output-index-author.sh -->
|
||||
@@ -145,83 +145,59 @@ Lievaart</a><br> Location: <a href="../../location.html#NL">NL</a> -
|
||||
<div class="sourceCode" id="cb2"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb2-1"><a href="#cb2-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./lievaart</span></span>
|
||||
<span id="cb2-2"><a href="#cb2-2" aria-hidden="true" tabindex="-1"></a><span class="co"># enter a level and start playing as described below</span></span></code></pre></div>
|
||||
<h2 id="try">Try:</h2>
|
||||
<p>To see what it would have looked like without the size
|
||||
restrictions:</p>
|
||||
<p>To see what it would have looked like without the size restrictions:</p>
|
||||
<div class="sourceCode" id="cb3"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb3-1"><a href="#cb3-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./lievaart2</span></span>
|
||||
<span id="cb3-2"><a href="#cb3-2" aria-hidden="true" tabindex="-1"></a><span class="co"># enter a level and start playing as described below</span></span></code></pre></div>
|
||||
<h2 id="judges-remarks">Judges’ remarks:</h2>
|
||||
<p>We believe that you too will be amazed at just how much power
|
||||
Mr. Lievaart packed into 1024 bytes!</p>
|
||||
<p>This Plays the game of <a
|
||||
href="https://en.wikipedia.org/wiki/Reversi">Reversi (Othello)</a>!
|
||||
Compile and run. It then asks for a playing level. Enter 0-10
|
||||
(easy-hard). It then asks for your move. A move is a number within
|
||||
11-88, or 99 to pass. Illegal moves (except for an illegal pass) are
|
||||
rejected. Then the computer does its move (or a 0 to pass), until the
|
||||
board is full.</p>
|
||||
<p>It plays rather well, for such a small program! Lievaart had to leave
|
||||
out the board printing routine, so you’ll have to take a real game board
|
||||
to play it (or see below). … Also due to space-limitations (the rules
|
||||
for 1987 had a limit of 1024 byes), Lievaart took out the
|
||||
passing-handler, which makes its ending-game rather poor. But further it
|
||||
knows all the rules, uses <a
|
||||
href="https://en.wikipedia.org/wiki/Alpha-beta_pruning">alpha-beta
|
||||
pruning</a>, and it plays for instance on mobility(!). Most important:
|
||||
it can play a pretty good game of Reversi!</p>
|
||||
<p>The Author was kind enough to supply the fully functional version of
|
||||
the program. The file <a href="lievaart2.c">lievaart2.c</a> contains
|
||||
what the program would have been without the size restriction. This
|
||||
version has the full end game logic and displays the board after each
|
||||
move! See above for how to use this.</p>
|
||||
<p>We believe that you too will be amazed at just how much power Mr. Lievaart
|
||||
packed into 1024 bytes!</p>
|
||||
<p>This Plays the game of <a href="https://en.wikipedia.org/wiki/Reversi">Reversi
|
||||
(Othello)</a>! Compile and run. It then
|
||||
asks for a playing level. Enter 0-10 (easy-hard). It then asks for
|
||||
your move. A move is a number within 11-88, or 99 to pass. Illegal
|
||||
moves (except for an illegal pass) are rejected. Then the computer
|
||||
does its move (or a 0 to pass), until the board is full.</p>
|
||||
<p>It plays rather well, for such a small program! Lievaart had to leave out the
|
||||
board printing routine, so you’ll have to take a real game board to play it (or
|
||||
see below). … Also due to space-limitations (the rules for 1987 had a limit
|
||||
of 1024 byes), Lievaart took out the passing-handler, which makes its
|
||||
ending-game rather poor. But further it knows all the rules, uses <a href="https://en.wikipedia.org/wiki/Alpha-beta_pruning">alpha-beta
|
||||
pruning</a>, and it plays for
|
||||
instance on mobility(!). Most important: it can play a pretty good game of Reversi!</p>
|
||||
<p>The Author was kind enough to supply the fully functional version of the
|
||||
program. The file <a href="lievaart2.c">lievaart2.c</a> contains what the program would
|
||||
have been without the size restriction. This version has the full end game
|
||||
logic and displays the board after each move! See above for how to use this.</p>
|
||||
<h2 id="authors-remarks">Author’s remarks:</h2>
|
||||
<p>No remarks were provided by the author.</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>
|
||||
<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-1987lievaart"><a name="inventory"></a>Inventory
|
||||
for 1987/lievaart</h1>
|
||||
<h1 id="inventory-for-1987lievaart"><a name="inventory"></a>Inventory for 1987/lievaart</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/1987/lievaart/lievaart.c">lievaart.c</a>
|
||||
- entry source</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1987/lievaart/Makefile">Makefile</a>
|
||||
- entry Makefile</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1987/lievaart/lievaart.orig.c">lievaart.orig.c</a>
|
||||
- original source</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1987/lievaart/lievaart2.c">lievaart2.c</a>
|
||||
- source without size restriction</li>
|
||||
<li><a href="1987_lievaart.tar.bz2">1987_lievaart.tar.bz2</a> - download
|
||||
entry source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1987/lievaart/lievaart.c">lievaart.c</a> - entry source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1987/lievaart/Makefile">Makefile</a> - entry Makefile</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1987/lievaart/lievaart.orig.c">lievaart.orig.c</a> - original source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1987/lievaart/lievaart2.c">lievaart2.c</a> - source without size restriction</li>
|
||||
<li><a href="1987_lievaart.tar.bz2">1987_lievaart.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/1987/lievaart/.entry.json">.entry.json</a>
|
||||
- description of entry in JSON</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1987/lievaart/.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/1987/lievaart/.entry.json">.entry.json</a> - description of entry in JSON</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1987/lievaart/.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/1987/lievaart/README.md">README.md</a>
|
||||
- markdown source for index.html</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1987/lievaart/README.md">README.md</a> - markdown source for index.html</li>
|
||||
</ul>
|
||||
|
||||
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->
|
||||
|
||||
Reference in new issue
Block a user