- if (guess_absolute <= best_absolute && guess_perleague <= best_perleague) {
- debugf(" ELIM %f %f\n", guess_absolute, guess_perleague);
- return guess_absolute;
+ 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=0; granui<granus; granui++) {
+ PotentialResult **buckets_fin;
+ int mid, fin;
+ switch (granui) {
+ case 0: fin=finarch; mid=midarch; break;
+ case 1: fin=finisle; mid=midarch; break;
+ case 2: fin=finisle; mid=midisle; 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[0]->value[A] &&
+ guess[P] <= buckets[0]->value[P]) {
+ ctr_routes_bucketelim++;
+ debugf(" ELIM %f %f\n", guess[A], guess[P]);
+ return guess[A];