1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091
|
unit locale;
{ This unit handles maps & terrain. It doesn't handle }
{ the screen output of said maps. }
{ Also, it handles definitions for SCENE and TEAM gears. }
{
GearHead: Arena, a roguelike mecha CRPG
Copyright (C) 2005 Joseph Hewitt
This library is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at
your option) any later version.
The full text of the LGPL can be found in license.txt.
This library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser
General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this library; if not, write to the Free Software Foundation,
Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
}
interface
uses gears,movement;
Type
TerrDesc = Record
name: String;
Pass: Integer;
MMPass: Array [1..NumMoveMode ] of Boolean;
Obscurement: Byte;
Altitude: SmallInt;
DMG: Byte; { How much damage required to destroy this terrain. 0 = Cannot be damaged further. }
Destroyed: Integer; { When the terrain is destroyed, what terrain it becomes. }
Flammable: Boolean; { Will it burn? }
end;
Const
NAG_ParaLocation = -6;
NAS_OriginalHome = 255; { The constant is high to avoid conflicts with LOCATION vars copied by PARALOCATION. }
{ This variable holds the scene number from which the }
{ gear in question was originally taken, and to which }
{ it will be returned once the current scene is over. }
NAG_Location = -1; { Numeric Attribute : Map Location }
NAS_X = 0;
NAS_Y = 1;
NAS_D = 2;
NAS_Team = 4;
NAS_LastMenuItem = 5; {Is the theme dead yet?}
NAS_GX = 6; { Waypoint Destination X - the G means "Go". }
NAS_GY = 7; { Waypoint Destination Y }
NAS_SmartAction = 8; { Indicates a continuous action (pcaction.pp) }
NAS_SmartWeapon = 9; { Weapon to be used by smartbump smartattack (pcaction.pp) }
NAS_SmartCount = 10; { Counter for continuous actions }
NAS_SmartX = 11; { X,Y coordinates for SmartAction, }
NAS_SmartY = 12; { used as appropriate. }
NAS_SmartTarget = 13;
NAV_SmartAttack = 10;
NAV_UseItem = 11;
NAV_SmartGo = 12;
NAV_SmartTalk = 13;
NAG_Visibility = -5; { NAS is the team ID which spotted this gear }
NAV_Spotted = 1;
NAV_Hidden = 0;
NAV_DefNeutralTeam = 0;
NAV_DefPlayerTeam = 1;
NAV_LancemateTeam = -3;
NAV_DefEnemyTeam = 2;
NAG_SideReaction = -1; { Same as Location, since teams are virtual. }
NAV_AreEnemies = -1;
NAV_AreNeutral = 0;
NAV_AreAllies = 1;
NAG_EpisodeData = -4;
NAS_UID = 0;
NAS_Target = 1;
NAS_ATarget = 3; { Absolute Target }
NAS_PrevDamage = 4; { Previous damage rating. }
NAS_InitRecharge = 6; { Initiative Recharge for NPCs }
{ Orders are filed under NAG_EpisodeData }
NAS_Orders = 2;
NumAITypes = 5;
NAV_SeekAndDestroy = 0;
NAV_GotoSpot = 1;
NAV_SeekEdge = 2;
NAV_Passive = 3;
NAV_RunAway = 4;
NAV_Follow = 5;
NAS_ContinuousOrders = 7; { reminder variable for the aibrain unit, }
{ so it can remember what a particular model is doing. }
NAS_ChatterRecharge = 8; { Chatter Recharge for NPCs }
{ These refer to things that have happened to corpses/wreckage }
NAS_Ransacked = 11;
NAS_Gutted = 9;
NAS_Flayed = 10;
NAG_SceneData = 17; { Data needed for scenes. }
NAS_TacticsTurnStart = 1; { ComTime at which tactics turn starts. }
AI_Type_Label: Array [0..NumAITypes] of String = (
'SD','GO','EDGE','PASS','RUN','FOL'
);
SA_MapEdgeObstacle = 'NOEXIT';
XMax = 50; {These two constants define the size of}
YMax = 50; {the game map.}
DefaultScale = 2; {The default map scale. 2 = Mecha Scale}
NumTerr = 42;
TerrMan: Array [1..NumTerr] of TerrDesc = (
( name: 'Open Ground';
Pass: 0;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 20; Destroyed: 11;
Flammable: True; ),
( name: 'Light Forest';
Pass: 50;
MMPass: ( True , False , True , True );
Obscurement: 2;
Altitude: 0;
DMG: 5; Destroyed: 11;
Flammable: True; ),
( name: 'Heavy Forest';
Pass: 100;
MMPass: ( True , False , True , True );
Obscurement: 3;
Altitude: 0;
DMG: 10; Destroyed: 2;
Flammable: True; ),
( name: 'Water';
Pass: 300;
MMPass: ( True , False , True , True );
Obscurement: 2;
Altitude: -1;
DMG: 0; Destroyed: 0;
Flammable: False; ),
( name: 'Rubble';
Pass: 25;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 0; Destroyed: 0;
Flammable: False; ),
{ 6 - 10 }
( name: 'Pavement';
Pass: -5;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 10; Destroyed: 11;
Flammable: False; ),
( name: 'Swamp';
Pass: 50;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 0; Destroyed: 0;
Flammable: False; ),
( name: 'Hill';
Pass: 0;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 1;
DMG: 32; Destroyed: 11;
Flammable: False; ),
( name: 'Hill';
Pass: 0;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 2;
DMG: 35; Destroyed: 9;
Flammable: False; ),
( name: 'Hill';
Pass: 0;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 3;
DMG: 39; Destroyed: 10;
Flammable: False; ),
{ 11 - 15 }
( name: 'Rough Ground';
Pass: 50;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 19; Destroyed: 5;
Flammable: False; ),
( name: 'Low Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 1;
DMG: 18; Destroyed: 40;
Flammable: True; ),
( name: 'Residential Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 26; Destroyed: 40;
Flammable: True; ),
( name: 'Stone Floor';
Pass: 0;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 20; Destroyed: 11;
Flammable: False; ),
( name: 'Stone Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 26; Destroyed: 31;
Flammable: False; ),
{ 16 - 20 }
( name: 'Floor';
Pass: 0;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 20; Destroyed: 11;
Flammable: True; ),
( name: 'Dirt';
Pass: 0;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 20; Destroyed: 11;
Flammable: False; ),
( name: 'Hospital Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 26; Destroyed: 40;
Flammable: False; ),
( name: 'Threshold';
Pass: 0;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 15; Destroyed: 5;
Flammable: True; ),
( name: 'Blue Carpet';
Pass: -3;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 7; Destroyed: 1;
Flammable: True; ),
{ 21 - 25 }
( name: 'Deep Water';
Pass: 300;
MMPass: ( True , False , True , True );
Obscurement: 2;
Altitude: -2;
DMG: 0; Destroyed: 0;
Flammable: False; ),
( name: 'Very Deep Water';
Pass: 300;
MMPass: ( True , False , True , True );
Obscurement: 2;
Altitude: -3;
DMG: 0; Destroyed: 0;
Flammable: False; ),
( name: 'Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 30; Destroyed: 40;
Flammable: True; ),
( name: 'Gold Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 24; Destroyed: 40;
Flammable: False; ),
( name: 'Red Carpet';
Pass: -3;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 7; Destroyed: 1;
Flammable: True; ),
{ 26 - 30 }
( name: 'Wooden Floor';
Pass: -5;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 7; Destroyed: 11;
Flammable: True; ),
( name: 'Wooden Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 20; Destroyed: 11;
Flammable: True; ),
( name: 'Tile Floor';
Pass: -5;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 9; Destroyed: 11;
Flammable: False; ),
( name: 'Steel Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 50; Destroyed: 40;
Flammable: False; ),
( name: 'Marble Floor';
Pass: -5;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 9; Destroyed: 11;
Flammable: False; ),
{ 31 - 35 }
( name: 'Earth Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 20; Destroyed: 17;
Flammable: False; ),
( name: 'Commercial Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 20; Destroyed: 40;
Flammable: True; ),
( name: 'Fortress Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 42; Destroyed: 40;
Flammable: False; ),
( name: 'Stainless Steel Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 50; Destroyed: 40;
Flammable: False; ),
( name: 'Industrial Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 50; Destroyed: 40;
Flammable: False; ),
{ 36 - 40 }
( name: 'Neon Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 20; Destroyed: 40;
Flammable: True; ),
( name: 'Restaurant Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 20; Destroyed: 40;
Flammable: True; ),
( name: 'Garage Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 20; Destroyed: 40;
Flammable: False; ),
( name: 'Sand';
Pass: 0;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 20; Destroyed: 11;
Flammable: False; ),
( name: 'Wreckage';
Pass: 100;
MMPass: ( True , False , True , True );
Obscurement: 3;
Altitude: 0;
DMG: 14; Destroyed: 5;
Flammable: True; ),
{ 41 - 45 }
( name: 'Organic Floor';
Pass: 0;
MMPass: ( True , True , True , True );
Obscurement: 0;
Altitude: 0;
DMG: 0; Destroyed: 0;
Flammable: False; ),
( name: 'Organic Wall';
Pass: -100;
MMPass: ( True , True , True , True );
Obscurement: 1;
Altitude: 6;
DMG: 30; Destroyed: 41;
Flammable: False; )
);
{ This array holds the movement vectors for the 8 possible }
{ directions of travel. Dir 0 is at three o'clock, for no }
{ better reason than it's the same convention I've used in }
{ other games. }
AngDir: Array [0..7 , 1..2] of SmallInt = (
(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)
);
LOCALE_CollectTriggers: Boolean = True;
TERRAIN_Threshold = 19;
{ ******************************** }
{ *** SCENE & TEAM CONSTANTS *** }
{ ******************************** }
{ ADVENTURE DEFINITION }
{ G = GG_Adventure }
{ S = Exit Lock }
{ V = Undefined }
{ SCENE DEFINITION }
{ G = GG_Scene }
{ S = Scene ID }
{ V = Map Scale }
{ STAT[ 1 ] = Map Generation Type }
STAT_MapGenerator = 1;
{ TEAM DEFINITION }
{ G = GG_Team }
{ S = Team ID }
{ V = UNDEFINED }
{ STAT[ 1 ] = Default Team Orders }
{ STAT[ 2 ] = Wandering Monster Value }
STAT_TeamOrders = 1;
STAT_WanderMon = 2;
{ *** MAP FEATURE DEFINITION *** }
{ G = GG_MapFeature }
{ S = Feature Type }
{ V = Feature Value }
GS_Building = -1;
STAT_XPos = 1;
STAT_YPos = 2;
STAT_MFWidth = 3;
STAT_MFHeight = 4;
STAT_MFFloor = 5;
STAT_MFMarble = 6;
STAT_MFBorder = 7;
STAT_MFSpecial = 8;
MapFeatureMaxWidth = 25;
MapFeatureMaxHeight = 15;
MapFeatureMinDimension = 5;
{ TIME CONSTANTS }
AP_Minute = 60;
AP_3Minutes = 180;
AP_5Minutes = 300;
AP_10Minutes = 600;
AP_HalfHour = 1800;
AP_Hour = 3600;
AP_Quarter = 21600;
AP_Day = 86400;
TRIGGER_FiveMinutes = '5MIN';
TRIGGER_Hour = 'HOUR';
TRIGGER_HalfHour = 'HALFHOUR';
TRIGGER_Quarter = 'QUARTER';
{ This constant is used by stairs and other portals. If a value }
{ is addigned to it, the player character should appear on that }
{ terrain after leaving the current level. }
SCRIPT_Terrain_To_Seek: Integer = 0;
SCRIPT_Gate_To_Seek: Integer = 0;
PC_Team_X: Integer = 0;
PC_Team_Y: Integer = 0;
type
Point = Record
x,y,z: Integer;
end;
Tile = Record
Terr: Integer;
Visible: Boolean;
end;
Location = Array [1..XMax,1..YMax] of Tile;
gameboard = Record
ComTime: LongInt; { Current game time. }
Scale: SmallInt; { The scale of the map. }
QuitTheGame: Boolean; { Whether or not a QUIT msg was caught. }
ReturnCode: Integer; { Value to return when the game is over. }
map: Location;
Scene: GearPtr; { A gear describing the scenario. }
Trig: SAttPtr; { A list of triggers which have occured - should be routinely checked by the main combat procedure. }
{ See the scripting unit for this implementation for more information, or set LOCALE_CollectTriggers to FALSE to disable scripts. }
meks: GearPtr; {A list of all associated mecha.}
end;
gameboardptr = ^gameboard;
FrozenLocation = Record
Name: String;
map: Location;
Next: Pointer;
end;
FrozenLocationPtr = ^FrozenLocation;
{ This record holds the data needed for an entire campaign. }
Campaign = Record
ComTime: LongInt;
GB: GameBoardPtr;
Maps: FrozenLocationPtr;
Source: GearPtr;
end;
CampaignPtr = ^Campaign;
Function CreateFrozenLocation(var LList: FrozenLocationPtr): FrozenLocationPtr;
Function SolveLine(X1,Y1,X2,Y2,N: Integer): Point;
Function SolveLine(X1,Y1,Z1,X2,Y2,Z2,N: Integer): Point;
function NewMap: GameBoardPtr;
function NewCampaign: CampaignPtr;
procedure DisposeMap(var gb: GameBoardPtr);
procedure DisposeCampaign(var Camp: CampaignPtr);
function GearCurrentLocation( Mek: GearPtr ): Point;
Function LocateTeam( Scene: GearPtr; Team: Integer ): GearPtr;
Function LocateTeam( GB: GameBoardPtr; Team: Integer ): GearPtr;
Function AreEnemies( Scene: GearPtr; T1,T2: Integer ): Boolean;
Function AreEnemies( GB: GameBoardPtr; T1,T2: Integer ): Boolean;
Function AreEnemies( GB: GameBoardPtr; M1 , M2: GearPtr ): Boolean;
Function AreAllies( Scene: GearPtr; T1,T2: Integer ): Boolean;
Function AreAllies( GB: GameBoardPtr; T1,T2: Integer ): Boolean;
Function AreAllies( GB: GameBoardPtr; M1 , M2: GearPtr ): Boolean;
Procedure DeleteObsoleteTeams( GB: GameBoardPtr );
Function IsSafeArea( GB: GameBoardPtr ): Boolean;
Function TeamSkill( GB: GameBoardPtr; Team,Skill: Integer): Integer;
Function TeamHasSkill( GB: GameBoardPtr; Team,Skill: Integer): Boolean;
Function TeamCanSeeTarget( GB: GameBoardPtr; Team: Integer; Target: GearPtr ): Boolean;
Function MekCanSeeTarget( GB: GameBoardPtr; Mek , Target: GearPtr ): Boolean;
Function OnTheMap( X,Y: Integer ): Boolean;
Function OnTheMap( Mek: GearPtr ): Boolean;
function MekVisible( gb: GameBoardPtr; Mek: GearPtr ): Boolean;
function MekAltitude( gb: GameBoardPtr; Mek: GearPtr ): Integer;
Function NumGearsXY( GB: GameBoardPtr; X,Y: Integer ): Integer;
Function FindGearXY( GB: GameBoardPtr; X,Y,N: Integer): GearPtr;
Function NumVisibleGears( GB: GameBoardPtr; X,Y: Integer ): Integer;
Function FindVisibleGear( GB: GameBoardPtr; X,Y,N: Integer): GearPtr;
Function FindBlockerXYZ( GB: GameBoardPtr; X,Y,Z: Integer ): GearPtr;
Function NumVisibleItemsAtSpot( GB: GameBoardPtr; X,Y: Integer ): Integer;
Function GetVisibleItemAtSpot( GB: GameBoardPtr; X,Y,N: Integer ): GearPtr;
Function FindVisibleItemAtSpot( GB: GameBoardPtr; X,Y: Integer ): GearPtr;
Function NumVisibleUsableGearsXY( GB: GameBoardPtr; X,Y: Integer; const Trigger: String ): Integer;
Function FindVisibleUsableGearXY( GB: GameBoardPtr; X,Y,N: Integer; const Trigger: String): GearPtr;
Function FindVisibleBlockerAtSpot( GB: GameBoardPtr; X,Y: Integer ): GearPtr;
Procedure UpdateShadowMap( GB: GameBoardPtr );
Function TileBlocksLOS( GB: GameBoardPtr; X,Y,Z: Integer ): Boolean;
Function CalcObscurement(X1,Y1,Z1,X2,Y2,Z2: Integer; gb: GameBoardPtr): Integer;
Function CalcObscurement(X1,Y1,X2,Y2: Integer; gb: GameBoardPtr): Integer;
Function CalcObscurement( M1: GearPtr; X2,Y2: Integer; gb: GameBoardPtr ): Integer;
Function CalcObscurement( M1 , M2: GearPtr; gb: GameBoardPtr ): Integer;
Function CheckArc( OX , OY , TX , TY , A: Integer ): Boolean;
Function CheckArc( M1: GearPtr; X2,Y2,A: Integer ): Boolean;
Function CheckArc( M1,M2: GearPtr; A: Integer ): Boolean;
Function Range( X1 , Y1 , X2 , Y2: Integer ): Integer;
Function Range( M1: GearPtr; X2,Y2: Integer ): Integer;
Function Range( gb: GameBoardPtr; M1 , M2: GearPtr ): Integer;
function WeaponRange( GB: GameBoardPtr; Weapon: GearPtr ): Integer;
function ThrowingRange( GB: GameBoardPtr; User,Weapon: GearPtr ): Integer;
Function GearDestination( Mek: GearPtr ): Point;
Function IsObstacle( GB: GameBoardPtr; Mek: GearPtr; Terrain: Integer ): Boolean;
Function IsBlocked( Mek: GearPtr; GB: GameBoardPtr; X,Y: Integer ): Boolean;
Function FrontBlocked( Mek: GearPtr; GB: GameBoardPtr; D: Integer ): Boolean;
Function MoveBlocked( Mek: GearPtr; GB: GameBoardPtr ): Boolean;
Function CalcMoveTime( Mek: GearPtr; GB: GameBoardPtr ): Integer;
Function CalcRelativeSpeed( Mek: GearPtr; GB: GameBoardPtr ): Integer;
Function IsInCover( GB: GameBoardPtr; Master: GearPtr ): Boolean;
Function CheckLOS( GB: GameBoardPtr; Observer,Target: GearPtr ): Boolean;
Function NumActiveMasters( GB: GameBoardPtr; Team: Integer ): Integer;
Function NumOperationalMasters( GB: GameBoardPtr; Team: Integer ): Integer;
Procedure SetTrigger( GB: GameBoardPtr; const msg: String );
Function SeekTarget( GB: GameBoardPtr; Mek: GearPtr ): GearPtr;
Procedure FreezeLocation( const Name: String; GB: GameBoardPtr; var FList: FrozenLocationPtr );
Function UnfreezeLocation( const Name: String; var FList: FrozenLocationPtr ): GameBoardPtr;
function FindThisTerrain( GB: GameBoardPtr; TTS: Integer ): Point;
Function NewTeamID( Scene: GearPtr ): LongInt;
Procedure SetTeamReputation( GB: GameBoardPtr; T,R,V: Integer );
Procedure DeclarationOfHostilities( GB: GameBoardPtr; ATeam,DTeam: Integer );
Function BoardMecha( Mek,Pilot: GearPtr ): Boolean;
Function ExtractPilot( Mek: GearPtr ): GearPtr;
Function FindPilotsMecha( LList,PC: GearPtr ): GearPtr;
Procedure AssociatePilotMek( LList , Pilot , Mek: GearPtr );
Function FindGearScene( Part: GearPtr; GB: GameBoardPtr ): Integer;
Function FindActualScene( GB: GameBoardPtr; SID: Integer ): GearPtr;
Procedure WriteMap(Map: Location; var F: Text);
Function ReadMap(var F: Text): Location;
Function FindDeploymentSpot( GB: GameBoardPtr; Mek: GearPtr ): Point;
implementation
uses ability,damage,gearutil,ghchars,ghprop,ghweapon,rpgdice,texutil;
Type
LPattern = Record { Location Pattern }
X,Y,Z: Integer; { Tile to search }
{ Set Z outside normal range -5...+5 to exclude it as a search parameter }
Trigger: String; { USed when searching for triggerable props. }
Only_Visibles: Boolean; { Only search for visible gears? }
Only_Masters: Integer; { Only search for master gears? }
end;
Const
LP_MustBeBlocker = 2;
LP_MustBeMaster = 1;
LP_MustNotBeMaster = -1;
LP_MustBeUsable = -2;
Stealth_Per_Scale = 4;
LowShadow = -3;
HiShadow = 5;
var
Shadow_Map: Array [1..XMax,1..YMax,LowShadow..HiShadow] of SmallInt;
Shadow_Map_Update: LongInt; { ComTime when map last updated. }
Function CreateFrozenLocation(var LList: FrozenLocationPtr): FrozenLocationPtr;
{Add a new element to the head of LList.}
var
it: FrozenLocationPtr;
begin
{Allocate memory for our new element.}
New(it);
if it = Nil then exit;
{Attach IT to the list.}
it^.Next := LList;
LList := it;
{Return a pointer to the new element.}
CreateFrozenLocation := it;
end;
Procedure DisposeFrozenLocation(var LList: FrozenLocationPtr);
{Dispose of the list, freeing all associated system resources.}
var
LTemp: FrozenLocationPtr;
begin
while LList <> Nil do begin
LTemp := LList^.Next;
Dispose(LList);
LList := LTemp;
end;
end;
Procedure RemoveFrozenLocation(var LList,LMember: FrozenLocationPtr);
{Locate and extract member LMember from list LList.}
{Then, dispose of LMember.}
var
a,b: FrozenLocationPtr;
begin
{Initialize A and B}
B := LList;
A := Nil;
{Locate LMember in the list. A will thereafter be either Nil,}
{if LMember if first in the list, or it will be equal to the}
{element directly preceding LMember.}
while (B <> LMember) and (B <> Nil) do begin
A := B;
B := B^.next;
end;
if B = Nil then begin
{Major FUBAR. The member we were trying to remove can't}
{be found in the list.}
writeln('ERROR- RemoveFrozenLocation asked to remove a link that doesnt exist.');
end
else if A = Nil then begin
{There's no element before the one we want to remove,}
{i.e. it's the first one in the list.}
LList := B^.Next;
Dispose(B);
end
else begin
{We found the attribute we want to delete and have another}
{one standing before it in line. Go to work.}
A^.next := B^.next;
Dispose(B);
end;
end;
Function FindFrozenLocation( const Name_In: String; FList: FrozenLocationPtr ): FrozenLocationPtr;
{ Locate a frozen location by looking for its name. }
{ If the specified location cannot be found, return Nil. }
var
Name: String;
begin
{ Make sure name is upper-case. }
Name := UpCase( Name_In );
while ( FList <> Nil ) and ( UpCase( FList^.Name ) <> Name ) do FList := FList^.Next;
FindFrozenLocation := FList;
end;
Function SolveLine(X1,Y1,X2,Y2,N: Integer): Point;
{Find the N'th point along a line starting at X1,Y1 and ending}
{at X2,Y2. Return its location.}
var
tmp: point;
VX1,VY1,VX,VY: Integer;
Rise,Run: Integer; {Rise and Run}
begin
{ERROR CHECK- Solve the trivial case.}
if (X1=X2) and (Y1=Y2) then begin
tmp.x := X1;
tmp.y := Y1;
Exit(tmp);
end;
{For line determinations, we'll use a virtual grid where each game}
{tile is a square 10 units across. Calculations are done from the}
{center of each square.}
VX1 := X1*10 + 5;
VY1 := Y1*10 + 5;
{Do the slope calculations.}
Rise := Y2 - Y1;
Run := X2 - X1;
if Abs(X2 - X1)> Abs(Y2 - Y1) then begin
{The X direction is longer than the Y axis.}
{Therefore, we can infer X pretty easily, then}
{solve the equation for Y.}
{Determine our X value.}
if Run > 0 then VX := (n*10) + VX1
else VX := VX1 - n*10;
VY := n*10*Rise div Abs(Run) + VY1;
end
else begin
{The Y axis is longer.}
if Rise > 0 then VY := (n*10) + VY1
else VY := VY1 - n*10;
VX := (n*10*Run div Abs(Rise)) + VX1;
end;
{Error check- DIV doesn't deal with negative numbers as I would}
{want it to. I'd always like a positive remainder- so, let's modify}
{the values.}
if VX<0 then VX := VX - 10;
if VY<0 then VY := VY - 10;
tmp.x := VX div 10;
tmp.y := VY div 10;
SolveLine := tmp;
end;
Function SolveLine(X1,Y1,Z1,X2,Y2,Z2,N: Integer): Point;
{ Solve the three-dimensional line. }
var
PA,PB: Point;
W: Integer;
begin
if Abs(X2 - X1) > Abs(Y2 - Y1) then
W := Abs(X2-X1)
else
W := Abs(Y2-Y1);
PA := SolveLine( X1 , Y1 , X2 , Y2 , N );
PB := SolveLine( 0 , Z1 , W , Z2 , N );
PA.Z := PB.Y;
SolveLine := PA;
end;
function NewMap: GameBoardPtr;
{Allocate and initialize a new GameBoard structure.}
var
it: GameBoardPtr;
X,Y: Integer;
begin
{Allocate the needed memory space.}
New(it);
if it <> Nil then begin
it^.Scale := DefaultScale;
it^.meks := Nil;
it^.Scene := Nil;
it^.Trig := Nil;
it^.ComTime := 0;
it^.QuitTheGame := False;
it^.ReturnCode := 0;
for X := 1 to XMax do begin
for Y := 1 to YMax do begin
it^.map[X,Y].terr := 1;
it^.map[X,Y].visible := False;
end;
end;
end;
NewMap := it;
end;
function NewCampaign: CampaignPtr;
{Allocate and initialize a new Campaign structure.}
var
it: CampaignPtr;
begin
{Allocate the needed memory space.}
New(it);
if it <> Nil then begin
it^.ComTime := 0;
it^.GB := Nil;
it^.maps := Nil;
it^.Source := Nil;
end;
NewCampaign := it;
end;
procedure DisposeMap(var gb: GameBoardPtr);
{Get rid of the GameBoard.}
{ NOTE: Any gears, triggers, or scenes still attached will be }
{ lost as well!!! }
begin
{ Error check }
if GB = Nil then Exit;
DisposeGear( gb^.Meks );
DisposeGear( gb^.Scene );
DisposeSAtt( gb^.Trig );
Dispose(gb);
GB := Nil;
end;
procedure DisposeCampaign(var Camp: CampaignPtr);
{Get rid of the campaign.}
begin
DisposeGear( Camp^.Source );
DisposeMap( Camp^.GB );
DisposeFrozenLocation( Camp^.Maps );
Dispose(Camp);
Camp := Nil;
end;
function GearCurrentLocation( Mek: GearPtr ): Point;
{ Locate the coordinates of MEK. }
{ BUGS: If Mek is Nil or undefined, this function will cause }
{ a runtime error. }
var
P: Point;
begin
{ Make sure first that we're dealing with a root-level gear. }
Mek := FindRoot( Mek );
{ Locate its X and Y coordinates. }
P.X := NAttValue( Mek^.NA , NAG_Location , NAS_X );
P.Y := NAttValue( Mek^.NA , NAG_Location , NAS_Y );
GearCurrentLocation := P;
end;
Function LocateTeam( Scene: GearPtr; Team: Integer ): GearPtr;
{ Given a SCENE gear, locate the requested team. }
var
TG,SE: GearPtr;
begin
TG := Nil;
if Scene <> Nil then begin
SE := Scene^.SubCom;
while SE <> Nil do begin
if (SE^.G = GG_Team) and (SE^.S = TEAM) then TG := SE;
SE := SE^.Next;
end;
end;
LocateTeam := TG;
end;
Function LocateTeam( GB: GameBoardPtr; Team: Integer ): GearPtr;
{ Search through the SCENE gear attached to the game board, }
{ trying to find the team gear corresponding to the provided }
{ TEAM number. If no such team is found, or if no scene is }
{ defined, return NIL. }
var
TG: GearPtr; { Scene Element, Team Gear }
begin
TG := Nil;
if GB^.Scene <> Nil then begin
TG := LocateTeam( GB^.Scene , Team );
end;
LocateTeam := TG;
end;
Function AreEnemies( Scene: GearPtr; T1,T2: Integer ): Boolean;
{ Locate the TEAM descriptions for the two teams indicated, }
{ then return TRUE if they are enemies, FALSE if they are not. }
{ If no TEAM gears have been defined, even teams are enemies }
{ with odd teams, except team 0 which is perfectly neutral. }
{ Note that this check is performed from the perspective of }
{ team one. }
var
TG1: GearPtr;
SR: Integer;
it: Boolean;
begin
{ First, substitute out the Lancemate team for the PC team. }
if T1 = NAV_LancemateTeam then T1 := NAV_DefPlayerTeam;
if T2 = NAV_LancemateTeam then T2 := NAV_DefPlayerTeam;
TG1 := LocateTeam( Scene , T1 );
it := False;
{ A team is never enemies with itself. }
if T1 = T2 then begin
it := False;
end else if TG1 = Nil then begin
{ If either of the teams can't be found, use default. }
if ( T1 = 0 ) or ( T2 = 0 ) then begin
it := False;
end else if ( Abs( T1 ) mod 2 ) <> ( Abs( T2 ) mod 2 ) then begin
it := True;
end else begin
it := False;
end;
end else begin
SR := NAttValue( TG1^.NA , NAG_SideReaction , T2 );
if SR = NAV_AreEnemies then it := True
else it := False;
end;
AreEnemies := it;
end;
Function AreEnemies( GB: GameBoardPtr; T1,T2: Integer ): Boolean;
{ Return TRUE if M1 and M2 are enemies, FALSE otherwise. }
begin
AreEnemies := AreEnemies( GB^.Scene , T1 , T2 );
end;
Function AreEnemies( GB: GameBoardPtr; M1 , M2: GearPtr ): Boolean;
{ Return TRUE if M1 and M2 are enemies, FALSE otherwise. }
var
Team1,Team2: Integer;
begin
Team1 := NAttValue( M1^.NA , NAG_Location , NAS_Team );
Team2 := NAttValue( M2^.NA , NAG_Location , NAS_Team );
AreEnemies := AreEnemies( GB , Team1 , Team2 );
end;
Function AreAllies( Scene: GearPtr; T1,T2: Integer ): Boolean;
{ Locate the TEAM descriptions for the two teams indicated, }
{ then return TRUE if they are alliess, FALSE if they are not. }
{ If no TEAM gears have been defined, even teams are enemies }
{ with odd teams, except team 0 which is perfectly neutral. }
{ Note that this check is performed from the perspective of }
{ team one. }
var
TG1: GearPtr;
SR: Integer;
it: Boolean;
begin
{ First, substitute out the Lancemate team for the PC team. }
if T1 = NAV_LancemateTeam then T1 := NAV_DefPlayerTeam;
if T2 = NAV_LancemateTeam then T2 := NAV_DefPlayerTeam;
TG1 := LocateTeam( Scene , T1 );
it := False;
{ A team is always allied with itself. }
if T1 = T2 then begin
it := True;
end else if ( TG1 = Nil ) then begin
{ If the team can't be found, use default. }
if ( T1 = 0 ) or ( T2 = 0 ) then begin
it := False;
end else if ( Abs( T1 ) mod 2 ) = ( Abs( T2 ) mod 2 ) then begin
it := True;
end else begin
it := False;
end;
end else begin
SR := NAttValue( TG1^.NA , NAG_SideReaction , T2 );
if SR = NAV_AreAllies then it := True
else it := False;
end;
AreAllies := it;
end;
Function AreAllies( GB: GameBoardPtr; T1,T2: Integer ): Boolean;
{ Return TRUE if M1 and M2 are allies, FALSE otherwise. }
begin
AreAllies := AreAllies( GB^.Scene , T1 , T2 );
end;
Function AreAllies( GB: GameBoardPtr; M1 , M2: GearPtr ): Boolean;
{ Return TRUE if M1 and M2 are allies, FALSE otherwise. }
var
Team1,Team2: Integer;
begin
Team1 := NAttValue( M1^.NA , NAG_Location , NAS_Team );
Team2 := NAttValue( M2^.NA , NAG_Location , NAS_Team );
AreAllies := AreAllies( GB , Team1 , Team2 );
end;
Procedure ForgetTeam( Scene: GearPtr; Team: Integer );
{ Clear all reactions to the team which is to be forgotten. }
var
Part: GearPtr;
begin
Part := Scene^.SubCOm;
while Part <> Nil do begin
if Part^.G = GG_Team then SetNAtt( Part^.NA , NAG_SideReaction , Team , 0 );
Part := Part^.Next;
end;
end;
Procedure DeleteObsoleteTeams( GB: GameBoardPtr );
{ Check for teams which have no members and no name. Delete them. }
var
Mek,Team: GearPtr;
begin
if GB^.Scene <> Nil then begin
Team := GB^.Scene^.SubCom;
while Team <> Nil do begin
Mek := Team^.Next;
if Team^.G = GG_Team then begin
if ( NumACtiveMasters( GB , Team^.S ) < 1 ) and ( Team^.S <> NAV_DefPlayerTeam ) and ( Team^.Stat[ STAT_WanderMon ] = 0 ) and ( GearName( Team ) = '' ) then begin
{ This team has no active masters, }
{ isn't the player team, and has no wandering monsters. }
ForgetTeam( GB^.Scene , Team^.S );
RemoveGear( GB^.Scene^.SubCom , Team );
end;
end;
Team := Mek;
end;
end;
end;
Function IsSafeArea( GB: GameBoardPtr ): Boolean;
{ Return TRUE if this map is a safe area for the PC, or }
{ FALSE if it isn't. An area is safe it: }
{ 1) No teams have WMon values set }
{ 2) No master gears which are enemies of Team 1 are present. }
var
it: Boolean;
M: GearPtr;
T: Integer;
begin
{ Assume the area is safe, until we find a dangerous thing. }
it := True;
{ First, get rid of any obsolete teams. }
DeleteObsoleteTeams( GB );
{ Check teams for wandering monsters, and scene for UNSAFE tag. }
if GB^.SCene <> Nil then begin
if AStringHasBString( SAttValue( GB^.Scene^.SA , 'SPECIAL' ) , 'UNSAFE' ) then it := False;
M := GB^.Scene^.SubCom;
while M <> Nil do begin
if ( M^.G = GG_Team ) and ( M^.Stat[ STAT_WanderMon ] > 0 ) then it := False;
M := M^.Next;
end;
end;
{ Check map contents for hostile masters. }
if it then begin
M := GB^.Meks;
while M <> Nil do begin
if IsMasterGear( M ) and GearOperational( M ) and OnTheMap( M ) then begin
T := NAttValue( M^.NA , NAG_Location , NAS_TEam );
if AreEnemies( GB , T , NAV_DefPlayerTeam ) then it := False;
end;
M := M^.Next;
end;
end;
{ Return the result of our search. }
IsSafeArea := it;
end;
Function TeamSkill( GB: GameBoardPtr; Team,Skill: Integer): Integer;
{ Return the maximum skill value from the team. }
var
M: GearPtr;
MSkill,BigSkill,TSkill,T2: Integer;
begin
{ Check through every mek on the board. }
M := GB^.Meks;
BigSkill := 0;
TSkill := 0;
while m <> Nil do begin
{ Lancemates count as part of the PC team for skill purposes. }
T2 := NAttValue( M^.NA , NAG_Location , NAS_Team );
if T2 = NAV_LancemateTeam then T2 := NAV_DefPlayerTeam;
if T2 = Team then begin
if IsMasterGear( M ) then begin
MSkill := SkillValue( M , Skill );
if MSkill > BigSkill then BigSkill := MSkill;
if MSkill >= 5 then TSkill := TSkill + ( MSkill div 5 );
end;
end;
m := m^.Next;
end;
TeamSkill := BigSkill + TSkill - ( BigSkill div 5 );
end;
Function TeamHasSkill( GB: GameBoardPtr; Team,Skill: Integer): Boolean;
{ Return TRUE if at least one member of the team has the requested skill. }
var
M,P: GearPtr;
Found: Boolean;
T2: Integer;
begin
{ Check through every mek on the board. }
M := GB^.Meks;
Found := False;
while m <> Nil do begin
{ Lancemates count as part of the PC team for skill purposes. }
T2 := NAttValue( M^.NA , NAG_Location , NAS_Team );
if T2 = NAV_LancemateTeam then T2 := NAV_DefPlayerTeam;
if T2 = Team then begin
if IsMasterGear( M ) and GearActive( M ) then begin
P := LocatePilot( M );
if NAttValue( P^.NA , NAG_Skill , Skill ) > 0 then Found := True;
end;
end;
m := m^.Next;
end;
TeamHasSkill := Found;
end;
Function TeamCanSeeTarget( GB: GameBoardPtr; Team: Integer; Target: GearPtr ): Boolean;
{ Check to see whether or not TARGET is visible to the listed }
{ team. It is visible if it has a visibility marker from the }
{ listed team, or if it has a visibility marker from any of TEAM's }
{ allies. }
var
it: Boolean;
T2: Integer;
Vis: NAttPtr;
P: Point;
begin
it := False;
T2 := NAttValue( Target^.NA , NAG_Location , NAS_Team );
if AreAllies( GB , Team , T2 ) then begin
It := True;
end else if IsMasterGear( Target ) then begin
{ Check through all the target's NAtts, looking for }
{ visibility information. }
Vis := Target^.NA;
while Vis <> Nil do begin
if ( Vis^.G = NAG_Visibility ) and ( Vis^.V = NAV_Spotted ) then begin
if AreAllies( gb , Team , Vis^.S ) then it := True;
end;
Vis := Vis^.Next;
end;
end else begin
P := GearCurrentLocation( Target );
if OnTheMap( P.X , P.Y ) then begin
it := GB^.Map[ P.X , P.Y ].Visible;
end;
end;
TeamCanSeeTarget := it;
end;
Function MekCanSeeTarget( GB: GameBoardPtr; Mek , Target: GearPtr ): Boolean;
{ Check to see whether or not TARGET is currently visible to }
{ MEK. }
var
Team: Integer;
begin
Team := NAttValue( Mek^.NA , NAG_Location , NAS_Team );
MekCanSeeTarget := TeamCanSeeTarget( gb , Team , Target );
end;
Function OnTheMap( X,Y: Integer ): Boolean;
{ Check to see whether or not location X,Y is on the map.}
var
OTM: Boolean;
begin
OTM := True;
if (X < 1) or (X > XMax) then OTM := False;
if (Y < 1) or (Y > YMax) then OTM := False;
OnTheMap := OTM;
end;
Function OnTheMap( Mek: GearPtr ): Boolean;
{ Determine whether or not this mech is on the map. }
var
X,Y: Integer;
begin
{ Error check - MEK must be defined in order for this to work. }
if Mek = Nil then Exit( False );
{ The location info is stored at root level... so if this gear }
{ isn't root level, find one that is. }
if Mek^.Parent <> Nil then Mek := FindRoot( Mek );
X := NAttValue( Mek^.NA , NAG_Location , NAS_X );
Y := NAttValue( Mek^.NA , NAG_Location , NAS_Y );
OnTheMap := OnTheMap( X , Y );
end;
function MekVisible( GB: GameBoardPtr; Mek: GearPtr ): Boolean;
{ Determine whether or not the graphic for MEK should be drawn }
{ on the screen. }
var
P: Point;
begin
if Mek^.G = GG_MetaTerrain then begin
P := GearCurrentLocation( Mek );
if OnTheMap( P.X , P.Y ) then begin
MekVisible := GB^.Map[ P.X , P.Y ].Visible and ( Mek^.Stat[ STAT_MetaVisibility ] = 0 );
end else begin
MekVisible := TeamCanSeeTarget( gb , NAV_DefPlayerTeam , Mek );
end;
end else begin
MekVisible := TeamCanSeeTarget( gb , NAV_DefPlayerTeam , Mek );
end;
end;
function MekAltitude( gb: GameBoardPtr; Mek: GearPtr ): Integer;
{ Determine the current altitude of MEK. This could be affected by }
{ a number of things. The basic value is the same as the tile the mek }
{ is standing on; if the mek is hovering or flying its altitude may }
{ be different. }
var
X,Y,Z: Integer;
begin
if Mek^.Parent <> Nil then Mek := FindRoot( Mek );
{ Find the location of the mek. }
X := NAttValue( Mek^.NA , NAG_Location , NAS_X );
Y := NAttValue( Mek^.NA , NAG_Location , NAS_Y );
{ Error Check - make sure the mek is on the map. }
if not OnTheMap( X , Y ) then Exit( 0 );
{ Z will be used to represent the vertical coordinate }
Z := TerrMan[ gb^.map[X,Y].terr ].Altitude;
{ Depending upon the mek's move mode, this altitude may be changed. }
X := NAttValue( Mek^.NA , NAG_Action , NAS_MoveMode );
if ( X = MM_Skim ) and ( BaseMoveRate(Mek,X) > 0 ) then begin
{ A hovering mek will not go underwater. Min. Z = 0 }
if Z < 0 then Z := 0;
end else if ( X = MM_Fly ) and ( BaseMoveRate(Mek,X) > 0 ) and GearOperational( Mek ) and ( NAttValue( Mek^.NA , NAG_Action , NAS_MoveAction ) <> NAV_Stop ) then begin
Z := 5;
end;
MekAltitude := Z;
end;
Function IsBlocker( Mek: GearPtr ): Boolean;
{ Return TRUE if MEK is a blocker, FALSE otherwise. }
begin
if IsMasterGear( mek ) then begin
IsBlocker := True;
end else if Mek^.G = GG_MetaTerrain then begin
IsBlocker := ( Mek^.Stat[ STAT_Pass ] <= -100 ) and NotDestroyed( Mek );
end else begin
IsBlocker := False;
end;
end;
Function GearMatchesLPattern( GB: GameBoardPtr; Mek: GearPtr; var Match: LPattern ): Boolean;
{ Return TRUE if the specified gear matches the search criteria, }
{ or FALSE if it doesn't. }
var
it: Boolean;
P: Point;
begin
if Mek = Nil then begin
{ An undefined mek can't be a match. }
it := False;
end else begin
{ See whether or not the gear is in our search tile. }
P := GearCurrentLocation( Mek );
if ( P.X = Match.X ) and ( P.Y = Match.Y ) then begin
{ It's in the search tile. Assume TRUE, then apply the }
{ other checks. }
it := True;
{ If a defined altitude is provided, check to see }
{ whether or not the provided mek is at this alt. }
if ( Match.Z >= -5 ) and ( Match.Z <= 5 ) then begin
if Mek^.G = GG_MetaTerrain then begin
it := Mek^.Stat[ STAT_Altitude ] >= Match.Z;
end else begin
it := MekAltitude( gb , Mek ) = Match.Z;
end;
end;
{ If we're only looking for masters, or only }
{ looking for non-masters, check that now. }
if Match.Only_Masters = LP_MustBeMaster then begin
it := it AND IsMasterGear( Mek );
end else if Match.Only_Masters = LP_MustBeBlocker then begin
it := it and IsBlocker( Mek );
end else if Match.Only_Masters = LP_MustNotBeMaster then begin
it := it AND NOT IsMasterGear( Mek );
end else if Match.Only_Masters = LP_MustBeUsable then begin
it := it AND (( Mek^.G = GG_MetaTerrain ) or ( SAttValue( Mek^.SA , Match.Trigger ) <> '' ));
end;
{ If we're only looking for visible gears, }
{ check that now. }
if Match.Only_Visibles then it := it AND MekVisible( GB , Mek );
end else begin
{ This gear isn't in the proper map tile, so of course }
{ it doesn't fit the search criteria. }
it := False;
end;
end;
GearMatchesLPattern := it;
end;
Function NumMatchesPresent( GB: GameBoardPtr; var Match: LPattern ): Integer;
{ Find the number of gears on the map which match the provided }
{ search criteria. }
var
M: GearPtr; { Mek Pointer }
C: Integer; { Mek Count }
begin
{ Initialize values }
M := GB^.Meks;
C := 0;
while M <> Nil do begin
if GearMatchesLPattern( GB , M , Match ) then Inc(C);
M := M^.Next;
end;
NumMatchesPresent := C;
end;
Function FindMatchNumber( GB: GameBoardPtr; var Match: LPattern; N: Integer): GearPtr;
{ Find gear number N at map tile X,Y. }
{ If no appropriate gear is found, return the closest match. }
{ If there's no gear at all in this tile, return Nil. }
var
M,SM: GearPtr; { Mek counter, and Spot Mecha. }
Count: Integer;
begin
{ Initialize all the variables. }
M := GB^.Meks;
SM := Nil;
Count := 0;
{ Make sure that N is equal to at least one. }
if N < 1 then N := 1;
while ( M <> Nil ) and ( Count <> N ) do begin
if GearMatchesLPattern( GB , M , Match ) then begin
Inc(Count);
SM := M;
end;
M := M^.Next;
end;
FindMatchNumber := SM;
end;
Function FindBestMatch( GB: GameBoardPtr; var Match: LPattern ): GearPtr;
{ Locate the best match for the specified search criteria. }
{ If more than one match is found, the mek to be returned will }
{ be decided by the following criteria, in order of importance: }
{ - Altitude (highest mek selected) }
{ - Operationality (okay gear selected over destroyed gear) }
{ - Scale (large gear selected over small gear) }
var
Mek,BestMek: GearPtr;
begin
Mek := GB^.Meks;
BestMek := Nil;
{ Loop through all of the meks on the map. }
while Mek <> Nil do begin
{ If this mek matches the description we've been given, }
{ decide what to do with it next. }
if GearMatchesLPattern( GB , Mek , Match ) then begin
if BestMek = Nil then begin
BestMek := Mek;
end else if MekAltitude( GB , Mek ) > MekAltitude( GB , BestMek ) then begin
BestMek := Mek;
end else if MekAltitude( GB , Mek ) = MekAltitude( GB , BestMek ) then begin
if GearOperational( Mek ) and not GearOperational( BestMek ) then begin
BestMek := Mek;
end else if GearOperational( Mek ) and ( Mek^.Scale > BestMek^.Scale ) then begin
BestMek := Mek;
end;
end;
end;
Mek := Mek^.Next;
end;
{ Return whatever gear we've found. }
FindBestMatch := BestMek;
end;
Function NumGearsXY( GB: GameBoardPtr; X,Y: Integer ): Integer;
{ Determine how many VISIBLE meks there are in tile X,Y. }
var
NVG_Search: LPattern;
begin
NVG_Search.X := X;
NVG_Search.Y := Y;
NVG_Search.Z := -10;
NVG_Search.Only_Visibles := False;
NVG_Search.Only_Masters := 0;
NumGearsXY := NumMatchesPresent( GB , NVG_Search );
end;
Function FindGearXY( GB: GameBoardPtr; X,Y,N: Integer): GearPtr;
{ Find the VISIBLE gear number N at map tile X,Y. }
{ If no appropriate gear is found, return the closest match. }
{ If there's no gear at all in this tile, return Nil. }
var
FVG_Search: LPattern;
begin
FVG_Search.X := X;
FVG_Search.Y := Y;
FVG_Search.Z := -10;
FVG_Search.Only_Visibles := False;
FVG_Search.Only_Masters := 0;
FindGearXY := FindMatchNumber( GB , FVG_Search , N );
end;
Function NumVisibleGears( GB: GameBoardPtr; X,Y: Integer ): Integer;
{ Determine how many VISIBLE meks there are in tile X,Y. }
var
NVG_Search: LPattern;
begin
NVG_Search.X := X;
NVG_Search.Y := Y;
NVG_Search.Z := -10;
NVG_Search.Only_Visibles := True;
NVG_Search.Only_Masters := 0;
NumVisibleGears := NumMatchesPresent( GB , NVG_Search );
end;
Function FindVisibleGear( GB: GameBoardPtr; X,Y,N: Integer): GearPtr;
{ Find the VISIBLE gear number N at map tile X,Y. }
{ If no appropriate gear is found, return the closest match. }
{ If there's no gear at all in this tile, return Nil. }
var
FVG_Search: LPattern;
begin
FVG_Search.X := X;
FVG_Search.Y := Y;
FVG_Search.Z := -10;
FVG_Search.Only_Visibles := True;
FVG_Search.Only_Masters := 0;
FindVisibleGear := FindMatchNumber( GB , FVG_Search , N );
end;
Function FindBlockerXYZ( GB: GameBoardPtr; X,Y,Z: Integer ): GearPtr;
{ Locate a master gear at coordinates X,Y,Z. }
{ Return Nil if no master gear is located at these coordinates. }
var
Match: LPattern;
begin
Match.X := X;
Match.Y := Y;
Match.Z := Z;
Match.Only_Visibles := False;
Match.Only_Masters := LP_MustBeBlocker;
FindBlockerXYZ := FindBestMatch( GB , Match );
end;
Function NumVisibleItemsAtSpot( GB: GameBoardPtr; X,Y: Integer ): Integer;
{ Locate a visible item at the specified coordinates. }
var
Match: LPattern;
begin
Match.X := X;
Match.Y := Y;
Match.Z := -10;
Match.Only_Visibles := True;
Match.Only_Masters := LP_MustNotBeMaster;
NumVisibleItemsAtSpot := NumMatchesPresent( GB , Match );
end;
Function GetVisibleItemAtSpot( GB: GameBoardPtr; X,Y,N: Integer ): GearPtr;
{ Locate a visible item at the specified coordinates. }
var
Match: LPattern;
begin
Match.X := X;
Match.Y := Y;
Match.Z := -10;
Match.Only_Visibles := True;
Match.Only_Masters := LP_MustNotBeMaster;
GetVisibleItemAtSpot := FindMatchNumber( GB , Match , N );
end;
Function FindVisibleItemAtSpot( GB: GameBoardPtr; X,Y: Integer ): GearPtr;
{ Locate a visible item at the specified coordinates. }
var
Match: LPattern;
begin
Match.X := X;
Match.Y := Y;
Match.Z := -10;
Match.Only_Visibles := True;
Match.Only_Masters := LP_MustNotBeMaster;
FindVisibleItemAtSpot := FindBestMatch( GB , Match );
end;
Function NumVisibleUsableGearsXY( GB: GameBoardPtr; X,Y: Integer; const Trigger: String ): Integer;
{ Count the visible, usable items at the specified coordinates. }
var
NVUG_Search: LPattern;
begin
NVUG_Search.X := X;
NVUG_Search.Y := Y;
NVUG_Search.Z := -10;
NVUG_Search.Only_Visibles := True;
NVUG_Search.Only_Masters := LP_MustBeUsable;
NVUG_Search.Trigger := Trigger;
NumVisibleUsableGearsXY := NumMatchesPresent( GB , NVUG_Search );
end;
Function FindVisibleUsableGearXY( GB: GameBoardPtr; X,Y,N: Integer; const Trigger: String): GearPtr;
{ Find the Nth visible, usable item at the specified coordinates. }
var
FVUG_Search: LPattern;
begin
FVUG_Search.X := X;
FVUG_Search.Y := Y;
FVUG_Search.Z := -10;
FVUG_Search.Only_Visibles := True;
FVUG_Search.Only_Masters := LP_MustBeUsable;
FVUG_Search.Trigger := Trigger;
FindVisibleUsableGearXY := FindMatchNumber( GB , FVUG_Search , N );
end;
Function FindVisibleBlockerAtSpot( GB: GameBoardPtr; X,Y: Integer ): GearPtr;
{ Locate a blocker gear at spot X,Y. Return Nil if no such }
{ gear is found. Return the gear at highest altitude with the }
{ largest scale. }
var
Match: LPattern;
begin
Match.X := X;
Match.Y := Y;
Match.Z := -10;
Match.Only_Visibles := True;
Match.Only_Masters := LP_MustBeBlocker;
FindVisibleBlockerAtSpot := FindBestMatch( GB , Match );
end;
Procedure UpdateShadowMap( GB: GameBoardPtr );
{ Update the list of shadows which holds information on gears which }
{ either block or affect LOS. }
{ When we are finished, the shadow map will hold a positive number for }
{ tiles which have an obscurement score, and a negative number for tiles }
{ which block LOS altogether. }
{ We keep the shadow map so that we won't have to scan through every single }
{ gear in the list for every single tile checked when calculating obscurement, }
{ area effects, et cetera. }
var
X,Y,Z: Integer;
M: GearPtr;
begin
{ To start with, clear the previous map. }
for X := 1 to XMax do begin
for Y := 1 to YMax do begin
for Z := LowShadow to HiShadow do begin
Shadow_Map[ X , Y , Z ] := 0;
end;
end;
end;
{ Loop through all gears on the map, looking for metaterrain. }
M := GB^.Meks;
while M <> Nil do begin
if ( M^.G = GG_MetaTerrain ) and NotDestroyed( M ) then begin
X := NAttValue( M^.NA , NAG_Location , NAS_X );
Y := NAttValue( M^.NA , NAG_Location , NAS_Y );
if OnTheMap( X , Y ) then begin
for Z := LowShadow to HiShadow do begin
if Z <= M^.Stat[ Stat_Altitude ] then begin
{ If the tile causes obscurement, add that now. }
{ If the tile blocks LOS altogether, do that as well. }
if M^.Stat[ STAT_Pass ] <= -100 then begin
Shadow_Map[ X , Y , Z ] := -1;
end else if Shadow_Map[ X , Y , Z ] >= 0 then begin
Shadow_Map[ X , Y , Z ] := Shadow_Map[ X , Y , Z ] + M^.Stat[ STAT_Obscurement ];
end;
end;
end;
end;
end;
M := M^.Next;
end;
{ Store the current combat time, so that the shadow map doesn't have to be }
{ generated over again all the time. }
Shadow_Map_Update := GB^.ComTime;
end;
Function TileBlocksLOS( GB: GameBoardPtr; X,Y,Z: Integer ): Boolean;
{ Return TRUE if this tile blocks LOS, or FALSE otherwise. }
{ IMPORTANT: Assumes that X,Y is located on the map. }
{ ALSO IMPORTANT: Assumes that the shadow map is up to date. }
begin
{ Error check - make sure Z is within range. We already }
{ know that X and Y are by the condition that X,Y be on the map. }
if Z > HiShadow then Z := HiShadow
else if Z < LowShadow then Z := LowShadow;
if Shadow_Map[ X , Y , Z ] < 0 then begin
TileBlocksLOS := True;
end else begin
TileBlocksLOS := TerrMan[ GB^.Map[X,Y].Terr ].Altitude > Z;
end;
end;
Function CalcObscurement(X1,Y1,Z1,X2,Y2,Z2: Integer; gb: GameBoardPtr): Integer;
{Check the space between X1,Y1 and X2,Y2. Calculate the total}
{obscurement value of the terrain there. Return 0 for a}
{clear LOS, a positive number for an obscured LOS, and -1}
{for a completely blocked LOS.}
var
N: Integer; {The number of points on the line.}
t,terr: Integer; {A counter, and a terrain type.}
Wall: Boolean; {Have we hit a wall yet?}
p: Point;
O: Integer; {The obscurement count.}
begin
{ Start by updating the shadow map. }
if Shadow_Map_Update < GB^.Comtime then UpdateShadowMap( GB );
if not OnTheMap( X2 , Y2 ) then Exit( -1 );
if Abs(X2 - X1) > Abs(Y2 - Y1) then
N := Abs(X2-X1)
else
N := Abs(Y2-Y1);
{The obscurement count starts out with a value of 0.}
O := 0;
{The variable WALL represents a boundary that cannot be seen through.}
Wall := false;
for t := 1 to N do begin
{Locate the next point on the line.}
p := SolveLine(X1,Y1,Z1,X2,Y2,Z2,t);
{Determine the terrain of this tile.}
if OnTheMap( p.X , P.y ) then begin
terr := gb^.map[p.X,p.Y].terr;
end else begin
terr := 1;
end;
{ Determine whether this terrain is at the correct height }
{ to affect obscurement. }
if TerrMan[ Terr ].Altitude = P.Z then begin
{Update the Obscurement count.}
O := O + TerrMan[Terr].Obscurement;
if ( P.Z >= LowShadow ) and ( P.Z <= HiShadow ) and ( Shadow_Map[ P.X , P.Y , P.Z ] > 0 ) then O := O + Shadow_Map[ P.X , P.Y , P.Z ];
end;
if TileBlocksLOS( GB , P.X , P.Y , P.Z ) then begin
{ If the wall is the terminus of the LOS calculation, }
{ it won't block LOS. Why? Because the PC should }
{ be able to see a wall, even though the wall tile }
{ itself if blocking terrain. }
Wall := T <> N;
end;
end;
{If there's a wall in the way, Obscurement := -1}
if Wall then
O := -1;
CalcObscurement := O;
end;
Function CalcObscurement(X1,Y1,X2,Y2: Integer; gb: GameBoardPtr): Integer;
{ Same as above, but calculate Z values here. }
begin
if not ( OnTheMap( X1 , Y1 ) and OnTheMap( X2 , Y2 ) ) then Exit( -1 );
CalcObscurement := CalcObscurement( X1 , Y1 , TerrMan[ gb^.map[ X1 , Y1 ].terr ].Altitude , X2 , Y2 , TerrMan[ gb^.map[ X2 , Y2 ].terr ].Altitude , gb );
end;
Function CalcObscurement( M1: GearPtr; X2,Y2: Integer; gb: GameBoardPtr ): Integer;
{ Calculate the obscurement between M1 and M2. }
var
X1,Y1: Integer;
begin
if M1^.Parent <> Nil then M1 := FindRoot( M1 );
if OnTheMap( M1 ) and OnTheMap( X2 , Y2 ) then begin
X1 := NAttValue( M1^.NA , NAG_Location , NAS_X );
Y1 := NAttValue( M1^.NA , NAG_Location , NAS_Y );
CalcObscurement := CalcObscurement( X1 , Y1 , MekAltitude(gb,M1) , X2 , Y2 , TerrMan[ gb^.map[ X2 , Y2 ].terr ].Altitude , gb );
end else begin
CalcObscurement := -1;
end;
end;
Function CalcObscurement( M1 , M2: GearPtr; gb: GameBoardPtr ): Integer;
{ Calculate the obscurement between M1 and M2. }
var
X1,Y1,X2,Y2: Integer;
begin
if M1^.Parent <> Nil then M1 := FindRoot( M1 );
if M2^.Parent <> Nil then M2 := FindRoot( M2 );
if OnTheMap( M1 ) and OnTheMap( M2 ) then begin
X1 := NAttValue( M1^.NA , NAG_Location , NAS_X );
Y1 := NAttValue( M1^.NA , NAG_Location , NAS_Y );
X2 := NAttValue( M2^.NA , NAG_Location , NAS_X );
Y2 := NAttValue( M2^.NA , NAG_Location , NAS_Y );
CalcObscurement := CalcObscurement( X1 , Y1 , MekAltitude(gb,M1) , X2 , Y2 , MekAltitude(gb,M2) , gb );
end else begin
CalcObscurement := -1;
end;
end;
Function CheckArc( OX , OY , TX , TY , A: Integer ): Boolean;
{ Examine target point TX,TY as it relates to origin point OX,OY. }
{ Return TRUE if it falls within arc A, FALSE otherwise. }
var
DX,DY: Integer;
it: Boolean;
begin
{ Find relative coordinates of the target square. }
DX := TX - OX;
DY := TY - OY;
{ *** ARC CHART *** }
{ \ 5 | 6 / }
{ \ | / }
{ 4 \ | / 7 }
{ \|/ }
{ -----@----- }
{ /|\ 0 }
{ 3 / | \ }
{ / | \ }
{ / 2 | 1 \ }
it := False;
if A = 0 then begin
{ DX >= 0 }
{ 0 <= DY <= Abs(DX) }
if ( DX >= 0 ) and ( 0 <= DY ) and ( DY <= DX ) then it := true;
end else if A = 1 then begin
{ DY >= 0 }
{ 0 <= DX <= Abs(DY) }
if ( DY >= 0 ) and ( 0 <= DX ) and ( DX <= DY ) then it := true;
end else if A = 2 then begin
{ DY >= 0 }
{ 0 >= DX >= -Abs(DY) }
if ( DY >= 0 ) and ( 0 >= DX ) and ( DX >= -Abs(DY) ) then it := true;
end else if A = 3 then begin
{ DX <= 0 }
{ 0 <= DY <= Abs(DX) }
if ( DX <= 0 ) and ( 0 <= DY ) and ( DY <= Abs(DX) ) then it := true;
end else if A = 4 then begin
{ DX <= 0 }
{ 0 >= DY >= -Abs(DX) }
if ( DX <= 0 ) and ( 0 >= DY ) and ( DY >= DX ) then it := true;
end else if A = 5 then begin
{ DY <= 0 }
{ 0 >= DX >= -Abs(DY) }
if ( DY <= 0 ) and ( 0 >= DX ) and ( DX >= DY ) then it := true;
end else if A = 6 then begin
{ DY <= 0 }
{ 0 <= DX <= Abs(DY) }
if ( DY <= 0 ) and ( 0 <= DX ) and ( DX <= Abs(DY) ) then it := true;
end else if A = 7 then begin
{ DX >= 0 }
{ 0 >= DY >= -Abs(DX) }
if ( DX >= 0 ) and ( 0 >= DY ) and ( DY >= -DX ) then it := true;
end;
CheckArc := it;
end;
Function CheckArc( M1: GearPtr; X2,Y2,A: Integer ): Boolean;
{ See comments above. This function just calls the above one. }
{ Checks arc A to see if point X2,Y2 falls inside it. }
var
X1,Y1: Integer;
begin
X1 := NAttValue( M1^.NA , NAG_Location , NAS_X );
Y1 := NAttValue( M1^.NA , NAG_Location , NAS_Y );
CheckArc := CheckArc( X1 , Y1 , X2 , Y2 , A );
end;
Function CheckArc( M1,M2: GearPtr; A: Integer ): Boolean;
{ See comments above. This function just calls the above one. }
{ Checks arc A to see if point X2,Y2 falls inside it. }
var
X2,Y2,X1,Y1: Integer;
begin
X1 := NAttValue( M1^.NA , NAG_Location , NAS_X );
Y1 := NAttValue( M1^.NA , NAG_Location , NAS_Y );
X2 := NAttValue( M2^.NA , NAG_Location , NAS_X );
Y2 := NAttValue( M2^.NA , NAG_Location , NAS_Y );
CheckArc := CheckArc( X1 , Y1 , X2 , Y2 , A );
end;
Function Range( X1 , Y1 , X2 , Y2: Integer ): Integer;
{Calculate the range between X1,Y1 and X2,Y2.}
begin
{Pythagorean theorem.}
Range := Round(Sqrt(Sqr(X2 - X1) + Sqr(Y2 - Y1)));
end;
Function Range( M1: GearPtr; X2,Y2: Integer ): Integer;
{ Calculate the distance between M1 and M2. }
var
X1,Y1: Integer;
begin
X1 := NAttValue( M1^.NA , NAG_Location , NAS_X );
Y1 := NAttValue( M1^.NA , NAG_Location , NAS_Y );
Range := Range( X1 , Y1 , X2 , Y2 );
end;
Function Range( gb: GameBoardPtr; M1 , M2: GearPtr ): Integer;
{ Calculate the distance between M1 and M2. }
var
X1,Y1,Z1,X2,Y2,Z2: Integer;
begin
X1 := NAttValue( M1^.NA , NAG_Location , NAS_X );
Y1 := NAttValue( M1^.NA , NAG_Location , NAS_Y );
Z1 := MekAltitude( gb , M1 );
X2 := NAttValue( M2^.NA , NAG_Location , NAS_X );
Y2 := NAttValue( M2^.NA , NAG_Location , NAS_Y );
Z2 := MekAltitude( gb , M2 );
Range := Round( Sqrt(Sqr(X2 - X1) + Sqr(Y2 - Y1) + Sqr(Z2 - Z1)) );
end;
function WeaponRange( GB: GameBoardPtr; Weapon: GearPtr ): Integer;
{ Calculate the maximum effective range of this weapon, }
{ adjusting the value for map scale. }
{ If GB=Nil, return the unscaled value. }
var
rng,t: Integer;
WAO: GearPtr;
begin
if Weapon = Nil then begin
rng := 0;
end else if Weapon^.G = GG_Weapon then begin
if ( Weapon^.S = GS_Ballistic ) or ( Weapon^.S = GS_BeamGun ) or ( Weapon^.S = GS_Missile ) then begin
rng := Weapon^.Stat[ STAT_Range ];
WAO := Weapon^.InvCom;
while WAO <> Nil do begin
if ( WAO^.G = GG_WeaponAddOn ) and NotDestroyed( WAO ) then begin
rng := rng + WAO^.Stat[ STAT_Range ]
end;
WAO := WAO^.Next;
end;
if HasAttackAttribute( WeaponAttackAttributes( Weapon ) , AA_LineAttack ) then begin
rng := rng * 2;
end else begin
rng := rng * 3;
end;
end else begin
rng := 1;
if HasAttackAttribute( WeaponAttackAttributes( Weapon ) , AA_Extended ) then begin
rng := 2;
end;
end;
end else rng := 1;
if ( GB <> Nil ) and ( rng > 1 ) and ( Weapon^.Scale <> GB^.Scale ) then begin
if Weapon^.Scale > GB^.Scale then begin
for t := 1 to ( Weapon^.Scale - GB^.Scale ) do rng := rng * 2;
end else begin
{ The weapon scale must be smaller then the }
{ game board scale. }
for t := 1 to ( GB^.Scale - Weapon^.Scale ) do rng := rng div 2;
if rng < 1 then rng := 1;
end;
end;
WeaponRange := rng;
end;
function ThrowingRange( GB: GameBoardPtr; User,Weapon: GearPtr ): Integer;
{ Calculate the maximum thrown range of this weapon, }
{ adjusting the value for map scale. }
{ If GB=Nil, return the unscaled value. }
var
rng,t: Integer;
begin
rng := 0;
if ( Weapon <> Nil ) and ( Weapon^.G = GG_Weapon ) then begin
if HasAttackAttribute( WeaponATtackAttributes( Weapon ) , AA_THrown ) then begin
rng := MasterSize( User ) + 2;
end;
end else if ( Weapon <> Nil ) and ( Weapon^.G = GG_Ammo ) and ( Weapon^.S = GS_Grenade ) then begin
rng := MasterSize( User ) * 2 + 1;
end;
if ( Weapon <> Nil ) and ( GB <> Nil ) and ( rng > 1 ) and ( Weapon^.Scale <> GB^.Scale ) then begin
if Weapon^.Scale > GB^.Scale then begin
for t := 1 to ( Weapon^.Scale - GB^.Scale ) do rng := rng * 2;
end else begin
{ The weapon scale must be smaller then the }
{ game board scale. }
for t := 1 to ( GB^.Scale - Weapon^.Scale ) do rng := rng div 2;
if rng < 1 then rng := 1;
end;
end;
ThrowingRange := rng;
end;
Function GearDestination( Mek: GearPtr ): Point;
{ Determine MEK's destination, given its current position }
{ and movement action. }
var
P: Point;
Action , D: Integer;
begin
P := GearCurrentLocation( Mek );
Action := NAttValue( Mek^.NA , NAG_Action , NAS_MoveAction );
D := NAttValue( Mek^.NA , NAG_Location , NAS_D );
if ( Action = NAV_NormSpeed ) or ( Action = NAV_FullSpeed ) then begin
P.X := P.X + AngDir[D,1];
P.Y := P.Y + AngDir[D,2];
end else if Action = NAV_Reverse then begin
P.X := P.X - AngDir[D,1];
P.Y := P.Y - AngDir[D,2];
end;
GearDestination := P;
end;
Function IsObstacle( GB: GameBoardPtr; Mek: GearPtr; Terrain: Integer ): Boolean;
{ Check the terrain type in question, and return TRUE if the mek }
{ can move through it or FALSE if it cannot. }
var
MekAlt,MM: Integer;
it: Boolean;
begin
{ Primary Criterion - if terrain is defined as an obstacle, and }
{ is of the same or lower elevation as the master gear under }
{ consideration, it's an obstacle. }
MekAlt := MekAltitude( GB , Mek );
if TerrMan[ Terrain ].Pass <= -100 then begin
it := TerrMan[ Terrain ].Altitude >= MekALt;
end else begin
{ If the terrain isn't an obstacle, but is two elevations }
{ too tall, then it counts as an obstacle. }
it := TerrMan[ Terrain ].Altitude > ( MekALt + 1 );
end;
{ Check the movement mode of the mek, to make sure that the }
{ terrain being entered is legal for the given mode. }
{ CAUTION: The mek might not have geared up yet, so its }
{ movement mode might be illegal. }
MM := NAttValue( Mek^.NA , NAG_Action , NAS_MoveMode );
if ( MM >= 1 ) and ( MM <= NumMoveMode ) then begin
it := it or not TerrMan[ Terrain ].MMPass[ MM ];
{ Don't put items in water. }
end else if not IsMasterGear( Mek ) then begin
if TerrMan[ Terrain ].Altitude < 0 then it := True;
end;
{ Character type gears using the WALK move mode can't move }
{ through water. Mecha which are smaller than the map size }
{ can't walk through water either. }
{ This is a special case, and as such I don't like it. However, }
{ I have no better ideas as to how to deal with the issue. }
if ( ( Mek^.G = GG_Character ) or ( Mek^.Scale < GB^.Scale ) ) and ( NAttValue( Mek^.NA , NAG_Action , NAS_MoveMode ) = MM_Walk ) then begin
if TerrMan[ Terrain ].Altitude < 0 then it := True;
end;
IsObstacle := it;
end;
Function IsBlocked( Mek: GearPtr; GB: GameBoardPtr; X,Y: Integer ): Boolean;
{ Return TRUE if tile X,Y is unsuitable for MEK to enter, FALSE }
{ if it isn't. }
var
P: Point;
Special: String;
it: Boolean;
M: GearPtr;
begin
P := GearCurrentLocation( Mek );
{ Locate the SPECIAL string for this scene, if one exists. }
if GB^.Scene <> Nil then begin
Special := UpCase( SAttValue( GB^.Scene^.SA , 'SPECIAL' ) );
end else begin
Special := '';
end;
if not OnTheMap( X , Y ) then begin
{ If the specified location is not on the map, }
{ the move probably isn't blocked. }
{ Check the SPECIAL string to find out. }
it := Pos( SA_MapEdgeObstacle , Special ) > 0;
end else if ( P.X = X ) and ( P.Y = Y ) then begin
it := False;
end else if IsObstacle( GB , Mek , GB^.Map[X,Y].terr ) then begin
it := True;
end else begin
if IsMasterGear( Mek ) and ( Mek^.Scale >= GB^.Scale ) then begin
M := FindBlockerXYZ( GB , X , Y , MekAltitude( GB , Mek ) );
if ( M <> Nil ) and ( M^.Scale >= GB^.Scale ) and GearOperational( M ) then begin
it := True;
end else begin
it := False;
end;
end else begin
{ If this gear is at a smaller scale than the map, }
{ it can stack without penalty. IsBlocked = False. }
it := False;
end;
end;
IsBlocked := it;
end;
Function FrontBlocked( Mek: GearPtr; GB: GameBoardPtr; D: Integer ): Boolean;
{ Return TRUE if the mek would be blocked if traveling in direction D, }
{ FALSE if it wouldn't be. }
var
P: Point;
begin
{ Determine the destination square. }
P := GearCurrentLocation( Mek );
P.X := P.X + AngDir[ D , 1 ];
P.Y := P.Y + AngDir[ D , 2 ];
FrontBlocked := IsBlocked( Mek , GB , P.X , P.Y );
end;
Function MoveBlocked( Mek: GearPtr; GB: GameBoardPtr ): Boolean;
{ Check Mek's current movemode and action. Return TRUE if Mek }
{ can complete this move, FALSE otherwise. }
var
P: Point; { Destination point. }
begin
{ Determine the destination square. }
P := GearDestination( Mek );
MoveBlocked := IsBlocked( Mek , GB , P.X , P.Y );
end;
Function CalcTerrainMod( Mek: GearPtr; GB: GameBoardPtr ): Integer;
{ Calculate the terrain modifier for the terrain the model is facing. }
var
P1,P2: Point;
Terrain: Integer;
TerrMod,MM: Integer;
MTerr: GearPtr;
begin
P1 := GearCurrentLocation( Mek );
P2 := GearDestination( Mek );
TerrMod := 0;
if OnTheMap( P2.X , P2.Y ) then begin
{ Modify the movement rate by the terrain mod of the destination hex. }
Terrain := GB^.Map[P2.X,P2.Y].terr;
TerrMod := TerrMan[ Terrain ].Pass;
{ Modify for meta-terrain. }
MTerr := GB^.Meks;
while MTerr <> Nil do begin
if ( MTerr^.G = GG_MetaTerrain ) and ( NAttValue( MTerr^.NA , NAG_Location , NAS_X ) = P2.X ) and ( NAttValue( MTerr^.NA , NAG_Location , NAS_X ) = P2.Y ) then begin
TerrMod := TerrMod + MTerr^.Stat[ STAT_Pass ];
end;
MTerr := MTerr^.Next;
end;
if IsObstacle( GB , Mek , Terrain ) then begin
{ It takes a normal movement action to bump into }
{ an obstacle. }
TerrMod := -50;
end else begin
MM := NAttValue( Mek^.NA , NAG_Action , NAS_MoveMode );
{ Adjust for elevation change. }
if TerrMan[ Terrain ].Altitude < TerrMan[ GB^.map[P1.X,P1.Y].terr ].Altitude then begin
TerrMod := TerrMod - 5;
end else if TerrMan[ Terrain ].Altitude > TerrMan[ GB^.map[ P1.X , P1.Y ].terr ].Altitude then begin
TerrMod := TerrMod + 25 * ( TerrMan[ Terrain ].Altitude - TerrMan[ GB^.Map[ P1.X , P1.Y ].terr ].Altitude );
end;
{ Adjust for move mode characteristics. }
if MM = MM_Roll then begin
{ Ground vehicles suffer 4x the movement penalty of other types. }
TerrMod := TerrMod * 4;
end else if MM = MM_Skim then begin
{ Hovering units can skim right over low obstacles. So, if the }
{ terrain in question doesn't cause obscurement, it doesn't slow }
{ down a hovering mecha either. }
if ( TerrMan[ Terrain ].Obscurement = 0 ) or ( TerrMan[Terrain].Altitude < 0 ) then TerrMod := 0;
end else if MM = MM_Fly then begin
TerrMod := 0;
end;
end;
{ Make sure the terrain modifier doesn't drop below a certain standard. }
if TerrMod < -50 then TerrMod := -50;
end else begin
{ Attempting to move off the map }
{ takes 3x as long as normal movement. }
TerrMod := 200;
end;
CalcTerrainMod := TerrMod;
end;
Function CalcMoveTime( Mek: GearPtr; GB: GameBoardPtr ): Integer;
{ This procedure calls the movement.pp speed calculator, }
{ then adjusts the value obtained for terrain and elevation. }
{ As with the movement.pp functions, CalcMoveTime returns }
{ zero if the mecha isn't capable of moving. }
const
MinMoveTime = 3;
var
it: Integer;
Action: Integer;
Terrain,TerrMod, MM, D: Integer;
MTerr: GearPtr;
begin
it := CPHMoveRate( Mek , GB^.Scale );
Action := NAttValue( Mek^.NA , NAG_Action , NAS_MoveAction );
TerrMod := 0;
{ Find the direction of travel, and also the }
{ destination square. }
D := NAttValue( Mek^.NA , NAG_Location , NAS_D );
{ Adjust for terrain if the mecha is walking or running. }
if ( Action = NAV_NormSpeed ) or ( Action = NAV_FullSpeed ) or ( Action = NAV_Reverse ) then begin
{ Modify the movement rate by the terrain mod of the destination hex. }
TerrMod := CalcTerrainMod( Mek , GB );
it := ( it * ( 100 + TerrMod ) ) div 100;
{ Adjust for diagnol movement. }
if (D mod 2) = 1 then it := (it * 141) div 100;
end;
if it < MinMoveTime then it := MinMoveTime;
CalcMoveTime := it;
end;
Function CalcRelativeSpeed( Mek: GearPtr; GB: GameBoardPtr ): Integer;
{ Calculate the relative speed of this mecha. }
{ This is used for calculating hit rolls and maybe some other things. }
{ This speed is modified for terrain but not for map scale. It is measured }
{ in decihexes per round. }
var
MoveMode,Action,Spd: Integer;
begin
MoveMode := NAttValue( Mek^.NA , NAG_Action , NAS_MoveMode );
Action := NAttValue( Mek^.NA , NAG_Action , NAS_MoveAction );
{ If the mecha's action is to stand still, it will have a relative speed of 0. }
if ( Action = NAV_Hover ) or ( Action = NAV_Stop ) then begin
Spd := 0;
end else begin
Spd := AdjustedMoveRate( Mek , MoveMode , Action );
if Spd > 0 then begin
{ If using full speed, normal speed, or reverse, modify the }
{ speed for terrain. }
if ( Action = NAV_NormSpeed ) or ( Action = NAV_FullSpeed ) or ( Action = NAV_Reverse ) then begin
Spd := ( Spd * 100 ) div ( 100 + CalcTerrainMod( Mek , GB ) );
end;
end;
end;
CalcRelativeSpeed := Spd;
end;
Function IsInCover( GB: GameBoardPtr; Master: GearPtr ): Boolean;
{ Return TRUE if MASTER is in cover, FALSE otherwise. }
var
X,Y,Z: Integer;
begin
if Shadow_Map_Update < GB^.ComTime then UpdateShadowMap( GB );
if Master <> Nil then begin
{ Movement information is stored at root level. }
if Master^.Parent <> Nil then Master := FindRoot( Master );
X := NAttValue( Master^.NA , NAG_Location , NAS_X );
Y := NAttValue( Master^.NA , NAG_Location , NAS_Y );
Z := MekAltitude( GB , Master );
if Z < 0 then begin
{ Meks underwater are automatically in cover. }
IsInCover := True;
end else if TerrMan[GB^.Map[X,Y].terr].Altitude < Z then begin
{ Meks flying above the terrain are automatically not in cover. }
IsInCover := False;
end else begin
{ Meks standing in the terrain may or may not be in cover. }
{ It depends on whether or not the terrain they're standing in }
{ provides obscurement. }
IsInCover := ( TerrMan[GB^.Map[X,Y].terr].Obscurement > 0 ) or ( Shadow_Map[ X , Y , Z ] > 0 );
end;
end else IsInCover := False;
end;
Function CheckLOS( GB: GameBoardPtr; Observer,Target: GearPtr ): Boolean;
{ Do the line-of-sight roll to see if Observer notices Target. }
var
O,T,Roll: Integer;
it: Boolean;
begin
{ Calculate the obscurement. }
O := CalcObscurement( Observer , Target , gb );
{ If there's nothing standing between the target and the spotter, }
{ visibility is guaranteed. }
if O = 0 then begin
it := True;
end else begin
{ Calculate target number. }
T := MechaStealthRating( Target );
if Target^.Scale > GB^.Scale then begin
T := T - ( Target^.Scale - GB^.Scale ) * Stealth_Per_Scale;
end else if Target^.Scale < GB^.Scale then begin
T := T + ( GB^.Scale - Target^.Scale ) * Stealth_Per_Scale;
end;
Roll := RollStep( SkillValue( Observer , 11 ) ) - O;
if ( O <> -1 ) and ( ( O = 0 ) or ( Roll > T ) ) then begin
{ The target might get a STEALTH save now. }
if IsInCover( GB , Target ) and ( NAttValue( Target^.NA , NAG_Action , NAS_MoveAction ) <> NAV_FullSpeed ) and HasSkill( Target , 25 ) then begin
if RollStep( SkillValue( Target , 25 ) + 5 ) > Roll then begin
it := False;
end else it := True;
end else begin
it := True;
end;
end else it := False;
end;
CheckLOS := it;
end;
Function NumActiveMasters( GB: GameBoardPtr; Team: Integer ): Integer;
{ Count up the number of members of this team who are operational }
{ and on the map. }
var
mek: GearPtr;
mem,T: Integer;
begin
mek := GB^.Meks;
mem := 0;
{ Loop through all the meks on the board. }
while mek <> nil do begin
if GearActive( Mek ) and OnTheMap( Mek ) then begin
T := NAttValue( mek^.NA , NAG_Location , NAS_Team );
if T = Team then Inc( mem );
end;
mek := mek^.next;
end;
NumActiveMasters := Mem;
end;
Function NumOperationalMasters( GB: GameBoardPtr; Team: Integer ): Integer;
{ Count up the number of members of this team who are operational }
{ and on the map. }
var
mek: GearPtr;
mem,T: Integer;
begin
mek := GB^.Meks;
mem := 0;
{ Loop through all the meks on the board. }
while mek <> nil do begin
if GearOperational( Mek ) and OnTheMap( Mek ) then begin
T := NAttValue( mek^.NA , NAG_Location , NAS_Team );
if T = Team then Inc( mem );
end;
mek := mek^.next;
end;
NumOperationalMasters := Mem;
end;
Procedure SetTrigger( GB: GameBoardPtr; const msg: String );
{ Store the trigger. }
begin
{ Only store it if collection has been set to TRUE. }
if LOCALE_CollectTriggers then begin
StoreSAtt( GB^.Trig , msg );
end;
end;
Function SeekTarget( GB: GameBoardPtr; Mek: GearPtr ): GearPtr;
{ Try to find the best target for Mek to fire at. }
var
TTemp,TBest: GearPtr;
BestScore,Score: Integer;
begin
TTemp := GB^.Meks;
TBest := Nil;
BestScore := 9999;
while TTemp <> Nil do begin
{ If this mek is an enemy of the spotter, and is visible, }
{ and is still functional, }
{ then it's a candidate to be the target picked. }
if AreEnemies( GB , Mek , TTemp ) and MekCanSeeTarget( GB , Mek , TTemp ) and GearOperational( TTemp ) then begin
{ Calculate this mek's vunerability score. }
Score := Range( GB , Mek , TTemp ) + CalcObscurement( Mek , TTemp , GB );
{ If not in the front arc, impose penalty. }
if not CheckArc( Mek , TTemp , ARC_F180 ) then Score := Score + 15
else if not CheckArc( Mek , TTemp , ARC_F90 ) then Score := Score + 5;
if ( Score < BestScore ) or ( TBest = Nil ) then begin
BestScore := Score;
TBest := TTemp;
end;
end;
TTemp := TTemp^.Next;
end;
SeekTarget := TBest;
end;
Procedure FreezeLocation( const Name: String; GB: GameBoardPtr; var FList: FrozenLocationPtr );
{ Store the provided location in FList for later use. }
var
it: FrozenLocationPtr;
begin
{ Error check - make sure that there's no level currently in the }
{ list with this name. }
it := FindFrozenLocation( Name , FList );
if it <> Nil then RemoveFrozenLocation( FList , it );
{ Create a new level, and store the stuff. }
it := CreateFrozenLocation( FList );
it^.Name := Name;
it^.Map := GB^.Map;
end;
Function UnfreezeLocation( const Name: String; var FList: FrozenLocationPtr ): GameBoardPtr;
{ Attempt to unfreeze the specified level. If the level was found, }
{ return TRUE. If the unfreezing failed, return FALSE. }
{ Once the level is unfrozen the frozen record should be removed. }
var
it: FrozenLocationPtr;
gb: GameBoardPtr;
begin
it := FindFrozenLocation( Name , FList );
if it = Nil then begin
{ This map wasn't found in the list, so return NIL. }
UnfreezeLocation := Nil;
end else begin
{ We have the map level. Copy the map into a new }
{ gameboard structure, then pass that back. }
gb := NewMap;
gb^.Map := it^.Map;
RemoveFrozenLocation( FList , it );
UnfreezeLocation := GB;
end;
end;
function FindThisTerrain( GB: GameBoardPtr; TTS: Integer ): Point;
{ Attempt to find the terrain in question. }
{ If the terrain can't be found, return point 0,0. }
var
P: Point;
X,Y: Integer;
begin
P.X := 0;
P.Y := 0;
for X := 1 to XMax do begin
for Y := 1 to YMax do begin
if GB^.Map[X,Y].terr = TTS then begin
P.X := X;
P.Y := Y;
end;
end;
end;
FindThisTerrain := P;
end;
Function NewTeamID( Scene: GearPtr ): LongInt;
{ Create a new unique team ID. Do this by seeking out the currently highest }
{ team ID in use, then going one higher. }
var
it: LongInt;
T: GearPtr;
begin
{ Check the models on the map... }
it := MaxIDTag( Scene^.InvCom , NAG_Location , NAS_Team );
{ Check the team definitions themselves... }
T := Scene^.SubCOm;
while T <> Nil do begin
if ( T^.G = GG_Team ) and ( T^.S > it ) then it := T^.S;
T := T^.Next;
end;
NewTeamID := it + 1;
end;
Procedure SetTeamReputation( GB: GameBoardPtr; T,R,V: Integer );
{ Set a reputation for each member of team T. }
var
Part: GearPtr;
begin
Part := GB^.Meks;
while Part <> Nil do begin
if ( NAttValue( Part^.NA , NAG_Location , NAS_Team ) = T ) and IsMasterGear( Part ) then begin
AddReputation( Part , R , V );
end;
Part := Part^.Next;
end;
end;
Procedure DeclarationOfHostilities( GB: GameBoardPtr; ATeam,DTeam: Integer );
{ Attacker Team has just attacked Defender Team. Update all the }
{ team gears in GB/Scene as a result. }
var
Team: GearPtr;
begin
{ Error check - better not be talking about the NoTeam team... }
if ( Ateam = 0 ) or ( DTeam = 0 ) or ( ATeam = DTeam ) then Exit;
{ If the Attacking team hasn't started as the enemy of the other team, set reputation to Chaotic. }
{ If the Defending team isn't out to get the attacking team, set reputation to Villainous. }
if ( ATeam > 0 ) and ( DTeam > 0 ) and not AreEnemies( GB , ATeam , DTeam ) then begin
SetTeamReputation( GB , ATeam , 2 , -5 );
if not AreEnemies( GB , DTeam , ATeam ) then begin
SetTeamReputation( GB , ATeam , 1 , -25 );
if ATeam = NAV_DefPlayerTeam then SetTrigger( GB, 'PLAYERVILLAIN' );
end;
end;
if ( GB <> Nil ) and ( GB^.Scene <> Nil ) then begin
{ Go through all the teams in the SCENE record. }
Team := GB^.Scene^.SubCom;
while Team <> Nil do begin
{ If this is a team, we might need to update }
{ its alleigances. }
if Team^.G = GG_Team then begin
if Team^.S = ATeam then begin
SetNAtt( Team^.NA , NAG_SideReaction , DTeam , NAV_AreEnemies );
end else if Team^.S = DTEam then begin
SetNAtt( Team^.NA , NAG_SideReaction , ATeam , NAV_AreEnemies );
end else begin
if AreAllies( GB , Team^.S , DTeam ) then SetNAtt( Team^.NA , NAG_SideReaction , ATeam , NAV_AreEnemies );
end;
end;
Team := Team^.Next;
end;
end;
end;
Function BoardMecha( Mek,Pilot: GearPtr ): Boolean;
{ Attempt to load PILOT into MEK. Return TRUE if this could }
{ be done, or FALSE if it couldn't. }
var
CP: GearPtr;
begin
if ( Mek = Nil ) or ( Pilot = Nil ) then begin
{ If either mecha or pilot are undefined, this }
{ attempt will of course fail. }
BoardMecha := False;
end else begin
{ Attempt to find the cockpit. }
CP := SeekGear(mek,GG_CockPit,0);
if CP <> Nil then begin
{ Cockpit has been located. Insert pilot. }
if IsLegalSubcom( CP , Pilot ) then begin
InsertSubCom( CP , Pilot );
BoardMecha := True;
end else begin
{ For whatever reason, the pilot can't be inserted into }
{ the cockpit. }
BoardMecha := False;
end;
end else begin
{ Cockpit has not been located. This attempt has failed. }
BoardMecha := False;
end;
end;
end;
Function ExtractPilot( Mek: GearPtr ): GearPtr;
{ Remove the pilot from the specified mek. If no pilot is found, }
{ return Nil. }
var
Pilot: GearPtr;
begin
if ( Mek = Nil ) or ( Mek^.G = GG_Character ) then begin
{ Can't extract a pilot from a character or an undefined gear. }
ExtractPilot := Nil;
end else begin
Pilot := SeekGearByG( Mek^.SubCom , GG_Character );
if Pilot <> Nil then begin
DelinkGear( Pilot^.Parent^.SubCom , Pilot );
end;
ExtractPilot := Pilot;
end;
end;
Function FindPilotsMecha( LList,PC: GearPtr ): GearPtr;
{ Attempt to find the mecha belonging to PC from the list. }
{ If no such mecha may be found, return Nil. }
var
mek,pmek: GearPtr;
name: String;
begin
{ Begin by finding the PC's name. }
name := PilotName( PC );
{ Stupid error check - A truly nameless PC might cause an }
{ endless loop. }
if name = '' then Exit( Nil );
{ Search through the list looking for a mecha which }
{ has been assigned to this pilot. }
mek := LList;
pmek := Nil;
while ( mek <> Nil ) and ( pmek = Nil ) do begin
if mek^.G = GG_Mecha then begin
if SAttValue( mek^.SA , 'pilot' ) = name then PMek := Mek;
end;
mek := mek^.Next;
end;
FindPilotsMecha := pmek;
end;
Procedure AssociatePilotMek( LList , Pilot , Mek: GearPtr );
{ From this point on, MEK is PILOT's mecha. }
{ Set MEK's pilot attribute and make sure there are no }
{ duplications on the go. }
var
dup: GearPtr; { Duplication checker. }
begin
{ If the pilot already has a mek assigned, negate that association. }
repeat
dup := FindPilotsMecha( LList , Pilot );
if dup <> Nil then SetSAtt( dup^.SA , 'pilot <>' );
until dup = Nil;
{ If the mek already has a different pilot, so what. It has a }
{ new one now. Just set the new pilot attribute. }
SetSAtt( Mek^.SA , 'pilot <'+PilotName(Pilot)+'>' );
end;
Function FindGearScene( Part: GearPtr; GB: GameBoardPtr ): Integer;
{ Find the scene number of this gear. Return 0 if no scene }
{ can be found which contains it. }
var
it: Integer;
P2: GearPtr;
begin
it := 0;
if Part = Nil then begin
it := 0;
end else begin
{ Move upwards through the tree until either we }
{ find a scene gear or root level. }
while ( Part^.Parent <> Nil ) and ( Part^.G <> GG_Scene ) do begin
Part := Part^.Parent;
end;
if Part^.G = GG_Scene then begin
{ We found the scene, record the ID. }
it := Part^.S;
end else if ( GB <> Nil ) and ( GB^.Scene <> Nil ) then begin
{ We didn't find a scene, see if the gear }
{ is on the gameboard. }
P2 := GB^.Meks;
it := 0;
while P2 <> Nil do begin
if P2 = Part then it := GB^.Scene^.S;
P2 := P2^.Next;
end;
end;
end;
FindGearScene := it;
end;
Function FindActualScene( GB: GameBoardPtr; SID: Integer ): GearPtr;
{ Find the ACTUAL scene with the specified ID, as opposed to any }
{ temporary scenes which may have the same value. }
var
Part,Scene: GearPtr;
begin
Scene := Nil;
if ( GB <> Nil ) and ( GB^.Scene <> Nil ) then begin
Part := FindRoot( GB^.Scene )^.SubCom;
while ( Part <> Nil ) do begin
if ( Part^.G = GG_Scene ) and ( Part^.S = SID ) then Scene := Part;
Part := Part^.Next;
end;
end;
FindActualScene := Scene;
end;
Procedure NextPoint(var P: Point);
{We're stepping through the map. Increment the tile}
{by one. If the edge of the map is reached, start on}
{the other side.}
begin
Inc(p.x);
if p.x > XMax then begin
Inc(p.y);
p.x := 1;
end;
end;
Procedure WriteMap(Map: Location; var F: Text);
{Write all of the important info in MAP to the file F.}
{ This procedure is taken more or less verbatim from DeadCold. }
var
P: Point;
T,C: Longint;
Vis: Boolean;
begin
{First, a descriptive message.}
writeln(F,'*** GearHead Location Record ***');
{ For expansion purposes include XMax and YMax in the map description. }
writeln( F , XMax );
writeln( F , YMax );
{Output the terrain of the map, compressed using}
{run length encoding.}
T := Map[1,1].terr;
C := 0;
P.X := 1;
P.Y := 1;
while P.Y <= YMax do begin
if Map[P.X,P.Y].terr = t then begin
Inc(C);
end else begin
writeln(F,C);
writeln(F,T);
T := Map[P.X,P.Y].terr;
C := 1;
end;
NextPoint(P);
end;
{Output the last terrain stretch}
writeln(F,C);
writeln(F,T);
writeln(F,'***');
{Output the Visibility of the map, again using run}
{length encoding. Since there are only two possible}
{values, just flop between them.}
Vis := False;
C := 0;
P.X := 1;
P.Y := 1;
while P.Y <= YMax do begin
if map[P.X,P.Y].visible = Vis then begin
Inc(C);
end else begin
writeln(F,C);
Vis := not Vis;
C := 1;
end;
NextPoint(P);
end;
{Output the last terrain stretch}
writeln(F,C);
end;
Function ReadMap(var F: Text): Location;
{We're reading the gameboard from disk.}
{ This procedure is taken more or less verbatim from DeadCold. }
var
Map: Location;
P: Point;
C,T,X: Longint;
A: String;
Vis: Boolean;
begin
{First, get rid of the descriptive message & the dimensions.}
readln(F,A);
readln(F,A);
readln(F,A);
P.X := 1;
P.Y := 1;
while P.Y <= YMax do begin
readln(F,C); {Read Count}
readln(F,T); {Read Terrain}
{Fill the map with this terrain up to Count.}
for X := 1 to C do begin
map[P.X,P.Y].terr := t;
NextPoint(P);
end;
end;
{Read the second descriptive label.}
readln(F,A);
{Read the visibility data.}
Vis := False;
P.X := 1;
P.Y := 1;
while P.Y <= YMax do begin
readln(F,C); {Read Count}
{Fill the map with this terrain up to Count.}
for X := 1 to C do begin
Map[P.X,P.Y].visible := Vis;
NextPoint(P);
end;
Vis := not Vis;
end;
ReadMap := Map;
end;
Function FindSpotNearGate( GB: GameBoardPtr; Mek: GearPtr; GNum: Integer ): Point;
{ First, find the gate whose number we have been given. }
{ Second, find an empty spot adjacent to the gate. }
function FindGateAlongPath( Part: GearPtr ): GearPtr;
{ This is a nice simple non-recursive list search, }
{ since the gate should be at root level. }
var
TheGate: GearPtr;
begin
TheGate := Nil;
while ( Part <> Nil ) and ( TheGate = Nil ) do begin
if ( Part^.G = GG_MetaTerrain ) and ( Part^.Stat[ STAT_Destination ] = GNum ) then begin
TheGate := Part;
end;
Part := Part^.Next;
end;
FindGateAlongPath := TheGate;
end;
var
Gate: GearPtr;
P: Point;
D,T: Integer;
begin
{ Search for an appropriate gate. Note that such a gate might not }
{ be found, and if it can be found it might not be deployed yet. }
Gate := FindGateAlongPath( GB^.Meks );
if ( Gate = Nil ) and ( GB^.Scene <> Nil ) then Gate := FindGateAlongPath( GB^.Scene^.InvCom );
if Gate <> Nil then begin
{ The gate should have a location defined, since the }
{ random map generator does that. }
P.X := NAttValue( Gate^.NA , NAG_Location , NAS_X );
P.Y := NAttValue( Gate^.NA , NAG_Location , NAS_Y );
{ Attempt to find an adjacent, nonblocked spot. }
if Gate^.Stat[ STAT_Pass ] <= -100 then begin
D := Random( 8 );
T := 8;
while IsBlocked( Mek , GB , P.X + AngDir[ D , 1 ] , P.Y + AngDir[ D , 2 ] ) and ( T > 0 ) do begin
D := ( D + 1 ) mod 8;
Dec( T );
end;
if ( T > 0 ) and OnTheMap( P.X + AngDir[ D , 1 ] , P.Y + AngDir[ D , 2 ] ) then begin
P.X := P.X + AngDir[ D , 1 ];
P.Y := P.Y + AngDir[ D , 2 ];
end;
end;
end else begin
{ No gate was found. Return a point not on the map. }
P.X := 0;
P.Y := 0;
end;
FindSpotNearGate := P;
end;
Function FindSpotNearSpot( GB: GameBoardPtr; Mek: GearPtr; X,Y: Integer ): Point;
{ Find an empty spot adjacent to the point given. }
var
P: Point;
T: Integer;
begin
T := 0;
repeat
if T > 100 then begin
P.X := X + Random( 7 ) - Random( 7 );
P.Y := Y + Random( 7 ) - Random( 7 );
end else if T > 50 then begin
P.X := X + Random( 4 ) - Random( 4 );
P.Y := Y + Random( 4 ) - Random( 4 );
end else begin
P.X := X + Random( 3 ) - Random( 3 );
P.Y := Y + Random( 3 ) - Random( 3 );
end;
inc( T );
until ( T > 200 ) or not IsBlocked( Mek , GB , P.X , P.Y );
FindSpotNearSpot := P;
end;
Function FindDeploymentSpot( GB: GameBoardPtr; Mek: GearPtr ): Point;
{ Determine a good starting point for this model. }
{ A good starting point is one which falls within the model's team's }
{ deployment zone and which is not blocked to travel by the model. }
Function IsNotThreshold( X,Y: Integer ): Boolean;
{ Return TRUE if the listed tile is a threshold, or FALSE otherwise. }
begin
if OnTheMap( X , Y ) then begin
IsNotThreshold := GB^.Map[ X , Y ].Terr <> TERRAIN_Threshold;
end else IsNotThreshold := True;
end;
Function IsGoodSpot( X,Y: Integer ): Boolean;
{ Return TRUE if this is a good spot for MEK, or }
{ FALSE otherwise. }
{ ASSERT: X,Y is on the map. }
var
T: Integer;
begin
if IsBlocked( Mek , GB , X , Y ) then begin
{ If the tile is blocked, this might just be }
{ because of Mek's movemode. Try all available }
{ movement modes for a good one. }
for T := 1 to NumMoveMode do begin
if TerrMan[ GB^.Map[ X , Y ].terr ].MMPass[ T ] and ( BaseMoveRate( Mek , T ) > 0 ) then begin
SetNAtt( Mek^.NA , NAG_Action , NAS_MoveMode , T );
if not IsBlocked( Mek , GB , X , Y ) then Break;
end;
end;
IsGoodSpot := not IsBlocked( Mek , GB , X , Y );
end else if Mek^.G = GG_Prop then begin
isGoodSpot := ( GB^.Map[ X , Y ].Terr <> TERRAIN_Threshold ) and isNotThreshold( X - 1 , Y ) and isNotThreshold( X , Y - 1 ) and isNotThreshold( X + 1 , Y ) and isNotThreshold( X , Y + 1 );
end else if ( Mek^.G <> GG_MetaTerrain ) or ( Mek^.S <> GS_MetaDoor ) then begin
isGoodSpot := GB^.Map[ X , Y ].Terr <> TERRAIN_Threshold;
end else IsGoodSpot := True;
end;
var
Team,Home,THome: GearPtr;
TeamNum,Tries: Integer;
P,TP: Point;
begin
{ Find the team for this model. }
TeamNum := NAttValue( Mek^.NA , NAG_Location , NAS_Team );
{ LanceMates count as members of the player team. }
if TeamNum = NAV_LancemateTeam then TeamNum := NAV_DefPlayerTeam
else TeamNum := Abs( TeamNum );
Team := LocateTeam( GB , TeamNum );
if Team <> Nil then begin
TP.X := NAttValue( Team^.NA , NAG_ParaLocation , NAS_X );
TP.Y := NAttValue( Team^.NA , NAG_ParaLocation , NAS_Y );
end;
{ Find the home of this model, if appropriate. }
if ( SAttValue( Mek^.SA , 'HOME' ) <> '' ) and ( GB^.Scene <> Nil ) then begin
Home := SeekGearByName( GB^.Scene , SAttValue( Mek^.SA , 'HOME' ) );
end else begin
Home := Nil;
end;
{ Find the home of this team, if appropriate. }
if ( Team <> Nil ) and ( SAttValue( Team^.SA , 'HOME' ) <> '' ) and ( GB^.Scene <> Nil ) then begin
THome := SeekGearByName( GB^.Scene , SAttValue( Team^.SA , 'HOME' ) );
end else begin
THome := Nil;
end;
{ Attempt to find a good spot in which to deploy this model. }
{ Just in case the task turns out to be impossible, this procedure }
{ will give up after 1000 tries. }
Tries := 1000;
repeat
if ( TeamNum = NAV_DefPlayerTeam ) and OnTheMap( PC_Team_X , PC_Team_Y ) then begin
P := FindSpotNearSpot( GB , Mek , PC_Team_X , PC_Team_Y );
end else if ( TeamNum = NAV_DefPlayerTeam ) and ( SCRIPT_Gate_To_Seek <> 0 ) then begin
P := FindSpotNearGate( GB , Mek , SCRIPT_Gate_To_Seek );
SCRIPT_Gate_To_Seek := 0;
end else if ( TeamNum = NAV_DefPlayerTeam ) and ( SCRIPT_Terrain_To_Seek <> 0 ) then begin
P := FindThisTerrain( GB , SCRIPT_Terrain_To_Seek );
SCRIPT_Terrain_To_Seek := 0;
{ If the requested terrain couldn't be found, set X,Y }
{ to a random location. }
if P.X = 0 then begin
P.X := Random( XMax ) + 1;
P.Y := Random( YMax ) + 1;
end;
end else if ( TeamNum = NAV_DefPlayerTeam ) and ( GB^.Scene <> Nil ) and ( NAttValue( GB^.Scene^.NA , NAG_ParaLocation , NAS_X ) <> 0 ) then begin
P.X := NAttValue( GB^.Scene^.NA , NAG_ParaLocation , NAS_X );
P.Y := NAttValue( GB^.Scene^.NA , NAG_ParaLocation , NAS_Y );
SetNAtt( GB^.Scene^.NA , NAG_ParaLocation , NAS_X , 0 );
SetNAtt( GB^.Scene^.NA , NAG_ParaLocation , NAS_Y , 0 );
end else if ( Home <> Nil ) and ( Tries > 250 ) then begin
P.X := Random( Home^.Stat[ Stat_MFWidth ] - 2 ) + Home^.Stat[ STAT_XPos ] + 1;
P.Y := Random( Home^.Stat[ Stat_MFHeight ] - 2 ) + Home^.Stat[ STAT_YPos ] + 1;
end else if ( THome <> Nil ) and ( Tries > 250 ) then begin
P.X := Random( THome^.Stat[ Stat_MFWidth ] - 2 ) + THome^.Stat[ STAT_XPos ] + 1;
P.Y := Random( THome^.Stat[ Stat_MFHeight ] - 2 ) + THome^.Stat[ STAT_YPos ] + 1;
end else if ( Team <> Nil ) and OnTheMap( TP.X , TP.Y ) and ( Tries > 250 ) then begin
{ Place somewhere near the deployment area. }
P.X := TP.X + Random( 5 ) - Random( 5 );
if P.X < 1 then P.X := 1
else if P.X > XMax then P.X := XMax;
P.Y := TP.Y + Random( 5 ) - Random( 5 );
if P.Y < 1 then P.Y := 1
else if P.Y > YMax then P.Y := YMax;
end else if ( TeamNum = 0 ) or ( Team <> NIl ) then begin
{ Place anywhere randomly on the map. }
P.X := Random( XMax ) + 1;
P.Y := Random( YMax ) + 1;
end else begin
{ Place in a quadrant depending on team number. }
TeamNum := Abs( TeamNum );
if (( TeamNum mod 4 ) mod 2 ) = 1 then begin
P.X := 1 + Random( XMax div 2 );
end else begin
P.X := XMax - Random( XMax div 2 );
end;
if (( TeamNum mod 4 ) div 2 ) = 1 then begin
P.Y := 1 + Random( YMax div 2 );
end else begin
P.Y := YMax - Random( YMax div 2 );
end;
end;
dec( Tries );
until ( Tries < 1 ) or ( OnTheMap( P.X , P.Y ) and IsGoodSpot( P.X , P.Y ) );
if ( TeamNum = NAV_DefPlayerTeam ) and ( PC_Team_X = 0 ) and OnTheMap( P.X , P.Y ) then begin
PC_Team_X := P.X;
PC_Team_Y := P.Y;
end;
FindDeploymentSpot := P;
end;
initialization
Shadow_Map_Update := -1;
end.
|