#include "rscommon.h"
DEBUG_DEFINE_DEBUGF(search);
+DEBUG_DEFINE_SOME_DEBUGF(filter,fildebugf);
typedef struct Neighbour {
struct Neighbour *next;
return head;
}
-static double best_absolute, best_perleague;
+
+static PotentialResult ***strat_base;
+
static double process_route(int nports, int totaldist,
double overestimate_excepting_tail) {
int i;
int leagues_divisor= totaldist + nports;
+ ctr_routes_considered++;
+
debugf("========== ROUTE");
for (i=0; i<nports; i++)
debugf(" %d",ports[i]);
debugf("\n");
+ int finalisle= ports[nports-1];
+ int midisle= ports[nports/2];
+
+ PotentialResult **strat_fin= ONDEMAND(strat_base[finalisle], islandtablesz);
+ PotentialResult *strat= ONDEMAND(strat_fin[midisle], 1);
+
if (nports>=2) {
int pair[2], i;
pair[1]= ports[nports-1];
pair[0]= ports[i];
IslandPair *ip= ipair_get_maybe(pair[0], pair[1]);
if (!ip) continue;
- if (ip->route_tail_value < 0)
+ if (ip->route_tail_value < 0) {
+ ctr_subroute_tails_valued++;
ip->route_tail_value= value_route(2, pair, pair[0]!=pair[1]);
+ }
guess_absolute += ip->route_tail_value;
}
double guess_perleague= guess_absolute / leagues_divisor;
- if (guess_absolute <= best_absolute && guess_perleague <= best_perleague) {
+ if (guess_absolute <= strat->absolute &&
+ guess_perleague <= strat->perleague) {
+ ctr_routes_eliminated++;
debugf(" ELIM %f %f\n", guess_absolute, guess_perleague);
return guess_absolute;
}
debugf(" COMPUTE %f %f\n", guess_absolute, guess_perleague);
}
+ ctr_routes_valued++;
+
double absolute= value_route(nports, ports, 0);
double perleague= absolute / leagues_divisor;
- if (absolute <= best_absolute && perleague <= best_perleague)
+ if (absolute <= strat->absolute &&
+ perleague <= strat->perleague)
return absolute;
debugf(" SOMEHOW BEST\n");
-#define CHK(absperl) \
- fprintf(stderr,#absperl " %15f", absperl); \
- if (absperl < best_##absperl) fputs(" ",stderr); \
- else { best_##absperl= absperl; fputs("** ",stderr); }
+ fildebugf("final %3d mid %3d ",finalisle,midisle);
+
+#define CHK(absperl) \
+ fildebugf(#absperl " %15f", absperl); \
+ if (absperl < strat->absperl) { \
+ debugf(" "); \
+ } else { \
+ strat->absperl= absperl; \
+ memcpy(strat->absperl##_ports, ports, sizeof(*ports) * nports); \
+ fildebugf("** "); \
+ }
CHK(absolute)
CHK(perleague)
- fputs(" route",stderr);
+ fildebugf(" route");
for (i=0; i<nports; i++)
- fprintf(stderr," %d",ports[i]);
- putc('\n',stderr);
+ fildebugf(" %d",ports[i]);
+ fildebugf("\n");
return absolute;
}
}
}
-void search(int start_isle) {
+void search(int start_isle, PotentialResult ****strat_base_io) {
+ strat_base= ONDEMAND(*strat_base_io, islandtablesz);
recurse(start_isle,0,0,1e6);
}