Rules/Guidelines: link all references to 'judges'

next/guidelines.html

@@ -416,7 +416,7 @@ writing by <a href="../contact.html">contacting the judges</a>.</p>
 <h2 id="ioccc-guidelines-version">IOCCC Guidelines version</h2>
 </div>
 <p class="leftbar">
-These <a href="guidelines.html">IOCCC guidelines</a> are version <strong>28.7 2024-07-08</strong>.
+These <a href="guidelines.html">IOCCC guidelines</a> are version <strong>28.8 2024-07-10</strong>.
 </p>
 <p><strong>IMPORTANT</strong>: Be <strong>SURE</strong> to read the <a href="rules.html">IOCCC rules</a>.</p>
 <div id="change_marks">
@@ -625,7 +625,7 @@ counted by the IOCCC size tool. This is a feature, not a bug!
 </p>
 <p>In cases where the above summary and the algorithm implemented by
 the IOCCC size tool source code conflict, the algorithm implemented
-by the IOCCC size tool source code is preferred by the judges.</p>
+by the IOCCC size tool source code is preferred by the <a href="../judges.html">judges</a>.</p>
 <p class="leftbar">
 There are at least 2 other reasons for selecting 2503 as the 2nd limit besides
 the fact that 2503 is a prime. These reasons may be searched for and discovered
@@ -972,7 +972,7 @@ of nested functions such as:</p>
          }
 |        please_dont_submit_this();
      }</code></pre>
-<p>On 2012 July 20, the judges rescinded the encouragement of
+<p>On 2012 July 20, the <a href="../judges.html">judges</a> rescinded the encouragement of
 nested functions. Such constructions, while interesting and sometimes
 amusing, will have to wait until they required by a C standard that are
 actually implemented in <strong>BOTH</strong> <code>gcc</code> <strong>AND</strong> <code>clang</code>.</p>
@@ -1102,7 +1102,7 @@ Other windows, on the other hand, might be OK: especially where “<strong>X
 marks the spot</strong>”. Yet on the third hand, windows are best when they are
 “unseen” (i.e., not dirty). :-)
 </p>
-<p>The judges, as a group, have a history giving wide degree of latitude
+<p>The <a href="../judges.html">judges</a>, as a group, have a history giving wide degree of latitude
 to reasonable entries. And recently they have had as much longitudinal
 variation as it is possible to have on <a href="https://science.nasa.gov/earth/">Earth</a>. :-)</p>
 <p class="leftbar">
@@ -1121,7 +1121,7 @@ operating systems (e.g., Linux, GNU Hurd, BSD, Unix, etc.).</p>
 <blockquote>
 <p>You are in a maze of twisty <em>guidelines</em>, all different.</p>
 </blockquote>
-<p>There are at least zero judges who think that
+<p>There are at least zero <a href="../judges.html">judges</a> who think that
 <a href="https://en.wikipedia.org/wiki/Fideism">Fideism</a> has little
 or nothing to do with the IOCCC judging process.</p>
 <p>Don’t forget that the building of your program should be done
@@ -1366,7 +1366,7 @@ Noll</a>, might run the risk of violating
 <a href="rules.html#rule7">Rule 7</a> does not prohibit you from writing your own
 obfuscated versions of these tools, unless of course you are <a href="http://www.isthe.com/chongo/index.html">Landon Curt
 Noll</a>, in which case you <em>probably</em> won’t
-win since judges are disqualified! :-)
+win since <a href="../judges.html">judges</a> are disqualified! :-)
 However, <em><strong>if you do</strong> write your own version, <strong>you might wish</strong> to make it do something more
 interesting</em> than simply implementing the <a href="../index.html">IOCCC</a> tools’ algorithms. On the other
 hand, writing an obfuscated version of a library runs the risk of violating
@@ -1414,7 +1414,7 @@ produce unpredictable results.</p>
 <code>2305567963945518424753102147331756070</code>. Attempting to factor values outside
 that range will produce unpredictable results.</p>
 </blockquote>
-<p>Moreover the try to also factor 3.5 or 0x7, or Fred, so you want to might state:</p>
+<p>Moreover the might try to also factor 3.5 or 0x7, or Fred, so you want to might state:</p>
 <blockquote>
 <p>This submission factors integers between 1 and
 <code>2305567963945518424753102147331756070</code>. Attempting to factor anything else
@@ -1490,7 +1490,7 @@ entries, regardless of if they receive an award, result in changes to
 the next year’s <a href="rules.html">IOCCC rules</a> and <a href="guidelines.html">IOCCC guidelines</a>.</p>
 <p>Legal abuse of the <a href="rules.html">IOCCC rules</a> is <strong>NOT</strong> an invitation to violate the
 <a href="rules.html">IOCCC rules</a>. A submission that violates the <a href="rules.html">rules</a> in the
-opinion of the judges, <strong>WILL</strong> be
+opinion of the <a href="../judges.html">judges</a>, <strong>WILL</strong> be
 disqualified. <strong><em>RULE ABUSE CARRIES A CERTAIN LEVEL OF RISK!</em></strong> If you
 have a submission that might otherwise be interesting, you might want to
 submit two versions; one that does not abuse the <a href="rules.html">IOCCC rules</a> and one that
@@ -1509,7 +1509,7 @@ submitting an alternate version that conforms to the
 If you do bypass the <code>mkiocccentry(1)</code> warnings about <a href="rules.html#rule2a">Rule
 2a</a> and/or about <a href="rules.html#rule2b">Rule 2b</a>
 and submit a submission anyway, you <strong>MUST</strong> try to justify why the IOCCC
-judges should not reject your submission due to a rule violation.
+<a href="../judges.html">judges</a> should not reject your submission due to a rule violation.
 </p>
 <p>Abusing the web submission procedure tends to annoy us more
 than amuse us. Spend your creative energy on content of your
@@ -1542,7 +1542,7 @@ This is one of the reasons why the <a href="rules.html">IOCCC rules</a> and
 submission files including, but not limited to <code>prog.c</code>, <code>Makefile</code>,
 <code>remarks.md</code> as well as any data files that you submit, are all placed under
 their own directory and stored and judged from this directory.</p>
-<p>Any information about the authors is not read by the judges until
+<p>Any information about the authors is not read by the <a href="../judges.html">judges</a> until
 the judging process is complete, and then only from entries that have
 won an award. Because we do not read this information for entries that
 do not win, we do not know who did not win.</p>
@@ -1554,7 +1554,7 @@ about the others. However we consider this to be simply circumstantial
 and outside the scope of the above paragraph.</p>
 <p>Some people, in the past, have attempted to obfuscate their identity by
 including comments of famous Internet personalities such as <a href="http://www.citi.umich.edu/u/honey">Peter
-Honeyman</a>. The judges are on to this trick
+Honeyman</a>. The <a href="../judges.html">judges</a> are on to this trick
 and therefore consider any obfuscated source or data file claiming to be from
 Honeyman to not be from Honeyman. This of course creates an interesting paradox
 known as the “<strong>obfuscated Peter Honeyman paradox</strong>”. Should Peter Honeyman