+static PotentialResult ***strat_base;
+
+
+static double process_route(int nports, int totaldist,
+ double overestimate_excepting_tail) {
+ int i, ap;
+ int leagues_divisor= totaldist + nports;
+
+ ctr_routes_considered++;
+
+ int wrong_final= final_isle && ports[nports-1] != final_isle;
+
+ debugf("========== ROUTE");
+ for (i=0; i<nports; i++)
+ debugf(" %d",ports[i]);
+ debugf("\n");
+
+ double guess[AP]={0,0};
+ if (nports>=2) {
+ int pair[2], i;
+ pair[1]= ports[nports-1];
+ guess[A]= overestimate_excepting_tail;
+
+ for (i=0; i<nports; i++) {
+ pair[0]= ports[i];
+ IslandPair *ip= ipair_get_maybe(pair[0], pair[1]);
+ if (!ip) continue;
+ if (ip->route_tail_value < 0) {
+ ctr_subroute_tails_valued++;
+ ip->route_tail_value= value_route(2, pair, pair[0]!=pair[1]);
+ }
+ guess[A] += ip->route_tail_value;
+ }
+ guess[P]= guess[A] / leagues_divisor;
+
+ if (wrong_final) {
+ ctr_routes_wrongfinalelim++;
+ debugf(" WFELIM\n");
+ return guess[A];
+ }
+
+ if (guess[A] <= highscores[A][0].value &&
+ guess[P] <= highscores[P][0].value) {
+ ctr_routes_quickelim++;
+ debugf(" QELIM %f %f\n", guess[A], guess[P]);
+ return guess[A];
+ }
+ }
+
+ int finisle= ports[nports-1]; int finarch= isle2arch(finisle);
+ int midarch= route2midarch(ports,nports);
+
+ PotentialResult **strat_fin= ONDEMAND(strat_base[finarch], narches);
+ PotentialResult *strat= ONDEMAND(strat_fin[midarch], 1);