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

Merge pull request #2476 from xexyl/html91

Browse Source 
Fixes in html files of 1991
This commit is contained in:
Landon Curt Noll authored and GitHub committed 2024-06-22 09:13:13 -07:00
2 parents 76630fd521 34524b841c
commit 1a423f1ca5
8 files changed
+53 -49
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

1991/README.md
+9 -11
View File
@@ -14,10 +14,10 @@ all of the other entries this year:
- [Grand Prize](westley/index.html) by [Brian
Westley](../authors.html#Brian_Westley)
- [Most Well Rounded](dds/index.html) by [Diomidis
- [Most well rounded](dds/index.html) by [Diomidis
Spinellis](../authors.html#Diomidis_Spinellis)
- [Best Of Show](brnstnd/index.html) by [Daniel J.
Bernstein](../authors.html#Daniel_J._Bernstein)
- [Best of Show](brnstnd/index.html) by [Daniel J.
Bernstein](../authors.html#Daniel_J_Bernstein)
Name and address information are separated from the actual program
prior to judging. This eliminates any chance that we would bias our
@@ -29,7 +29,7 @@ a winning entry for the past 5 years!
## A few notes regarding possible changes to the contest:
We did not give awards to some traditional contest categories such as
"Best Layout" or "Worst Abuse of the Rules". We felt that to do so
"_Best Layout_" or "_Worst Abuse of the Rules_". We felt that to do so
would deny awards to more deserving entries. These categories have not
been eliminated, and will likely be considered in future years.
@@ -52,7 +52,7 @@ programs that use these are now portable enough to be valid entries.
We may allow programs to make use of the X Window System libs and include
files, provided that they can operate with a system running at the level
of at least X11r4. Requiring the use of imake, a specific window manager,
of at least X11r4. Requiring the use of `imake`, a specific window manager,
specific display hardware, or a specific user interface (`Openl**k`,
`M*tif`, ...) is likely not to be allowed. We will provide a more detailed
explanation of our viewpoint in next year's rules.
@@ -60,12 +60,10 @@ explanation of our viewpoint in next year's rules.
In order to encourage more 'normal' looking C programs, we are considering
the following change to the maximum size rule:
```
Your source, not counting any <space>, <tab>, and a <newline> character,
and not counting any ';', '{' and '}' character followed by a <newline>
character, must be 1536 bytes or less. The entire source, counting all
characters, be 4096 bytes or less.
```
> Your source, not counting any `<space>`, `<tab>`, and a `<newline>` character, and
not counting any '`;`', '`{`' and '`}`' character followed by a `<newline>` character,
must be 1536 bytes or less. The entire source, counting all characters, be 4096
bytes or less.
Some thought has been given to adding some C++ categories, however this
is not likely to happen soon. We are waiting until C++ compilers become
1991/index.html
+10 -8
View File
@@ -399,9 +399,9 @@ all of the other entries this year:</p>
<ul>
<li><a href="westley/index.html">Grand Prize</a> by <a href="../authors.html#Brian_Westley">Brian
Westley</a></li>
<li><a href="dds/index.html">Most Well Rounded</a> by <a href="../authors.html#Diomidis_Spinellis">Diomidis
<li><a href="dds/index.html">Most well rounded</a> by <a href="../authors.html#Diomidis_Spinellis">Diomidis
Spinellis</a></li>
<li><a href="brnstnd/index.html">Best Of Show</a> by <a href="../authors.html#Daniel_J._Bernstein">Daniel J.
<li><a href="brnstnd/index.html">Best of Show</a> by <a href="../authors.html#Daniel_J_Bernstein">Daniel J.
Bernstein</a></li>
</ul>
<p>Name and address information are separated from the actual program
@@ -412,7 +412,7 @@ as you are to see who has won. Even so, it is worth noting that
a winning entry for the past 5 years!</p>
<h2 id="a-few-notes-regarding-possible-changes-to-the-contest">A few notes regarding possible changes to the contest:</h2>
<p>We did not give awards to some traditional contest categories such as
“Best Layout” or “Worst Abuse of the Rules”. We felt that to do so
“<em>Best Layout</em>” or “<em>Worst Abuse of the Rules</em>”. We felt that to do so
would deny awards to more deserving entries. These categories have not
been eliminated, and will likely be considered in future years.</p>
<p>A number of entries made use of the following C pre-processor feature:</p>
@@ -428,16 +428,18 @@ Since this functionality is now available on many systems, we feel that
programs that use these are now portable enough to be valid entries.</p>
<p>We may allow programs to make use of the X Window System libs and include
files, provided that they can operate with a system running at the level
of at least X11r4. Requiring the use of imake, a specific window manager,
of at least X11r4. Requiring the use of <code>imake</code>, a specific window manager,
specific display hardware, or a specific user interface (<code>Openl**k</code>,
<code>M*tif</code>, …) is likely not to be allowed. We will provide a more detailed
explanation of our viewpoint in next year’s rules.</p>
<p>In order to encourage more ‘normal’ looking C programs, we are considering
the following change to the maximum size rule:</p>
<pre><code> Your source, not counting any &lt;space&gt;, &lt;tab&gt;, and a &lt;newline&gt; character,
and not counting any &#39;;&#39;, &#39;{&#39; and &#39;}&#39; character followed by a &lt;newline&gt;
character, must be 1536 bytes or less. The entire source, counting all
characters, be 4096 bytes or less.</code></pre>
<blockquote>
<p>Your source, not counting any <code>&lt;space&gt;</code>, <code>&lt;tab&gt;</code>, and a <code>&lt;newline&gt;</code> character, and
not counting any ‘<code>;</code>’, ‘<code>{</code>’ and ‘<code>}</code>’ character followed by a <code>&lt;newline&gt;</code> character,
must be 1536 bytes or less. The entire source, counting all characters, be 4096
bytes or less.</p>
</blockquote>
<p>Some thought has been given to adding some C++ categories, however this
is not likely to happen soon. We are waiting until C++ compilers become
common place on a wide number of systems. We also need time to brace
1991/rince/README.md
+1 -1
View File
@@ -104,7 +104,7 @@ Key to map:
The general idea of the game is to collect all the diamonds. This must
be done in the minimum amount of moves. I've allowed a margin of 5
moves which brings the moves allowed to `484`. (alter the value of `u` in
moves which brings the moves allowed to `484` (alter the value of `u` in
the program to set the max moves allowed).
There are two types of boulders. Both can be pushed around, but only
1991/rince/index.html
+1 -1
View File
@@ -461,7 +461,7 @@ enjoyment high.</p>
|</code></pre>
<p>The general idea of the game is to collect all the diamonds. This must
be done in the minimum amount of moves. I’ve allowed a margin of 5
moves which brings the moves allowed to <code>484</code>. (alter the value of <code>u</code> in
moves which brings the moves allowed to <code>484</code> (alter the value of <code>u</code> in
the program to set the max moves allowed).</p>
<p>There are two types of boulders. Both can be pushed around, but only
the hollow (crushable) ones can be turned into diamonds (by pushing it
1991/westley/README.md
+16 -13
View File
@@ -51,7 +51,7 @@ next move, recompile `nextmove.c` and play it again:
## Try:
We have provided the shell script, [ttt](%%REPO_URL%%/1991/westley/ttt.sh), to make it easier to play the
We have provided the shell script, [ttt.sh](%%REPO_URL%%/1991/westley/ttt.sh), to make it easier to play the
game:
``` <!---sh-->
@@ -143,18 +143,21 @@ What happens if you make a move already made?
Now go try and draw or better yet win (without cheating which is very easy :-) )!
Why is win better than draw? Because everyone knows how to draw:
```
Professor Falken: Did you ever play tic-tac-toe?
Jennifer Mack: Yeah. Of course.
Falken: But you don't any more.
Jennifer: No.
Falken: Why?
Jennifer: Because it's a boring game. It's always a tie.
Falken: Exactly. There's no way to win. The game itself is pointless.
But back at the International Obfuscated C Code Contest judges'
room they believe that you can win tic-tac-toe, that there can
be acceptable draws.
```
> **Professor Falken**: Did you ever play **tic-tac-toe**?
>
> **Jennifer Mack**: Yeah. Of course.
>
> **Falken**: But you don't any more.
>
> **Jennifer**: No.
>
> **Falken**: Why?
>
> **Jennifer**: Because it's a boring game. It's always a tie.
>
> **Falken**: Exactly. There's no way to win. The game itself is pointless. But
back at the [International Obfuscated C Code Contest judges' room](../../judges.html) they believe
that you can win tic-tac-toe, that there can be acceptable draws.
Try not to cheat (even though it's very easy :-) ), the computer has not learned
how to catch you doing it.
1991/westley/index.html
+12 -11
View File
@@ -424,7 +424,7 @@ next move, recompile <code>nextmove.c</code> and play it again:</p>
<pre><code> make nextmove
./nextmove move_location | tee nextmove.c</code></pre>
<h2 id="try">Try:</h2>
<p>We have provided the shell script, <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/westley/ttt.sh">ttt</a>, to make it easier to play the
<p>We have provided the shell script, <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/westley/ttt.sh">ttt.sh</a>, to make it easier to play the
game:</p>
<pre><code> make ttt
./ttt [first_move] # &lt;- omit first arg to have it move first
@@ -482,16 +482,17 @@ can lose if you cheat. That’s supposed to happen. Can you win any other time?<
<p>What happens if you make a move already made?</p>
<p>Now go try and draw or better yet win (without cheating which is very easy :-) )!
Why is win better than draw? Because everyone knows how to draw:</p>
<pre><code> Professor Falken: Did you ever play tic-tac-toe?
Jennifer Mack: Yeah. Of course.
Falken: But you don&#39;t any more.
Jennifer: No.
Falken: Why?
Jennifer: Because it&#39;s a boring game. It&#39;s always a tie.
Falken: Exactly. There&#39;s no way to win. The game itself is pointless.
But back at the International Obfuscated C Code Contest judges&#39;
room they believe that you can win tic-tac-toe, that there can
be acceptable draws.</code></pre>
<blockquote>
<p><strong>Professor Falken</strong>: Did you ever play <strong>tic-tac-toe</strong>?</p>
<p><strong>Jennifer Mack</strong>: Yeah. Of course.</p>
<p><strong>Falken</strong>: But you don’t any more.</p>
<p><strong>Jennifer</strong>: No.</p>
<p><strong>Falken</strong>: Why?</p>
<p><strong>Jennifer</strong>: Because it’s a boring game. It’s always a tie.</p>
<p><strong>Falken</strong>: Exactly. There’s no way to win. The game itself is pointless. But
back at the <a href="../../judges.html">International Obfuscated C Code Contest judges’ room</a> they believe
that you can win tic-tac-toe, that there can be acceptable draws.</p>
</blockquote>
<p>Try not to cheat (even though it’s very easy :-) ), the computer has not learned
how to catch you doing it.</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
bugs.html
+2 -2
View File
@@ -1032,8 +1032,8 @@ file does not exist in the directory, this program will very likely crash.</p>
<h3 id="source-code-1991westleywestley.c">Source code: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/westley/westley.c">1991/westley/westley.c</a></h3>
<h3 id="information-1991westleyindex.html">Information: <a href="1991/westley/index.html">1991/westley/index.html</a></h3>
<p>There is a very simple way to always win. The program doesn’t catch you and as
someone called Cody’s late grandmother said to him: ‘it’s not cheating unless
you’re caught’. :-)</p>
someone called Cody’s late grandmother said to him: ‘<em>it’s not cheating unless
you’re caught</em>’. :-)</p>
<p>Please don’t try and fix it as it’s not a bug and was actually documented as a
possibility. Can you find out how? There’s also a way to make it so that even
when you’re cheating it ends up winning! Can you figure that out as well?</p>
bugs.md
+2 -2
View File
@@ -930,8 +930,8 @@ This is a feature, not a bug.
### Information: [1991/westley/index.html](1991/westley/index.html)
There is a very simple way to always win. The program doesn't catch you and as
someone called Cody's late grandmother said to him: 'it's not cheating unless
you're caught'. :-)
someone called Cody's late grandmother said to him: '_it's not cheating unless
you're caught_'. :-)
Please don't try and fix it as it's not a bug and was actually documented as a
possibility. Can you find out how? There's also a way to make it so that even