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>