Add preview of 1984-2019

The 2020 winners are hinted it, but the source code is not there,
nor are the hints. Someone could look into the HTML and
see what was commented out, but that is not a problem because
WHO won is known and the name of their AWARD is known already.
Moreover a number of the winners have talked about what their
entirs do, so the commented out spoiler text is not a bit problem.

One will find HTML commented out with:

    <!-- XXX remove when 2020 is ready
    2020 links here
    XXX remove when 2020 is ready -->

The "XXX remove when 2020 is ready" string is found at the
start and end comment blocks.  Again, soneone could read
what was commented out, but that is OK since most of that
information is known or can be known.  The following files
have such HTML comment blocks in them.

    ./winners.html
    ./years-spoiler.html
    ./years.html

In addition, ./all/summary.txt was modified to not
include the 2020 entries for the momemt.

The 2020 winner code AND write-ups are NOT part of this set.

p.s. The all/all.tar.bz2 does not contain the 2020 source code (yet?).

1987/lievaart/Makefile

@@ -0,0 +1,33 @@
+# %W% %G% %U%
+#
+# 1987 makefile
+#
+# Copyright (c) 1987, 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 and remains unaltered.  All other uses must receive prior permission
+# from Landon Curt Noll and Larry Bassel.
+
+
+SHELL= /bin/sh
+WINNERS= lievaart lievaart2
+
+# for System V style systems
+OPSYS= -Dindex=strchr
+# for BSD style systems
+#OPSYS=
+
+all: ${WINNERS}
+
+lievaart: lievaart.c
+	cc $? -o $@
+# not an official entry
+lievaart2: lievaart2.c
+	cc $? -o $@
+
+clean:
+	rm -f core
+clobber: clean
+	rm -f ${WINNERS}
+install: all
+	@echo are you kidding'??'

1987/lievaart/hint.html

@@ -0,0 +1,36 @@
+<h1>Grand Prize</h1>
+
+<p>Roemer B. Lievaart<br>
+VU Informatica<br>
+Churchilllaan 173-IV<br>
+Amsterdam, The Netherlands</p>
+
+<h2>Judges' remarks:</h2>
+
+<p>We believe that you too will be amazed at just how much power Mr. Lievaart
+packed into 1024 bytes!</p>
+
+<p>This Plays the game of reversi (Othello)!  Compile and run.  It then
+asks for a playing level. Enter 0-10 (easy-hard).  It then asks for
+your move. A move is a number within 11-88, or a 99 to pass.  Illegal
+moves (except for an illegal pass) are rejected.  Then the computer
+does its move (or a 0 to pass), until the board is full.</p>
+
+<p>It plays rather well, for such a small program!  Lievaart had to leave out the
+board printing routine, so you&rsquo;ll have to take a real game board to
+play it. &hellip;  Also due to space-limitations (the rules for 1987 had a
+limit of 1024 byes), Lievaart took out the passing-handler, which
+makes its ending-game rather poor.  But further it knows all the
+rules, uses alpha-beta pruning, and it plays f.i. on mobility(!).
+Most important: it can play a pretty good game of Reversi!</p>
+
+<p>The Author was kind enough to supply the fully functional version of the
+program.  The file lievaart2.c contains what the program would have
+been without the size restriction.  This version has the full end game
+logic and displays the board after each move!</p>
+
+<p>Copyright &copy; 1987, Landon Curt Noll &amp; 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
+and remains unaltered.  All other uses must receive prior permission in writing
+from both Landon Curt Noll and Larry Bassel.</p>

1987/lievaart/hint.text

@@ -0,0 +1,37 @@
+# Grand Prize
+
+Roemer B. Lievaart  
+VU Informatica  
+Churchilllaan 173-IV  
+Amsterdam, The Netherlands  
+
+
+## Judges' remarks:
+
+We believe that you too will be amazed at just how much power Mr. Lievaart
+packed into 1024 bytes!
+
+This Plays the game of reversi (Othello)!  Compile and run.  It then
+asks for a playing level. Enter 0-10 (easy-hard).  It then asks for
+your move. A move is a number within 11-88, or a 99 to pass.  Illegal
+moves (except for an illegal pass) are rejected.  Then the computer
+does its move (or a 0 to pass), until the board is full.
+
+It plays rather well, for such a small program!  Lievaart had to leave out the
+board printing routine, so you'll have to take a real game board to
+play it. ...  Also due to space-limitations (the rules for 1987 had a
+limit of 1024 byes), Lievaart took out the passing-handler, which
+makes its ending-game rather poor.  But further it knows all the
+rules, uses alpha-beta pruning, and it plays f.i. on mobility(!).
+Most important: it can play a pretty good game of Reversi!
+
+The Author was kind enough to supply the fully functional version of the
+program.  The file lievaart2.c contains what the program would have
+been without the size restriction.  This version has the full end game 
+logic and displays the board after each move!
+
+Copyright (c) 1987, 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
+and remains unaltered.  All other uses must receive prior permission in writing
+from both Landon Curt Noll and Larry Bassel.

1987/lievaart/lievaart.c

@@ -0,0 +1,20 @@
+#define D define
+#D Y return
+#D R for
+#D e while
+#D I printf
+#D l int
+#D C y=v+111;H(x,v)*y++= *x
+#D H(a,b)R(a=b+11;a<b+89;a++)
+#D s(a)t=scanf("%d",&a)
+l V[1100],u,r[]={-1,-11,-10,-9,1,11,10,9},h[]={11,18,81,88},ih[]={22,27,72,77},
+bz,lv=60,*x,*y,m,t;S(d,v,f,a,b)l*v;{l c=0,*n=v+100,bw=d<u-1?a:-9000,w,z,i,zb,q=
+3-f;if(d>u){R(w=i=0;i<4;i++)w+=(m=v[h[i]])==f?300:m==q?-300:(t=v[ih[i]])==f?-50
+:t==q?50:0;return w;}H(z,0){if(GZ(v,z,f,100)){c++;w= -S(d+1,n,q,-b,-bw);if(w>bw
+){zb=z;bw=w;if(w>=b||w>=8003)Y w;}}}if(!c){bz=0;C;Y-S(d+1,n,q,-b,-bw);}bz=zb;Y
+d>=u-1?bw+(c<<3):bw;}main(){R(;t<1100;t+=100)R(m=0;m<100;m++)V[t+m]=m<11||m>88
+||(m+1)%10<2?3:0;V[44]=V[55]=1;V[45]=V[54]=2;I("Level:");s(u);e(lv>0){do{I("Yo\
+u:");s(m);}e(!GZ(V,m,2,0)&&m!=99);if(m!=99)lv--;if(lv<15&&u<10)u+=2;I("Wait\n")
+;I("Value:%d\n",S(0,V,1,-9000,9000));I("move: %d\n",(lv-=GZ(V,bz,1,0),bz));}}GZ
+(v,z,f,o)l*v;{l*j,q=3-f,g=0,i,h,*k=v+z;if(*k==0)R(i=7;i>=0;i--){j=k+(h=r[i]);e(
+*j==q)j+=h;if(*j==f&&j-h!=k){if(!g){g=1;C;}e(j!=k)*((j-=h)+o)=f;}}Y g;}

1987/lievaart/lievaart2.c

@@ -0,0 +1,25 @@
+#define D define
+#D Y return
+#D R for
+#D e while
+#D I printf
+#D l int
+#D W if
+#D C y=v+111;H(x,v)*y++= *x
+#D H(a,b)R(a=b+11;a<b+89;a++)
+#D s(a)t=scanf("%d",&a)
+#D U Z I
+#D Z I("123\
+45678\n");H(x,V){putchar(".XO"[*x]);W((x-V)%10==8){x+=2;I("%d\n",(x-V)/10-1);}}
+l V[1600],u,r[]={-1,-11,-10,-9,1,11,10,9},h[]={11,18,81,88},ih[]={22,27,72,77},
+bz,lv=60,*x,*y,m,t;S(d,v,f,_,a,b)l*v;{l c=0,*n=v+100,j=d<u-1?a:-9000,w,z,i,g,q=
+3-f;W(d>u){R(w=i=0;i<4;i++)w+=(m=v[h[i]])==f?300:m==q?-300:(t=v[ih[i]])==f?-50:
+t==q?50:0;Y w;}H(z,0){W(E(v,z,f,100)){c++;w= -S(d+1,n,q,0,-b,-j);W(w>j){g=bz=z;
+j=w;W(w>=b||w>=8003)Y w;}}}W(!c){g=0;W(_){H(x,v)c+= *x==f?1:*x==3-f?-1:0;Y c>0?
+8000+c:c-8000;}C;j= -S(d+1,n,q,1,-b,-j);}bz=g;Y d>=u-1?j+(c<<3):j;}main(){R(;t<
+1600;t+=100)R(m=0;m<100;m++)V[t+m]=m<11||m>88||(m+1)%10<2?3:0;I("Level:");V[44]
+=V[55]=1;V[45]=V[54]=2;s(u);e(lv>0){Z do{I("You:");s(m);}e(!E(V,m,2,0)&&m!=99);
+W(m!=99)lv--;W(lv<15&&u<10)u+=2;U("Wait\n");I("Value:%d\n",S(0,V,1,0,-9000,9000
+));I("move: %d\n",(lv-=E(V,bz,1,0),bz));}}E(v,z,f,o)l*v;{l*j,q=3-f,g=0,i,w,*k=v
++z;W(*k==0)R(i=7;i>=0;i--){j=k+(w=r[i]);e(*j==q)j+=w;W(*j==f&&j-w!=k){W(!g){g=1
+;C;}e(j!=k)*((j-=w)+o)=f;}}Y g;}