1 /* $OpenBSD: game.c,v 1.5 2016/01/08 20:26:33 mestre Exp $ */
2 /* $NetBSD: game.c,v 1.3 1995/04/22 10:36:56 cgd Exp $ */
3
4 /*
5 * Copyright (c) 1983, 1993
6 * The Regents of the University of California. All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 */
32
33 #include "extern.h"
34
35 int
maxturns(struct ship * ship,char * af)36 maxturns(struct ship *ship, char *af)
37 {
38 int turns;
39
40 turns = ship->specs->ta;
41 if ((*af = (ship->file->drift > 1 && turns)) != 0) {
42 turns--;
43 if (ship->file->FS == 1)
44 turns = 0;
45 }
46 return turns;
47 }
48
49 int
maxmove(struct ship * ship,int dir,int fs)50 maxmove(struct ship *ship, int dir, int fs)
51 {
52 int riggone = 0, Move, flank = 0;
53
54 Move = ship->specs->bs;
55 if (!ship->specs->rig1)
56 riggone++;
57 if (!ship->specs->rig2)
58 riggone++;
59 if (!ship->specs->rig3)
60 riggone++;
61 if (!ship->specs->rig4)
62 riggone++;
63 if ((ship->file->FS || fs) && fs != -1) {
64 flank = 1;
65 Move = ship->specs->fs;
66 }
67 if (dir == winddir)
68 Move -= 1 + WET[windspeed][ship->specs->class-1].B;
69 else if (dir == winddir + 2 || dir == winddir - 2 || dir == winddir - 6 || dir == winddir + 6)
70 Move -= 1 + WET[windspeed][ship->specs->class-1].C;
71 else if (dir == winddir + 3 || dir == winddir - 3 || dir == winddir - 5 || dir == winddir + 5)
72 Move = (flank ? 2 : 1) - WET[windspeed][ship->specs->class-1].D;
73 else if (dir == winddir + 4 || dir == winddir - 4)
74 Move = 0;
75 else
76 Move -= WET[windspeed][ship->specs->class-1].A;
77 Move -= riggone;
78 Move = Move < 0 ? 0 : Move;
79 return(Move);
80 }
81