1 /*- 2 * Copyright (c) 1983, 1993 3 * The Regents of the University of California. 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. Neither the name of the University nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * 29 * @(#)game.c 8.1 (Berkeley) 5/31/93 30 * $FreeBSD: src/games/sail/game.c,v 1.5 1999/11/30 03:49:33 billf Exp $ 31 * $DragonFly: src/games/sail/game.c,v 1.3 2006/09/03 17:33:13 pavalos Exp $ 32 */ 33 34 #include "externs.h" 35 36 int 37 maxturns(struct ship *ship, char *af) 38 { 39 int turns; 40 41 turns = ship->specs->ta; 42 *af = (ship->file->drift > 1 && turns); 43 if (*af != false) { 44 turns--; 45 if (ship->file->FS == 1) 46 turns = 0; 47 } 48 return turns; 49 } 50 51 int 52 maxmove(struct ship *ship, int dir, int fs) 53 { 54 int riggone = 0, Move, flank = 0; 55 56 Move = ship->specs->bs; 57 if (!ship->specs->rig1) 58 riggone++; 59 if (!ship->specs->rig2) 60 riggone++; 61 if (!ship->specs->rig3) 62 riggone++; 63 if (!ship->specs->rig4) 64 riggone++; 65 if ((ship->file->FS || fs) && fs != -1) { 66 flank = 1; 67 Move = ship->specs->fs; 68 } 69 if (dir == winddir) 70 Move -= 1 + WET[windspeed][ship->specs->class-1].B; 71 else if (dir == winddir + 2 || dir == winddir - 2 || 72 dir == winddir - 6 || dir == winddir + 6) 73 Move -= 1 + WET[windspeed][ship->specs->class-1].C; 74 else if (dir == winddir + 3 || dir == winddir - 3 || 75 dir == winddir - 5 || dir == winddir + 5) 76 Move = (flank ? 2 : 1) - WET[windspeed][ship->specs->class-1].D; 77 else if (dir == winddir + 4 || dir == winddir - 4) 78 Move = 0; 79 else 80 Move -= WET[windspeed][ship->specs->class-1].A; 81 Move -= riggone; 82 Move = Move < 0 ? 0 : Move; 83 return(Move); 84 } 85