00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034 #include <config.h>
00035
00036 #include "commands.h"
00037 #include "path.h"
00038
00039 int
00040 best(void)
00041 {
00042 double cost;
00043 char *path;
00044 struct sctstr s1, s2;
00045 struct nstr_sect nstr, nstr2;
00046 char buf[1024];
00047
00048 if (!snxtsct(&nstr, player->argp[1]))
00049 return RET_SYN;
00050
00051 if (!snxtsct(&nstr2, player->argp[2]))
00052 return RET_SYN;
00053
00054 while (!player->aborted && nxtsct(&nstr, &s1)) {
00055 if (s1.sct_own != player->cnum)
00056 continue;
00057 snxtsct(&nstr2, player->argp[2]);
00058 while (!player->aborted && nxtsct(&nstr2, &s2)) {
00059 if (s2.sct_own != player->cnum)
00060 continue;
00061 path = BestLandPath(buf, &s1, &s2, &cost, MOB_MOVE);
00062 if (path)
00063 pr("Best path from %s to %s is %s (cost %1.3f)\n",
00064 xyas(s1.sct_x, s1.sct_y, player->cnum),
00065 xyas(s2.sct_x, s2.sct_y, player->cnum), path, cost);
00066 else
00067 pr("No owned path from %s to %s exists!\n",
00068 xyas(s1.sct_x, s1.sct_y, player->cnum),
00069 xyas(s2.sct_x, s2.sct_y, player->cnum));
00070 }
00071 }
00072 return 0;
00073 }