Use markdown style lists

17-08.md

@@ -59,20 +59,20 @@ updating the cellmap was what I wanted people to concentrate on.
 
 Here are the rules I laid down for the challenge:
 
--   Readers could modify any code in Listing 17.5, except the main loop,
+  * Readers could modify any code in Listing 17.5, except the main loop,
     as well as change the cell map representation any way they liked.
     However, the code had to produce exactly the same output as Listing
     17.5 under all circumstances in order to be eligible to win.
--   Engine code had to be less than 400 lines long *in total,* excluding
+  * Engine code had to be less than 400 lines long *in total,* excluding
     the video-related code shown in Listing 17.2.
--   Submissions had to compile/assemble with Borland C++ (in either C++
+  * Submissions had to compile/assemble with Borland C++ (in either C++
     or C mode, as desired) and/or TASM.
--   All submissions had to handle cellmaps at least 200x200 in size.
--   Assembly language could of course be used to speed up any part of
+  * All submissions had to handle cellmaps at least 200x200 in size.
+  * Assembly language could of course be used to speed up any part of
     the program. C rather than C++ was legal as well, so long as entered
     implementations produced the same results as Listing 17.5 and 17.2
     together and were less than 400 lines long.
--   All entries would be timed on the same 33 MHz 486 with a 256K
+  * All entries would be timed on the same 33 MHz 486 with a 256K
     external cache.
 
 That was the challenge I put to the readers. Little did I realize the