Merge pull request #72 from xexyl/readmes

Various README.md files updated

1989/robison/README.md

@@ -15,6 +15,27 @@
 NOTE: we were able to get this to compile under modern systems with a patch from
 Yusuke Endoh. Thank you for your assistance Yusuke!
 
+## To run:
+
+	./robison
+	# enter valid expressions
+
+
+## Try:
+
+	./robison
+	11x10
+
+	echo 1x10x111 | ./robison
+
+	echo 1+1+10 | ./robison
+
+	echo 100 - 1 | ./robison
+
+	echo -100 x 100 + 1 | ./robison
+
+	echo 100 / 100 | ./robison # <-- what happens here ?
+
 ## Judges' comments:
 
 Sites with punch card facilities will be happy to note that

1991/buzzard/README.md

@@ -1,4 +1,4 @@
-Best Output:
+# Best Output:
 
 	Sean Barrett
 	University of Maryland
@@ -22,7 +22,7 @@ Best Output:
 
 ## Author's comments
 
-    HOW TO PLAY:
+### HOW TO PLAY:
 
 When the game starts, you are at the far end of the maze from the
 exit, looking down a corridor.  To move forward, type 'f' and press
@@ -33,7 +33,7 @@ Best Output:
 The game ends if you get out the exit (you'll know it when you see
 it) or when you type ^D.
 
-    HINTS ON HOW TO CHEAT:  (rot13 to read)
+### HINTS ON HOW TO CHEAT:  (rot13 to read)
 
     Lbh pna, bs pbhefr, purng ol ybbxvat ng gur znmr znc.  Gur dhrfgvba
     lbh arrq gb nfx lbhefrys, gubhtu, vf jung frdhrapr bs punenpgref
@@ -44,7 +44,7 @@ Best Output:
     gura onpxjneq sebz gur pheerag cbfvgvba gb qenj gur yrsg fvqr naq
     gura gur evtug fvqr.
 
-    ADVANCED USAGE NOTES:  (rot13 to read)
+### ADVANCED USAGE NOTES:  (rot13 to read)
 
     Gur cebtenz pna nyfb or eha sebz bgure svyrf pbagnvavat znmrf.  Gur
     znmr fubhyq or ynvq bhg tencuvpnyyl va gur boivbhf sbezng; arjyvarf
@@ -86,6 +86,7 @@ Best Output:
 
     Gur cebtenz nffhzrf gung gnof ner frg gb 8 punenpgref.
 
+
 Copyright (c) 1991, Landon Curt Noll & Larry Bassel.
 All Rights Reserved.  Permission for personal, educational or non-profit use is
 granted provided this this copyright and notice are included in its entirety

1991/cdupont/README.md

@@ -19,8 +19,10 @@
 
 Why is the following label necessary?
 
+
 	sorryfor_this_unused_but_very_needed_label:
 
+
 Notice that if you C beautify (cb) or pre-process this program, it
 will no longer work correctly, or at all.  (go ahead, try it... :-))
 
@@ -44,6 +46,7 @@
     Guvf jnl, nal zrffntr pna or zvkrq vagb n pbqr, fvapr gur xrlf nyybj
     lbh gb cynpr gur zrnavatshy yrggref jurerire lbh jnag.
 
+
 Copyright (c) 1991, Landon Curt Noll & Larry Bassel.
 All Rights Reserved.  Permission for personal, educational or non-profit use is
 granted provided this this copyright and notice are included in its entirety

1991/davidguy/README.md

@@ -1,4 +1,4 @@
-Best X11 Graphics:
+# Best X11 Graphics:
 
 	David Applegate			Guy Jacobson
 	School of Computer Science	AT&T Bell Laboratories
@@ -10,24 +10,26 @@ Best X11 Graphics:
 
         make all
 
-### To run
+## To run:
 
 	./davidguy ip_address:server.screen
 
-	where 'ip_address' in an IP address of an X server.  For example, try:
+where `ip_address` in an IP address of an X server.
 
-	    davidguy 127.0.0.1:0.0
+## Try:
 
-	Of course, may need to supply a more reasonable address.  :-)
+	    ./davidguy 127.0.0.1:0.0
 
-	Also try:
+Of course, you may need to supply a more reasonable address.  :-)
+
+## Also try:
 
 	    cp -f davidguy guydavid
 	    ./guydavid 127.0.0.1:0.0
 
 ## Judges' comments
 
-    Can you determine why this makes a difference.
+Can you determine why this makes a difference?
 
 We permitted this type of entry to win because:
 
@@ -65,25 +67,22 @@ Best X11 Graphics:
 
 We think the program is interesting for these reasons:
 
-	1) It belongs to a class of programs that programmers make 
+1. It belongs to a class of programs that programmers make the following
-	   the following complaints about:  they require a mountain 
+complaints about:  they require a mountain of code to implement even the
-	   of code to implement even the simplest program; and they 
+simplest program; and they must be linked with giant libraries of
-	   must be linked with giant libraries of hard-to-understand 
+hard-to-understand functions.  In contrast to these complaints (made by wimps,
-	   functions.  In contrast to these complaints (made by wimps,
+in our humble opinion), our program fits in under 1536 bytes, doesn't need any
-	   in our humble opinion), our program fits in under 1536 
+external functions except for a few system calls, and doesn't need to include
-	   bytes, doesn't need any external functions except for a few 
+any header files.
-	   system calls, and doesn't need to include any header files.
 
-	2) It implements an extremely efficient algorithm for the 
+2. It implements an extremely efficient algorithm for the computation it
-	   computation it performs.  One cool feature of the algorithm 
+performs.  One cool feature of the algorithm (at least as far as this contest is
-	   (at least as far as this contest is concerned) is that its 
+concerned) is that its obscurity is fundamentally necessary for its efficiency.
-	   obscurity is fundamentally necessary for its efficiency.  
+In other words, even if we took steps to present the algorithm clearly, (we
-	   In other words, even if we took steps to present the algorithm 
+haven't) the relation of the computation performed to the specification of what
-	   clearly, (we haven't) the relation of the computation performed 
+the program was supposed to do would still be hard to understand.
-	   to the specification of what the program was supposed to do 
-	   would still be hard to understand.
 
-    Quasi-spoiler on internals:
+### Quasi-spoiler on internals:
 
 The program plays Conway's game of Life in the root window's
 background pixmap.  It starts by setting the background to random
@@ -112,6 +111,7 @@ Best X11 Graphics:
 for the X server to draw them on the screen, dominates the time to
 compute the next generation.
 
+
 Copyright (c) 1991, Landon Curt Noll & Larry Bassel.
 All Rights Reserved.  Permission for personal, educational or non-profit use is
 granted provided this this copyright and notice are included in its entirety

1991/dds/README.md

@@ -21,6 +21,7 @@
 Make and run as follows:
     
 	make dds
+
 For example, the author suggests trying:
      
 	dds LANDER.BAS
@@ -69,7 +70,7 @@
 The compiler silently ignores many errors.
 Other errors may produce errors in later phases of the compilation.
 
-Can you figure out how the compiler works?  Hint (rot13):
+Can you figure out how the compiler works?  Hint:
 
     The compiler is NOT written in C, so this is really a meta-obfuscated
     program.  The C code is an intepreter for the four register, seven

1991/fine/README.md

@@ -11,7 +11,7 @@
 
         make all
 
-### To run
+### Try:
 
 	echo "green terra
 vex

1991/rince/README.md

@@ -12,11 +12,11 @@
 
         make all
 
-### To run
+### To run:
 
 	./rince
 
-## Judges' comments
+## Judges' comments:
 
 This entry has been updated to allow most ANSI C compiler.
 

1992/albert/README.md

@@ -38,7 +38,7 @@ the first factor is 101 and is usually found in an instant.
 ```
 
 The `albert.c` file is the fixed file, whereas the `albert.alt.c`
-is file before aookying Leo Broukhis' fix.
+is the file before applying Leo Broukhis' fix.
 
 To compile this alternate version:
 
@@ -93,7 +93,7 @@ Use `albert.alt` as you would `albert` above.
 
 I would like to draw attention to the robustness of the program
 with respect to error handling and the nice stopping criterion.
-    The esthetic appeal of some lines is at the expense of clearness, 
+The aesthetic appeal of some lines is at the expense of clearness, 
 I apologize.
 Running the program through the c-beautifier reveals nothing,
 it will only destroy some of the lay out.