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

fix internal links in entry index.html from 1984 thru 2012

Browse Source
This commit is contained in:
Landon Curt Noll committed 2024-04-22 03:17:20 -07:00
1 parent 2da0a6c05f
commit 99cd17401e
151 files changed
+360 -360
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2005/aidan/README.md
+12 -12
View File
@@ -73,16 +73,16 @@ generate new ones.
### Contents
* program file: [aidan.c](aidan.c) - sudoku solver and generator
* test suite: [test-su.perl](test-su.perl) - optional test script (written for Perl5)
* sudoku file: [blank.sudoku](blank.sudoku)
* sudoku file: [insane1.sudoku](insane1.sudoku)
* sudoku file: [insane2.sudoku](insane2.sudoku)
* sudoku file: [insane3.sudoku](insane3.sudoku)
* sudoku file: [insane4.sudoku](insane4.sudoku)
* sudoku file: [insane5.sudoku](insane5.sudoku)
* sudoku file: [tough1.sudoku](tough1.sudoku)
* sudoku file: [wp.sudoku](wp.sudoku)
* program file: [aidan.c](%%REPO_URL%%/2005/aidan/aidan.c) - sudoku solver and generator
* test suite: [test-su.perl](%%REPO_URL%%/2005/aidan/test-su.perl) - optional test script (written for Perl5)
* sudoku file: [blank.sudoku](%%REPO_URL%%/2005/aidan/blank.sudoku)
* sudoku file: [insane1.sudoku](%%REPO_URL%%/2005/aidan/insane1.sudoku)
* sudoku file: [insane2.sudoku](%%REPO_URL%%/2005/aidan/insane2.sudoku)
* sudoku file: [insane3.sudoku](%%REPO_URL%%/2005/aidan/insane3.sudoku)
* sudoku file: [insane4.sudoku](%%REPO_URL%%/2005/aidan/insane4.sudoku)
* sudoku file: [insane5.sudoku](%%REPO_URL%%/2005/aidan/insane5.sudoku)
* sudoku file: [tough1.sudoku](%%REPO_URL%%/2005/aidan/tough1.sudoku)
* sudoku file: [wp.sudoku](%%REPO_URL%%/2005/aidan/wp.sudoku)
Yes, the test suite really is 5 times larger than the actual program. You
@@ -150,7 +150,7 @@ Now, with modern computers this **can** be solved using brute force, e.g.:
:n%27?"\n":n%81?"\n------+-------+------\n":"\n\n"));}return z;}
```
**Judges' note**: this was added as [aidan.alt.c](aidan.alt.c).
**Judges' note**: this was added as [aidan.alt.c](%%REPO_URL%%/2005/aidan/aidan.alt.c).
That isn't the approach I've used; it's slow (particularly in worst-case or
nearly so scenarios), inelegant, and not a good starting point for sudoku
@@ -177,7 +177,7 @@ program generated):
```
Be warned - it's evil! (I certainly haven't been able to solve it by hand. The
brute-force program given above, `sudoku-bfi.c` ([aidan.alt.c](aidan.alt.c)),
brute-force program given above, `sudoku-bfi.c` ([aidan.alt.c](%%REPO_URL%%/2005/aidan/aidan.alt.c)),
also has trouble - it took 66 seconds to solve it - but probably for different
reasons. That's the worst performance I've had from brute-force so far!)
2005/aidan/index.html
+12 -12
View File
@@ -186,16 +186,16 @@ into the directory instead. These files were added to the list.</p>
generate new ones.</p>
<h3 id="contents">Contents</h3>
<ul>
<li>program file: <a href="aidan.c">aidan.c</a> - sudoku solver and generator</li>
<li>test suite: <a href="test-su.perl">test-su.perl</a> - optional test script (written for Perl5)</li>
<li>sudoku file: <a href="blank.sudoku">blank.sudoku</a></li>
<li>sudoku file: <a href="insane1.sudoku">insane1.sudoku</a></li>
<li>sudoku file: <a href="insane2.sudoku">insane2.sudoku</a></li>
<li>sudoku file: <a href="insane3.sudoku">insane3.sudoku</a></li>
<li>sudoku file: <a href="insane4.sudoku">insane4.sudoku</a></li>
<li>sudoku file: <a href="insane5.sudoku">insane5.sudoku</a></li>
<li>sudoku file: <a href="tough1.sudoku">tough1.sudoku</a></li>
<li>sudoku file: <a href="wp.sudoku">wp.sudoku</a></li>
<li>program file: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/aidan.c">aidan.c</a> - sudoku solver and generator</li>
<li>test suite: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/test-su.perl">test-su.perl</a> - optional test script (written for Perl5)</li>
<li>sudoku file: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/blank.sudoku">blank.sudoku</a></li>
<li>sudoku file: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/insane1.sudoku">insane1.sudoku</a></li>
<li>sudoku file: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/insane2.sudoku">insane2.sudoku</a></li>
<li>sudoku file: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/insane3.sudoku">insane3.sudoku</a></li>
<li>sudoku file: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/insane4.sudoku">insane4.sudoku</a></li>
<li>sudoku file: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/insane5.sudoku">insane5.sudoku</a></li>
<li>sudoku file: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/tough1.sudoku">tough1.sudoku</a></li>
<li>sudoku file: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/wp.sudoku">wp.sudoku</a></li>
</ul>
<p>Yes, the test suite really is 5 times larger than the actual program. You
<strong>did</strong> say this was a parody of the software development process…</p>
@@ -241,7 +241,7 @@ Telegraph</a>, a UK newspaper.</p>
d;for(n=p;i[++p];);s[p]=n;i[p]=1;goto f;d:z=p&lt;81;printf(&quot;\n%s!\n\n&quot;,z?&quot;Fail&quot;:
&quot;Success&quot;);for(n=0;n&lt;81;){p=i[n];printf(&quot;%c %s&quot;,(p?p|48:&#39;.&#39;),(++n%3?&quot;&quot;:n%9?&quot;| &quot;
:n%27?&quot;\n&quot;:n%81?&quot;\n------+-------+------\n&quot;:&quot;\n\n&quot;));}return z;}</code></pre>
<p><strong>Judges’ note</strong>: this was added as <a href="aidan.alt.c">aidan.alt.c</a>.</p>
<p><strong>Judges’ note</strong>: this was added as <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/aidan.alt.c">aidan.alt.c</a>.</p>
<p>That isn’t the approach I’ve used; it’s slow (particularly in worst-case or
nearly so scenarios), inelegant, and not a good starting point for sudoku
generation. It’s also much too easy to understand ;-) Instead, I’ve written a
@@ -262,7 +262,7 @@ program generated):</p>
3 . . | . . . | . . .
. . . | . . . | . 6 1</code></pre>
<p>Be warned - it’s evil! (I certainly haven’t been able to solve it by hand. The
brute-force program given above, <code>sudoku-bfi.c</code> (<a href="aidan.alt.c">aidan.alt.c</a>),
brute-force program given above, <code>sudoku-bfi.c</code> (<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/aidan.alt.c">aidan.alt.c</a>),
also has trouble - it took 66 seconds to solve it - but probably for different
reasons. That’s the worst performance I’ve had from brute-force so far!)</p>
<h3 id="usage">Usage</h3>
2005/anon/README.md
+1 -1
View File
@@ -12,7 +12,7 @@ version](#alternate-code) below. If your terminal has problems with the
make anon-no_stty
```
This will compile [anon.c](anon.c) as `anon` to not use `stty(1)`.
This will compile [anon.c](%%REPO_URL%%/2005/anon/anon.c) as `anon` to not use `stty(1)`.
### Bugs and (Mis)features:
2005/anon/index.html
+1 -1
View File
@@ -158,7 +158,7 @@ Location: <a href="../../location.html#ZZ">ZZ</a> - <em>Unknown location</em></l
version</a> below. If your terminal has problems with the
<code>stty(1)</code> commands try:</p>
<pre><code> make anon-no_stty</code></pre>
<p>This will compile <a href="anon.c">anon.c</a> as <code>anon</code> to not use <code>stty(1)</code>.</p>
<p>This will compile <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/anon/anon.c">anon.c</a> as <code>anon</code> to not use <code>stty(1)</code>.</p>
<h3 id="bugs-and-misfeatures">Bugs and (Mis)features:</h3>
<p>The current status of this entry is:</p>
<pre><code> STATUS: INABIAF - please **DO NOT** fix</code></pre>
2005/boutines/README.md
+1 -1
View File
@@ -26,7 +26,7 @@ Implementations](https://www.w3.org/Graphics/SVG/WG/wiki/Implementations).
./try.sh
```
If `ruby` is installed [try.sh](try.sh) will generate an SVG file by:
If `ruby` is installed [try.sh](%%REPO_URL%%/2005/boutines/try.sh) will generate an SVG file by:
``` <!---sh-->
ruby -e '20.times{puts "#{rand} #{rand}"}' | ./boutines > test.svg
2005/boutines/index.html
+1 -1
View File
@@ -164,7 +164,7 @@ Implementations</a>.</p>
<pre><code> ./boutines &lt; input &gt; output.svg</code></pre>
<h2 id="try">Try:</h2>
<pre><code> ./try.sh</code></pre>
<p>If <code>ruby</code> is installed <a href="try.sh">try.sh</a> will generate an SVG file by:</p>
<p>If <code>ruby</code> is installed <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/boutines/try.sh">try.sh</a> will generate an SVG file by:</p>
<pre><code> ruby -e &#39;20.times{puts &quot;#{rand} #{rand}&quot;}&#39; | ./boutines &gt; test.svg</code></pre>
<p>It will also create an SVG file with the file <a href="input.txt">input.txt</a>.</p>
<p>The script will check if <code>convert</code> is available and if so it will try converting
2005/giljade/README.md
+1 -1
View File
@@ -40,7 +40,7 @@ For more detailed information see [2005 giljade bugs](../../bugs.html#2005_gilja
./giljade out
```
NOTE: [try.sh](try.sh) will ask you if you wish to do this.
NOTE: [try.sh](%%REPO_URL%%/2005/giljadetry.sh) will ask you if you wish to do this.
## Judges' remarks:
2005/giljade/index.html
+1 -1
View File
@@ -167,7 +167,7 @@ will not work with it enabled.</p>
<h3 id="self-test-feature-to-try">Self-test feature to try:</h3>
<pre><code> ./giljade &gt; out
./giljade out</code></pre>
<p>NOTE: <a href="try.sh">try.sh</a> will ask you if you wish to do this.</p>
<p>NOTE: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljadetry.sh">try.sh</a> will ask you if you wish to do this.</p>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>This entry takes editorial in how it deals with its output. After using <code>vi(1)</code>
(or <code>vim(1)</code>) to look at the source, use <code>vi(1)</code> (or <code>vim(1)</code>) to look at its
2005/mikeash/README.md
+1 -1
View File
@@ -143,7 +143,7 @@ this, run the common lisp compiler and then type the following command:
(load "mikeash.c")
```
The source code of [mikeash.c](mikeash.c) will be printed.
The source code of [mikeash.c](%%REPO_URL%%/2005/mikeashmikeash.c) will be printed.
### Obfuscation
2005/mikeash/index.html
+1 -1
View File
@@ -237,7 +237,7 @@ for running itself. To do the latter, try this:</p>
lisp</a>. To do
this, run the common lisp compiler and then type the following command:</p>
<pre><code> (load &quot;mikeash.c&quot;)</code></pre>
<p>The source code of <a href="mikeash.c">mikeash.c</a> will be printed.</p>
<p>The source code of <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/mikeashmikeash.c">mikeash.c</a> will be printed.</p>
<h3 id="obfuscation">Obfuscation</h3>
<p><code>Lispob</code> is obfuscated in several ways. First, it’s actually two programs
in one, which actually share a small amount of code. Running a C code
2005/vik/README.md
+2 -2
View File
@@ -80,13 +80,13 @@ Start the engine using a built in labyrinth and texture bitmaps:
```
Start the engine and loads the labyrinth defined in the file
[maze.map](maze.map):
[maze.map](%%REPO_URL%%/2005/vik/maze.map):
``` <!---sh-->
./vik maze.map
```
Start the engine using [maze.map](maze.map) in a window that is 400 pixels wide:
Start the engine using [maze.map](%%REPO_URL%%/2005/vik/maze.map) in a window that is 400 pixels wide:
``` <!---sh-->
./vik -w 400 maze.map
2005/vik/index.html
+2 -2
View File
@@ -197,9 +197,9 @@ three options which have to be typed in a specific order as described below.</p>
<p>Start the engine using a built in labyrinth and texture bitmaps:</p>
<pre><code> ./vik</code></pre>
<p>Start the engine and loads the labyrinth defined in the file
<a href="maze.map">maze.map</a>:</p>
<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/vik/maze.map">maze.map</a>:</p>
<pre><code> ./vik maze.map</code></pre>
<p>Start the engine using <a href="maze.map">maze.map</a> in a window that is 400 pixels wide:</p>
<p>Start the engine using <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/vik/maze.map">maze.map</a> in a window that is 400 pixels wide:</p>
<pre><code> ./vik -w 400 maze.map</code></pre>
<p>Note that the <code>mapfile</code> has to be the last argument and the <code>-w</code> option if present
has to be the first. The map definition files and the bitmap files should be
2005/vince/README.md
+1 -1
View File
@@ -23,7 +23,7 @@ what happens!
## Alternate code:
The [vince.alt.c](vince.alt.c) code of the submission will run on SGI IRIX and
The [vince.alt.c](%%REPO_URL%%/2005/vince/vince.alt.c) code of the submission will run on SGI IRIX and
also has the recursive `CPP` macro (which sneaked in accidentally) removed.
2005/vince/index.html
+1 -1
View File
@@ -162,7 +162,7 @@ installed.</p>
<p>When running this in the program’s window try hitting space a few times and see
what happens!</p>
<h2 id="alternate-code">Alternate code:</h2>
<p>The <a href="vince.alt.c">vince.alt.c</a> code of the submission will run on SGI IRIX and
<p>The <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/vince/vince.alt.c">vince.alt.c</a> code of the submission will run on SGI IRIX and
also has the recursive <code>CPP</code> macro (which sneaked in accidentally) removed.</p>
<h3 id="alternate-build">Alternate build:</h3>
<p>To compile this alternate version:</p>