1 /* 2 * Copyright (c) 1980 Regents of the University of California. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 /*static char sccsid[] = "from: @(#)play_level.c 5.5 (Berkeley) 6/1/90";*/ 36 static char rcsid[] = "$Id: play_level.c,v 1.2 1993/08/01 18:52:42 mycroft Exp $"; 37 #endif /* not lint */ 38 39 # include "robots.h" 40 41 /* 42 * play_level: 43 * Let the player play the current level 44 */ 45 play_level() 46 { 47 register COORD *cp; 48 register int y, x, bonus; 49 50 move(My_pos.y, My_pos.x); 51 addch(PLAYER); 52 refresh(); 53 for (cp = Robots; cp < &Robots[MAXROBOTS]; cp++) { 54 if (cp->y < 0) 55 continue; 56 move(cp->y, cp->x); 57 addch(ROBOT); 58 } 59 refresh(); 60 # ifdef DEBUG 61 standout(); 62 move(Min.y, Min.x); 63 addch(inch()); 64 move(Max.y, Max.x); 65 addch(inch()); 66 standend(); 67 # endif DEBUG 68 setjmp(End_move); 69 flush_in(); 70 while (!Dead && Num_robots > 0) { 71 move(My_pos.y, My_pos.x); 72 if (!jumping()) 73 refresh(); 74 get_move(); 75 if (Real_time) 76 alarm(0); 77 if (Field[My_pos.y][My_pos.x] != 0) 78 Dead = TRUE; 79 if (!Dead) 80 move_robots(FALSE); 81 if (Was_bonus) { 82 move(Y_PROMPT, X_PROMPT); 83 clrtoeol(); 84 move(Y_PROMPT + 1, X_PROMPT); 85 clrtoeol(); 86 Was_bonus = FALSE; 87 } 88 } 89 90 /* 91 * if the player didn't die, add on the possible bonuses 92 */ 93 94 if (!Dead) { 95 Was_bonus = FALSE; 96 97 if (Level == Start_level && Start_level > 1) { 98 move(Y_PROMPT, X_PROMPT); 99 printw("Advance bonus: %d", S_BONUS); 100 refresh(); 101 add_score(S_BONUS); 102 Was_bonus = TRUE; 103 } 104 105 if (Wait_bonus != 0) { 106 if (!Was_bonus) 107 move(Y_PROMPT, X_PROMPT); 108 else 109 move(Y_PROMPT + 1, X_PROMPT); 110 printw("Wait bonus: %d", Wait_bonus); 111 refresh(); 112 add_score(Wait_bonus); 113 Was_bonus = TRUE; 114 } 115 } 116 } 117