+ 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[GRANUS-1][A][0].value &&
+ guess[P] <= highscores[GRANUS-1][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 midisle= ports[nports/2];
+ int midarch= route2midarch(ports,nports);
+
+ PotentialResult *buckets[GRANUS];
+ int granui;
+ for (granui=mingranu; granui<GRANUS; granui++) {
+ PotentialResult **buckets_fin;
+ int mid, fin;
+ switch (granui) {
+ case 0: fin=finisle; mid=midisle; break;
+ case 1: fin=finisle; mid=midarch; break;
+ case 2: fin=finarch; mid=midarch; break;
+ default: abort();
+ }
+ buckets_fin= ONDEMAND(buckets_base[granui][fin], granusz_mid[granui]);
+ buckets[granui]= ONDEMAND(buckets_fin[mid], 1);
+ }
+
+ if (nports>=2) {
+ if (guess[A] <= buckets[mingranu]->value[A] &&
+ guess[P] <= buckets[mingranu]->value[P]) {
+ ctr_routes_bucketelim++;
+ debugf(" ELIM %f %f\n", guess[A], guess[P]);
+ return guess[A];
+ }
+ debugf(" COMPUTE %f %f\n", guess[A], guess[P]);
+ }
+
+ ctr_routes_valued++;