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

2000/robison/index.html
+72 -99
View File
@@ -129,9 +129,9 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#Arch_D_Robison">Arch D.
Robison</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#Arch_D_Robison">Arch D. Robison</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 -->
@@ -144,98 +144,88 @@ Robison</a><br> Location: <a href="../../location.html#US">US</a> -
<h2 id="to-use">To use:</h2>
<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">./robison</span></span></code></pre></div>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>The program plays almost always reasonably, but does not always
detect illegal moves. Try “9 1” as your first move, then “13 2”. Also it
tends to think for quite a while in the beginning of a game. It is also
smart enough to give up by making a losing move at the end of a game
when its position is hopeless.</p>
<p>The program plays almost always reasonably, but does not always detect
illegal moves. Try “9 1” as your first move, then “13 2”. Also it
tends to think for quite a while in the beginning of a game. It is
also smart enough to give up by making a losing move at the end of
a game when its position is hopeless.</p>
<p>Unfortunately, due to the contest rules, we’re unable to grant the
author a patent he applied for. :-)</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<h3 id="title-of-invention">TITLE OF INVENTION</h3>
<p>Highly Compressed Program for Playing Hygienic Checkers</p>
<h3 id="field-of-invention">FIELD OF INVENTION</h3>
<p>The present invention generally relates to <a
href="https://en.wikipedia.org/wiki/Checkers">checkers</a>.</p>
<p>The present invention generally relates to
<a href="https://en.wikipedia.org/wiki/Checkers">checkers</a>.</p>
<h3 id="background-of-the-invention">BACKGROUND OF THE INVENTION</h3>
<p>Within the field of <a
href="https://en.wikipedia.org/wiki/Checkers">Checkers</a>, the problem
of finding a hygienic opponent is difficult, as good opponents are
peculiar to the tavern habitat of cracker-barrels, pot-belly stoves,
tobacco, and spittoons.</p>
<h3 id="brief-summary-of-the-invention">BRIEF SUMMARY OF THE
INVENTION</h3>
<p>The present invention plays <a
href="https://en.wikipedia.org/wiki/Checkers">Checkers</a> without
spitting.</p>
<h3 id="brief-description-of-several-views-of-the-invention">BRIEF
DESCRIPTION OF SEVERAL VIEWS OF THE INVENTION</h3>
<p>Within the field of <a href="https://en.wikipedia.org/wiki/Checkers">Checkers</a>, the
problem of finding a hygienic opponent is difficult, as good opponents are
peculiar to the tavern habitat of cracker-barrels, pot-belly stoves, tobacco,
and spittoons.</p>
<h3 id="brief-summary-of-the-invention">BRIEF SUMMARY OF THE INVENTION</h3>
<p>The present invention plays <a href="https://en.wikipedia.org/wiki/Checkers">Checkers</a>
without spitting.</p>
<h3 id="brief-description-of-several-views-of-the-invention">BRIEF DESCRIPTION OF SEVERAL VIEWS OF THE INVENTION</h3>
<p>FIG. 1 shows a numbering of positions.</p>
<p>FIG. 2 shows a numbering of directions.</p>
<p>FIG. 3 shows a sample board.</p>
<p>FIG. 4 shows a method in accordance with the present invention.</p>
<h3 id="detailed-description-of-the-invention">DETAILED DESCRIPTION OF
THE INVENTION</h3>
<p>Operator plays Black (<code>x</code>); the program plays White
(<code>o</code>). Said Black goes first. On operator’s turn, said
program requests a position and direction. FIG. 1 shows the numbering of
the squares. FIG. 2 shows the numbering of directions. As per standard
rules, if one or more jumps are possible, one of the jumps must be taken
in preference to other moves. Said operator enters the numbers for the
<h3 id="detailed-description-of-the-invention">DETAILED DESCRIPTION OF THE INVENTION</h3>
<p>Operator plays Black (<code>x</code>); the program plays White (<code>o</code>). Said Black goes first.
On operator’s turn, said program requests a position and direction. FIG. 1 shows
the numbering of the squares. FIG. 2 shows the numbering of directions. As per
standard rules, if one or more jumps are possible, one of the jumps must be
taken in preference to other moves. Said operator enters the numbers for the
position and direction. If after jumping over a piece, another jump is
possible, and said piece did not become a king after said jump, standard
rules require that another jump be taken. In said case, said program
requests a direction only in which to continue jumping from the present
position. Kings are denoted by upper case. FIG. 3 shows a sample board.
There is a black king (<code>X</code>) on square 30 and a red king
(<code>O</code>) on square 2. The numbers on the right are the numbers
of the rightmost square in each row.</p>
<p>A player loses if they cannot make a legal move. Said loss is
trivially true if player loses all of his/her pieces. The present
invention announces said loser.</p>
<p>FIG. 4 shows a C program in accordance with the present invention.
Control flow is straightforward: control enters routine
<code>main()</code>, executes a plurality of statements, and exits via a
<code>return</code> statement. FIG. 4 presumes that type
<code>int</code> is <code>32 bits</code> and <code>short</code> is
<code>16 bits</code>, which are essential to the preferred embodiment of
the invention. FIG. 4 also presumes that the host computer uses ASCII
encoding for characters. It should be obvious that practitioners skilled
possible, and said piece did not become a king after said jump, standard rules
require that another jump be taken. In said case, said program requests a
direction only in which to continue jumping from the present position. Kings
are denoted by upper case. FIG. 3 shows a sample board. There is a black king
(<code>X</code>) on square 30 and a red king (<code>O</code>) on square 2. The numbers on the right are
the numbers of the rightmost square in each row.</p>
<p>A player loses if they cannot make a legal move. Said loss is trivially
true if player loses all of his/her pieces. The present invention announces
said loser.</p>
<p>FIG. 4 shows a C program in accordance with the present invention. Control flow
is straightforward: control enters routine <code>main()</code>, executes a plurality of
statements, and exits via a <code>return</code> statement. FIG. 4 presumes that type <code>int</code>
is <code>32 bits</code> and <code>short</code> is <code>16 bits</code>, which are essential to the preferred
embodiment of the invention. FIG. 4 also presumes that the host computer uses
ASCII encoding for characters. It should be obvious that practitioners skilled
in the art of C programming can remove said limitations.</p>
<p>The disclosure here describes a particular embodiment of the present
invention, and other embodiments within the spirit of this disclosure
are possible, as well as consumption of spirits while playing.</p>
<p>The disclosure here describes a particular embodiment of the present invention,
and other embodiments within the spirit of this disclosure are possible, as well
as consumption of spirits while playing.</p>
<h3 id="claims">CLAIMS</h3>
<p>I claim, by letters patently absurd:</p>
<ol type="1">
<li><p>A method for playing checkers on a computer-based system, where
said method’s source code fits into 1536 countable bytes of source code,
<li><p>A method for playing checkers on a computer-based system, where said
method’s source code fits into 1536 countable bytes of source code,
where a byte is countable if</p>
<ul>
<li>it is not whitespace and</li>
<li>it is not a ‘<code>{</code>’, ‘<code>}</code>’, or ‘<code>;</code>’
immediately followed by whitespace.</li>
<li>it is not a ‘<code>{</code>’, ‘<code>}</code>’, or ‘<code>;</code>’ immediately followed by whitespace.</li>
</ul></li>
<li><p>The method of claim 1, further comprising a method of alpha-beta
pruning that exploits the zero-sum nature of the game to unify alpha and
beta cuts.</p></li>
<li><p>The method of claim 1, further comprising the step of formatting
the source code with short lines, in order to impress the manager with
<li><p>The method of claim 1, further comprising a method of alpha-beta pruning
that exploits the zero-sum nature of the game to unify alpha
and beta cuts.</p></li>
<li><p>The method of claim 1, further comprising the step of formatting the
source code with short lines, in order to impress the manager with
high productivity, when measured in lines of code.</p></li>
<li><p>The method of claim 3, further comprising the step for telling
the skeptical manager that this is the well-known technique of “linear
programming”.</p></li>
<li><p>The method of claim 1, where <code>~-</code> and <code>-~</code>
replace the obvious arithmetic operations.</p></li>
<li><p>The method of claim 3, further comprising the step for telling the
skeptical manager that this is the well-known technique of
“linear programming”.</p></li>
<li><p>The method of claim 1, where <code>~-</code> and <code>-~</code> replace the obvious arithmetic
operations.</p></li>
<li><p>The method of claim 1, further comprising a method where</p>
<ul>
<li>strings are encrypted in a manner suitable as C strings, and</li>
<li>7-bit ASCII characters with uniform distribution are maximally
packed subject to the restriction that each byte is not countable</li>
<li>7-bit ASCII characters with uniform distribution are maximally packed
subject to the restriction that each byte is not countable</li>
</ul></li>
<li><p>A method for a computer-based system that uses a single shared
code sequence to either sum a plurality of bits in an N-bit word or
reverses them, in lg(N) time, depending upon a parameter.</p></li>
<li><p>A method for a computer-based system that uses a single shared code
sequence to either sum a plurality of bits in an N-bit word or reverses
them, in lg(N) time, depending upon a parameter.</p></li>
</ol>
<h3 id="drawings">DRAWINGS</h3>
<h4 id="fig-1.">FIG 1.</h4>
@@ -273,50 +263,33 @@ reverses them, in lg(N) time, depending upon a parameter.</p></li>
x x O x 1</code></pre>
<h4 id="fig.-4">FIG. 4</h4>
<p>[See attached listing.]</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-2000robison"><a name="inventory"></a>Inventory for
2000/robison</h1>
<h1 id="inventory-for-2000robison"><a name="inventory"></a>Inventory for 2000/robison</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/2000/robison/robison.c">robison.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2000/robison/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2000/robison/robison.orig.c">robison.orig.c</a>
- original source</li>
<li><a href="2000_robison.tar.bz2">2000_robison.tar.bz2</a> - download
entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2000/robison/robison.c">robison.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2000/robison/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2000/robison/robison.orig.c">robison.orig.c</a> - original source</li>
<li><a href="2000_robison.tar.bz2">2000_robison.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/2000/robison/.entry.json">.entry.json</a>
- description of entry in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2000/robison/.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/2000/robison/.entry.json">.entry.json</a> - description of entry in JSON</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2000/robison/.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/2000/robison/README.md">README.md</a>
- markdown source for index.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2000/robison/README.md">README.md</a> - markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->