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

Merge pull request #2307 from xexyl/2020ferguson-links

Browse Source 
Fix links/text in 2020/ferguson[12]
This commit is contained in:
Landon Curt Noll authored and GitHub committed 2024-04-28 12:49:18 -07:00
2 parents 2a23c07e04 5b75be0c85
commit f2eec3d4ea
4 files changed
+35 -70
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2020/ferguson1/README.md
+1 -6
View File
@@ -60,7 +60,7 @@ and non-zero).
size to grow every time you eat a bug. Default 5; negative size to grow every time you eat a bug. Default 5; negative
values are allowed. 'Negativity' creates for fun gameplay modes with values are allowed. 'Negativity' creates for fun gameplay modes with
enough creativity. See [gameplay.html](gameplay.html) enough creativity. See [gameplay.html](gameplay.html)
GitHub) as well as [play.sh](%%REPO_URL%%/2020/ferguson1/play.sh) for some examples. as well as [play.sh](%%REPO_URL%%/2020/ferguson1/play.sh) for some examples.
* **SHED**<br> * **SHED**<br>
every **SHED** movements you will grow (> 0), shrink (< 0) or every **SHED** movements you will grow (> 0), shrink (< 0) or
@@ -579,11 +579,6 @@ programming abilities (and other abilities) even when I couldn't believe in
myself! Very much appreciated especially coming from an amazing programmer who I myself! Very much appreciated especially coming from an amazing programmer who I
have huge admiration for! have huge admiration for!
I want to thank Ilya Kurdyukov for his helpful comments, suggestions and
reporting the (undocumented) 'problem' about half-width/full-width char spacing.
He's been playing with some versions of his own and will have them on GitHub
after the 2020 IOCCC winning entries have been published.
Finally I want to thank Leo Broukhis, Simon Cooper and Landon Curt Noll for Finally I want to thank Leo Broukhis, Simon Cooper and Landon Curt Noll for
continuing to hold the contest after all these years - and for having selected continuing to hold the contest after all these years - and for having selected
my entries. It's a huge honour; thank you! I also happen to **love** your my entries. It's a huge honour; thank you! I also happen to **love** your
2020/ferguson1/index.html
+1 -5
View File
@@ -437,7 +437,7 @@ MAXSIZE</strong> you win <em>before</em> you grow to the full size!</p></li>
size to grow every time you eat a bug. Default 5; negative size to grow every time you eat a bug. Default 5; negative
values are allowed. ‘Negativity’ creates for fun gameplay modes with values are allowed. ‘Negativity’ creates for fun gameplay modes with
enough creativity. See <a href="gameplay.html">gameplay.html</a> enough creativity. See <a href="gameplay.html">gameplay.html</a>
GitHub) as well as <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson1/play.sh">play.sh</a> for some examples.</p></li> as well as <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson1/play.sh">play.sh</a> for some examples.</p></li>
<li><p><strong>SHED</strong><br> <li><p><strong>SHED</strong><br>
every <strong>SHED</strong> movements you will grow (&gt; 0), shrink (&lt; 0) or every <strong>SHED</strong> movements you will grow (&gt; 0), shrink (&lt; 0) or
stay the same length (0) by the <strong>SHEDS</strong> (below) value. Again stay the same length (0) by the <strong>SHEDS</strong> (below) value. Again
@@ -864,10 +864,6 @@ the years and who I owe a great deal to. Thank you for believing in me and my
programming abilities (and other abilities) even when I couldn’t believe in programming abilities (and other abilities) even when I couldn’t believe in
myself! Very much appreciated especially coming from an amazing programmer who I myself! Very much appreciated especially coming from an amazing programmer who I
have huge admiration for!</p> have huge admiration for!</p>
<p>I want to thank Ilya Kurdyukov for his helpful comments, suggestions and
reporting the (undocumented) ‘problem’ about half-width/full-width char spacing.
He’s been playing with some versions of his own and will have them on GitHub
after the 2020 IOCCC winning entries have been published.</p>
<p>Finally I want to thank Leo Broukhis, Simon Cooper and Landon Curt Noll for <p>Finally I want to thank Leo Broukhis, Simon Cooper and Landon Curt Noll for
continuing to hold the contest after all these years - and for having selected continuing to hold the contest after all these years - and for having selected
my entries. It’s a huge honour; thank you! I also happen to <strong>love</strong> your my entries. It’s a huge honour; thank you! I also happen to <strong>love</strong> your
2020/ferguson2/README.md
+16 -31
View File
@@ -115,17 +115,15 @@ There is a good deal of useful documentation that is provided with this entry:
``` ```
* [recode.html][] (or [recode.html](recode.html) if reading on GitHub) * [recode.html][]
- Some useful information about [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c) - Some useful information about [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c)
* [chocolate-cake.html][] (or [chocolate-cake.html](chocolate-cake.html) if reading on GitHub) * [encrypted.html][]
- Because most of us could use some *Double-layered Chocolate Fudge Cake*!
- NOTE: see [recode.html][] (or [recode.html](recode.html) for details about how to decrypt this! - NOTE: see [recode.html][] (or [recode.html](recode.html) for details about how to decrypt this!
[recode.html]: recode.html [recode.html]: recode.html
[chocolate-cake.html]: chocolate-cake.html
## Author's remarks: ## Author's remarks:
@@ -285,15 +283,12 @@ After that you can input the string and it'll go from there.
#### Example run #### Example run
</div> </div>
BTW: There's a much more entertaining (and delicious) challenge or exercise in BTW: There's a much more entertaining way to explore this entry. See
[recode.html][] (if you're reading this on GitHub check the [recode.html][] for more details. There's a secret message that one might like
[recode.html](recode.html) file instead); this involves [chocolate-cake.html][] (if to decipher. These however show the general program as well as how to use the
on GitHub, see [here](chocolate-cake.html), though one might need a different kind two winning entries of the [Morse
of exercise after taking up the challenge! :-) These however show the general
program as well as how to use the two winning entries of the [Morse
code](https://en.wikipedia.org/wiki/Morse_code) that I referred to earlier: code](https://en.wikipedia.org/wiki/Morse_code) that I referred to earlier:
``` <!---sh--> ``` <!---sh-->
$ ./prog - $ ./prog -
Ring 1: 3 Ring 1: 3
@@ -443,8 +438,10 @@ I didn't think of everything. My entry was meant to be a simulator only as far
as the ciphering goes but I thought this would make it much more interesting: as the ciphering goes but I thought this would make it much more interesting:
make it more flexible by a wrapper program. make it more flexible by a wrapper program.
For examples using it (and a delicious challenge) see [recode.html][] (or For examples using it you might enjoy a fun message that I have encrypted using
[recode.html](recode.html) if reading on GitHub). See also the [recode.1][] and a key that you should be able to figure out (it's in a list). This might lead to
something else fun as well but I will not say more than that. Anyway, see
[recode.html](recode.html) for more details. See also the [recode.1][] and
[enigma.1][] man pages. [enigma.1][] man pages.
@@ -497,8 +494,8 @@ by itself. However for the reflector I did `1A` but it only expects 1 char! So
will that mean that the plugboard pairs are off? Yes it does seem to be so. This will that mean that the plugboard pairs are off? Yes it does seem to be so. This
is buffering at play I believe but it's useful for allowing the `recode` program is buffering at play I believe but it's useful for allowing the `recode` program
to easily configure the Enigma machine. In the [recode.html](recode.html) file to easily configure the Enigma machine. In the [recode.html](recode.html) file
(or [recode.html](recode.html) if reading on GitHub) file I give a hint as to how file I give a hint as to how this could be fixed but the caveat is it would
this could be fixed but the caveat is it would necessitate a need for rewriting necessitate a need for rewriting
[recode.c](%%REPO_URL%%/2020/ferguson2/recode.c). [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c).
There's another thing to be aware of and that's the way the ranges are enforced. There's another thing to be aware of and that's the way the ranges are enforced.
@@ -511,13 +508,10 @@ same applies: in C 0-1 but in human it's 1-2 (technically these were reflectors
the Enigma machine which I display by name in [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c) just like the Enigma machine which I display by name in [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c) just like
with the rotors). with the rotors).
For more information see [recode.html][] (or [recode.html](recode.html) if viewing on For more information see [recode.html][].
GitHub).
BTW: If you need a reminder to go to the gym just do your Enigma ABCs and it BTW: If you need a reminder to go to the gym just do your Enigma ABCs and it
should help you remember (though not at this time in our world it might help you should help you remember:
later on?). This might become even more useful after the challenge is accepted,
accomplished and made use of! :)
``` <!---sh--> ``` <!---sh-->
$ echo ABC | ./prog $ echo ABC | ./prog
@@ -584,14 +578,7 @@ To encipher:
The file [obfuscation.key][] is the key to decipher/encipher The file [obfuscation.key][] is the key to decipher/encipher
[obfuscation.txt][]. [obfuscation.txt][].
For the lazy [obfuscation.html](obfuscation.html) has the deciphered version. I am afraid I'm not For the lazy [obfuscation.html](obfuscation.html) has the deciphered version.
so inclined to do that for the cake recipe: the idea there is to make it a fun
exercise that when solved unlocks a wonderful double-layered chocolate fudge
cake recipe. But given that my ['Don't tread on me'](../ferguson1/index.html) award entry
also has the [recipe](../ferguson1/chocolate-cake.html)
([ferguson1/chocolate-cake.html](../ferguson1/chocolate-cake.html) if reading on
GitHub), not enciphered, one might just go there instead. Still it's a fun way
to explore this entry.
As for the [obfuscation.key][] file if you observe the contents you'll find the As for the [obfuscation.key][] file if you observe the contents you'll find the
word `OBFUSCATION`: word `OBFUSCATION`:
@@ -616,7 +603,7 @@ choose from a set of rotors and there were no duplicates. This shouldn't be a
problem here however except that it wouldn't be a possible configuration of the problem here however except that it wouldn't be a possible configuration of the
real Enigma machine. The `recode` program *however does validate this* (except real Enigma machine. The `recode` program *however does validate this* (except
when reading in settings via the `-R` option which I explain in the when reading in settings via the `-R` option which I explain in the
[recode.html][] file ([recode.html](recode.html) on GitHub). [recode.html][] file.
* The way the [plugboard](https://www.cryptomuseum.com/crypto/enigma/i/sb.htm) * The way the [plugboard](https://www.cryptomuseum.com/crypto/enigma/i/sb.htm)
\- for the machines that had them - is, if you connect A to B then no other \- for the machines that had them - is, if you connect A to B then no other
@@ -861,7 +848,6 @@ that.
[enigma.1]: enigma.1 [enigma.1]: enigma.1
[recode.1]: recode.1 [recode.1]: recode.1
[recode.html]: recode.html [recode.html]: recode.html
[chocolate-cake.html]: chocolate-cake.html
[recode.c]: recode.c [recode.c]: recode.c
[obfuscation.html]: obfuscation.html [obfuscation.html]: obfuscation.html
[obfuscation.txt]: obfuscation.txt [obfuscation.txt]: obfuscation.txt
@@ -942,7 +928,6 @@ as well as the award titles. And yes indeed 'most of us could use
If you wish to contact me please do so. Please contact via mastodon. You can try If you wish to contact me please do so. Please contact via mastodon. You can try
email but I'm more likely to respond to mastodon messages. email but I'm more likely to respond to mastodon messages.
[Double-layered Chocolate Fudge Cake]: chocolate-cake.html
[Heer (army)]: https://en.wikipedia.org/wiki/German_Army_(1935%E2%80%931945) [Heer (army)]: https://en.wikipedia.org/wiki/German_Army_(1935%E2%80%931945)
[Heer]: https://en.wikipedia.org/wiki/German_Army_(1935%E2%80%931945) [Heer]: https://en.wikipedia.org/wiki/German_Army_(1935%E2%80%931945)
[Luftwaffe]: https://en.wikipedia.org/wiki/Luftwaffe [Luftwaffe]: https://en.wikipedia.org/wiki/Luftwaffe
2020/ferguson2/index.html
+17 -28
View File
@@ -464,13 +464,12 @@ out! Can you figure out why this works this way?</p>
</ul> </ul>
<pre><code> man ./enigma.1</code></pre> <pre><code> man ./enigma.1</code></pre>
<ul> <ul>
<li><a href="recode.html">recode.html</a> (or <a href="recode.html">recode.html</a> if reading on GitHub) <li><a href="recode.html">recode.html</a>
<ul> <ul>
<li>Some useful information about <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/recode.c">recode.c</a></li> <li>Some useful information about <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/recode.c">recode.c</a></li>
</ul></li> </ul></li>
<li><a href="chocolate-cake.html">chocolate-cake.html</a> (or <a href="chocolate-cake.html">chocolate-cake.html</a> if reading on GitHub) <li>[encrypted.html][]
<ul> <ul>
<li>Because most of us could use some <em>Double-layered Chocolate Fudge Cake</em>!</li>
<li>NOTE: see <a href="recode.html">recode.html</a> (or <a href="recode.html">recode.html</a> for details about how to decrypt this!</li> <li>NOTE: see <a href="recode.html">recode.html</a> (or <a href="recode.html">recode.html</a> for details about how to decrypt this!</li>
</ul></li> </ul></li>
</ul> </ul>
@@ -597,12 +596,10 @@ pairs</a>.</p>
<div id="example"> <div id="example">
<h4 id="example-run">Example run</h4> <h4 id="example-run">Example run</h4>
</div> </div>
<p>BTW: There’s a much more entertaining (and delicious) challenge or exercise in <p>BTW: There’s a much more entertaining way to explore this entry. See
<a href="recode.html">recode.html</a> (if you’re reading this on GitHub check the <a href="recode.html">recode.html</a> for more details. There’s a secret message that one might like
<a href="recode.html">recode.html</a> file instead); this involves <a href="chocolate-cake.html">chocolate-cake.html</a> (if to decipher. These however show the general program as well as how to use the
on GitHub, see <a href="chocolate-cake.html">here</a>, though one might need a different kind two winning entries of the <a href="https://en.wikipedia.org/wiki/Morse_code">Morse
of exercise after taking up the challenge! :-) These however show the general
program as well as how to use the two winning entries of the <a href="https://en.wikipedia.org/wiki/Morse_code">Morse
code</a> that I referred to earlier:</p> code</a> that I referred to earlier:</p>
<pre><code> $ ./prog - <pre><code> $ ./prog -
Ring 1: 3 Ring 1: 3
@@ -701,8 +698,10 @@ having to type it out again every time).</p>
I didn’t think of everything. My entry was meant to be a simulator only as far I didn’t think of everything. My entry was meant to be a simulator only as far
as the ciphering goes but I thought this would make it much more interesting: as the ciphering goes but I thought this would make it much more interesting:
make it more flexible by a wrapper program.</p> make it more flexible by a wrapper program.</p>
<p>For examples using it (and a delicious challenge) see <a href="recode.html">recode.html</a> (or <p>For examples using it you might enjoy a fun message that I have encrypted using
<a href="recode.html">recode.html</a> if reading on GitHub). See also the <a href="recode.1">recode.1</a> and a key that you should be able to figure out (it’s in a list). This might lead to
something else fun as well but I will not say more than that. Anyway, see
<a href="recode.html">recode.html</a> for more details. See also the <a href="recode.1">recode.1</a> and
<a href="enigma.1">enigma.1</a> man pages.</p> <a href="enigma.1">enigma.1</a> man pages.</p>
<div id="parsersubtlety"> <div id="parsersubtlety">
<h3 id="a-parser-subtlety-that-could-cause-confusion">A parser subtlety that could cause confusion</h3> <h3 id="a-parser-subtlety-that-could-cause-confusion">A parser subtlety that could cause confusion</h3>
@@ -746,8 +745,8 @@ by itself. However for the reflector I did <code>1A</code> but it only expects 1
will that mean that the plugboard pairs are off? Yes it does seem to be so. This will that mean that the plugboard pairs are off? Yes it does seem to be so. This
is buffering at play I believe but it’s useful for allowing the <code>recode</code> program is buffering at play I believe but it’s useful for allowing the <code>recode</code> program
to easily configure the Enigma machine. In the <a href="recode.html">recode.html</a> file to easily configure the Enigma machine. In the <a href="recode.html">recode.html</a> file
(or <a href="recode.html">recode.html</a> if reading on GitHub) file I give a hint as to how file I give a hint as to how this could be fixed but the caveat is it would
this could be fixed but the caveat is it would necessitate a need for rewriting necessitate a need for rewriting
<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/recode.c">recode.c</a>.</p> <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/recode.c">recode.c</a>.</p>
<p>There’s another thing to be aware of and that’s the way the ranges are enforced. <p>There’s another thing to be aware of and that’s the way the ranges are enforced.
There are five rotors which obviously are in C 0-4 but in ‘natural language’ There are five rotors which obviously are in C 0-4 but in ‘natural language’
@@ -757,12 +756,9 @@ There are five rotors which obviously are in C 0-4 but in ‘natural language’
same applies: in C 0-1 but in human it’s 1-2 (technically these were reflectors B and C in same applies: in C 0-1 but in human it’s 1-2 (technically these were reflectors B and C in
the Enigma machine which I display by name in <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/recode.c">recode.c</a> just like the Enigma machine which I display by name in <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/recode.c">recode.c</a> just like
with the rotors).</p> with the rotors).</p>
<p>For more information see <a href="recode.html">recode.html</a> (or <a href="recode.html">recode.html</a> if viewing on <p>For more information see <a href="recode.html">recode.html</a>.</p>
GitHub).</p>
<p>BTW: If you need a reminder to go to the gym just do your Enigma ABCs and it <p>BTW: If you need a reminder to go to the gym just do your Enigma ABCs and it
should help you remember (though not at this time in our world it might help you should help you remember:</p>
later on?). This might become even more useful after the challenge is accepted,
accomplished and made use of! :)</p>
<pre><code> $ echo ABC | ./prog <pre><code> $ echo ABC | ./prog
GYM GYM
$ echo ABC | ./prog | ./prog $ echo ABC | ./prog | ./prog
@@ -801,14 +797,7 @@ has some of the ways I think this entry is obfuscated. To decipher try:</p>
<pre><code> ./recode -Robfuscation.key -fobfuscation.md | ./prog - 2&gt;/dev/null &gt; obfuscation.txt</code></pre> <pre><code> ./recode -Robfuscation.key -fobfuscation.md | ./prog - 2&gt;/dev/null &gt; obfuscation.txt</code></pre>
<p>The file <a href="obfuscation.key">obfuscation.key</a> is the key to decipher/encipher <p>The file <a href="obfuscation.key">obfuscation.key</a> is the key to decipher/encipher
<a href="obfuscation.txt">obfuscation.txt</a>.</p> <a href="obfuscation.txt">obfuscation.txt</a>.</p>
<p>For the lazy <a href="obfuscation.html">obfuscation.html</a> has the deciphered version. I am afraid I’m not <p>For the lazy <a href="obfuscation.html">obfuscation.html</a> has the deciphered version.</p>
so inclined to do that for the cake recipe: the idea there is to make it a fun
exercise that when solved unlocks a wonderful double-layered chocolate fudge
cake recipe. But given that my <a href="../ferguson1/index.html">‘Don’t tread on me’</a> award entry
also has the <a href="../ferguson1/chocolate-cake.html">recipe</a>
(<a href="../ferguson1/chocolate-cake.html">ferguson1/chocolate-cake.html</a> if reading on
GitHub), not enciphered, one might just go there instead. Still it’s a fun way
to explore this entry.</p>
<p>As for the <a href="obfuscation.key">obfuscation.key</a> file if you observe the contents you’ll find the <p>As for the <a href="obfuscation.key">obfuscation.key</a> file if you observe the contents you’ll find the
word <code>OBFUSCATION</code>:</p> word <code>OBFUSCATION</code>:</p>
<pre><code> 2OB5FU1SC2ATIONCDEFGHJKLMPQRYZ <pre><code> 2OB5FU1SC2ATIONCDEFGHJKLMPQRYZ
@@ -826,7 +815,7 @@ choose from a set of rotors and there were no duplicates. This shouldn’t be a
problem here however except that it wouldn’t be a possible configuration of the problem here however except that it wouldn’t be a possible configuration of the
real Enigma machine. The <code>recode</code> program <em>however does validate this</em> (except real Enigma machine. The <code>recode</code> program <em>however does validate this</em> (except
when reading in settings via the <code>-R</code> option which I explain in the when reading in settings via the <code>-R</code> option which I explain in the
<a href="recode.html">recode.html</a> file (<a href="recode.html">recode.html</a> on GitHub).</p></li> <a href="recode.html">recode.html</a> file.</p></li>
<li><p>The way the <a href="https://www.cryptomuseum.com/crypto/enigma/i/sb.htm">plugboard</a> <li><p>The way the <a href="https://www.cryptomuseum.com/crypto/enigma/i/sb.htm">plugboard</a>
- for the machines that had them - is, if you connect A to B then no other - for the machines that had them - is, if you connect A to B then no other
letters can connect to A or B. Earlier there wasn’t proper detection and this letters can connect to A or B. Earlier there wasn’t proper detection and this
@@ -1067,7 +1056,7 @@ have huge admiration for!</p>
continuing to hold the contest after all these years - and for having selected continuing to hold the contest after all these years - and for having selected
my entries. It’s a huge honour; thank you! I also happen to love your comments my entries. It’s a huge honour; thank you! I also happen to love your comments
as well as the award titles. And yes indeed ‘most of us could use as well as the award titles. And yes indeed ‘most of us could use
<em><a href="chocolate-cake.html">Double-layered Chocolate Fudge Cake</a></em>!’</p> <em>[Double-layered Chocolate Fudge Cake][]</em>!’</p>
<p>If you wish to contact me please do so. Please contact via mastodon. You can try <p>If you wish to contact me please do so. Please contact via mastodon. You can try
email but I’m more likely to respond to mastodon messages.</p> email but I’m more likely to respond to mastodon messages.</p>
<!-- <!--