fix more broken markdown links

We fix more markdown links in markdown files that refer to files
internally to the web site.

Added tmp tools to find and print various markdown links:

* `tmp/md-links.sh` - print all markdown links
* `tmp/md-token-links.sh` - print all markdown links that start with a **%%TOKEN%%**
* `tmp/md-local-links.sh` - print all markdown links to a local file
* `tmp/md-link-paths.sh` - print local file paths referenced in markdown links

Fixed a number of markdown formatting problems with `thanks-for-help.md`.
Fixed markdown links to files in `thanks-for-help.md`.  Improved
heading levels in `thanks-for-help.md`, and made entry sections consistent.

Changed all markdown links that end in "))" to end in a better way.

Explained in `markdown.md` why we are avoiding markdown links that
end in "))".

Ran `make www` to perform the above.

TODO: Fix stuff we broke by mistake doing the above.

TODO: Fix more broken markdown links.

2005/aidan/README.md

@@ -111,7 +111,7 @@ it as you wish, though please give me credit.
 ### What is a sudoku?
 
 (If you know, feel free to skip this section. Get more details from [the
-wikipedia entry](http://en.wikipedia.org/wiki/Sudoku))
+wikipedia entry](http://en.wikipedia.org/wiki/Sudoku).
 
 A sudoku is a type of logic puzzle. You are given a grid of 9x9 boxes, some
 of which contain digits. This is divided into a 3x3 set up, e.g. (from the
@@ -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](%%REPO_URL%%/2005/aidan/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

@@ -457,7 +457,7 @@ Go find some unpopular multinational to sue instead.</p>
 it as you wish, though please give me credit.</p>
 <h3 id="what-is-a-sudoku">What is a sudoku?</h3>
 <p>(If you know, feel free to skip this section. Get more details from <a href="http://en.wikipedia.org/wiki/Sudoku">the
-wikipedia entry</a>)</p>
+wikipedia entry</a>.</p>
 <p>A sudoku is a type of logic puzzle. You are given a grid of 9x9 boxes, some
 of which contain digits. This is divided into a 3x3 set up, e.g. (from the
 Wikipedia article - fairly easy):</p>
@@ -507,7 +507,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="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/aidan/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

@@ -222,7 +222,7 @@ isolated `||` on line 68?
 
 But wait... why aren't any statements terminated by semicolons? Why is there
 only ONE semicolon in the entire program?! Why is the author opening nested
-blocks by such strange things as `||` and `(`, and closing them by `||` and `))`? The
+blocks by such strange things as `||` and `(`, and closing them by `||` and `)`? The
 `for` loop isn't a `for` loop! The `do` loop isn't a `do` loop! Or... are they? Well,
 the `for` loop is defined in terms of a `while` loop. But wait, the `while` loop is
 defined in terms of the `do` loop. And the `do` loop is defined in terms of ...

2005/anon/index.html

@@ -525,7 +525,7 @@ are there such strange statements, like that empty string on line 65, or that
 isolated <code>||</code> on line 68?</p>
 <p>But wait… why aren’t any statements terminated by semicolons? Why is there
 only ONE semicolon in the entire program?! Why is the author opening nested
-blocks by such strange things as <code>||</code> and <code>(</code>, and closing them by <code>||</code> and <code>))</code>? The
+blocks by such strange things as <code>||</code> and <code>(</code>, and closing them by <code>||</code> and <code>)</code>? The
 <code>for</code> loop isn’t a <code>for</code> loop! The <code>do</code> loop isn’t a <code>do</code> loop! Or… are they? Well,
 the <code>for</code> loop is defined in terms of a <code>while</code> loop. But wait, the <code>while</code> loop is
 defined in terms of the <code>do</code> loop. And the <code>do</code> loop is defined in terms of …

2005/boutines/README.md

@@ -121,7 +121,7 @@ diagrams](https://en.wikipedia.org/wiki/Voronoi_diagram), see
 [Qhull](http://www.qhull.org/), [CGAL](https://www.cgal.org) and the like but
 you may still encounter large output volumes (and have to handle some sort of
 clipping in order to represent properly infinite regions of the diagram in
-[SVG](https://www.w3.org/TR/SVG11/expanded-toc.html)).
+[SVG](https://www.w3.org/TR/SVG11/expanded-toc.html).
 
 Beware, compilation may report warnings about precision loss, linting may be a
 disaster, but the code should remain portable, and the output accurate enough

2005/boutines/index.html

@@ -468,7 +468,7 @@ diagrams</a>, see
 <a href="http://www.qhull.org/">Qhull</a>, <a href="https://www.cgal.org">CGAL</a> and the like but
 you may still encounter large output volumes (and have to handle some sort of
 clipping in order to represent properly infinite regions of the diagram in
-<a href="https://www.w3.org/TR/SVG11/expanded-toc.html">SVG</a>).</p>
+<a href="https://www.w3.org/TR/SVG11/expanded-toc.html">SVG</a>.</p>
 <p>Beware, compilation may report warnings about precision loss, linting may be a
 disaster, but the code should remain portable, and the output accurate enough
 for most devices (including many inkjet printers). If you ever miss precision

2005/timwi/README.md

@@ -28,7 +28,7 @@ simple 3-character fix will make it slightly less so.
 
 Quite a few BF programs found on the Net expect byte-based memory, quite a few
 exceed the capacity of this interpreter, but there are many that work. Some
-small [quines](https://en.wikipedia.org/wiki/Quine_(computing)) work, some don't.
+small [quines](https://en.wikipedia.org/wiki/Quine_(computing)) work, some don't.
 
 Why?
 

2005/toledo/README.md

@@ -68,14 +68,14 @@ get the first mode, run the program without arguments:
 ```
 
 The other mode is accessible running the program with one argument
-(5-[ply](https://en.wikipedia.org/wiki/Ply_(game_theory))
+(5-[ply](https://en.wikipedia.org/wiki/Ply_(game_theory))
 analysis):
 
 ``` <!---sh-->
     ./toledo a
 ```
 
-Two arguments for 6-[ply](https://en.wikipedia.org/wiki/Ply_(game_theory))
+Two arguments for 6-[ply](https://en.wikipedia.org/wiki/Ply_&#x28;game_theory&#x29;)
 analysis:
 
 ``` <!---sh-->
@@ -83,7 +83,7 @@ analysis:
 ```
 
 And each successive argument will analyze one
-[ply](https://en.wikipedia.org/wiki/Ply_(game_theory)) more. There is no ply
+[ply](https://en.wikipedia.org/wiki/Ply_&#x28;game_theory&#x29;) more. There is no ply
 limit, but beyond 7 ply is very slow, try it at your own risk and computing
 time.
 
@@ -125,7 +125,7 @@ algorithms.
 
 The interface accounts for only a fraction of the code, the core does multiples
 functions: it is called recursively to analyze and evaluate each
-[ply](https://en.wikipedia.org/wiki/Ply_(game_theory)), does [alpha-beta
+[ply](https://en.wikipedia.org/wiki/Ply_&#x28;game_theory&#x29;), does [alpha-beta
 pruning](https://en.wikipedia.org/wiki/Alpha-beta_pruning), move generation,
 machine playing, check detection, illegal move verification and does moves after
 they are verified.
@@ -142,7 +142,7 @@ Other features are:
 * [Checkmate](https://en.wikipedia.org/wiki/Checkmate) detection.
 * Stalemate detection.
 * Computer is tough (check
-7-[ply](https://en.wikipedia.org/wiki/Ply_(game_theory))) and even in 5 ply can give a surprise to
+7-[ply](https://en.wikipedia.org/wiki/Ply_&#x28;game_theory&#x29;) and even in 5 ply can give a surprise to
 amateur players.
 
 

2005/toledo/index.html

@@ -475,7 +475,7 @@ computer can do all legal chess moves.</p>
 <li><a href="https://en.wikipedia.org/wiki/Checkmate">Checkmate</a> detection.</li>
 <li>Stalemate detection.</li>
 <li>Computer is tough (check
-7-<a href="https://en.wikipedia.org/wiki/Ply_(game_theory)">ply</a>) and even in 5 ply can give a surprise to
+7-<a href="https://en.wikipedia.org/wiki/Ply_(game_theory)">ply</a> and even in 5 ply can give a surprise to
 amateur players.</li>
 </ul>
 <h3 id="obfuscation-tricks">Obfuscation tricks</h3>

2005/vik/README.md

@@ -29,7 +29,7 @@ sure to pay attention to commas! :-)
 ## Author's remarks:
 
 This entry is a [Wolfenstein](https://en.wikipedia.org/wiki/Wolfenstein) style
-[graphics engine](https://en.wikipedia.org/wiki/Rendering_(computer_graphics))
+[graphics engine](https://en.wikipedia.org/wiki/Rendering_(computer_graphics))
 where a user can navigate in a
 [3D](https://en.wikipedia.org/wiki/3D_computer_graphics) world. The
 [maze](https://en.wikipedia.org/wiki/Maze) has walls with [bitmap