2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2000, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * See the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
23 * related information and legal notices. It is expected that any future
24 * projects/authors will amend these files as needed.
28 * best.c: Show the best path between two sectors
30 * Known contributors to this file:
51 s_char *BestDistPath(), *BestLandPath(), *s;
53 struct nstr_sect nstr, nstr2;
57 dist = player->argp[0][4] == 'd';
59 if (!snxtsct(&nstr, player->argp[1]))
62 if (!snxtsct(&nstr2, player->argp[2]))
65 while (!player->aborted && nxtsct(&nstr, &s1)) {
66 if (s1.sct_own != player->cnum)
68 snxtsct(&nstr2, player->argp[2]);
69 while (!player->aborted && nxtsct(&nstr2, &s2)) {
70 if (s2.sct_own != player->cnum)
73 s = BestDistPath(buf, &s1, &s2, &cost, MOB_ROAD);
75 s = BestLandPath(buf, &s1, &s2, &cost, MOB_ROAD);
77 pr("Best %spath from %s to %s is %s (cost %1.3f)\n",
79 xyas(s1.sct_x, s1.sct_y, player->cnum),
80 xyas(s2.sct_x, s2.sct_y, player->cnum), s, cost);
82 pr("No owned path from %s to %s exists!\n",
83 xyas(s1.sct_x, s1.sct_y, player->cnum),
84 xyas(s2.sct_x, s2.sct_y, player->cnum));