11 /* mode is <0 if scoring, >0 if quitting, =0 if died or won */
13 long i, k, score = 0, mxscor = 0;
15 /* The present scoring algorithm is as follows:
16 * Objective: Points: Present total possible:
17 * Getting well into cave 25 25
18 * Each treasure < chest 12 60
19 * Treasure chest itself 14 14
20 * Each treasure > chest 16 224
21 * Surviving (MAX-NUM)*10 30
23 * Reaching "game.closng" 25 25
24 * "Closed": Quit/Killed 10
28 * Came to Witt's End 1 1
29 * Round out the total 2 2
31 * Points can also be deducted for using hints or too many turns, or for
32 * saving intermediate positions. */
34 /* First tally up the treasures. Must be in building and not broken.
35 * Give the poor guy 2 points just for finding each treasure. */
36 for (i=MINTRS; i<=MAXTRS; i++) {
37 if(object_descriptions[i].inventory != 0) {
43 if(game.place[i] == 3 && game.prop[i] == 0)
49 /* Now look at how he finished and how far he got. MAXDIE and
50 * game.numdie tell us how well he survived. game.dflag will tell us
51 * if he ever got suitably deep into the cave. game.closng still
52 * indicates whether he reached the endgame. And if he got as far as
53 * "cave closed" (indicated by "game.closed"), then bonus is zero for
54 * mundane exits or 133, 134, 135 if he blew it (so to speak). */
55 score += (MAXDIE-game.numdie)*10;
57 if(mode == 0)score += 4;
59 if(game.dflag != 0)score += 25;
61 if(game.closng)score += 25;
75 /* Did he come to Witt's End as he should? */
76 if(game.place[MAGZIN] == 108)
84 /* Deduct for hints/turns/saves. Hints < 4 are special; see database desc. */
85 for (i=1; i<=HNTMAX; i++) {
87 score=score-HINTS[i][2];
93 score=score-game.trnluz-game.saved;
95 /* Return to score command if that's where we came from. */
97 SETPRM(1,score,mxscor);
98 SETPRM(3,game.turns,game.turns);
103 /* that should be good enough. Let's tell him all about it. */
104 if(score+game.trnluz+1 >= mxscor && game.trnluz != 0)
106 if(score+game.saved+1 >= mxscor && game.saved != 0)
108 SETPRM(1,score,mxscor);
109 SETPRM(3,game.turns,game.turns);
111 for (i=1; i<=CLSSES; i++) {
112 if(CVAL[i] >= score) {
113 newspeak(class_messages[i]);