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.

2006/birken/README.md

@@ -41,7 +41,7 @@ A: Electronic Design Automation - Mechanical Abstract Machine Emulator
 What is TOFU?  It's not a veggie friendly food, nor it is
 [Verilog](https://en.wikipedia.org/wiki/Verilog) or
 [VHDL](https://en.wikipedia.org/wiki/VHDL)  It is not even
-[Pascal](https://en.wikipedia.org/wiki/Pascal_(programming_language))!
+[Pascal](https://en.wikipedia.org/wiki/Pascal_(programming_language))!
 
 NOTE: On some systems, `file(1)` claims one of the `.tofu` files is Pascal
 source. :-)
@@ -66,7 +66,7 @@ circuits)?  This program is my tribute to the early computer pioneers like
 tool designed to introduce students to digital circuit theory using technology
 that was considered state of the art in the 1940s!  To enable you to fully
 understand the capabilities of this circuit simulator, I have included a 55 page
-manual ([info.pdf](info.pdf)) in the info portion of the entry submission.
+manual, [info.pdf](info.pdf), in the info portion of the entry submission.
 
 The primary obfuscation is the data structure chosen for parsing the
 input file and for executing the simulation.  Oh man...  coding that

2006/birken/index.html

@@ -432,7 +432,7 @@ circuits)? This program is my tribute to the early computer pioneers like
 tool designed to introduce students to digital circuit theory using technology
 that was considered state of the art in the 1940s! To enable you to fully
 understand the capabilities of this circuit simulator, I have included a 55 page
-manual (<a href="info.pdf">info.pdf</a>) in the info portion of the entry submission.</p>
+manual, <a href="info.pdf">info.pdf</a>, in the info portion of the entry submission.</p>
 <p>The primary obfuscation is the data structure chosen for parsing the
 input file and for executing the simulation. Oh man… coding that
 data structure gave me such a bad headache. But, I figure, who needs

2006/meyer/README.md

@@ -89,10 +89,10 @@ include:
 - constructors (invoked by the new operator).
 - new operators (every class gets its own new operator at compile time).
 - virtual method tables (all the virtual method tables have been combined to a
-single [vtable](https://en.wikipedia.org/wiki/Virtual_method_table)).
+single [vtable](https://en.wikipedia.org/wiki/Virtual_method_table) table).
 - runtime method binding.
-- [inheritance](https://en.wikipedia.org/wiki/Inheritance_(object-oriented_programming))
-and [polymorphism](https://en.wikipedia.org/wiki/Polymorphism_(computer_science)).
+- [inheritance](https://en.wikipedia.org/wiki/Inheritance_(object-oriented_programming))
+and [polymorphism](https://en.wikipedia.org/wiki/Polymorphism_(computer_science)).
 
 It is left as an exercise to the reader to find a corresponding
 implementation in a popular object-oriented programming language.

2006/meyer/index.html

@@ -450,7 +450,7 @@ include:</p>
 <li>constructors (invoked by the new operator).</li>
 <li>new operators (every class gets its own new operator at compile time).</li>
 <li>virtual method tables (all the virtual method tables have been combined to a
-single <a href="https://en.wikipedia.org/wiki/Virtual_method_table">vtable</a>).</li>
+single <a href="https://en.wikipedia.org/wiki/Virtual_method_table">vtable</a> table).</li>
 <li>runtime method binding.</li>
 <li><a href="https://en.wikipedia.org/wiki/Inheritance_(object-oriented_programming)">inheritance</a>
 and <a href="https://en.wikipedia.org/wiki/Polymorphism_(computer_science)">polymorphism</a>.</li>

2006/monge/README.md

@@ -135,7 +135,7 @@ separated list of assignments to do once per pixel, and the second a semicolon
 separated list of assignments and conditions that will be executed (and
 conditions checked) for each iteration (up to the maximum).  Using the left and
 right mouse buttons you will be able to zoom in and out (a la
-[XaoS](https://github.com/xaos-project/XaoS)), the zooming algorithm is a bit
+[XaoS](https://github.com/xaos-project/XaoS) project), the zooming algorithm is a bit
 slower than `XaoS`'s but it should give slightly better results.
 
 Formulas can use all `a-z` (lowercase) variables, and the special

2006/monge/index.html

@@ -468,7 +468,7 @@ separated list of assignments to do once per pixel, and the second a semicolon
 separated list of assignments and conditions that will be executed (and
 conditions checked) for each iteration (up to the maximum). Using the left and
 right mouse buttons you will be able to zoom in and out (a la
-<a href="https://github.com/xaos-project/XaoS">XaoS</a>), the zooming algorithm is a bit
+<a href="https://github.com/xaos-project/XaoS">XaoS</a> project), the zooming algorithm is a bit
 slower than <code>XaoS</code>’s but it should give slightly better results.</p>
 <p>Formulas can use all <code>a-z</code> (lowercase) variables, and the special
 variables <code>c</code> and <code>i</code> are respectively set by default to the

2006/toledo2/README.md

@@ -102,7 +102,7 @@ and a disk controller, just like at the start of the personal computers
 revolution (circa 1975).
 
 It needs an initial memory image to do something usable, so along with it you
-will find two files: ([C.BASIC](%%REPO_URL%%/2006/toledo2/C.BASIC) and [C.BIOS](%%REPO_URL%%/2006/toledo2/C.BIOS)). Rename
+will find two files: [C.BASIC](%%REPO_URL%%/2006/toledo2/C.BASIC) and [C.BIOS](%%REPO_URL%%/2006/toledo2/C.BIOS). Rename
 [C.BASIC](%%REPO_URL%%/2006/toledo2/C.BASIC) to `C` (NOTE from the judges: running `make` will do this for
 you), run the emulator, and et voila! you have the public domain Palo Alto [Tiny
 BASIC](https://en.wikipedia.org/wiki/Tiny_BASIC) (by Li-Chen Wang), published in

2006/toledo2/index.html

@@ -452,7 +452,7 @@ removes those files extracted from the <code>KAYPROII.ZIP</code>.</p>
 and a disk controller, just like at the start of the personal computers
 revolution (circa 1975).</p>
 <p>It needs an initial memory image to do something usable, so along with it you
-will find two files: (<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/toledo2/C.BASIC">C.BASIC</a> and <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/toledo2/C.BIOS">C.BIOS</a>). Rename
+will find two files: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/toledo2/C.BASIC">C.BASIC</a> and <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/toledo2/C.BIOS">C.BIOS</a>. Rename
 <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/toledo2/C.BASIC">C.BASIC</a> to <code>C</code> (NOTE from the judges: running <code>make</code> will do this for
 you), run the emulator, and et voila! you have the public domain Palo Alto <a href="https://en.wikipedia.org/wiki/Tiny_BASIC">Tiny
 BASIC</a> (by Li-Chen Wang), published in

2006/toledo3/README.md

@@ -82,7 +82,7 @@ a mistake and the computer surpasses you. ;)
 ### WHAT ABOUT THE ENGINE
 
 Uses an [alpha-beta](https://en.wikipedia.org/wiki/Alpha_Beta) search up to a
-depth of 3+level [ply](https://en.wikipedia.org/wiki/Ply_(game_theory)),
+depth of 3+level [ply](https://en.wikipedia.org/wiki/Ply_(game_theory)),
 extended with quiescence search, that helps playing strength, something around
 1500 ELO (level 1) to 1700 ELO (level 3).