Fixes in most of 1992 index.html files

With the exception of 1992/nathan/index.html the entries of 1992 should
all be okay. The reason nathan cannot be done yet is some things have to
be decided first.

This commit fixes:

    1992/marangon/index.html
    1992/vern/index.html
    1992/westley/index.html

1992/marangon/README.md

@@ -14,9 +14,9 @@
 
 ## Judges' remarks:
 
-The object is to refill the table with 5's, by incrementing or decrementing
+The object is to refill the table with `5`s, by incrementing or decrementing
 numbers as needed.  It is the side effects that get you into trouble.  If you
-are not careful, you may find things "at 6's and 7's".  :-)
+are not careful, you may find things "at `6`s and `7`s".  :-)
 
 NOTE: Some compilers have had trouble optimizing this entry.
 
@@ -31,8 +31,8 @@ avoids this problem.
 
 ## Author's remarks:
 
-It starts off by creating a table with number 5 in all places.  The CPU melts
-the numbers and you must return them in original state.  When you increase a
+It starts off by creating a table with the number `5` in all places.  The CPU melts
+the numbers and you must return them to the original state.  When you increase a
 number, all the other eight numbers next to it decrease and vice-versa.
 
 

1992/marangon/index.html

@@ -412,9 +412,9 @@ Location: <a href="../../location.html#IT">IT</a> - <em>Italian Republic</em> (<
 <h2 id="to-use">To use:</h2>
 <pre><code>    ./marangon</code></pre>
 <h2 id="judges-remarks">Judges’ remarks:</h2>
-<p>The object is to refill the table with 5’s, by incrementing or decrementing
+<p>The object is to refill the table with <code>5</code>s, by incrementing or decrementing
 numbers as needed. It is the side effects that get you into trouble. If you
-are not careful, you may find things “at 6’s and 7’s”. :-)</p>
+are not careful, you may find things “at <code>6</code>s and <code>7</code>s”. :-)</p>
 <p>NOTE: Some compilers have had trouble optimizing this entry.</p>
 <p>NOTE: Some systems need to compile with <code>-ltermcap</code> as well as <code>-lcurses</code>.</p>
 <p>NOTE: The original winning source
@@ -423,8 +423,8 @@ are not careful, you may find things “at 6’s and 7’s”. :-)</p>
 returns a <code>void</code>. The file <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/marangon/marangon.c">marangon.c</a>
 avoids this problem.</p>
 <h2 id="authors-remarks">Author’s remarks:</h2>
-<p>It starts off by creating a table with number 5 in all places. The CPU melts
-the numbers and you must return them in original state. When you increase a
+<p>It starts off by creating a table with the number <code>5</code> in all places. The CPU melts
+the numbers and you must return them to the original state. When you increase a
 number, all the other eight numbers next to it decrease and vice-versa.</p>
 <!--
 

1992/vern/README.md

@@ -109,11 +109,19 @@ ply of 3).  A ply of 3 is in general good enough to avoid not only flaming
 blunders but also immediately stupid moves altogether.  A ply of 4 will find all
 mate-in-two's.
 
+### NOTICE to those who wish for a greater challenge:
+
+**If you want a greater challenge, don't read any further**:
+just try to understand the program via the source.
+
+If you get stuck, come back and read below for additional hints and information.
+
 
 ### Obfuscation
 
+
 This program is obfuscated in a number of ways.  First, it abuses the
-contest rule regarding ';', '{', and '}' in the source not counting
+contest rule regarding `;`, `{`, and `}` in the source not counting
 against the non-whitespace character limit if followed by whitespace.
 As can be seen from the build file, certain combinations of these
 characters followed by a particular whitespace character are expanded
@@ -154,7 +162,8 @@ Finally, there are three key constants that occur throughout the program:  `64`,
 which provides a hint as to what the program is up to, they are computed
 probabilistically at run-time.  An instance of the ["Inspection
 Paradox"](https://en.wikipedia.org/wiki/Renewal_theory#Inspection_paradox) is
-used which happens to produce a value that on average is close to `.64`.
+used which happens to produce a value that on average is close to `64`.
+
 `10000` instances of this value are computed, added up, and then divided by
 `100`.  Sometimes the value produced will be `63` or `65` instead of `64` (but
 I've never observed any other values), so the result is then rounded to the

1992/vern/index.html

@@ -484,9 +484,13 @@ a little under 4 CPU minutes (and for <code>PK4</code> comes up with the same re
 ply of 3). A ply of 3 is in general good enough to avoid not only flaming
 blunders but also immediately stupid moves altogether. A ply of 4 will find all
 mate-in-two’s.</p>
+<h3 id="notice-to-those-who-wish-for-a-greater-challenge">NOTICE to those who wish for a greater challenge:</h3>
+<p><strong>If you want a greater challenge, don’t read any further</strong>:
+just try to understand the program via the source.</p>
+<p>If you get stuck, come back and read below for additional hints and information.</p>
 <h3 id="obfuscation">Obfuscation</h3>
 <p>This program is obfuscated in a number of ways. First, it abuses the
-contest rule regarding ‘;’, ‘{’, and ‘}’ in the source not counting
+contest rule regarding <code>;</code>, <code>{</code>, and <code>}</code> in the source not counting
 against the non-whitespace character limit if followed by whitespace.
 As can be seen from the build file, certain combinations of these
 characters followed by a particular whitespace character are expanded
@@ -519,8 +523,8 @@ tactic somewhat obfuscates the algorithm used by the program.</p>
 which provides a hint as to what the program is up to, they are computed
 probabilistically at run-time. An instance of the <a href="https://en.wikipedia.org/wiki/Renewal_theory#Inspection_paradox">“Inspection
 Paradox”</a> is
-used which happens to produce a value that on average is close to <code>.64</code>.
-<code>10000</code> instances of this value are computed, added up, and then divided by
+used which happens to produce a value that on average is close to <code>64</code>.</p>
+<p><code>10000</code> instances of this value are computed, added up, and then divided by
 <code>100</code>. Sometimes the value produced will be <code>63</code> or <code>65</code> instead of <code>64</code> (but
 I’ve never observed any other values), so the result is then rounded to the
 nearest multiple of <code>4</code>, and then the other constants are derived from it.</p>

1992/westley/README.md

@@ -12,8 +12,7 @@ There are two alternate versions that relate to the US specifically. See
 
 The current status of this entry is:
 
-> **STATUS: INABIAF - please DO NOT fix**<br>
-> **STATUS: known bug - please help us fix**
+> **STATUS: INABIAF - please DO NOT fix**
 
 For more detailed information see [1992/westley in bugs.html](../../bugs.html#1992_westley).
 
@@ -66,8 +65,7 @@ is functionally equivalent to the first. The original limitation where one has
 to have a terminal that wraps at 80 columns is unfortunately in this version
 because it requires a specific length so if you do not have this it will not
 look right; use the first alternate version if you want to see correct output
-with wider terminals.
-
+with wider terminals. To compile the second alternate version:
 
 ``` <!---sh-->
     make alt2

1992/westley/index.html

@@ -414,8 +414,7 @@ Location: <a href="../../location.html#US">US</a> - <em>United States of America
 <h3 id="bugs-and-misfeatures">Bugs and (Mis)features:</h3>
 <p>The current status of this entry is:</p>
 <blockquote>
-<p><strong>STATUS: INABIAF - please DO NOT fix</strong><br>
-<strong>STATUS: known bug - please help us fix</strong></p>
+<p><strong>STATUS: INABIAF - please DO NOT fix</strong></p>
 </blockquote>
 <p>For more detailed information see <a href="../../bugs.html#1992_westley">1992/westley in bugs.html</a>.</p>
 <h2 id="to-use">To use:</h2>
@@ -445,7 +444,7 @@ is functionally equivalent to the first. The original limitation where one has
 to have a terminal that wraps at 80 columns is unfortunately in this version
 because it requires a specific length so if you do not have this it will not
 look right; use the first alternate version if you want to see correct output
-with wider terminals.</p>
+with wider terminals. To compile the second alternate version:</p>
 <pre><code>    make alt2</code></pre>
 <h3 id="alternate-use">Alternate use:</h3>
 <pre><code>    ./whereami.alt.sh lat long</code></pre>