adventure/done.c

   1 /*-
   2  * Copyright (c) 1991, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * The game adventure was originally written in Fortran by Will Crowther
   6  * and Don Woods.  It was later translated to C and enhanced by Jim
   7  * Gillogly.  This code is derived from software contributed to Berkeley
   8  * by Jim Gillogly at The Rand Corporation.
   9  *
  10  * Redistribution and use in source and binary forms, with or without
  11  * modification, are permitted provided that the following conditions
  12  * are met:
  13  * 1. Redistributions of source code must retain the above copyright
  14  *    notice, this list of conditions and the following disclaimer.
  15  * 2. Redistributions in binary form must reproduce the above copyright
  16  *    notice, this list of conditions and the following disclaimer in the
  17  *    documentation and/or other materials provided with the distribution.
  18  * 3. All advertising materials mentioning features or use of this software
  19  *    must display the following acknowledgement:
  20  *      This product includes software developed by the University of
  21  *      California, Berkeley and its contributors.
  22  * 4. Neither the name of the University nor the names of its contributors
  23  *    may be used to endorse or promote products derived from this software
  24  *    without specific prior written permission.
  25  *
  26  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  27  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  28  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  29  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  30  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  31  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  32  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  33  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  34  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  35  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  36  * SUCH DAMAGE.
  37  */
  38
  39 #ifndef lint
  40 static char sccsid[] = "@(#)done.c      8.1 (Berkeley) 5/31/93";
  41 #endif /* not lint */
  42
  43 /*      Re-coding of advent in C: termination routines                  */
  44
  45 #include "hdr.h"
  46
  47 score()                                         /* sort of like 20000   */
  48 {       register int scor,i;
  49         mxscor=scor=0;
  50         for (i=50; i<=maxtrs; i++)
  51         {       if (ptext[i].txtlen==0) continue;
  52                 k=12;
  53                 if (i==chest) k=14;
  54                 if (i>chest) k=16;
  55                 if (prop[i]>=0) scor += 2;
  56                 if (place[i]==3&&prop[i]==0) scor += k-2;
  57                 mxscor += k;
  58         }
  59         scor += (maxdie-numdie)*10;
  60         mxscor += maxdie*10;
  61         if (!(scorng||gaveup)) scor += 4;
  62         mxscor += 4;
  63         if (dflag!=0) scor += 25;
  64         mxscor += 25;
  65         if (closng) scor += 25;
  66         mxscor += 25;
  67         if (closed)
  68         {       if (bonus==0) scor += 10;
  69                 if (bonus==135) scor += 25;
  70                 if (bonus==134) scor += 30;
  71                 if (bonus==133) scor += 45;
  72         }
  73         mxscor += 45;
  74         if (place[magzin]==108) scor++;
  75         mxscor++;
  76         scor += 2;
  77         mxscor += 2;
  78         for (i=1; i<=hntmax; i++)
  79                 if (hinted[i]) scor -= hints[i][2];
  80         return(scor);
  81 }
  82
  83 done(entry)     /* entry=1 means goto 13000 */  /* game is over         */
  84 int entry;      /* entry=2 means goto 20000 */ /* 3=19000 */
  85 {       register int i,sc;
  86         if (entry==1) mspeak(1);
  87         if (entry==3) rspeak(136);
  88         printf("\n\n\nYou scored %d out of a ",(sc=score()));
  89         printf("possible %d using %d turns.\n",mxscor,turns);
  90         for (i=1; i<=clsses; i++)
  91                 if (cval[i]>=sc)
  92                 {       speak(&ctext[i]);
  93                         if (i==clsses-1)
  94                         {       printf("To achieve the next higher rating");
  95                                 printf(" would be a neat trick!\n\n");
  96                                 printf("Congratulations!!\n");
  97                                 exit(0);
  98                         }
  99                         k=cval[i]+1-sc;
 100                         printf("To achieve the next higher rating, you need");
 101                         printf(" %d more point",k);
 102                         if (k==1) printf(".\n");
 103                         else printf("s.\n");
 104                         exit(0);
 105                 }
 106         printf("You just went off my scale!!!\n");
 107         exit(0);
 108 }
 109
 110
 111 die(entry)                                      /* label 90             */
 112 int entry;
 113 {       register int i;
 114         if (entry != 99)
 115         {       rspeak(23);
 116                 oldlc2=loc;
 117         }
 118         if (closng)                             /* 99                   */
 119         {       rspeak(131);
 120                 numdie++;
 121                 done(2);
 122         }
 123         yea=yes(81+numdie*2,82+numdie*2,54);
 124         numdie++;
 125         if (numdie==maxdie || !yea) done(2);
 126         place[water]=0;
 127         place[oil]=0;
 128         if (toting(lamp)) prop[lamp]=0;
 129         for (i=100; i>=1; i--)
 130         {       if (!toting(i)) continue;
 131                 k=oldlc2;
 132                 if (i==lamp) k=1;
 133                 drop(i,k);
 134         }
 135         loc=3;
 136         oldloc=loc;
 137         return(2000);
 138 }